{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:RVGQU6FIWQIWOMW7F7S2I2LJKT","short_pith_number":"pith:RVGQU6FI","canonical_record":{"source":{"id":"1308.3937","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2013-08-19T07:15:16Z","cross_cats_sorted":[],"title_canon_sha256":"ba9c366b48a902d5ee25f7274ebe904f9f7981a4dc452921aa15af50fdd79b9e","abstract_canon_sha256":"4dfa38ea93ef6669d25462cef7e2b0059162a54d9f73a3de4e7df5a096ec0456"},"schema_version":"1.0"},"canonical_sha256":"8d4d0a78a8b4116732df2fe5a4696954d868b096cc649a566adf2722026377cc","source":{"kind":"arxiv","id":"1308.3937","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1308.3937","created_at":"2026-05-18T03:15:35Z"},{"alias_kind":"arxiv_version","alias_value":"1308.3937v1","created_at":"2026-05-18T03:15:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1308.3937","created_at":"2026-05-18T03:15:35Z"},{"alias_kind":"pith_short_12","alias_value":"RVGQU6FIWQIW","created_at":"2026-05-18T12:27:59Z"},{"alias_kind":"pith_short_16","alias_value":"RVGQU6FIWQIWOMW7","created_at":"2026-05-18T12:27:59Z"},{"alias_kind":"pith_short_8","alias_value":"RVGQU6FI","created_at":"2026-05-18T12:27:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:RVGQU6FIWQIWOMW7F7S2I2LJKT","target":"record","payload":{"canonical_record":{"source":{"id":"1308.3937","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2013-08-19T07:15:16Z","cross_cats_sorted":[],"title_canon_sha256":"ba9c366b48a902d5ee25f7274ebe904f9f7981a4dc452921aa15af50fdd79b9e","abstract_canon_sha256":"4dfa38ea93ef6669d25462cef7e2b0059162a54d9f73a3de4e7df5a096ec0456"},"schema_version":"1.0"},"canonical_sha256":"8d4d0a78a8b4116732df2fe5a4696954d868b096cc649a566adf2722026377cc","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:15:35.269619Z","signature_b64":"fPOWzxK/H+Uusqs43Ncg69gRrAIrv013XH8j5vus1L5urvON/ctBmDVaCjYW7hN9cfitU5AlyXvnmXQNm3BKDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8d4d0a78a8b4116732df2fe5a4696954d868b096cc649a566adf2722026377cc","last_reissued_at":"2026-05-18T03:15:35.268938Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:15:35.268938Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1308.3937","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:15:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hvJnyt+yijjRrlYDMrt1WCQGsrBnqJqqbS6pUDCMZSQTG3XQbE6wrZMeth5rLgyTD7FUZJTu/MfxAg8WA2F9CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T15:47:42.752547Z"},"content_sha256":"6a4c3ab1307769bb5607fa8d26953398a931e54a9f322b41f0798b2321106c8c","schema_version":"1.0","event_id":"sha256:6a4c3ab1307769bb5607fa8d26953398a931e54a9f322b41f0798b2321106c8c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:RVGQU6FIWQIWOMW7F7S2I2LJKT","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Compiling Finite Domain Constraints to SAT with BEE: the Director's Cut","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.PL","authors_text":"Amit Metodi, Michael Codish, Yoav Fekete","submitted_at":"2013-08-19T07:15:16Z","abstract_excerpt":"BEE is a compiler which facilitates solving finite domain constraints by encoding them to CNF and applying an underlying SAT solver. In BEE 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. We term this process equi-propagation. A key factor is that considering only a small fragment of a constraint model at one time enables to apply stronger, and even complete reasoning to detect equivalent literals in that fragment. Once detected, equivalences pro"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1308.3937","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:15:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bRm6L5uhnqBlDRUG68MVEUN5/iMJ0AmD3SHWtUsaosgY3cukWVYvsUEK+2XuAzvWu0OUfPUEMcvWLegJ5vtiCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T15:47:42.752961Z"},"content_sha256":"381240cd963a9864c744c95e4b41e58ca5d5c75a7ddac199ca82cac4f8158262","schema_version":"1.0","event_id":"sha256:381240cd963a9864c744c95e4b41e58ca5d5c75a7ddac199ca82cac4f8158262"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RVGQU6FIWQIWOMW7F7S2I2LJKT/bundle.json","state_url":"https://pith.science/pith/RVGQU6FIWQIWOMW7F7S2I2LJKT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RVGQU6FIWQIWOMW7F7S2I2LJKT/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-05-28T15:47:42Z","links":{"resolver":"https://pith.science/pith/RVGQU6FIWQIWOMW7F7S2I2LJKT","bundle":"https://pith.science/pith/RVGQU6FIWQIWOMW7F7S2I2LJKT/bundle.json","state":"https://pith.science/pith/RVGQU6FIWQIWOMW7F7S2I2LJKT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RVGQU6FIWQIWOMW7F7S2I2LJKT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:RVGQU6FIWQIWOMW7F7S2I2LJKT","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":"4dfa38ea93ef6669d25462cef7e2b0059162a54d9f73a3de4e7df5a096ec0456","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2013-08-19T07:15:16Z","title_canon_sha256":"ba9c366b48a902d5ee25f7274ebe904f9f7981a4dc452921aa15af50fdd79b9e"},"schema_version":"1.0","source":{"id":"1308.3937","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1308.3937","created_at":"2026-05-18T03:15:35Z"},{"alias_kind":"arxiv_version","alias_value":"1308.3937v1","created_at":"2026-05-18T03:15:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1308.3937","created_at":"2026-05-18T03:15:35Z"},{"alias_kind":"pith_short_12","alias_value":"RVGQU6FIWQIW","created_at":"2026-05-18T12:27:59Z"},{"alias_kind":"pith_short_16","alias_value":"RVGQU6FIWQIWOMW7","created_at":"2026-05-18T12:27:59Z"},{"alias_kind":"pith_short_8","alias_value":"RVGQU6FI","created_at":"2026-05-18T12:27:59Z"}],"graph_snapshots":[{"event_id":"sha256:381240cd963a9864c744c95e4b41e58ca5d5c75a7ddac199ca82cac4f8158262","target":"graph","created_at":"2026-05-18T03:15:35Z","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":"BEE is a compiler which facilitates solving finite domain constraints by encoding them to CNF and applying an underlying SAT solver. In BEE 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. We term this process equi-propagation. A key factor is that considering only a small fragment of a constraint model at one time enables to apply stronger, and even complete reasoning to detect equivalent literals in that fragment. Once detected, equivalences pro","authors_text":"Amit Metodi, Michael Codish, Yoav Fekete","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2013-08-19T07:15:16Z","title":"Compiling Finite Domain Constraints to SAT with BEE: the Director's Cut"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1308.3937","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:6a4c3ab1307769bb5607fa8d26953398a931e54a9f322b41f0798b2321106c8c","target":"record","created_at":"2026-05-18T03:15:35Z","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":"4dfa38ea93ef6669d25462cef7e2b0059162a54d9f73a3de4e7df5a096ec0456","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2013-08-19T07:15:16Z","title_canon_sha256":"ba9c366b48a902d5ee25f7274ebe904f9f7981a4dc452921aa15af50fdd79b9e"},"schema_version":"1.0","source":{"id":"1308.3937","kind":"arxiv","version":1}},"canonical_sha256":"8d4d0a78a8b4116732df2fe5a4696954d868b096cc649a566adf2722026377cc","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8d4d0a78a8b4116732df2fe5a4696954d868b096cc649a566adf2722026377cc","first_computed_at":"2026-05-18T03:15:35.268938Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:15:35.268938Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"fPOWzxK/H+Uusqs43Ncg69gRrAIrv013XH8j5vus1L5urvON/ctBmDVaCjYW7hN9cfitU5AlyXvnmXQNm3BKDg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:15:35.269619Z","signed_message":"canonical_sha256_bytes"},"source_id":"1308.3937","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6a4c3ab1307769bb5607fa8d26953398a931e54a9f322b41f0798b2321106c8c","sha256:381240cd963a9864c744c95e4b41e58ca5d5c75a7ddac199ca82cac4f8158262"],"state_sha256":"11a29d90b50f4a3d2c0298e44251031e0e5cf0f9583805d2b4de10cecf3c4d6d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PzG+MK+vqiThyggO4n1OUPPeGndqfrjoC+R+gZj8i2os1nHC6b4EQk+JaV8CDIfwei4Yb94kwrHAqhnQEdfEBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T15:47:42.756590Z","bundle_sha256":"0a616b532c273c0c061ef910f8e94c98b9919f6b83ae8d6a50df8c0819626ded"}}