{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:GED5RDU3JMFVHE2GVVSH4TDKHE","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":"eaeda1156351b7ffa91e17e4a4295db6964e268b1cd3ce9a530bd4af9e327e56","cross_cats_sorted":["cs.CC","cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2026-05-11T08:59:57Z","title_canon_sha256":"632fd37e0d9554c4a1846e13e91fc71c4d49351b5a7fa58a22681c6a163b0546"},"schema_version":"1.0","source":{"id":"2605.10219","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.10219","created_at":"2026-05-25T02:01:22Z"},{"alias_kind":"arxiv_version","alias_value":"2605.10219v2","created_at":"2026-05-25T02:01:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.10219","created_at":"2026-05-25T02:01:22Z"},{"alias_kind":"pith_short_12","alias_value":"GED5RDU3JMFV","created_at":"2026-05-25T02:01:22Z"},{"alias_kind":"pith_short_16","alias_value":"GED5RDU3JMFVHE2G","created_at":"2026-05-25T02:01:22Z"},{"alias_kind":"pith_short_8","alias_value":"GED5RDU3","created_at":"2026-05-25T02:01:22Z"}],"graph_snapshots":[{"event_id":"sha256:6ec078e9bd5bff33aa383cab0f93b41102684a0d8aedc60b99c9fdbc3895f201","target":"graph","created_at":"2026-05-25T02:01:22Z","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":4,"items":[{"attestation":"unclaimed","claim_id":"C1","kind":"strongest_claim","source":"verdict.strongest_claim","status":"machine_extracted","text":"We give XP algorithms in fixed dimension for the tractable sides, and prove W[1]-hardness for the complementary sides. Moreover, lower bounds under the Exponential Time Hypothesis rule out algorithms running in time ρ(d) size^{o(d)} for any computable function ρ, where size denotes the total binary encoding length of the stationarity-testing instance."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"The assumption that continuous piecewise-affine functions form a canonical model that captures the local polyhedral geometry appearing in ReLU-type training losses, and that the chosen notion of approximate first-order stationarity is the appropriate one for the parameterized analysis."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"The paper fully characterizes the parameterized complexity of approximate first-order stationarity testing for continuous piecewise-affine functions and shallow ReLU CNN losses with respect to the dimension parameter, including XP algorithms, W[1]-hardness, and ETH lower bounds."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"Testing approximate stationarity for continuous piecewise-affine functions is XP-tractable in fixed dimension for some cases but W[1]-hard for others, with ETH lower bounds excluding subexponential dependence on dimension."}],"snapshot_sha256":"69b02a619c49e94e162790d813640136c937ac1346bfcabe496965fc1264e526"},"formal_canon":{"evidence_count":2,"snapshot_sha256":"5361fb8c69c46fc15d663821864037ab52924898d611d23293f738c430f58298"},"integrity":{"available":true,"clean":true,"detectors_run":[{"findings_count":0,"name":"claim_evidence","ran_at":"2026-05-20T06:22:00.902625Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"ai_meta_artifact","ran_at":"2026-05-19T15:38:33.571346Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"doi_title_agreement","ran_at":"2026-05-19T11:31:19.856695Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"doi_compliance","ran_at":"2026-05-19T09:35:20.120462Z","status":"completed","version":"1.0.0"}],"endpoint":"/pith/2605.10219/integrity.json","findings":[],"snapshot_sha256":"6e14a490263ebbf3bf58b5d39f167e4ffce29708e31733b22957be4203a9d947","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We study the parameterized complexity of testing approximate first-order stationarity at a prescribed point for continuous piecewise-affine (PA) functions, a basic task in nonsmooth optimization. PA functions form a canonical model for nonsmooth stationarity testing and capture the local polyhedral geometry that appears in ReLU-type training losses. Recent work by Tian and So (SODA 2025) shows that testing approximate stationarity notions for PA functions is computationally intractable in the worst case, and identifies fixed-dimensional tractability as an open direction.\n  We address this dire","authors_text":"Yuhan Ye","cross_cats":["cs.CC","cs.LG"],"headline":"Testing approximate stationarity for continuous piecewise-affine functions is XP-tractable in fixed dimension for some cases but W[1]-hard for others, with ETH lower bounds excluding subexponential dependence on dimension.","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2026-05-11T08:59:57Z","title":"Parameterized Complexity of Stationarity Testing for Piecewise-Affine Functions and Shallow CNN Losses"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.10219","kind":"arxiv","version":2},"verdict":{"created_at":"2026-05-12T03:27:42.489870Z","id":"4c2af462-eacd-4573-855a-9f6cc16bff42","model_set":{"reader":"grok-4.3"},"one_line_summary":"The paper fully characterizes the parameterized complexity of approximate first-order stationarity testing for continuous piecewise-affine functions and shallow ReLU CNN losses with respect to the dimension parameter, including XP algorithms, W[1]-hardness, and ETH lower bounds.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"Testing approximate stationarity for continuous piecewise-affine functions is XP-tractable in fixed dimension for some cases but W[1]-hard for others, with ETH lower bounds excluding subexponential dependence on dimension.","strongest_claim":"We give XP algorithms in fixed dimension for the tractable sides, and prove W[1]-hardness for the complementary sides. Moreover, lower bounds under the Exponential Time Hypothesis rule out algorithms running in time ρ(d) size^{o(d)} for any computable function ρ, where size denotes the total binary encoding length of the stationarity-testing instance.","weakest_assumption":"The assumption that continuous piecewise-affine functions form a canonical model that captures the local polyhedral geometry appearing in ReLU-type training losses, and that the chosen notion of approximate first-order stationarity is the appropriate one for the parameterized analysis."}},"verdict_id":"4c2af462-eacd-4573-855a-9f6cc16bff42"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:00cde6eee90473a8827310b28e6e20d8476c24b20d04ccf12b331e6a7e5300ff","target":"record","created_at":"2026-05-25T02:01:22Z","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":"eaeda1156351b7ffa91e17e4a4295db6964e268b1cd3ce9a530bd4af9e327e56","cross_cats_sorted":["cs.CC","cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2026-05-11T08:59:57Z","title_canon_sha256":"632fd37e0d9554c4a1846e13e91fc71c4d49351b5a7fa58a22681c6a163b0546"},"schema_version":"1.0","source":{"id":"2605.10219","kind":"arxiv","version":2}},"canonical_sha256":"3107d88e9b4b0b539346ad647e4c6a391c06840c0529e36b0797d6104ae2056a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3107d88e9b4b0b539346ad647e4c6a391c06840c0529e36b0797d6104ae2056a","first_computed_at":"2026-05-25T02:01:22.788761Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-25T02:01:22.788761Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"aizytQYy9XcQo2Q/BtEoJWQWVmQWzsRacflKHNB62zd00GSVpRrWpbIpr1DvDAr/WoHjGPTZADRxRRWXsblTCw==","signature_status":"signed_v1","signed_at":"2026-05-25T02:01:22.789355Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.10219","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:00cde6eee90473a8827310b28e6e20d8476c24b20d04ccf12b331e6a7e5300ff","sha256:6ec078e9bd5bff33aa383cab0f93b41102684a0d8aedc60b99c9fdbc3895f201"],"state_sha256":"3afeae3a734fb1eba476d10d3a95f33af29e18ffe7b17c3dc10af71b854eea82"}