{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:3XA4UOFZHLBKI73T3T7VY5JYXX","short_pith_number":"pith:3XA4UOFZ","canonical_record":{"source":{"id":"1402.0568","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2014-02-04T01:36:36Z","cross_cats_sorted":[],"title_canon_sha256":"7dde1e6b087df7f96c8d3139119266768fac86074151c0a375db5b3be02988d7","abstract_canon_sha256":"585177285bca38eeeadec7391669f084c6a4d71e9477f3e8601aec3ea7bcb311"},"schema_version":"1.0"},"canonical_sha256":"ddc1ca38b93ac2a47f73dcff5c7538bdd065801f7f5cdef3ac7ed2496735c247","source":{"kind":"arxiv","id":"1402.0568","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1402.0568","created_at":"2026-05-18T03:00:13Z"},{"alias_kind":"arxiv_version","alias_value":"1402.0568v1","created_at":"2026-05-18T03:00:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.0568","created_at":"2026-05-18T03:00:13Z"},{"alias_kind":"pith_short_12","alias_value":"3XA4UOFZHLBK","created_at":"2026-05-18T12:28:11Z"},{"alias_kind":"pith_short_16","alias_value":"3XA4UOFZHLBKI73T","created_at":"2026-05-18T12:28:11Z"},{"alias_kind":"pith_short_8","alias_value":"3XA4UOFZ","created_at":"2026-05-18T12:28:11Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:3XA4UOFZHLBKI73T3T7VY5JYXX","target":"record","payload":{"canonical_record":{"source":{"id":"1402.0568","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2014-02-04T01:36:36Z","cross_cats_sorted":[],"title_canon_sha256":"7dde1e6b087df7f96c8d3139119266768fac86074151c0a375db5b3be02988d7","abstract_canon_sha256":"585177285bca38eeeadec7391669f084c6a4d71e9477f3e8601aec3ea7bcb311"},"schema_version":"1.0"},"canonical_sha256":"ddc1ca38b93ac2a47f73dcff5c7538bdd065801f7f5cdef3ac7ed2496735c247","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:00:13.864791Z","signature_b64":"IcYBQLD9c1OJWwxlnlwXuuDRZOUcxGtOE4WBUe5dUnf29sbeDnVRBOxJ5gOaW6V6zN93YZBYDrFmXYE4iupeCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ddc1ca38b93ac2a47f73dcff5c7538bdd065801f7f5cdef3ac7ed2496735c247","last_reissued_at":"2026-05-18T03:00:13.864014Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:00:13.864014Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1402.0568","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-18T03:00:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QRboUoG7lxFTK77cfiraYkfWSmQ4ZmE8eI88sn/qwdqzp4Onx6xBj5NU8fcnGg62pu1wIRZDxUApsowfIojrDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T23:44:06.489134Z"},"content_sha256":"13ad79547f003dd4d9fff73e44fe118f36cd94256f47e52b48910c09531d9611","schema_version":"1.0","event_id":"sha256:13ad79547f003dd4d9fff73e44fe118f36cd94256f47e52b48910c09531d9611"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:3XA4UOFZHLBKI73T3T7VY5JYXX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Boolean Equi-propagation for Concise and Efficient SAT Encodings of Combinatorial Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Amit Metodi, Michael Codish, Peter James Stuckey","submitted_at":"2014-02-04T01:36:36Z","abstract_excerpt":"We present an approach to propagation-based SAT encoding of combinatorial problems, Boolean equi-propagation, where constraints are modeled as Boolean functions which propagate information about equalities between Boolean literals.  This information is then applied to simplify the CNF encoding of the constraints.  A key factor is that considering only a small fragment of a constraint model at one time enables us to apply stronger, and even complete, reasoning to detect equivalent literals in that fragment. Once detected, equivalences apply to simplify the entire constraint model and facilitate"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1402.0568","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-18T03:00:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fu6iwQZNLeVvyeubHcwn9mbu1DEakix/nUt2LMaZVrwnQIUC1wbgCAaVTjyPmSueFsKFBgZZfUNHQy92QQkyDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T23:44:06.489502Z"},"content_sha256":"4998e0e57cdcf0ad54692a02730f4e76975a78f6a1d2fe88dd35c07c2f1f5d4a","schema_version":"1.0","event_id":"sha256:4998e0e57cdcf0ad54692a02730f4e76975a78f6a1d2fe88dd35c07c2f1f5d4a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3XA4UOFZHLBKI73T3T7VY5JYXX/bundle.json","state_url":"https://pith.science/pith/3XA4UOFZHLBKI73T3T7VY5JYXX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3XA4UOFZHLBKI73T3T7VY5JYXX/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-20T23:44:06Z","links":{"resolver":"https://pith.science/pith/3XA4UOFZHLBKI73T3T7VY5JYXX","bundle":"https://pith.science/pith/3XA4UOFZHLBKI73T3T7VY5JYXX/bundle.json","state":"https://pith.science/pith/3XA4UOFZHLBKI73T3T7VY5JYXX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3XA4UOFZHLBKI73T3T7VY5JYXX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:3XA4UOFZHLBKI73T3T7VY5JYXX","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":"585177285bca38eeeadec7391669f084c6a4d71e9477f3e8601aec3ea7bcb311","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2014-02-04T01:36:36Z","title_canon_sha256":"7dde1e6b087df7f96c8d3139119266768fac86074151c0a375db5b3be02988d7"},"schema_version":"1.0","source":{"id":"1402.0568","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1402.0568","created_at":"2026-05-18T03:00:13Z"},{"alias_kind":"arxiv_version","alias_value":"1402.0568v1","created_at":"2026-05-18T03:00:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.0568","created_at":"2026-05-18T03:00:13Z"},{"alias_kind":"pith_short_12","alias_value":"3XA4UOFZHLBK","created_at":"2026-05-18T12:28:11Z"},{"alias_kind":"pith_short_16","alias_value":"3XA4UOFZHLBKI73T","created_at":"2026-05-18T12:28:11Z"},{"alias_kind":"pith_short_8","alias_value":"3XA4UOFZ","created_at":"2026-05-18T12:28:11Z"}],"graph_snapshots":[{"event_id":"sha256:4998e0e57cdcf0ad54692a02730f4e76975a78f6a1d2fe88dd35c07c2f1f5d4a","target":"graph","created_at":"2026-05-18T03:00:13Z","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":"We present an approach to propagation-based SAT encoding of combinatorial problems, Boolean equi-propagation, where constraints are modeled as Boolean functions which propagate information about equalities between Boolean literals.  This information is then applied to simplify the CNF encoding of the constraints.  A key factor is that considering only a small fragment of a constraint model at one time enables us to apply stronger, and even complete, reasoning to detect equivalent literals in that fragment. Once detected, equivalences apply to simplify the entire constraint model and facilitate","authors_text":"Amit Metodi, Michael Codish, Peter James Stuckey","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2014-02-04T01:36:36Z","title":"Boolean Equi-propagation for Concise and Efficient SAT Encodings of Combinatorial Problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1402.0568","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:13ad79547f003dd4d9fff73e44fe118f36cd94256f47e52b48910c09531d9611","target":"record","created_at":"2026-05-18T03:00:13Z","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":"585177285bca38eeeadec7391669f084c6a4d71e9477f3e8601aec3ea7bcb311","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2014-02-04T01:36:36Z","title_canon_sha256":"7dde1e6b087df7f96c8d3139119266768fac86074151c0a375db5b3be02988d7"},"schema_version":"1.0","source":{"id":"1402.0568","kind":"arxiv","version":1}},"canonical_sha256":"ddc1ca38b93ac2a47f73dcff5c7538bdd065801f7f5cdef3ac7ed2496735c247","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ddc1ca38b93ac2a47f73dcff5c7538bdd065801f7f5cdef3ac7ed2496735c247","first_computed_at":"2026-05-18T03:00:13.864014Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:00:13.864014Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"IcYBQLD9c1OJWwxlnlwXuuDRZOUcxGtOE4WBUe5dUnf29sbeDnVRBOxJ5gOaW6V6zN93YZBYDrFmXYE4iupeCg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:00:13.864791Z","signed_message":"canonical_sha256_bytes"},"source_id":"1402.0568","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:13ad79547f003dd4d9fff73e44fe118f36cd94256f47e52b48910c09531d9611","sha256:4998e0e57cdcf0ad54692a02730f4e76975a78f6a1d2fe88dd35c07c2f1f5d4a"],"state_sha256":"896ef226e407ba784c371c1444e074030253a09ae70ee272afcebccd8ef7e472"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GtqGBgRBVam7AlxpTgW0PThnDhZ9/ae7RlhuTDeJ2ymTjs35IugEiK0yWZUUMK8di8gU9tMBB52kToTEmK2RBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-20T23:44:06.491504Z","bundle_sha256":"fdbf3bb57307a403d96a4b56e6348127658ce760b0320a95e49a6c00f39b9635"}}