{"_canonicalization":{"envelope_id":"axm_ + sha256(envelope minus {signature, axiom_id, anchors})","envelope_signature":"ed25519(envelope minus {signature, axiom_id})","json":"sort_keys=True, separators=(',',':'), ensure_ascii=False, allow_nan=False, utf-8","leaf_hash":"sha256(0x00 || canonical_json(envelope_full))","seal_signature":"ed25519(seal minus {signature, sig_algorithm})"},"axiom_id":"axm_26bd382d10e0d105b41a80ac7b1df5b6a110a0535ff43c678e881f526ebf61b4","bitcoin_anchor":{"bitcoin_attestations":["bitcoin_block_949451"],"calendar_attestations":["https://finney.calendar.eternitywall.com","https://btc.calendar.catallaxy.com","https://alice.btc.calendar.opentimestamps.org","https://bob.btc.calendar.opentimestamps.org"],"ots_url":"/registry/data/substrate/anchors/77fc9c28fae777b81da5b495b3115474df6592dfac590333213d3bdf8b94a9b3.ots","stamped_at":"2026-05-15T03:00:03Z","status":"bitcoin"},"envelope":{"anchors":[{"chain":"crovia.axiom_graph","height":0,"merkle_proof":"spider_vendor_press_v1","root_at_anchor":"spider_vendor_press_v1"}],"axiom_id":"axm_26bd382d10e0d105b41a80ac7b1df5b6a110a0535ff43c678e881f526ebf61b4","axiom_type":"AX.OBS","body":{"axiom_subtype":"news.vendor_press.v1","category":"news","fingerprint":"2fa02af6846d7a2a16e8d8ae6fd8e227365ffad63d04c46dd442cc58e1e3cf22","published":"Tue, 12 May 2026 00:00:00 -0400","receipt_hash":"2fa02af6846d7a2a16e8d8ae6fd8e227365ffad63d04c46dd442cc58e1e3cf22","schema":"spider.news.vendor_press.v1","spider":"vendor_press","spider_record":{"axiom_subtype":"news.vendor_press.v1","category":"news","decision_hint":"POSITIVE","envelope_target":"AX.OBS","fingerprint":"2fa02af6846d7a2a16e8d8ae6fd8e227365ffad63d04c46dd442cc58e1e3cf22","observed_at":"2026-05-12T04:43:42.564879Z","parent_run_hash":"4cc5aca0c1b8116c9ab92405e0260204f01cf7ce2e49dea9d7e123236f5dc13b","published":"Tue, 12 May 2026 00:00:00 -0400","runtime_version":"0.1.0","schema":"spider.news.vendor_press.v1","source_status":200,"source_url":"https://export.arxiv.org/rss/cs.AI","spider":"vendor_press","summary_excerpt":"arXiv:2508.05463v2 Announce Type: replace-cross \nAbstract: Neural networks excel across a wide range of tasks, yet remain black boxes. In particular, how their internal representations are shaped by the complexity of the input data and the problems they solve remains obscure. In this work, we introduce a suite of five data-agnostic probes-pruning, binarization, noise injection, sign flipping, and bipartite network randomization-to quantify how task difficulty influences the topology and robustness of representations in multilayer perceptrons (MLPs). MLPs are represented as signed, weighted bipartite graphs from a network science perspective. We contrast easy and hard classification tasks on the MNIST and Fashion-MNIST datasets. We show that binarizing weights in hard-task models collapses accuracy to chance, whereas easy-task models remain robust. We also find that pruning low-magnitude edges in binarized hard-task models reveals a sharp phase-transition in performance. Moreover, moder","title":"Task complexity shapes internal representations and robustness in neural networks","url":"https://arxiv.org/abs/2508.05463","vendor":"arxiv_cs_ai"},"summary":"arXiv:2508.05463v2 Announce Type: replace-cross \nAbstract: Neural networks excel across a wide range of tasks, yet remain black boxes. In particular, how their internal representations are shaped by the complexity of the input data and the problems they solve remains obscure. In this work, we introduce a suite of five data-agnostic probes-pruning, binarization, noise injection, sign flipping, and bipartite network randomization-to quantify how task difficulty influences the topology and robustness of representations in multilayer perceptrons (MLPs). MLPs are represented as signed, weighted bipartite graphs from a network science perspective. We contrast easy and hard classification tasks on the MNIST and Fashion-MNIST datasets. We show that binarizing weights in hard-task models collapses accuracy to chance, whereas easy-task models remain robust. We also find that pruning low-magnitude edges in binarized hard-task models reveals a sharp phase-transition in performance. Moreover, moder","title":"Task complexity shapes internal representations and robustness in neural networks","vendor":"arxiv_cs_ai"},"confidence":{"method":"deterministic"},"decision":"POSITIVE","issued_at":"2026-05-12T04:43:42Z","notes":"Spider vendor_press (news) news.vendor_press.v1","object":{"captured_by":"crovia.spider.vendor_press","primary_source_url":"https://arxiv.org/abs/2508.05463"},"predecessors":[],"schema":"crovia.axiom.v1","signature":"ed25519:973b062f9ae09363cfdb46ef0abbda17458632ffd2c0f4cc87043581140cef1c9182575ec41624d5737c94c7ac3da8eb0464a76a976f63c9b5c97d47e2814601","signer":"crovia.substrate","subject":{"observed_at":"2026-05-12T04:43:42Z","source_collector":"spider:vendor_press","target_id":"https://arxiv.org/abs/2508.05463"},"tsa":{"authority":"crovia.substrate.bootstrap","rfc3161_token":"{\"kind\":\"crovia.bootstrap.tsa\",\"source_jsonl\":\"/opt/crovia/spider/data/news/vendor_press_v1.jsonl\",\"source_seal_merkle_root\":\"spider_vendor_press_v1\",\"upgrade_path\":\"Sessione H \\u2014 OpenTimestamps weekly anchor\"}"},"zk_mode":"clear","zk_proof":null},"ledger":{"leaf_hash":"0b83a73040689f51fcc34e08d5f1cbebe7f81c1f6841bb52d972b4e14d895178","leaf_index":129052,"ledger_path":"/opt/crovia/substrate/axiom_ledger.jsonl"},"merkle_proof":{"hash_alg":"sha256","leaf_prefix":"0x00","node_prefix":"0x01","odd_leaf_rule":"duplicate_last","path":[{"sibling":"8d73229f5326ef1918846f877da7c38362f4762262ecf51a6bd6c8d00504d559","side":"right"},{"sibling":"707a0b59bfad7c5c2dd2f79ba1f2744391c9e26f7822e3a71c660f458f07af93","side":"right"},{"sibling":"6351a2e3cf80cfcc94d61b614d2178d9cf658b18bcd84350264988c8a07a9e6b","side":"left"},{"sibling":"21c4d0e11d4d635cbf5978e77af9f06780f55c401b16989ed4013b6fd302e18c","side":"left"},{"sibling":"cf6db3d1f1842677072358e68c8caeb18dce2c118d4bd24083593307ff67654c","side":"left"},{"sibling":"d8590087ff66893846944af105967121e233f6d4ad9589ba18031c04e258aed4","side":"right"},{"sibling":"c5b62701bbf63351dae156c3100c38b6201c7026e10b07dd5da9fa82d3187bf6","side":"right"},{"sibling":"684a7e41697dc4a5ae5bd51e0b1fa452ba8e0ce5866bec279d63e12ce9b1e6cf","side":"right"},{"sibling":"bb93634b6ea81ccfb7b9c5b023ffaff85acd8b3f1ec609973d847fd93873d3ec","side":"right"},{"sibling":"9922155d12ac3db561299f0abaec57fc59dd8e711d91cd590823abd8f3e4647f","side":"right"},{"sibling":"9c71dae5b380aff58527385ccecc23b4cd8ff36395d4fc35ad5236b00fcb6db8","side":"right"},{"sibling":"d32d0a951c1d7e98a8e1951a587d83c97962daeeaa455643bc1d5d53744dc21e","side":"left"},{"sibling":"ffc4d51379293bc3e1910c7d612f409dc610fd9acf8241793fb89f82e1bad4ef","side":"left"},{"sibling":"62ac6554017807bd83187f5a3e5f4f72d6c482616429c2780e9fff1f4845fa04","side":"left"},{"sibling":"3a5e69cf0803f4c91f3895ed7c9a95748fef240bec4422e167c05300f79f06c0","side":"left"},{"sibling":"f2817ab288b5324fe49770372c7a10f33f7cd11005f8d4c0a730316f5229dc98","side":"left"},{"sibling":"725fac972e772ca0dc598810ea1abc70df472f72d2d6ab8a0baee2b80e5d2f4c","side":"left"},{"sibling":"98fc57dfef8873b512edc8340f7181df57302bb96777625e072235c62d7c5895","side":"right"}]},"schema":"crovia.axiom_proof.v1","seal":{"first_collector_run_id":"","first_receipt_hash":"","jsonl_path":"/opt/crovia/substrate/axiom_ledger.jsonl","key_id":"430895f101d38164","last_collector_run_id":"","last_receipt_hash":"","leaf_count":134292,"merkle_root":"77fc9c28fae777b81da5b495b3115474df6592dfac590333213d3bdf8b94a9b3","public_key_hex":"cf742e26f75669dc673cb5c0786a1ae23ae8ca19c347317192ce40c28a7ff25c","run_id":"hourly_json_retrofit_20260515T023701Z","schema":"crovia.seal.v1","seal_family_version":"crovia-seal-family/1","seal_kind":"substrate_batch","sealed_at":"2026-05-15T02:37:25Z","sig_algorithm":"ed25519","signature":"68107a834b00b24f5d4501e5ec727445311f132a486567ecc4c72a4e6dff24c8c21f2de3105293353ba5fdbe370d032819af6aa70f694e2e39b6af6737507009","signer_version":"1.1.0"},"trust_root":{"key_id":"430895f101d38164","public_key_hex":"cf742e26f75669dc673cb5c0786a1ae23ae8ca19c347317192ce40c28a7ff25c","signature_algorithm":"ed25519","url":"/registry/canon/TRUST_ROOT.md"},"verifier":{"spec":"/registry/canon/AXIOM_RECEIPT_v1.md","url":"/v/axm_26bd382d10e0d105b41a80ac7b1df5b6a110a0535ff43c678e881f526ebf61b4"}}