{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:A2RRCN22XUOEYBLXHZ6XE7IY7D","short_pith_number":"pith:A2RRCN22","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"},"canonical_sha256":"06a311375abd1c4c05773e7d727d18f8dd624211edba57ac48a8cec503b15f38","source":{"kind":"arxiv","id":"1207.6692","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1207.6692","created_at":"2026-05-18T02:21:07Z"},{"alias_kind":"arxiv_version","alias_value":"1207.6692v1","created_at":"2026-05-18T02:21:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.6692","created_at":"2026-05-18T02:21:07Z"},{"alias_kind":"pith_short_12","alias_value":"A2RRCN22XUOE","created_at":"2026-05-18T12:26:58Z"},{"alias_kind":"pith_short_16","alias_value":"A2RRCN22XUOEYBLX","created_at":"2026-05-18T12:26:58Z"},{"alias_kind":"pith_short_8","alias_value":"A2RRCN22","created_at":"2026-05-18T12:26:58Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:A2RRCN22XUOEYBLXHZ6XE7IY7D","target":"record","payload":{"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"},"canonical_sha256":"06a311375abd1c4c05773e7d727d18f8dd624211edba57ac48a8cec503b15f38","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"},"source_kind":"arxiv","source_id":"1207.6692","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:21:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"awcE+3mL1DrcfDTjEVx1d69yK1YPQXoG9lpYMzK8rbDiVZqicrfjMDB2yTXSyIETb9X80le5HLGjGtsiQzszAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T14:45:38.146862Z"},"content_sha256":"1095a218e11ae63fe7daa075295e786f98db7ca09b04dbb9cc1fba691e30d34c","schema_version":"1.0","event_id":"sha256:1095a218e11ae63fe7daa075295e786f98db7ca09b04dbb9cc1fba691e30d34c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:A2RRCN22XUOEYBLXHZ6XE7IY7D","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:21:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8FQ3EMFvId3q+NQtOpz9l6BQbDZNwU5I8fxH04CDxLTpzYKb2EcMITxR/Pag+PEAOxqCx0sL0DYuViishtVsAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T14:45:38.147202Z"},"content_sha256":"911cffe6624a96518af461b146d4bea8349213bb5b6c26d6d910dea7d9fb8d91","schema_version":"1.0","event_id":"sha256:911cffe6624a96518af461b146d4bea8349213bb5b6c26d6d910dea7d9fb8d91"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/A2RRCN22XUOEYBLXHZ6XE7IY7D/bundle.json","state_url":"https://pith.science/pith/A2RRCN22XUOEYBLXHZ6XE7IY7D/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/A2RRCN22XUOEYBLXHZ6XE7IY7D/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-28T14:45:38Z","links":{"resolver":"https://pith.science/pith/A2RRCN22XUOEYBLXHZ6XE7IY7D","bundle":"https://pith.science/pith/A2RRCN22XUOEYBLXHZ6XE7IY7D/bundle.json","state":"https://pith.science/pith/A2RRCN22XUOEYBLXHZ6XE7IY7D/state.json","well_known_bundle":"https://pith.science/.well-known/pith/A2RRCN22XUOEYBLXHZ6XE7IY7D/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:A2RRCN22XUOEYBLXHZ6XE7IY7D","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":"4bc51f855700d200182363097d2d90e28f17c209793719b1957b37dc2ce2be84","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2012-07-28T09:01:36Z","title_canon_sha256":"121c4468df6833107e5333a245a6bb98a4f03558e1661608cd6917711a738438"},"schema_version":"1.0","source":{"id":"1207.6692","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1207.6692","created_at":"2026-05-18T02:21:07Z"},{"alias_kind":"arxiv_version","alias_value":"1207.6692v1","created_at":"2026-05-18T02:21:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.6692","created_at":"2026-05-18T02:21:07Z"},{"alias_kind":"pith_short_12","alias_value":"A2RRCN22XUOE","created_at":"2026-05-18T12:26:58Z"},{"alias_kind":"pith_short_16","alias_value":"A2RRCN22XUOEYBLX","created_at":"2026-05-18T12:26:58Z"},{"alias_kind":"pith_short_8","alias_value":"A2RRCN22","created_at":"2026-05-18T12:26:58Z"}],"graph_snapshots":[{"event_id":"sha256:911cffe6624a96518af461b146d4bea8349213bb5b6c26d6d910dea7d9fb8d91","target":"graph","created_at":"2026-05-18T02:21:07Z","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":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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 ","authors_text":"David A. Cohen, Martin C. Cooper, Paidi Creed, Peter G. Jeavons, Stanislav Zivny","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2012-07-28T09:01:36Z","title":"An Algebraic Theory of Complexity for Discrete Optimisation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1207.6692","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:1095a218e11ae63fe7daa075295e786f98db7ca09b04dbb9cc1fba691e30d34c","target":"record","created_at":"2026-05-18T02:21:07Z","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":"4bc51f855700d200182363097d2d90e28f17c209793719b1957b37dc2ce2be84","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2012-07-28T09:01:36Z","title_canon_sha256":"121c4468df6833107e5333a245a6bb98a4f03558e1661608cd6917711a738438"},"schema_version":"1.0","source":{"id":"1207.6692","kind":"arxiv","version":1}},"canonical_sha256":"06a311375abd1c4c05773e7d727d18f8dd624211edba57ac48a8cec503b15f38","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"06a311375abd1c4c05773e7d727d18f8dd624211edba57ac48a8cec503b15f38","first_computed_at":"2026-05-18T02:21:07.909575Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:21:07.909575Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"uBEuZk5llAnnYCK9Tcg5gceFkPVdu8iNjXZS5Giek2jBc/KH1k/+V3AejviDTQAuRPEjzhSSkXNra3YFRY41Ag==","signature_status":"signed_v1","signed_at":"2026-05-18T02:21:07.910275Z","signed_message":"canonical_sha256_bytes"},"source_id":"1207.6692","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1095a218e11ae63fe7daa075295e786f98db7ca09b04dbb9cc1fba691e30d34c","sha256:911cffe6624a96518af461b146d4bea8349213bb5b6c26d6d910dea7d9fb8d91"],"state_sha256":"2ead3c7eac84ac5bdbc44f0b3650438a90272c2a0c80b62ef3d057dbf5a6b03e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"am5cZurr7TwCCKqvu1KJqKVmKsWyf3XbKWBOTAeLQ7ipRZ976ZD5+JYLT75aPpj5HPDUsAXRRV3Hg7Hs0dduDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T14:45:38.149186Z","bundle_sha256":"76ccdb238410ebef39f0179252333488fcfbb05d8e885035576be2f7fb670688"}}