{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:4U3RESIVVFWSHYZGWQ27TEHS55","short_pith_number":"pith:4U3RESIV","schema_version":"1.0","canonical_sha256":"e537124915a96d23e326b435f990f2ef7a581a6b6c76338d93c5d21c62902416","source":{"kind":"arxiv","id":"1401.3846","version":1},"attestation_state":"computed","paper":{"title":"Fast Set Bounds Propagation Using a BDD-SAT Hybrid","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Graeme Gange, Peter James Stuckey, Vitaly Lagoon","submitted_at":"2014-01-16T04:56:56Z","abstract_excerpt":"Binary Decision Diagram (BDD) based set bounds propagation is a powerful approach to solving set-constraint satisfaction problems. However, prior BDD based techniques in- cur the significant overhead of constructing and manipulating graphs during search. We present a set-constraint solver which combines BDD-based set-bounds propagators with the learning abilities of a modern SAT solver. Together with a number of improvements beyond the basic algorithm, this solver is highly competitive with existing propagation based set constraint solvers."},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1401.3846","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2014-01-16T04:56:56Z","cross_cats_sorted":[],"title_canon_sha256":"51c8a59f1f03d6de867b62ad9ae8acd1e5b9da21ea9960c48f3c3093d1ec4f47","abstract_canon_sha256":"42f48d2baab6eeff8bd3327779d4d8766837c8720d1a875ba7e45b718239f1a5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:02:06.658754Z","signature_b64":"KxKvXAYMUVsUuZ2TIcCunPe3/ohXGGf5dK6ZjTpWzohS4PPjCwPpV0QU0PswDj+6legCNvs6uWPhoY3hNC7fAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e537124915a96d23e326b435f990f2ef7a581a6b6c76338d93c5d21c62902416","last_reissued_at":"2026-05-18T03:02:06.657936Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:02:06.657936Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fast Set Bounds Propagation Using a BDD-SAT Hybrid","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Graeme Gange, Peter James Stuckey, Vitaly Lagoon","submitted_at":"2014-01-16T04:56:56Z","abstract_excerpt":"Binary Decision Diagram (BDD) based set bounds propagation is a powerful approach to solving set-constraint satisfaction problems. However, prior BDD based techniques in- cur the significant overhead of constructing and manipulating graphs during search. We present a set-constraint solver which combines BDD-based set-bounds propagators with the learning abilities of a modern SAT solver. Together with a number of improvements beyond the basic algorithm, this solver is highly competitive with existing propagation based set constraint solvers."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.3846","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1401.3846","created_at":"2026-05-18T03:02:06.658069+00:00"},{"alias_kind":"arxiv_version","alias_value":"1401.3846v1","created_at":"2026-05-18T03:02:06.658069+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.3846","created_at":"2026-05-18T03:02:06.658069+00:00"},{"alias_kind":"pith_short_12","alias_value":"4U3RESIVVFWS","created_at":"2026-05-18T12:28:14.216126+00:00"},{"alias_kind":"pith_short_16","alias_value":"4U3RESIVVFWSHYZG","created_at":"2026-05-18T12:28:14.216126+00:00"},{"alias_kind":"pith_short_8","alias_value":"4U3RESIV","created_at":"2026-05-18T12:28:14.216126+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/4U3RESIVVFWSHYZGWQ27TEHS55","json":"https://pith.science/pith/4U3RESIVVFWSHYZGWQ27TEHS55.json","graph_json":"https://pith.science/api/pith-number/4U3RESIVVFWSHYZGWQ27TEHS55/graph.json","events_json":"https://pith.science/api/pith-number/4U3RESIVVFWSHYZGWQ27TEHS55/events.json","paper":"https://pith.science/paper/4U3RESIV"},"agent_actions":{"view_html":"https://pith.science/pith/4U3RESIVVFWSHYZGWQ27TEHS55","download_json":"https://pith.science/pith/4U3RESIVVFWSHYZGWQ27TEHS55.json","view_paper":"https://pith.science/paper/4U3RESIV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1401.3846&json=true","fetch_graph":"https://pith.science/api/pith-number/4U3RESIVVFWSHYZGWQ27TEHS55/graph.json","fetch_events":"https://pith.science/api/pith-number/4U3RESIVVFWSHYZGWQ27TEHS55/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4U3RESIVVFWSHYZGWQ27TEHS55/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4U3RESIVVFWSHYZGWQ27TEHS55/action/storage_attestation","attest_author":"https://pith.science/pith/4U3RESIVVFWSHYZGWQ27TEHS55/action/author_attestation","sign_citation":"https://pith.science/pith/4U3RESIVVFWSHYZGWQ27TEHS55/action/citation_signature","submit_replication":"https://pith.science/pith/4U3RESIVVFWSHYZGWQ27TEHS55/action/replication_record"}},"created_at":"2026-05-18T03:02:06.658069+00:00","updated_at":"2026-05-18T03:02:06.658069+00:00"}