{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:XSEHWWTEWNZJSGQPOD4PG5ZG5T","short_pith_number":"pith:XSEHWWTE","schema_version":"1.0","canonical_sha256":"bc887b5a64b372991a0f70f8f37726ece6d51bf3c3892b77911b0ff5bf8b192f","source":{"kind":"arxiv","id":"2509.22849","version":2},"attestation_state":"computed","paper":{"title":"Parameterized Hardness of Zonotope Containment and Neural Network Verification","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DM","cs.LG","cs.NE"],"primary_cat":"cs.CC","authors_text":"Christoph Hertrich, Moritz Grillo, Moritz Stargalla, Vincent Froese","submitted_at":"2025-09-26T18:59:59Z","abstract_excerpt":"Neural networks with ReLU activations are a widely used model in machine learning. It is thus important to have a profound understanding of the properties of the functions computed by such networks. Recently, there has been increasing interest in the (parameterized) computational complexity of determining these properties. In this work, we close several gaps and resolve an open problem posted by Froese et al. [COLT '25] regarding the parameterized complexity of various problems related to network verification. In particular, we prove that deciding positivity (and thus surjectivity) of a functi"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2509.22849","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CC","submitted_at":"2025-09-26T18:59:59Z","cross_cats_sorted":["cs.DM","cs.LG","cs.NE"],"title_canon_sha256":"5e4012b0d39c689617656824f95965319eb95ecd4c1f8ece249b85bca7238636","abstract_canon_sha256":"7480c04964295de7027e1da5126d578c8f84f0c9089282c60ad849cb696ebd1b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-20T00:04:13.955834Z","signature_b64":"QjiRW/Sj7vYkT3uK3MjrAPJPfv6cCYuoTN+1OFmxL31IWPSzrt6OIyHnyY/2aUJLaAUkaWwjj2bkH/hMpiNfCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bc887b5a64b372991a0f70f8f37726ece6d51bf3c3892b77911b0ff5bf8b192f","last_reissued_at":"2026-05-20T00:04:13.955078Z","signature_status":"signed_v1","first_computed_at":"2026-05-20T00:04:13.955078Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Parameterized Hardness of Zonotope Containment and Neural Network Verification","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DM","cs.LG","cs.NE"],"primary_cat":"cs.CC","authors_text":"Christoph Hertrich, Moritz Grillo, Moritz Stargalla, Vincent Froese","submitted_at":"2025-09-26T18:59:59Z","abstract_excerpt":"Neural networks with ReLU activations are a widely used model in machine learning. It is thus important to have a profound understanding of the properties of the functions computed by such networks. Recently, there has been increasing interest in the (parameterized) computational complexity of determining these properties. In this work, we close several gaps and resolve an open problem posted by Froese et al. [COLT '25] regarding the parameterized complexity of various problems related to network verification. In particular, we prove that deciding positivity (and thus surjectivity) of a functi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2509.22849","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2509.22849/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"2509.22849","created_at":"2026-05-20T00:04:13.955194+00:00"},{"alias_kind":"arxiv_version","alias_value":"2509.22849v2","created_at":"2026-05-20T00:04:13.955194+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2509.22849","created_at":"2026-05-20T00:04:13.955194+00:00"},{"alias_kind":"pith_short_12","alias_value":"XSEHWWTEWNZJ","created_at":"2026-05-20T00:04:13.955194+00:00"},{"alias_kind":"pith_short_16","alias_value":"XSEHWWTEWNZJSGQP","created_at":"2026-05-20T00:04:13.955194+00:00"},{"alias_kind":"pith_short_8","alias_value":"XSEHWWTE","created_at":"2026-05-20T00:04:13.955194+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2605.04183","citing_title":"Nearly-Tight Bounds for Zonotope Containment and Beyond","ref_index":28,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/XSEHWWTEWNZJSGQPOD4PG5ZG5T","json":"https://pith.science/pith/XSEHWWTEWNZJSGQPOD4PG5ZG5T.json","graph_json":"https://pith.science/api/pith-number/XSEHWWTEWNZJSGQPOD4PG5ZG5T/graph.json","events_json":"https://pith.science/api/pith-number/XSEHWWTEWNZJSGQPOD4PG5ZG5T/events.json","paper":"https://pith.science/paper/XSEHWWTE"},"agent_actions":{"view_html":"https://pith.science/pith/XSEHWWTEWNZJSGQPOD4PG5ZG5T","download_json":"https://pith.science/pith/XSEHWWTEWNZJSGQPOD4PG5ZG5T.json","view_paper":"https://pith.science/paper/XSEHWWTE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2509.22849&json=true","fetch_graph":"https://pith.science/api/pith-number/XSEHWWTEWNZJSGQPOD4PG5ZG5T/graph.json","fetch_events":"https://pith.science/api/pith-number/XSEHWWTEWNZJSGQPOD4PG5ZG5T/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XSEHWWTEWNZJSGQPOD4PG5ZG5T/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XSEHWWTEWNZJSGQPOD4PG5ZG5T/action/storage_attestation","attest_author":"https://pith.science/pith/XSEHWWTEWNZJSGQPOD4PG5ZG5T/action/author_attestation","sign_citation":"https://pith.science/pith/XSEHWWTEWNZJSGQPOD4PG5ZG5T/action/citation_signature","submit_replication":"https://pith.science/pith/XSEHWWTEWNZJSGQPOD4PG5ZG5T/action/replication_record"}},"created_at":"2026-05-20T00:04:13.955194+00:00","updated_at":"2026-05-20T00:04:13.955194+00:00"}