{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:GMEP3GU75MTEKSFA5WPEN2EDN4","short_pith_number":"pith:GMEP3GU7","canonical_record":{"source":{"id":"2306.10337","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LO","submitted_at":"2023-06-17T12:44:26Z","cross_cats_sorted":[],"title_canon_sha256":"b47bc615906d01ec968ebd7883ff34a0f44c9834a87c7efa31898ba3d1964c00","abstract_canon_sha256":"0738dfa0bdcd39ea37b038a774188bda0914f7569786ff3311551d163731b62b"},"schema_version":"1.0"},"canonical_sha256":"3308fd9a9feb264548a0ed9e46e8836f2048bb9e5461dc20dd99048050e7a4cc","source":{"kind":"arxiv","id":"2306.10337","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2306.10337","created_at":"2026-07-05T06:21:36Z"},{"alias_kind":"arxiv_version","alias_value":"2306.10337v1","created_at":"2026-07-05T06:21:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2306.10337","created_at":"2026-07-05T06:21:36Z"},{"alias_kind":"pith_short_12","alias_value":"GMEP3GU75MTE","created_at":"2026-07-05T06:21:36Z"},{"alias_kind":"pith_short_16","alias_value":"GMEP3GU75MTEKSFA","created_at":"2026-07-05T06:21:36Z"},{"alias_kind":"pith_short_8","alias_value":"GMEP3GU7","created_at":"2026-07-05T06:21:36Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:GMEP3GU75MTEKSFA5WPEN2EDN4","target":"record","payload":{"canonical_record":{"source":{"id":"2306.10337","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LO","submitted_at":"2023-06-17T12:44:26Z","cross_cats_sorted":[],"title_canon_sha256":"b47bc615906d01ec968ebd7883ff34a0f44c9834a87c7efa31898ba3d1964c00","abstract_canon_sha256":"0738dfa0bdcd39ea37b038a774188bda0914f7569786ff3311551d163731b62b"},"schema_version":"1.0"},"canonical_sha256":"3308fd9a9feb264548a0ed9e46e8836f2048bb9e5461dc20dd99048050e7a4cc","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:21:36.658868Z","signature_b64":"++3uEgoNVUr5cojrP/+980mgTHyMzcRCetKsC37eYemlIc+Qk1jCnNodh2owX1LO91UrjWet9NWQiCySoN9GAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3308fd9a9feb264548a0ed9e46e8836f2048bb9e5461dc20dd99048050e7a4cc","last_reissued_at":"2026-07-05T06:21:36.658312Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:21:36.658312Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2306.10337","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-07-05T06:21:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sAwRD2QFo9AFSwvJl5HT3dzZ41tXEbHo66vwphGC08YwiKMJQCEeU7gc9gB2/+5upD/zCseAAgxCyco4xg+GCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-01T09:36:58.024593Z"},"content_sha256":"98a21fc2f8a9642a0c4e9e7c0f52ff2921c127c720cbb7ed5d6172427e16dbc9","schema_version":"1.0","event_id":"sha256:98a21fc2f8a9642a0c4e9e7c0f52ff2921c127c720cbb7ed5d6172427e16dbc9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:GMEP3GU75MTEKSFA5WPEN2EDN4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Notes on \"Bounds on BDD-Based Bucket Elimination''","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Randal E. Bryant","submitted_at":"2023-06-17T12:44:26Z","abstract_excerpt":"This paper concerns Boolean satisfiability (SAT) solvers based on Ordered Binary Decision Diagrams (BDDs), especially those that can generate proofs of unsatisfiability. Mengel (arXiv:2306.00886) has presented a theoretical analysis that a BDD-based SAT solver can generate a proof of unsatisfiability for the pigeonhole problem (PHP$_n$) in polynomial time, even when the problem is encoded in the standard ``direct'' form. His approach is based on bucket elimination, using different orderings for the variables in the BDDs than in the buckets. We show experimentally that these proofs scale as $O("},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2306.10337","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2306.10337/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T06:21:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xwAnEla2Qr7bPlDP/RPpMh9INdRu2hjI1ZvdNXvxTX8OzMxA1ss2YrN9iiklKHDaex1a2lZDzQOXUVc2p7IQBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-01T09:36:58.024987Z"},"content_sha256":"7815a8bf7f398d7f7d7cb17c5cf0f0fd3ffc540db125df078b994b22a5dc7013","schema_version":"1.0","event_id":"sha256:7815a8bf7f398d7f7d7cb17c5cf0f0fd3ffc540db125df078b994b22a5dc7013"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GMEP3GU75MTEKSFA5WPEN2EDN4/bundle.json","state_url":"https://pith.science/pith/GMEP3GU75MTEKSFA5WPEN2EDN4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GMEP3GU75MTEKSFA5WPEN2EDN4/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-08-01T09:36:58Z","links":{"resolver":"https://pith.science/pith/GMEP3GU75MTEKSFA5WPEN2EDN4","bundle":"https://pith.science/pith/GMEP3GU75MTEKSFA5WPEN2EDN4/bundle.json","state":"https://pith.science/pith/GMEP3GU75MTEKSFA5WPEN2EDN4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GMEP3GU75MTEKSFA5WPEN2EDN4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:GMEP3GU75MTEKSFA5WPEN2EDN4","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":"0738dfa0bdcd39ea37b038a774188bda0914f7569786ff3311551d163731b62b","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LO","submitted_at":"2023-06-17T12:44:26Z","title_canon_sha256":"b47bc615906d01ec968ebd7883ff34a0f44c9834a87c7efa31898ba3d1964c00"},"schema_version":"1.0","source":{"id":"2306.10337","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2306.10337","created_at":"2026-07-05T06:21:36Z"},{"alias_kind":"arxiv_version","alias_value":"2306.10337v1","created_at":"2026-07-05T06:21:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2306.10337","created_at":"2026-07-05T06:21:36Z"},{"alias_kind":"pith_short_12","alias_value":"GMEP3GU75MTE","created_at":"2026-07-05T06:21:36Z"},{"alias_kind":"pith_short_16","alias_value":"GMEP3GU75MTEKSFA","created_at":"2026-07-05T06:21:36Z"},{"alias_kind":"pith_short_8","alias_value":"GMEP3GU7","created_at":"2026-07-05T06:21:36Z"}],"graph_snapshots":[{"event_id":"sha256:7815a8bf7f398d7f7d7cb17c5cf0f0fd3ffc540db125df078b994b22a5dc7013","target":"graph","created_at":"2026-07-05T06:21:36Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2306.10337/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"This paper concerns Boolean satisfiability (SAT) solvers based on Ordered Binary Decision Diagrams (BDDs), especially those that can generate proofs of unsatisfiability. Mengel (arXiv:2306.00886) has presented a theoretical analysis that a BDD-based SAT solver can generate a proof of unsatisfiability for the pigeonhole problem (PHP$_n$) in polynomial time, even when the problem is encoded in the standard ``direct'' form. His approach is based on bucket elimination, using different orderings for the variables in the BDDs than in the buckets. We show experimentally that these proofs scale as $O(","authors_text":"Randal E. Bryant","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LO","submitted_at":"2023-06-17T12:44:26Z","title":"Notes on \"Bounds on BDD-Based Bucket Elimination''"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2306.10337","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:98a21fc2f8a9642a0c4e9e7c0f52ff2921c127c720cbb7ed5d6172427e16dbc9","target":"record","created_at":"2026-07-05T06:21:36Z","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":"0738dfa0bdcd39ea37b038a774188bda0914f7569786ff3311551d163731b62b","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LO","submitted_at":"2023-06-17T12:44:26Z","title_canon_sha256":"b47bc615906d01ec968ebd7883ff34a0f44c9834a87c7efa31898ba3d1964c00"},"schema_version":"1.0","source":{"id":"2306.10337","kind":"arxiv","version":1}},"canonical_sha256":"3308fd9a9feb264548a0ed9e46e8836f2048bb9e5461dc20dd99048050e7a4cc","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3308fd9a9feb264548a0ed9e46e8836f2048bb9e5461dc20dd99048050e7a4cc","first_computed_at":"2026-07-05T06:21:36.658312Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T06:21:36.658312Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"++3uEgoNVUr5cojrP/+980mgTHyMzcRCetKsC37eYemlIc+Qk1jCnNodh2owX1LO91UrjWet9NWQiCySoN9GAA==","signature_status":"signed_v1","signed_at":"2026-07-05T06:21:36.658868Z","signed_message":"canonical_sha256_bytes"},"source_id":"2306.10337","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:98a21fc2f8a9642a0c4e9e7c0f52ff2921c127c720cbb7ed5d6172427e16dbc9","sha256:7815a8bf7f398d7f7d7cb17c5cf0f0fd3ffc540db125df078b994b22a5dc7013"],"state_sha256":"2dd1918951f0af264456c0553e3486adf4a9dfbcb2d637b06d183ff9a2885b90"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sUUpupdP39LyiKUwVne++/ENb+b3IhJVfkxrWSEGJfRvGIha+p4hA/sFkPFiY8hxIiyJnjf3QxRu5AyFM7qsBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-01T09:36:58.027545Z","bundle_sha256":"0f5e4a8c500d8c2df9f3bef283a22a63bef53e653a8ba05d6d4a76d54a1dda05"}}