{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:G33UPN26WS5TZJXT26GTZOBWY4","short_pith_number":"pith:G33UPN26","canonical_record":{"source":{"id":"1807.05194","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2018-07-13T17:29:50Z","cross_cats_sorted":["cs.DS","cs.LO","math.OC"],"title_canon_sha256":"ab0d92be82a9d4ef070aa5362ece277733d331ccf54d0dcdd14454e756e479a5","abstract_canon_sha256":"395e00080b9fe2df73d4a5754d4efa5e969e9f720ac16d922a0fcb064491f796"},"schema_version":"1.0"},"canonical_sha256":"36f747b75eb4bb3ca6f3d78d3cb836c7268076186911a4328e81fb35e643aa7d","source":{"kind":"arxiv","id":"1807.05194","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1807.05194","created_at":"2026-05-18T00:10:48Z"},{"alias_kind":"arxiv_version","alias_value":"1807.05194v1","created_at":"2026-05-18T00:10:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.05194","created_at":"2026-05-18T00:10:48Z"},{"alias_kind":"pith_short_12","alias_value":"G33UPN26WS5T","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_16","alias_value":"G33UPN26WS5TZJXT","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_8","alias_value":"G33UPN26","created_at":"2026-05-18T12:32:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:G33UPN26WS5TZJXT26GTZOBWY4","target":"record","payload":{"canonical_record":{"source":{"id":"1807.05194","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2018-07-13T17:29:50Z","cross_cats_sorted":["cs.DS","cs.LO","math.OC"],"title_canon_sha256":"ab0d92be82a9d4ef070aa5362ece277733d331ccf54d0dcdd14454e756e479a5","abstract_canon_sha256":"395e00080b9fe2df73d4a5754d4efa5e969e9f720ac16d922a0fcb064491f796"},"schema_version":"1.0"},"canonical_sha256":"36f747b75eb4bb3ca6f3d78d3cb836c7268076186911a4328e81fb35e643aa7d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:10:48.525523Z","signature_b64":"5vcLEPzUE6ZK3C4P1YgGaPaRykR+Foqp2WmgnhuFmeh9QrL/rIOtFF4Aeh5a4+hlx23UqcDpbQW8ADgh1NpYDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"36f747b75eb4bb3ca6f3d78d3cb836c7268076186911a4328e81fb35e643aa7d","last_reissued_at":"2026-05-18T00:10:48.524858Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:10:48.524858Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1807.05194","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-18T00:10:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"R4iGggsHCYdGhtgHIqSeGtsgRYSgqHnNg7+tFYRKCeIH2euAEsSj7PGdgiZ6bed7roGuu1fnJH8dWQlajN+LCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T08:57:12.953752Z"},"content_sha256":"139b921f72e2434882b4995c87ce8c888c4fc9f79f02efaf27305773d89e65e2","schema_version":"1.0","event_id":"sha256:139b921f72e2434882b4995c87ce8c888c4fc9f79f02efaf27305773d89e65e2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:G33UPN26WS5TZJXT26GTZOBWY4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An Algorithmic Blend of LPs and Ring Equations for Promise CSPs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","cs.LO","math.OC"],"primary_cat":"cs.CC","authors_text":"Joshua Brakensiek, Venkatesan Guruswami","submitted_at":"2018-07-13T17:29:50Z","abstract_excerpt":"Promise CSPs are a relaxation of constraint satisfaction problems where the goal is to find an assignment satisfying a relaxed version of the constraints. Several well-known problems can be cast as promise CSPs including approximate graph coloring, discrepancy minimization, and interesting variants of satisfiability. Similar to CSPs, the tractability of promise CSPs can be tied to the structure of operations on the solution space called polymorphisms, though in the promise world these operations are much less constrained. Under the thesis that non-trivial polymorphisms govern tractability, pro"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.05194","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-18T00:10:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VALL7H6IYTnpyzW0sCQYT2pZAcF++P66z60UmTi8IUivyRc7OHDfcPQyU6phnjjbKczB9K5ZdKuCwTP2Yn+vAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T08:57:12.954495Z"},"content_sha256":"ad345d9bc3ab9f22848aa8f4cfb724e5f0900c1e790df04f5d9309e7744eb783","schema_version":"1.0","event_id":"sha256:ad345d9bc3ab9f22848aa8f4cfb724e5f0900c1e790df04f5d9309e7744eb783"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/G33UPN26WS5TZJXT26GTZOBWY4/bundle.json","state_url":"https://pith.science/pith/G33UPN26WS5TZJXT26GTZOBWY4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/G33UPN26WS5TZJXT26GTZOBWY4/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-09T08:57:12Z","links":{"resolver":"https://pith.science/pith/G33UPN26WS5TZJXT26GTZOBWY4","bundle":"https://pith.science/pith/G33UPN26WS5TZJXT26GTZOBWY4/bundle.json","state":"https://pith.science/pith/G33UPN26WS5TZJXT26GTZOBWY4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/G33UPN26WS5TZJXT26GTZOBWY4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:G33UPN26WS5TZJXT26GTZOBWY4","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":"395e00080b9fe2df73d4a5754d4efa5e969e9f720ac16d922a0fcb064491f796","cross_cats_sorted":["cs.DS","cs.LO","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2018-07-13T17:29:50Z","title_canon_sha256":"ab0d92be82a9d4ef070aa5362ece277733d331ccf54d0dcdd14454e756e479a5"},"schema_version":"1.0","source":{"id":"1807.05194","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1807.05194","created_at":"2026-05-18T00:10:48Z"},{"alias_kind":"arxiv_version","alias_value":"1807.05194v1","created_at":"2026-05-18T00:10:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.05194","created_at":"2026-05-18T00:10:48Z"},{"alias_kind":"pith_short_12","alias_value":"G33UPN26WS5T","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_16","alias_value":"G33UPN26WS5TZJXT","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_8","alias_value":"G33UPN26","created_at":"2026-05-18T12:32:25Z"}],"graph_snapshots":[{"event_id":"sha256:ad345d9bc3ab9f22848aa8f4cfb724e5f0900c1e790df04f5d9309e7744eb783","target":"graph","created_at":"2026-05-18T00:10:48Z","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":"Promise CSPs are a relaxation of constraint satisfaction problems where the goal is to find an assignment satisfying a relaxed version of the constraints. Several well-known problems can be cast as promise CSPs including approximate graph coloring, discrepancy minimization, and interesting variants of satisfiability. Similar to CSPs, the tractability of promise CSPs can be tied to the structure of operations on the solution space called polymorphisms, though in the promise world these operations are much less constrained. Under the thesis that non-trivial polymorphisms govern tractability, pro","authors_text":"Joshua Brakensiek, Venkatesan Guruswami","cross_cats":["cs.DS","cs.LO","math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2018-07-13T17:29:50Z","title":"An Algorithmic Blend of LPs and Ring Equations for Promise CSPs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.05194","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:139b921f72e2434882b4995c87ce8c888c4fc9f79f02efaf27305773d89e65e2","target":"record","created_at":"2026-05-18T00:10:48Z","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":"395e00080b9fe2df73d4a5754d4efa5e969e9f720ac16d922a0fcb064491f796","cross_cats_sorted":["cs.DS","cs.LO","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2018-07-13T17:29:50Z","title_canon_sha256":"ab0d92be82a9d4ef070aa5362ece277733d331ccf54d0dcdd14454e756e479a5"},"schema_version":"1.0","source":{"id":"1807.05194","kind":"arxiv","version":1}},"canonical_sha256":"36f747b75eb4bb3ca6f3d78d3cb836c7268076186911a4328e81fb35e643aa7d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"36f747b75eb4bb3ca6f3d78d3cb836c7268076186911a4328e81fb35e643aa7d","first_computed_at":"2026-05-18T00:10:48.524858Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:10:48.524858Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"5vcLEPzUE6ZK3C4P1YgGaPaRykR+Foqp2WmgnhuFmeh9QrL/rIOtFF4Aeh5a4+hlx23UqcDpbQW8ADgh1NpYDg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:10:48.525523Z","signed_message":"canonical_sha256_bytes"},"source_id":"1807.05194","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:139b921f72e2434882b4995c87ce8c888c4fc9f79f02efaf27305773d89e65e2","sha256:ad345d9bc3ab9f22848aa8f4cfb724e5f0900c1e790df04f5d9309e7744eb783"],"state_sha256":"ef4f4a8ccb21c43b06667e3fe390d8dca82b61855f852486f0f0c617eeba78ba"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pAmAwMTzYqv/OtURGHTzIvlwO9IZ0K1r+XBukXd3Syk7hEqRczChfm+ieLpc/FiRjgNCvcT+UGAvI01wYTJXAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T08:57:12.958845Z","bundle_sha256":"116e781b11a0d2e90ed22790a41c34d72e2d9d3a38e818ee9d1079e460a0e13c"}}