{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:FC3PXFFSZCTWNXY7NIBUGO5THY","short_pith_number":"pith:FC3PXFFS","canonical_record":{"source":{"id":"1502.03796","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-02-12T20:22:44Z","cross_cats_sorted":["cs.AI","cs.DM"],"title_canon_sha256":"4ba94b750ff9e1f422d4a4ddbe90b4ecb1b529994b961d86b3caa716c35ecc90","abstract_canon_sha256":"c99db968ac127f58a354e3fecf7e373f17056cbe177506292e04315e9d3ae01d"},"schema_version":"1.0"},"canonical_sha256":"28b6fb94b2c8a766df1f6a03433bb33e14e5334144821067eafbb923fa53d018","source":{"kind":"arxiv","id":"1502.03796","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1502.03796","created_at":"2026-05-18T01:55:32Z"},{"alias_kind":"arxiv_version","alias_value":"1502.03796v1","created_at":"2026-05-18T01:55:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.03796","created_at":"2026-05-18T01:55:32Z"},{"alias_kind":"pith_short_12","alias_value":"FC3PXFFSZCTW","created_at":"2026-05-18T12:29:19Z"},{"alias_kind":"pith_short_16","alias_value":"FC3PXFFSZCTWNXY7","created_at":"2026-05-18T12:29:19Z"},{"alias_kind":"pith_short_8","alias_value":"FC3PXFFS","created_at":"2026-05-18T12:29:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:FC3PXFFSZCTWNXY7NIBUGO5THY","target":"record","payload":{"canonical_record":{"source":{"id":"1502.03796","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-02-12T20:22:44Z","cross_cats_sorted":["cs.AI","cs.DM"],"title_canon_sha256":"4ba94b750ff9e1f422d4a4ddbe90b4ecb1b529994b961d86b3caa716c35ecc90","abstract_canon_sha256":"c99db968ac127f58a354e3fecf7e373f17056cbe177506292e04315e9d3ae01d"},"schema_version":"1.0"},"canonical_sha256":"28b6fb94b2c8a766df1f6a03433bb33e14e5334144821067eafbb923fa53d018","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:55:32.766030Z","signature_b64":"kg0DlNb7BOBv0VPye0j4zyE548vW6VJ20IszhDzSyJwNCENfEW0syPsqMyNaBl24XrgEbcngPL90VARxvvPoCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"28b6fb94b2c8a766df1f6a03433bb33e14e5334144821067eafbb923fa53d018","last_reissued_at":"2026-05-18T01:55:32.765454Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:55:32.765454Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1502.03796","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-18T01:55:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xFh6xJXisbAtGSz2rGUPH3oSw1R65BQ9EI59gjg9/EbZcwJpntno08kQO+FuLNQAJHDX0JHAMfHbxCAvp5xdCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T06:27:17.817715Z"},"content_sha256":"9b4f6ec0ea9a713561f7fd9980f91b65433b7997e109aa5731e994ef3b7824ad","schema_version":"1.0","event_id":"sha256:9b4f6ec0ea9a713561f7fd9980f91b65433b7997e109aa5731e994ef3b7824ad"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:FC3PXFFSZCTWNXY7NIBUGO5THY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Variable and value elimination in binary constraint satisfaction via forbidden patterns","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.DM"],"primary_cat":"cs.CC","authors_text":"David A. Cohen, Guillaume Escamocher, Martin C. Cooper, Stanislav Zivny","submitted_at":"2015-02-12T20:22:44Z","abstract_excerpt":"Variable or value elimination in a constraint satisfaction problem (CSP) can be used in preprocessing or during search to reduce search space size. A variable elimination rule (value elimination rule) allows the polynomial-time identification of certain variables (domain elements) whose elimination, without the introduction of extra compensatory constraints, does not affect the satisfiability of an instance. We show that there are essentially just four variable elimination rules and three value elimination rules defined by forbidding generic sub-instances, known as irreducible existential patt"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1502.03796","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-18T01:55:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4V4vtuG5ta0NPCBJN1Ecp9dP3qinX7Ma6XIJ5qhcMbuopFHbrxckNYjvB5Rk5gnSsDvZ7LJjnjjJBhE83dsOBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T06:27:17.818062Z"},"content_sha256":"bb5e06abc84e03d2b4e2817f023839e0b32e521c26af99d8507081a81da0ff67","schema_version":"1.0","event_id":"sha256:bb5e06abc84e03d2b4e2817f023839e0b32e521c26af99d8507081a81da0ff67"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FC3PXFFSZCTWNXY7NIBUGO5THY/bundle.json","state_url":"https://pith.science/pith/FC3PXFFSZCTWNXY7NIBUGO5THY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FC3PXFFSZCTWNXY7NIBUGO5THY/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-03T06:27:17Z","links":{"resolver":"https://pith.science/pith/FC3PXFFSZCTWNXY7NIBUGO5THY","bundle":"https://pith.science/pith/FC3PXFFSZCTWNXY7NIBUGO5THY/bundle.json","state":"https://pith.science/pith/FC3PXFFSZCTWNXY7NIBUGO5THY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FC3PXFFSZCTWNXY7NIBUGO5THY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:FC3PXFFSZCTWNXY7NIBUGO5THY","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":"c99db968ac127f58a354e3fecf7e373f17056cbe177506292e04315e9d3ae01d","cross_cats_sorted":["cs.AI","cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-02-12T20:22:44Z","title_canon_sha256":"4ba94b750ff9e1f422d4a4ddbe90b4ecb1b529994b961d86b3caa716c35ecc90"},"schema_version":"1.0","source":{"id":"1502.03796","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1502.03796","created_at":"2026-05-18T01:55:32Z"},{"alias_kind":"arxiv_version","alias_value":"1502.03796v1","created_at":"2026-05-18T01:55:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.03796","created_at":"2026-05-18T01:55:32Z"},{"alias_kind":"pith_short_12","alias_value":"FC3PXFFSZCTW","created_at":"2026-05-18T12:29:19Z"},{"alias_kind":"pith_short_16","alias_value":"FC3PXFFSZCTWNXY7","created_at":"2026-05-18T12:29:19Z"},{"alias_kind":"pith_short_8","alias_value":"FC3PXFFS","created_at":"2026-05-18T12:29:19Z"}],"graph_snapshots":[{"event_id":"sha256:bb5e06abc84e03d2b4e2817f023839e0b32e521c26af99d8507081a81da0ff67","target":"graph","created_at":"2026-05-18T01:55:32Z","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":"Variable or value elimination in a constraint satisfaction problem (CSP) can be used in preprocessing or during search to reduce search space size. A variable elimination rule (value elimination rule) allows the polynomial-time identification of certain variables (domain elements) whose elimination, without the introduction of extra compensatory constraints, does not affect the satisfiability of an instance. We show that there are essentially just four variable elimination rules and three value elimination rules defined by forbidding generic sub-instances, known as irreducible existential patt","authors_text":"David A. Cohen, Guillaume Escamocher, Martin C. Cooper, Stanislav Zivny","cross_cats":["cs.AI","cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-02-12T20:22:44Z","title":"Variable and value elimination in binary constraint satisfaction via forbidden patterns"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1502.03796","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:9b4f6ec0ea9a713561f7fd9980f91b65433b7997e109aa5731e994ef3b7824ad","target":"record","created_at":"2026-05-18T01:55:32Z","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":"c99db968ac127f58a354e3fecf7e373f17056cbe177506292e04315e9d3ae01d","cross_cats_sorted":["cs.AI","cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-02-12T20:22:44Z","title_canon_sha256":"4ba94b750ff9e1f422d4a4ddbe90b4ecb1b529994b961d86b3caa716c35ecc90"},"schema_version":"1.0","source":{"id":"1502.03796","kind":"arxiv","version":1}},"canonical_sha256":"28b6fb94b2c8a766df1f6a03433bb33e14e5334144821067eafbb923fa53d018","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"28b6fb94b2c8a766df1f6a03433bb33e14e5334144821067eafbb923fa53d018","first_computed_at":"2026-05-18T01:55:32.765454Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:55:32.765454Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"kg0DlNb7BOBv0VPye0j4zyE548vW6VJ20IszhDzSyJwNCENfEW0syPsqMyNaBl24XrgEbcngPL90VARxvvPoCw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:55:32.766030Z","signed_message":"canonical_sha256_bytes"},"source_id":"1502.03796","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9b4f6ec0ea9a713561f7fd9980f91b65433b7997e109aa5731e994ef3b7824ad","sha256:bb5e06abc84e03d2b4e2817f023839e0b32e521c26af99d8507081a81da0ff67"],"state_sha256":"5929645d360c4647776265a88b54eda529831faa332f428e49f859229d02782b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"X6p8pKsk+Tu85kJfYqC6dXoa8pW2Nhx/NCj7dJ/90IV1G105CuHw3u6/REqVfE6KWUCFi/CiUMB0uaq+wAk8Cg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T06:27:17.820033Z","bundle_sha256":"80b82dfea2a3b8c0a0549fcaedd8a7d115c03654a75a1e1a78bc2a78bdd197f2"}}