{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:A2RRCN22XUOEYBLXHZ6XE7IY7D","short_pith_number":"pith:A2RRCN22","schema_version":"1.0","canonical_sha256":"06a311375abd1c4c05773e7d727d18f8dd624211edba57ac48a8cec503b15f38","source":{"kind":"arxiv","id":"1207.6692","version":1},"attestation_state":"computed","paper":{"title":"An Algebraic Theory of Complexity for Discrete Optimisation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.CC","authors_text":"David A. Cohen, Martin C. Cooper, Paidi Creed, Peter G. Jeavons, Stanislav Zivny","submitted_at":"2012-07-28T09:01:36Z","abstract_excerpt":"Discrete optimisation problems arise in many different areas and are studied under many different names. In many such problems the quantity to be optimised can be expressed as a sum of functions of a restricted form. Here we present a unifying theory of complexity for problems of this kind. We show that the complexity of a finite-domain discrete optimisation problem is determined by certain algebraic properties of the objective function, which we call weighted polymorphisms. We define a Galois connection between sets of rational-valued functions and sets of weighted polymorphisms and show how "},"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":"1207.6692","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2012-07-28T09:01:36Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"121c4468df6833107e5333a245a6bb98a4f03558e1661608cd6917711a738438","abstract_canon_sha256":"4bc51f855700d200182363097d2d90e28f17c209793719b1957b37dc2ce2be84"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:21:07.910275Z","signature_b64":"uBEuZk5llAnnYCK9Tcg5gceFkPVdu8iNjXZS5Giek2jBc/KH1k/+V3AejviDTQAuRPEjzhSSkXNra3YFRY41Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"06a311375abd1c4c05773e7d727d18f8dd624211edba57ac48a8cec503b15f38","last_reissued_at":"2026-05-18T02:21:07.909575Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:21:07.909575Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An Algebraic Theory of Complexity for Discrete Optimisation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.CC","authors_text":"David A. Cohen, Martin C. Cooper, Paidi Creed, Peter G. Jeavons, Stanislav Zivny","submitted_at":"2012-07-28T09:01:36Z","abstract_excerpt":"Discrete optimisation problems arise in many different areas and are studied under many different names. In many such problems the quantity to be optimised can be expressed as a sum of functions of a restricted form. Here we present a unifying theory of complexity for problems of this kind. We show that the complexity of a finite-domain discrete optimisation problem is determined by certain algebraic properties of the objective function, which we call weighted polymorphisms. We define a Galois connection between sets of rational-valued functions and sets of weighted polymorphisms and show how "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1207.6692","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":""},"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":"1207.6692","created_at":"2026-05-18T02:21:07.909690+00:00"},{"alias_kind":"arxiv_version","alias_value":"1207.6692v1","created_at":"2026-05-18T02:21:07.909690+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.6692","created_at":"2026-05-18T02:21:07.909690+00:00"},{"alias_kind":"pith_short_12","alias_value":"A2RRCN22XUOE","created_at":"2026-05-18T12:26:58.693483+00:00"},{"alias_kind":"pith_short_16","alias_value":"A2RRCN22XUOEYBLX","created_at":"2026-05-18T12:26:58.693483+00:00"},{"alias_kind":"pith_short_8","alias_value":"A2RRCN22","created_at":"2026-05-18T12:26:58.693483+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/A2RRCN22XUOEYBLXHZ6XE7IY7D","json":"https://pith.science/pith/A2RRCN22XUOEYBLXHZ6XE7IY7D.json","graph_json":"https://pith.science/api/pith-number/A2RRCN22XUOEYBLXHZ6XE7IY7D/graph.json","events_json":"https://pith.science/api/pith-number/A2RRCN22XUOEYBLXHZ6XE7IY7D/events.json","paper":"https://pith.science/paper/A2RRCN22"},"agent_actions":{"view_html":"https://pith.science/pith/A2RRCN22XUOEYBLXHZ6XE7IY7D","download_json":"https://pith.science/pith/A2RRCN22XUOEYBLXHZ6XE7IY7D.json","view_paper":"https://pith.science/paper/A2RRCN22","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1207.6692&json=true","fetch_graph":"https://pith.science/api/pith-number/A2RRCN22XUOEYBLXHZ6XE7IY7D/graph.json","fetch_events":"https://pith.science/api/pith-number/A2RRCN22XUOEYBLXHZ6XE7IY7D/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/A2RRCN22XUOEYBLXHZ6XE7IY7D/action/timestamp_anchor","attest_storage":"https://pith.science/pith/A2RRCN22XUOEYBLXHZ6XE7IY7D/action/storage_attestation","attest_author":"https://pith.science/pith/A2RRCN22XUOEYBLXHZ6XE7IY7D/action/author_attestation","sign_citation":"https://pith.science/pith/A2RRCN22XUOEYBLXHZ6XE7IY7D/action/citation_signature","submit_replication":"https://pith.science/pith/A2RRCN22XUOEYBLXHZ6XE7IY7D/action/replication_record"}},"created_at":"2026-05-18T02:21:07.909690+00:00","updated_at":"2026-05-18T02:21:07.909690+00:00"}