{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:KONA5E3MMHPB7IGXC2ZH4GBX5J","short_pith_number":"pith:KONA5E3M","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"},"canonical_sha256":"539a0e936c61de1fa0d716b27e1837ea768780083f2494515c570f44022f508e","source":{"kind":"arxiv","id":"1501.01598","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1501.01598","created_at":"2026-05-18T02:29:53Z"},{"alias_kind":"arxiv_version","alias_value":"1501.01598v1","created_at":"2026-05-18T02:29:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.01598","created_at":"2026-05-18T02:29:53Z"},{"alias_kind":"pith_short_12","alias_value":"KONA5E3MMHPB","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_16","alias_value":"KONA5E3MMHPB7IGX","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_8","alias_value":"KONA5E3M","created_at":"2026-05-18T12:29:29Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:KONA5E3MMHPB7IGXC2ZH4GBX5J","target":"record","payload":{"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"},"canonical_sha256":"539a0e936c61de1fa0d716b27e1837ea768780083f2494515c570f44022f508e","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"},"source_kind":"arxiv","source_id":"1501.01598","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:29:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4zQptvy9nM+gba0rPOiWog1JlQf00DGBehU6t0MWIR5sIcVPB1/ahwu7rNC3KksuUE4g4XSAizHRJlO0Zb/4DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T13:06:36.165573Z"},"content_sha256":"799a9da766c0fae9c28770cfcb7c21a549c7a33dac5a70e1574cf096a537ca4d","schema_version":"1.0","event_id":"sha256:799a9da766c0fae9c28770cfcb7c21a549c7a33dac5a70e1574cf096a537ca4d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:KONA5E3MMHPB7IGXC2ZH4GBX5J","target":"graph","payload":{"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"},"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:29:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eEfqHdMZFkBSBPs5aelN4wwmwvacvCYIe+w64W2rnPGvvq1DT3OgA82QBXBkcLY47LBCs3x7dOIsjAs68JQRBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T13:06:36.166238Z"},"content_sha256":"c4d654025d0f3bd2e595d4f52e22bc6e73f171e0e28c252e8e728f469fa9e7f5","schema_version":"1.0","event_id":"sha256:c4d654025d0f3bd2e595d4f52e22bc6e73f171e0e28c252e8e728f469fa9e7f5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KONA5E3MMHPB7IGXC2ZH4GBX5J/bundle.json","state_url":"https://pith.science/pith/KONA5E3MMHPB7IGXC2ZH4GBX5J/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KONA5E3MMHPB7IGXC2ZH4GBX5J/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-06-06T13:06:36Z","links":{"resolver":"https://pith.science/pith/KONA5E3MMHPB7IGXC2ZH4GBX5J","bundle":"https://pith.science/pith/KONA5E3MMHPB7IGXC2ZH4GBX5J/bundle.json","state":"https://pith.science/pith/KONA5E3MMHPB7IGXC2ZH4GBX5J/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KONA5E3MMHPB7IGXC2ZH4GBX5J/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:KONA5E3MMHPB7IGXC2ZH4GBX5J","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":"0f830c35d7cbdca52d9efc07b0ae0a5447ae725a38d6533eb84a649187164cd3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-01-07T19:17:25Z","title_canon_sha256":"857154cf3c0c57a568c3e27d1638dc65f7086d6231fc2b44a04c912e2a80016a"},"schema_version":"1.0","source":{"id":"1501.01598","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1501.01598","created_at":"2026-05-18T02:29:53Z"},{"alias_kind":"arxiv_version","alias_value":"1501.01598v1","created_at":"2026-05-18T02:29:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.01598","created_at":"2026-05-18T02:29:53Z"},{"alias_kind":"pith_short_12","alias_value":"KONA5E3MMHPB","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_16","alias_value":"KONA5E3MMHPB7IGX","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_8","alias_value":"KONA5E3M","created_at":"2026-05-18T12:29:29Z"}],"graph_snapshots":[{"event_id":"sha256:c4d654025d0f3bd2e595d4f52e22bc6e73f171e0e28c252e8e728f469fa9e7f5","target":"graph","created_at":"2026-05-18T02:29:53Z","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":"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","authors_text":"Jonah Brown-Cohen, Prasad Raghavendra","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-01-07T19:17:25Z","title":"Combinatorial Optimization Algorithms via Polymorphisms"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1501.01598","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:799a9da766c0fae9c28770cfcb7c21a549c7a33dac5a70e1574cf096a537ca4d","target":"record","created_at":"2026-05-18T02:29:53Z","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":"0f830c35d7cbdca52d9efc07b0ae0a5447ae725a38d6533eb84a649187164cd3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-01-07T19:17:25Z","title_canon_sha256":"857154cf3c0c57a568c3e27d1638dc65f7086d6231fc2b44a04c912e2a80016a"},"schema_version":"1.0","source":{"id":"1501.01598","kind":"arxiv","version":1}},"canonical_sha256":"539a0e936c61de1fa0d716b27e1837ea768780083f2494515c570f44022f508e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"539a0e936c61de1fa0d716b27e1837ea768780083f2494515c570f44022f508e","first_computed_at":"2026-05-18T02:29:53.543119Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:29:53.543119Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"nek5BtKmyn2FcH6vDkyR2QQbU2afgnCVXhtJ6jKtZs9dt8zUL9OYANb569YCKTpv+ghbrrt5jGGpwN/jS0WRDg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:29:53.543547Z","signed_message":"canonical_sha256_bytes"},"source_id":"1501.01598","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:799a9da766c0fae9c28770cfcb7c21a549c7a33dac5a70e1574cf096a537ca4d","sha256:c4d654025d0f3bd2e595d4f52e22bc6e73f171e0e28c252e8e728f469fa9e7f5"],"state_sha256":"7a25f440de492c297ba81b03b001122628b7ea62bf2c8b351286c35a4876488b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iSb/tW76lDVapELXWPmhVw6D+jQ7LPGtzyktzh/zg9AnLhhNKRyTiUo2wnYygnc9Wa1eTFEvm3b+3L491hxPBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-06T13:06:36.169838Z","bundle_sha256":"a94af6afff8d5517c16b1d7dab7ac298ca94267da167b5058c9ecc318a7170a7"}}