{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:FE243ZE4B6K4KNG3EBF7DQAKDK","short_pith_number":"pith:FE243ZE4","canonical_record":{"source":{"id":"1511.07663","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2015-11-24T11:52:28Z","cross_cats_sorted":["cs.LO"],"title_canon_sha256":"f95f2443a458bfe707c6dd62dcc3fdf903f35cef775096195a5efb46359c5f73","abstract_canon_sha256":"3f4d59ae4bbd19b485fc5f6946c42b03b2e70d0fa49a5bd47d4207074a1f6ff2"},"schema_version":"1.0"},"canonical_sha256":"2935cde49c0f95c534db204bf1c00a1a80c233078beba970f35941104579f330","source":{"kind":"arxiv","id":"1511.07663","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1511.07663","created_at":"2026-05-18T01:21:08Z"},{"alias_kind":"arxiv_version","alias_value":"1511.07663v3","created_at":"2026-05-18T01:21:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.07663","created_at":"2026-05-18T01:21:08Z"},{"alias_kind":"pith_short_12","alias_value":"FE243ZE4B6K4","created_at":"2026-05-18T12:29:19Z"},{"alias_kind":"pith_short_16","alias_value":"FE243ZE4B6K4KNG3","created_at":"2026-05-18T12:29:19Z"},{"alias_kind":"pith_short_8","alias_value":"FE243ZE4","created_at":"2026-05-18T12:29:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:FE243ZE4B6K4KNG3EBF7DQAKDK","target":"record","payload":{"canonical_record":{"source":{"id":"1511.07663","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2015-11-24T11:52:28Z","cross_cats_sorted":["cs.LO"],"title_canon_sha256":"f95f2443a458bfe707c6dd62dcc3fdf903f35cef775096195a5efb46359c5f73","abstract_canon_sha256":"3f4d59ae4bbd19b485fc5f6946c42b03b2e70d0fa49a5bd47d4207074a1f6ff2"},"schema_version":"1.0"},"canonical_sha256":"2935cde49c0f95c534db204bf1c00a1a80c233078beba970f35941104579f330","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:21:08.306545Z","signature_b64":"ZFW0In9dJyk9kS2IKAiHbe8X9sp3YX9yS+1wdm/eeQAM3kWcW4gAOLJLWADnmIZ3O5LPITk30JR7/31fj6l6BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2935cde49c0f95c534db204bf1c00a1a80c233078beba970f35941104579f330","last_reissued_at":"2026-05-18T01:21:08.305788Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:21:08.305788Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1511.07663","source_version":3,"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-18T01:21:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iI4MwK6/uzw8lCEaWuy2P9tvzoukd6kMHoirmHThLjIuJCdGe4EC3q1sEerqTPBiPpvmNrEto1E/wEr+b6FfAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T18:37:06.351776Z"},"content_sha256":"979a381bbda256df55c3fba37ce77850f8402d675ccd00222bdd7f709812e351","schema_version":"1.0","event_id":"sha256:979a381bbda256df55c3fba37ce77850f8402d675ccd00222bdd7f709812e351"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:FE243ZE4B6K4KNG3EBF7DQAKDK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Approximate Probabilistic Inference via Word-Level Counting","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LO"],"primary_cat":"cs.AI","authors_text":"Kuldeep S. Meel, Moshe Y. Vardi, Rakesh Mistry, Supratik Chakraborty","submitted_at":"2015-11-24T11:52:28Z","abstract_excerpt":"Hashing-based model counting has emerged as a promising approach for large-scale probabilistic inference on graphical models. A key component of these techniques is the use of xor-based 2-universal hash functions that operate over Boolean domains. Many counting problems arising in probabilistic inference are, however, naturally encoded over finite discrete domains. Techniques based on bit-level (or Boolean) hash functions require these problems to be propositionalized, making it impossible to leverage the remarkable progress made in SMT (Satisfiability Modulo Theory) solvers that can reason di"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.07663","kind":"arxiv","version":3},"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-18T01:21:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"o9GP9R8IE3meX1YYGqHeVIgg6njpuTQQgPTlL2CcV+oKFSFad9cbmVNJStYM79fTipc94q0NZRPq3R0XAb14AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T18:37:06.352516Z"},"content_sha256":"5269cf0d64a551687f0ba0b6b9b07bc035f0129e93dc82d5e66ec48acee39e98","schema_version":"1.0","event_id":"sha256:5269cf0d64a551687f0ba0b6b9b07bc035f0129e93dc82d5e66ec48acee39e98"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FE243ZE4B6K4KNG3EBF7DQAKDK/bundle.json","state_url":"https://pith.science/pith/FE243ZE4B6K4KNG3EBF7DQAKDK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FE243ZE4B6K4KNG3EBF7DQAKDK/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-29T18:37:06Z","links":{"resolver":"https://pith.science/pith/FE243ZE4B6K4KNG3EBF7DQAKDK","bundle":"https://pith.science/pith/FE243ZE4B6K4KNG3EBF7DQAKDK/bundle.json","state":"https://pith.science/pith/FE243ZE4B6K4KNG3EBF7DQAKDK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FE243ZE4B6K4KNG3EBF7DQAKDK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:FE243ZE4B6K4KNG3EBF7DQAKDK","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":"3f4d59ae4bbd19b485fc5f6946c42b03b2e70d0fa49a5bd47d4207074a1f6ff2","cross_cats_sorted":["cs.LO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2015-11-24T11:52:28Z","title_canon_sha256":"f95f2443a458bfe707c6dd62dcc3fdf903f35cef775096195a5efb46359c5f73"},"schema_version":"1.0","source":{"id":"1511.07663","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1511.07663","created_at":"2026-05-18T01:21:08Z"},{"alias_kind":"arxiv_version","alias_value":"1511.07663v3","created_at":"2026-05-18T01:21:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.07663","created_at":"2026-05-18T01:21:08Z"},{"alias_kind":"pith_short_12","alias_value":"FE243ZE4B6K4","created_at":"2026-05-18T12:29:19Z"},{"alias_kind":"pith_short_16","alias_value":"FE243ZE4B6K4KNG3","created_at":"2026-05-18T12:29:19Z"},{"alias_kind":"pith_short_8","alias_value":"FE243ZE4","created_at":"2026-05-18T12:29:19Z"}],"graph_snapshots":[{"event_id":"sha256:5269cf0d64a551687f0ba0b6b9b07bc035f0129e93dc82d5e66ec48acee39e98","target":"graph","created_at":"2026-05-18T01:21:08Z","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":"Hashing-based model counting has emerged as a promising approach for large-scale probabilistic inference on graphical models. A key component of these techniques is the use of xor-based 2-universal hash functions that operate over Boolean domains. Many counting problems arising in probabilistic inference are, however, naturally encoded over finite discrete domains. Techniques based on bit-level (or Boolean) hash functions require these problems to be propositionalized, making it impossible to leverage the remarkable progress made in SMT (Satisfiability Modulo Theory) solvers that can reason di","authors_text":"Kuldeep S. Meel, Moshe Y. Vardi, Rakesh Mistry, Supratik Chakraborty","cross_cats":["cs.LO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2015-11-24T11:52:28Z","title":"Approximate Probabilistic Inference via Word-Level Counting"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.07663","kind":"arxiv","version":3},"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:979a381bbda256df55c3fba37ce77850f8402d675ccd00222bdd7f709812e351","target":"record","created_at":"2026-05-18T01:21:08Z","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":"3f4d59ae4bbd19b485fc5f6946c42b03b2e70d0fa49a5bd47d4207074a1f6ff2","cross_cats_sorted":["cs.LO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2015-11-24T11:52:28Z","title_canon_sha256":"f95f2443a458bfe707c6dd62dcc3fdf903f35cef775096195a5efb46359c5f73"},"schema_version":"1.0","source":{"id":"1511.07663","kind":"arxiv","version":3}},"canonical_sha256":"2935cde49c0f95c534db204bf1c00a1a80c233078beba970f35941104579f330","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2935cde49c0f95c534db204bf1c00a1a80c233078beba970f35941104579f330","first_computed_at":"2026-05-18T01:21:08.305788Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:21:08.305788Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ZFW0In9dJyk9kS2IKAiHbe8X9sp3YX9yS+1wdm/eeQAM3kWcW4gAOLJLWADnmIZ3O5LPITk30JR7/31fj6l6BQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:21:08.306545Z","signed_message":"canonical_sha256_bytes"},"source_id":"1511.07663","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:979a381bbda256df55c3fba37ce77850f8402d675ccd00222bdd7f709812e351","sha256:5269cf0d64a551687f0ba0b6b9b07bc035f0129e93dc82d5e66ec48acee39e98"],"state_sha256":"3f928190153357d10dc13ce3c2db991512db06531011982aa6a6cb9d54f8f68c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9gycVUCSNO+ouDkPHPKRSu9h0nuEA4HVq9j910DcXPBgSUJNkI0hQtkFTuY5L+CqA3aDze/7TSD96ebmmdJ8DQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-29T18:37:06.356566Z","bundle_sha256":"4d43f6ae6265a43c008b5f881d242e6ddb876152fcb10d78a2432268cdc731c1"}}