{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:7WMIOE2ACZ7ERLOS7H426T7SR5","short_pith_number":"pith:7WMIOE2A","canonical_record":{"source":{"id":"1305.2039","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2013-05-09T09:12:52Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"55c02a2379874741373d8a2fa8ba0c816080ad5149d68bfb314e6c21446ac438","abstract_canon_sha256":"abd4a80f89e2cef530d75bfe54095d741acb0acd1d528bcf13288095f2faf86a"},"schema_version":"1.0"},"canonical_sha256":"fd98871340167e48add2f9f9af4ff28f74e221800d912ceaca4d244d0528a9a3","source":{"kind":"arxiv","id":"1305.2039","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1305.2039","created_at":"2026-05-18T03:16:51Z"},{"alias_kind":"arxiv_version","alias_value":"1305.2039v2","created_at":"2026-05-18T03:16:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1305.2039","created_at":"2026-05-18T03:16:51Z"},{"alias_kind":"pith_short_12","alias_value":"7WMIOE2ACZ7E","created_at":"2026-05-18T12:27:38Z"},{"alias_kind":"pith_short_16","alias_value":"7WMIOE2ACZ7ERLOS","created_at":"2026-05-18T12:27:38Z"},{"alias_kind":"pith_short_8","alias_value":"7WMIOE2A","created_at":"2026-05-18T12:27:38Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:7WMIOE2ACZ7ERLOS7H426T7SR5","target":"record","payload":{"canonical_record":{"source":{"id":"1305.2039","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2013-05-09T09:12:52Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"55c02a2379874741373d8a2fa8ba0c816080ad5149d68bfb314e6c21446ac438","abstract_canon_sha256":"abd4a80f89e2cef530d75bfe54095d741acb0acd1d528bcf13288095f2faf86a"},"schema_version":"1.0"},"canonical_sha256":"fd98871340167e48add2f9f9af4ff28f74e221800d912ceaca4d244d0528a9a3","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:16:51.002311Z","signature_b64":"hfJwYvseEwj+GqFReNE2TU0+1bwuOdZH0jQFkBgCxxPL4MK1SJLR0PPu9OFmQdKi0P/F69Nb3Kd/iIAaqLTCAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fd98871340167e48add2f9f9af4ff28f74e221800d912ceaca4d244d0528a9a3","last_reissued_at":"2026-05-18T03:16:51.001663Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:16:51.001663Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1305.2039","source_version":2,"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-18T03:16:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1JuYzMd1GfflfAOAXGrr7ghsXJsd45vzmzI0zI35aDWMXus7g0Q7auksrLLfW9L66IxysiTMOfy0h3yUbFgJAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T12:41:41.238185Z"},"content_sha256":"06022eee3784ef829ff18813ca753e140cddc8cea3dd3c206538553683e525b6","schema_version":"1.0","event_id":"sha256:06022eee3784ef829ff18813ca753e140cddc8cea3dd3c206538553683e525b6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:7WMIOE2ACZ7ERLOS7H426T7SR5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the reduction of the CSP dichotomy conjecture to digraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.CC","authors_text":"Dejan Delic, Jakub Bulin, Marcel Jackson, Todd Niven","submitted_at":"2013-05-09T09:12:52Z","abstract_excerpt":"It is well known that the constraint satisfaction problem over general relational structures can be reduced in polynomial time to digraphs. We present a simple variant of such a reduction and use it to show that the algebraic dichotomy conjecture is equivalent to its restriction to digraphs and that the polynomial reduction can be made in logspace. We also show that our reduction preserves the bounded width property, i.e., solvability by local consistency methods. We discuss further algorithmic properties that are preserved and related open problems."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1305.2039","kind":"arxiv","version":2},"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-18T03:16:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MXhOWdJuBToA9spZDIx9v7NFVLZhfLz8AGyNLztPEa48ZSWAYhwdsnpTRBgO9zNoNLExzWOnUX9mU5OooQIuCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T12:41:41.238565Z"},"content_sha256":"0d87622e64f360194fc7f6362001f58a7e2f44d041811f5af657bfbb63eaadc9","schema_version":"1.0","event_id":"sha256:0d87622e64f360194fc7f6362001f58a7e2f44d041811f5af657bfbb63eaadc9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7WMIOE2ACZ7ERLOS7H426T7SR5/bundle.json","state_url":"https://pith.science/pith/7WMIOE2ACZ7ERLOS7H426T7SR5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7WMIOE2ACZ7ERLOS7H426T7SR5/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-26T12:41:41Z","links":{"resolver":"https://pith.science/pith/7WMIOE2ACZ7ERLOS7H426T7SR5","bundle":"https://pith.science/pith/7WMIOE2ACZ7ERLOS7H426T7SR5/bundle.json","state":"https://pith.science/pith/7WMIOE2ACZ7ERLOS7H426T7SR5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7WMIOE2ACZ7ERLOS7H426T7SR5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:7WMIOE2ACZ7ERLOS7H426T7SR5","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":"abd4a80f89e2cef530d75bfe54095d741acb0acd1d528bcf13288095f2faf86a","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2013-05-09T09:12:52Z","title_canon_sha256":"55c02a2379874741373d8a2fa8ba0c816080ad5149d68bfb314e6c21446ac438"},"schema_version":"1.0","source":{"id":"1305.2039","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1305.2039","created_at":"2026-05-18T03:16:51Z"},{"alias_kind":"arxiv_version","alias_value":"1305.2039v2","created_at":"2026-05-18T03:16:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1305.2039","created_at":"2026-05-18T03:16:51Z"},{"alias_kind":"pith_short_12","alias_value":"7WMIOE2ACZ7E","created_at":"2026-05-18T12:27:38Z"},{"alias_kind":"pith_short_16","alias_value":"7WMIOE2ACZ7ERLOS","created_at":"2026-05-18T12:27:38Z"},{"alias_kind":"pith_short_8","alias_value":"7WMIOE2A","created_at":"2026-05-18T12:27:38Z"}],"graph_snapshots":[{"event_id":"sha256:0d87622e64f360194fc7f6362001f58a7e2f44d041811f5af657bfbb63eaadc9","target":"graph","created_at":"2026-05-18T03:16:51Z","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":"It is well known that the constraint satisfaction problem over general relational structures can be reduced in polynomial time to digraphs. We present a simple variant of such a reduction and use it to show that the algebraic dichotomy conjecture is equivalent to its restriction to digraphs and that the polynomial reduction can be made in logspace. We also show that our reduction preserves the bounded width property, i.e., solvability by local consistency methods. We discuss further algorithmic properties that are preserved and related open problems.","authors_text":"Dejan Delic, Jakub Bulin, Marcel Jackson, Todd Niven","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2013-05-09T09:12:52Z","title":"On the reduction of the CSP dichotomy conjecture to digraphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1305.2039","kind":"arxiv","version":2},"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:06022eee3784ef829ff18813ca753e140cddc8cea3dd3c206538553683e525b6","target":"record","created_at":"2026-05-18T03:16:51Z","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":"abd4a80f89e2cef530d75bfe54095d741acb0acd1d528bcf13288095f2faf86a","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2013-05-09T09:12:52Z","title_canon_sha256":"55c02a2379874741373d8a2fa8ba0c816080ad5149d68bfb314e6c21446ac438"},"schema_version":"1.0","source":{"id":"1305.2039","kind":"arxiv","version":2}},"canonical_sha256":"fd98871340167e48add2f9f9af4ff28f74e221800d912ceaca4d244d0528a9a3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fd98871340167e48add2f9f9af4ff28f74e221800d912ceaca4d244d0528a9a3","first_computed_at":"2026-05-18T03:16:51.001663Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:16:51.001663Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"hfJwYvseEwj+GqFReNE2TU0+1bwuOdZH0jQFkBgCxxPL4MK1SJLR0PPu9OFmQdKi0P/F69Nb3Kd/iIAaqLTCAA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:16:51.002311Z","signed_message":"canonical_sha256_bytes"},"source_id":"1305.2039","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:06022eee3784ef829ff18813ca753e140cddc8cea3dd3c206538553683e525b6","sha256:0d87622e64f360194fc7f6362001f58a7e2f44d041811f5af657bfbb63eaadc9"],"state_sha256":"3bd43058a54c121b41ce8bb3585d6683625461bf805a76015a1332e5e8bfca74"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9/qR7I5wL8si7clCftVf6ORJkrT1LAKc2hc2du3Uhm/+IHYoqKJKNBPdkULMGHhKQN1bJ5EkxP+TNx8ARb7JAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-26T12:41:41.240542Z","bundle_sha256":"156d7768ea230c3bfc055d76af10801e8c5253e062874a8d8119b263d06af007"}}