{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:2C2IXUFBXLHKKFZEU6OX7A7YBC","short_pith_number":"pith:2C2IXUFB","canonical_record":{"source":{"id":"1404.6682","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2014-04-26T21:08:07Z","cross_cats_sorted":[],"title_canon_sha256":"4caeee456383c8719a4d28c0e109c7cc19561225b5437290ce90a6ad0a8a4582","abstract_canon_sha256":"a30aa48df870d4eff49015c3133a764c0803a53768592855aef82e5851c32475"},"schema_version":"1.0"},"canonical_sha256":"d0b48bd0a1bacea51724a79d7f83f808b3b95c9e3c61ebc0c98d66c01a2e5b8a","source":{"kind":"arxiv","id":"1404.6682","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1404.6682","created_at":"2026-05-18T02:53:06Z"},{"alias_kind":"arxiv_version","alias_value":"1404.6682v1","created_at":"2026-05-18T02:53:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.6682","created_at":"2026-05-18T02:53:06Z"},{"alias_kind":"pith_short_12","alias_value":"2C2IXUFBXLHK","created_at":"2026-05-18T12:28:09Z"},{"alias_kind":"pith_short_16","alias_value":"2C2IXUFBXLHKKFZE","created_at":"2026-05-18T12:28:09Z"},{"alias_kind":"pith_short_8","alias_value":"2C2IXUFB","created_at":"2026-05-18T12:28:09Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:2C2IXUFBXLHKKFZEU6OX7A7YBC","target":"record","payload":{"canonical_record":{"source":{"id":"1404.6682","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2014-04-26T21:08:07Z","cross_cats_sorted":[],"title_canon_sha256":"4caeee456383c8719a4d28c0e109c7cc19561225b5437290ce90a6ad0a8a4582","abstract_canon_sha256":"a30aa48df870d4eff49015c3133a764c0803a53768592855aef82e5851c32475"},"schema_version":"1.0"},"canonical_sha256":"d0b48bd0a1bacea51724a79d7f83f808b3b95c9e3c61ebc0c98d66c01a2e5b8a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:53:06.335888Z","signature_b64":"drdhwuqysLzXbyJG8ESrl9h9M+mQiXiNtFXUQ5UCCKCVU6nnKsz1EZXdmzGc2dhWORauckZjtwKg5WZcu/PDAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d0b48bd0a1bacea51724a79d7f83f808b3b95c9e3c61ebc0c98d66c01a2e5b8a","last_reissued_at":"2026-05-18T02:53:06.334088Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:53:06.334088Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1404.6682","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-18T02:53:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"J4Et+I7Sb4rS7+O1KdwfIv/yYdH0OA4m17hBmXPMYvQ5iYCmWSAbgOzD4NYlef2t8iP9pnsrRjeofGt+ytQTAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-23T01:33:57.903905Z"},"content_sha256":"4640b9108b6c969010119dde3f1dc0ba7e79119a61517494bfc6157fa68ce99c","schema_version":"1.0","event_id":"sha256:4640b9108b6c969010119dde3f1dc0ba7e79119a61517494bfc6157fa68ce99c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:2C2IXUFBXLHKKFZEU6OX7A7YBC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Sampling Techniques for Boolean Satisfiability","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Kuldeep S. Meel","submitted_at":"2014-04-26T21:08:07Z","abstract_excerpt":"Boolean satisfiability ({\\SAT}) has played a key role in diverse areas spanning testing, formal verification, planning, optimization, inferencing and the like. Apart from the classical problem of checking boolean satisfiability, the problems of generating satisfying uniformly at random, and of counting the total number of satisfying assignments have also attracted significant theoretical and practical interest over the years. Prior work offered heuristic approaches with very weak or no guarantee of performance, and theoretical approaches with proven guarantees, but poor performance in practice"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.6682","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-18T02:53:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ws2c6tVjtR3p/iEWOyPZcIRQ1jjR2W4FvcZUTSIx3FL2mFMjaH4NLQzKymoNS8VOkux0TigBoCNJT9bmIIfcCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-23T01:33:57.904556Z"},"content_sha256":"2f4af281c469314460f5967af6ab84f3da4f87a26ab196f94aeec2299be51a07","schema_version":"1.0","event_id":"sha256:2f4af281c469314460f5967af6ab84f3da4f87a26ab196f94aeec2299be51a07"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2C2IXUFBXLHKKFZEU6OX7A7YBC/bundle.json","state_url":"https://pith.science/pith/2C2IXUFBXLHKKFZEU6OX7A7YBC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2C2IXUFBXLHKKFZEU6OX7A7YBC/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-23T01:33:57Z","links":{"resolver":"https://pith.science/pith/2C2IXUFBXLHKKFZEU6OX7A7YBC","bundle":"https://pith.science/pith/2C2IXUFBXLHKKFZEU6OX7A7YBC/bundle.json","state":"https://pith.science/pith/2C2IXUFBXLHKKFZEU6OX7A7YBC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2C2IXUFBXLHKKFZEU6OX7A7YBC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:2C2IXUFBXLHKKFZEU6OX7A7YBC","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":"a30aa48df870d4eff49015c3133a764c0803a53768592855aef82e5851c32475","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2014-04-26T21:08:07Z","title_canon_sha256":"4caeee456383c8719a4d28c0e109c7cc19561225b5437290ce90a6ad0a8a4582"},"schema_version":"1.0","source":{"id":"1404.6682","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1404.6682","created_at":"2026-05-18T02:53:06Z"},{"alias_kind":"arxiv_version","alias_value":"1404.6682v1","created_at":"2026-05-18T02:53:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.6682","created_at":"2026-05-18T02:53:06Z"},{"alias_kind":"pith_short_12","alias_value":"2C2IXUFBXLHK","created_at":"2026-05-18T12:28:09Z"},{"alias_kind":"pith_short_16","alias_value":"2C2IXUFBXLHKKFZE","created_at":"2026-05-18T12:28:09Z"},{"alias_kind":"pith_short_8","alias_value":"2C2IXUFB","created_at":"2026-05-18T12:28:09Z"}],"graph_snapshots":[{"event_id":"sha256:2f4af281c469314460f5967af6ab84f3da4f87a26ab196f94aeec2299be51a07","target":"graph","created_at":"2026-05-18T02:53:06Z","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":"Boolean satisfiability ({\\SAT}) has played a key role in diverse areas spanning testing, formal verification, planning, optimization, inferencing and the like. Apart from the classical problem of checking boolean satisfiability, the problems of generating satisfying uniformly at random, and of counting the total number of satisfying assignments have also attracted significant theoretical and practical interest over the years. Prior work offered heuristic approaches with very weak or no guarantee of performance, and theoretical approaches with proven guarantees, but poor performance in practice","authors_text":"Kuldeep S. Meel","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2014-04-26T21:08:07Z","title":"Sampling Techniques for Boolean Satisfiability"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.6682","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:4640b9108b6c969010119dde3f1dc0ba7e79119a61517494bfc6157fa68ce99c","target":"record","created_at":"2026-05-18T02:53:06Z","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":"a30aa48df870d4eff49015c3133a764c0803a53768592855aef82e5851c32475","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2014-04-26T21:08:07Z","title_canon_sha256":"4caeee456383c8719a4d28c0e109c7cc19561225b5437290ce90a6ad0a8a4582"},"schema_version":"1.0","source":{"id":"1404.6682","kind":"arxiv","version":1}},"canonical_sha256":"d0b48bd0a1bacea51724a79d7f83f808b3b95c9e3c61ebc0c98d66c01a2e5b8a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d0b48bd0a1bacea51724a79d7f83f808b3b95c9e3c61ebc0c98d66c01a2e5b8a","first_computed_at":"2026-05-18T02:53:06.334088Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:53:06.334088Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"drdhwuqysLzXbyJG8ESrl9h9M+mQiXiNtFXUQ5UCCKCVU6nnKsz1EZXdmzGc2dhWORauckZjtwKg5WZcu/PDAA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:53:06.335888Z","signed_message":"canonical_sha256_bytes"},"source_id":"1404.6682","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4640b9108b6c969010119dde3f1dc0ba7e79119a61517494bfc6157fa68ce99c","sha256:2f4af281c469314460f5967af6ab84f3da4f87a26ab196f94aeec2299be51a07"],"state_sha256":"2455cec88a468d8969d425db40bfe93a94cae57d66e6684dbc0a4e7afd29f316"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ha9X9ySjJbtWYZXL6TJpS/pNoIwBCNwPx2/WoypArujqfck0RQaIVAaw7mx1SRum35Fw4NbWsYld9J3lj1bNAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-23T01:33:57.908610Z","bundle_sha256":"e569aa5c3611bb9e3eb1426a52457903e3d5499e0ed5f24e1649356136ad6c66"}}