{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:KONA5E3MMHPB7IGXC2ZH4GBX5J","short_pith_number":"pith:KONA5E3M","schema_version":"1.0","canonical_sha256":"539a0e936c61de1fa0d716b27e1837ea768780083f2494515c570f44022f508e","source":{"kind":"arxiv","id":"1501.01598","version":1},"attestation_state":"computed","paper":{"title":"Combinatorial Optimization Algorithms via Polymorphisms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Jonah Brown-Cohen, Prasad Raghavendra","submitted_at":"2015-01-07T19:17:25Z","abstract_excerpt":"An elegant characterization of the complexity of constraint satisfaction problems has emerged in the form of the the algebraic dichotomy conjecture of [BKJ00]. Roughly speaking, the characterization asserts that a CSP {\\Lambda} is tractable if and only if there exist certain non-trivial operations known as polymorphisms to combine solutions to {\\Lambda} to create new ones. In an entirely separate line of work, the unique games conjecture yields a characterization of approximability of Max-CSPs. Surprisingly, this characterization for Max-CSPs can also be reformulated in the language of polymor"},"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":"1501.01598","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-01-07T19:17:25Z","cross_cats_sorted":[],"title_canon_sha256":"857154cf3c0c57a568c3e27d1638dc65f7086d6231fc2b44a04c912e2a80016a","abstract_canon_sha256":"0f830c35d7cbdca52d9efc07b0ae0a5447ae725a38d6533eb84a649187164cd3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:29:53.543547Z","signature_b64":"nek5BtKmyn2FcH6vDkyR2QQbU2afgnCVXhtJ6jKtZs9dt8zUL9OYANb569YCKTpv+ghbrrt5jGGpwN/jS0WRDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"539a0e936c61de1fa0d716b27e1837ea768780083f2494515c570f44022f508e","last_reissued_at":"2026-05-18T02:29:53.543119Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:29:53.543119Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Combinatorial Optimization Algorithms via Polymorphisms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Jonah Brown-Cohen, Prasad Raghavendra","submitted_at":"2015-01-07T19:17:25Z","abstract_excerpt":"An elegant characterization of the complexity of constraint satisfaction problems has emerged in the form of the the algebraic dichotomy conjecture of [BKJ00]. Roughly speaking, the characterization asserts that a CSP {\\Lambda} is tractable if and only if there exist certain non-trivial operations known as polymorphisms to combine solutions to {\\Lambda} to create new ones. In an entirely separate line of work, the unique games conjecture yields a characterization of approximability of Max-CSPs. Surprisingly, this characterization for Max-CSPs can also be reformulated in the language of polymor"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1501.01598","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":"1501.01598","created_at":"2026-05-18T02:29:53.543178+00:00"},{"alias_kind":"arxiv_version","alias_value":"1501.01598v1","created_at":"2026-05-18T02:29:53.543178+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.01598","created_at":"2026-05-18T02:29:53.543178+00:00"},{"alias_kind":"pith_short_12","alias_value":"KONA5E3MMHPB","created_at":"2026-05-18T12:29:29.992203+00:00"},{"alias_kind":"pith_short_16","alias_value":"KONA5E3MMHPB7IGX","created_at":"2026-05-18T12:29:29.992203+00:00"},{"alias_kind":"pith_short_8","alias_value":"KONA5E3M","created_at":"2026-05-18T12:29:29.992203+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/KONA5E3MMHPB7IGXC2ZH4GBX5J","json":"https://pith.science/pith/KONA5E3MMHPB7IGXC2ZH4GBX5J.json","graph_json":"https://pith.science/api/pith-number/KONA5E3MMHPB7IGXC2ZH4GBX5J/graph.json","events_json":"https://pith.science/api/pith-number/KONA5E3MMHPB7IGXC2ZH4GBX5J/events.json","paper":"https://pith.science/paper/KONA5E3M"},"agent_actions":{"view_html":"https://pith.science/pith/KONA5E3MMHPB7IGXC2ZH4GBX5J","download_json":"https://pith.science/pith/KONA5E3MMHPB7IGXC2ZH4GBX5J.json","view_paper":"https://pith.science/paper/KONA5E3M","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1501.01598&json=true","fetch_graph":"https://pith.science/api/pith-number/KONA5E3MMHPB7IGXC2ZH4GBX5J/graph.json","fetch_events":"https://pith.science/api/pith-number/KONA5E3MMHPB7IGXC2ZH4GBX5J/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KONA5E3MMHPB7IGXC2ZH4GBX5J/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KONA5E3MMHPB7IGXC2ZH4GBX5J/action/storage_attestation","attest_author":"https://pith.science/pith/KONA5E3MMHPB7IGXC2ZH4GBX5J/action/author_attestation","sign_citation":"https://pith.science/pith/KONA5E3MMHPB7IGXC2ZH4GBX5J/action/citation_signature","submit_replication":"https://pith.science/pith/KONA5E3MMHPB7IGXC2ZH4GBX5J/action/replication_record"}},"created_at":"2026-05-18T02:29:53.543178+00:00","updated_at":"2026-05-18T02:29:53.543178+00:00"}