{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:7SUPK6UQEDGGDRBX6VHA3EH76G","short_pith_number":"pith:7SUPK6UQ","schema_version":"1.0","canonical_sha256":"fca8f57a9020cc61c437f54e0d90fff1bdb95cbc13b6bc35dec2868eaf09d624","source":{"kind":"arxiv","id":"2412.12228","version":1},"attestation_state":"computed","paper":{"title":"Linear Equations with Min and Max Operators: Computational Complexity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","math.OC"],"primary_cat":"cs.CC","authors_text":"Jakub Svoboda, Krishnendu Chatterjee, Raimundo Saona, Ruichen Luo","submitted_at":"2024-12-16T12:18:36Z","abstract_excerpt":"We consider a class of optimization problems defined by a system of linear equations with min and max operators. This class of optimization problems has been studied under restrictive conditions, such as, (C1) the halting or stability condition; (C2) the non-negative coefficients condition; (C3) the sum up to 1 condition; and (C4) the only min or only max oerator condition. Several seminal results in the literature focus on special cases. For example, turn-based stochastic games correspond to conditions C2 and C3; and Markov decision process to conditions C2, C3, and C4. However, the systemati"},"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":"2412.12228","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2024-12-16T12:18:36Z","cross_cats_sorted":["cs.AI","math.OC"],"title_canon_sha256":"8dd1c55d1af02bcf1645a8a56becd6731d9bf9db0c8cd84d8c41d277e2f32591","abstract_canon_sha256":"0f96a3ca67cb2c9efe0db9872ac3584f554e7671f1185ea3a8aa11788f1f6df0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:50:37.655047Z","signature_b64":"I3JADI+SDSi8hkuK48au+5DarFMFSXNvddJZQ/oxzugpLO/INDoU7AysjABabELF+/t1PpsO7EaksPcvOh/TBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fca8f57a9020cc61c437f54e0d90fff1bdb95cbc13b6bc35dec2868eaf09d624","last_reissued_at":"2026-07-05T09:50:37.654556Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:50:37.654556Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Linear Equations with Min and Max Operators: Computational Complexity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","math.OC"],"primary_cat":"cs.CC","authors_text":"Jakub Svoboda, Krishnendu Chatterjee, Raimundo Saona, Ruichen Luo","submitted_at":"2024-12-16T12:18:36Z","abstract_excerpt":"We consider a class of optimization problems defined by a system of linear equations with min and max operators. This class of optimization problems has been studied under restrictive conditions, such as, (C1) the halting or stability condition; (C2) the non-negative coefficients condition; (C3) the sum up to 1 condition; and (C4) the only min or only max oerator condition. Several seminal results in the literature focus on special cases. For example, turn-based stochastic games correspond to conditions C2 and C3; and Markov decision process to conditions C2, C3, and C4. However, the systemati"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2412.12228","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/2412.12228/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":"2412.12228","created_at":"2026-07-05T09:50:37.654613+00:00"},{"alias_kind":"arxiv_version","alias_value":"2412.12228v1","created_at":"2026-07-05T09:50:37.654613+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2412.12228","created_at":"2026-07-05T09:50:37.654613+00:00"},{"alias_kind":"pith_short_12","alias_value":"7SUPK6UQEDGG","created_at":"2026-07-05T09:50:37.654613+00:00"},{"alias_kind":"pith_short_16","alias_value":"7SUPK6UQEDGGDRBX","created_at":"2026-07-05T09:50:37.654613+00:00"},{"alias_kind":"pith_short_8","alias_value":"7SUPK6UQ","created_at":"2026-07-05T09:50:37.654613+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/7SUPK6UQEDGGDRBX6VHA3EH76G","json":"https://pith.science/pith/7SUPK6UQEDGGDRBX6VHA3EH76G.json","graph_json":"https://pith.science/api/pith-number/7SUPK6UQEDGGDRBX6VHA3EH76G/graph.json","events_json":"https://pith.science/api/pith-number/7SUPK6UQEDGGDRBX6VHA3EH76G/events.json","paper":"https://pith.science/paper/7SUPK6UQ"},"agent_actions":{"view_html":"https://pith.science/pith/7SUPK6UQEDGGDRBX6VHA3EH76G","download_json":"https://pith.science/pith/7SUPK6UQEDGGDRBX6VHA3EH76G.json","view_paper":"https://pith.science/paper/7SUPK6UQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2412.12228&json=true","fetch_graph":"https://pith.science/api/pith-number/7SUPK6UQEDGGDRBX6VHA3EH76G/graph.json","fetch_events":"https://pith.science/api/pith-number/7SUPK6UQEDGGDRBX6VHA3EH76G/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7SUPK6UQEDGGDRBX6VHA3EH76G/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7SUPK6UQEDGGDRBX6VHA3EH76G/action/storage_attestation","attest_author":"https://pith.science/pith/7SUPK6UQEDGGDRBX6VHA3EH76G/action/author_attestation","sign_citation":"https://pith.science/pith/7SUPK6UQEDGGDRBX6VHA3EH76G/action/citation_signature","submit_replication":"https://pith.science/pith/7SUPK6UQEDGGDRBX6VHA3EH76G/action/replication_record"}},"created_at":"2026-07-05T09:50:37.654613+00:00","updated_at":"2026-07-05T09:50:37.654613+00:00"}