{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:3U67TQ5HOZM7AU5NUMO2XATASN","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"847ee2390ed9f76d2cc9753303fd107770c7a3345b6f6afe78e635e56f35ee39","cross_cats_sorted":["cs.DS"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-07-23T00:44:44Z","title_canon_sha256":"e5ecf2c8685f89d2332085ff2fc56dd8894a2d8f34c9a3fb5d0ffbd2593f41a7"},"schema_version":"1.0","source":{"id":"2607.20811","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.20811","created_at":"2026-07-24T00:23:35Z"},{"alias_kind":"arxiv_version","alias_value":"2607.20811v1","created_at":"2026-07-24T00:23:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.20811","created_at":"2026-07-24T00:23:35Z"},{"alias_kind":"pith_short_12","alias_value":"3U67TQ5HOZM7","created_at":"2026-07-24T00:23:35Z"},{"alias_kind":"pith_short_16","alias_value":"3U67TQ5HOZM7AU5N","created_at":"2026-07-24T00:23:35Z"},{"alias_kind":"pith_short_8","alias_value":"3U67TQ5H","created_at":"2026-07-24T00:23:35Z"}],"graph_snapshots":[{"event_id":"sha256:f3af30704405abb1227db141d22fece5c304368e67e92ed2ce35fcd6695a6bd9","target":"graph","created_at":"2026-07-24T00:23:35Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2607.20811/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In spite of the fundamental role of neural networks in contemporary machine learning research, our understanding of the computational complexity of optimally training neural networks remains incomplete even when dealing with the simplest kinds of activation functions. Indeed, while there has been a number of very recent results that establish ever-tighter lower bounds for the problem under linear and ReLU activation functions, less progress has been made towards the identification of novel polynomial-time tractable network architectures. In this article we obtain novel algorithmic upper bounds","authors_text":"Cornelius Brand, Mathis Rocton, Robert Ganian","cross_cats":["cs.DS"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-07-23T00:44:44Z","title":"New Complexity-Theoretic Frontiers of Tractability for Neural Network Training"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.20811","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:2143e6272b43873c866a73b471b9a054b55d97eb55959c63af054456548dfc75","target":"record","created_at":"2026-07-24T00:23:35Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"847ee2390ed9f76d2cc9753303fd107770c7a3345b6f6afe78e635e56f35ee39","cross_cats_sorted":["cs.DS"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-07-23T00:44:44Z","title_canon_sha256":"e5ecf2c8685f89d2332085ff2fc56dd8894a2d8f34c9a3fb5d0ffbd2593f41a7"},"schema_version":"1.0","source":{"id":"2607.20811","kind":"arxiv","version":1}},"canonical_sha256":"dd3df9c3a77659f053ada31dab82609351dfc2c392d480484a5e6cdaa3f29a83","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"dd3df9c3a77659f053ada31dab82609351dfc2c392d480484a5e6cdaa3f29a83","first_computed_at":"2026-07-24T00:23:35.948466Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-24T00:23:35.948466Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"XjD7NkygTy4pV1iKAlcrfhipcsG+uOpuVCgoDsWEeaituZYskFyg4bNs5xH99S84WsnMo6JgwU+QbMkVgo73Bw==","signature_status":"signed_v1","signed_at":"2026-07-24T00:23:35.949358Z","signed_message":"canonical_sha256_bytes"},"source_id":"2607.20811","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2143e6272b43873c866a73b471b9a054b55d97eb55959c63af054456548dfc75","sha256:f3af30704405abb1227db141d22fece5c304368e67e92ed2ce35fcd6695a6bd9"],"state_sha256":"ff9f4940ac5b327c9d9084e563e401a4906d6c7f2038ed776cb82ae8137a368b"}