{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:7LEEZLDVW7NT2FV2HYMDC56CY7","short_pith_number":"pith:7LEEZLDV","schema_version":"1.0","canonical_sha256":"fac84cac75b7db3d16ba3e183177c2c7f30fe196d0ea0424b33bc5dd4dbced88","source":{"kind":"arxiv","id":"2501.03224","version":1},"attestation_state":"computed","paper":{"title":"Testing Approximate Stationarity Concepts for Piecewise Affine Functions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Anthony Man-Cho So, Lai Tian","submitted_at":"2025-01-06T18:57:27Z","abstract_excerpt":"We study the basic computational problem of detecting approximate stationary points for continuous piecewise affine (PA) functions. Our contributions span multiple aspects, including complexity, regularity, and algorithms. Specifically, we show that testing first-order approximate stationarity concepts, as defined by commonly used generalized subdifferentials, is computationally intractable unless P=NP. To facilitate computability, we consider a polynomial-time solvable relaxation by abusing the convex subdifferential sum rule and establish a tight characterization of its exactness. Furthermor"},"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":"2501.03224","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2025-01-06T18:57:27Z","cross_cats_sorted":[],"title_canon_sha256":"5b872b0c5aabb59235ea079160766e06fc7b29e7030b0a4a960c2d43217bbcfc","abstract_canon_sha256":"8e7da3915719329f696d8f34125f457872e3bef6f3b2523c840fe8ab9dee1f5c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:57:33.488184Z","signature_b64":"yFcL6dmFbRi0cJpob6NMagFH1cBhfmkh6Lh/xPIDEixOClffF/YTYHctcBzmf/pS1jq4vCh7xAX4kOkH2cICDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fac84cac75b7db3d16ba3e183177c2c7f30fe196d0ea0424b33bc5dd4dbced88","last_reissued_at":"2026-07-05T09:57:33.487654Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:57:33.487654Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Testing Approximate Stationarity Concepts for Piecewise Affine Functions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Anthony Man-Cho So, Lai Tian","submitted_at":"2025-01-06T18:57:27Z","abstract_excerpt":"We study the basic computational problem of detecting approximate stationary points for continuous piecewise affine (PA) functions. Our contributions span multiple aspects, including complexity, regularity, and algorithms. Specifically, we show that testing first-order approximate stationarity concepts, as defined by commonly used generalized subdifferentials, is computationally intractable unless P=NP. To facilitate computability, we consider a polynomial-time solvable relaxation by abusing the convex subdifferential sum rule and establish a tight characterization of its exactness. Furthermor"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2501.03224","kind":"arxiv","version":1},"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/2501.03224/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":"2501.03224","created_at":"2026-07-05T09:57:33.487714+00:00"},{"alias_kind":"arxiv_version","alias_value":"2501.03224v1","created_at":"2026-07-05T09:57:33.487714+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2501.03224","created_at":"2026-07-05T09:57:33.487714+00:00"},{"alias_kind":"pith_short_12","alias_value":"7LEEZLDVW7NT","created_at":"2026-07-05T09:57:33.487714+00:00"},{"alias_kind":"pith_short_16","alias_value":"7LEEZLDVW7NT2FV2","created_at":"2026-07-05T09:57:33.487714+00:00"},{"alias_kind":"pith_short_8","alias_value":"7LEEZLDV","created_at":"2026-07-05T09:57:33.487714+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/7LEEZLDVW7NT2FV2HYMDC56CY7","json":"https://pith.science/pith/7LEEZLDVW7NT2FV2HYMDC56CY7.json","graph_json":"https://pith.science/api/pith-number/7LEEZLDVW7NT2FV2HYMDC56CY7/graph.json","events_json":"https://pith.science/api/pith-number/7LEEZLDVW7NT2FV2HYMDC56CY7/events.json","paper":"https://pith.science/paper/7LEEZLDV"},"agent_actions":{"view_html":"https://pith.science/pith/7LEEZLDVW7NT2FV2HYMDC56CY7","download_json":"https://pith.science/pith/7LEEZLDVW7NT2FV2HYMDC56CY7.json","view_paper":"https://pith.science/paper/7LEEZLDV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2501.03224&json=true","fetch_graph":"https://pith.science/api/pith-number/7LEEZLDVW7NT2FV2HYMDC56CY7/graph.json","fetch_events":"https://pith.science/api/pith-number/7LEEZLDVW7NT2FV2HYMDC56CY7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7LEEZLDVW7NT2FV2HYMDC56CY7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7LEEZLDVW7NT2FV2HYMDC56CY7/action/storage_attestation","attest_author":"https://pith.science/pith/7LEEZLDVW7NT2FV2HYMDC56CY7/action/author_attestation","sign_citation":"https://pith.science/pith/7LEEZLDVW7NT2FV2HYMDC56CY7/action/citation_signature","submit_replication":"https://pith.science/pith/7LEEZLDVW7NT2FV2HYMDC56CY7/action/replication_record"}},"created_at":"2026-07-05T09:57:33.487714+00:00","updated_at":"2026-07-05T09:57:33.487714+00:00"}