{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:UBKSQLJL4QDFW7SJISFDYDUJXD","short_pith_number":"pith:UBKSQLJL","canonical_record":{"source":{"id":"2409.10170","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LO","submitted_at":"2024-09-16T11:02:47Z","cross_cats_sorted":[],"title_canon_sha256":"20977c19769933473686d3dcbd38d4c9b217c3b57b387271ec85b7df755f0a6b","abstract_canon_sha256":"87e970b5f25afa5abb93907aee7965a864bdf6c1c0eb3234ef0eefe0d98acf65"},"schema_version":"1.0"},"canonical_sha256":"a055282d2be4065b7e49448a3c0e89b8f398ec2a5e1614b538aa615a301d53b8","source":{"kind":"arxiv","id":"2409.10170","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2409.10170","created_at":"2026-07-05T09:07:36Z"},{"alias_kind":"arxiv_version","alias_value":"2409.10170v1","created_at":"2026-07-05T09:07:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2409.10170","created_at":"2026-07-05T09:07:36Z"},{"alias_kind":"pith_short_12","alias_value":"UBKSQLJL4QDF","created_at":"2026-07-05T09:07:36Z"},{"alias_kind":"pith_short_16","alias_value":"UBKSQLJL4QDFW7SJ","created_at":"2026-07-05T09:07:36Z"},{"alias_kind":"pith_short_8","alias_value":"UBKSQLJL","created_at":"2026-07-05T09:07:36Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:UBKSQLJL4QDFW7SJISFDYDUJXD","target":"record","payload":{"canonical_record":{"source":{"id":"2409.10170","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LO","submitted_at":"2024-09-16T11:02:47Z","cross_cats_sorted":[],"title_canon_sha256":"20977c19769933473686d3dcbd38d4c9b217c3b57b387271ec85b7df755f0a6b","abstract_canon_sha256":"87e970b5f25afa5abb93907aee7965a864bdf6c1c0eb3234ef0eefe0d98acf65"},"schema_version":"1.0"},"canonical_sha256":"a055282d2be4065b7e49448a3c0e89b8f398ec2a5e1614b538aa615a301d53b8","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:07:36.089559Z","signature_b64":"sue0B/lYzM/1AH8irDgbNjlYW1muL+AIujncvIqCsBnrX+kUG2tbD1qEPgS3a3ZYqBXr+NyXgUpy2cXknI4QDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a055282d2be4065b7e49448a3c0e89b8f398ec2a5e1614b538aa615a301d53b8","last_reissued_at":"2026-07-05T09:07:36.089102Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:07:36.089102Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2409.10170","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-05T09:07:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VcNG1ALTNNBw+D53pHr79y/jL7vbkbZV3fX6XRpQ6lZ7XCPaInyRBKTJ38BEgb38wykn2XFsuWg5lw2meIQVAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T16:34:32.839202Z"},"content_sha256":"52b46314667c1d518ce8e7d9146bf72f9cdae73088a7af1a0c963e54aa2f0702","schema_version":"1.0","event_id":"sha256:52b46314667c1d518ce8e7d9146bf72f9cdae73088a7af1a0c963e54aa2f0702"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:UBKSQLJL4QDFW7SJISFDYDUJXD","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Minimal Model Counting via Knowledge Compilation","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Mohimenul Kabir","submitted_at":"2024-09-16T11:02:47Z","abstract_excerpt":"Counting the number of models of a Boolean formula is a fundamental problem in artificial intelligence and reasoning. Minimal models of a Boolean formula are critical in various reasoning systems, making the counting of minimal models essential for detailed inference tasks. Existing research primarily focused on decision problems related to minimal models. In this work, we extend beyond decision problems to address the challenge of counting minimal models. Specifically, we propose a novel knowledge compilation form that facilitates the efficient counting of minimal models. Our approach leverag"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2409.10170","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/2409.10170/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-05T09:07:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7b80OcqSq7sHcyEVRazy2NFZx2KhS34y7zU1chmwzMBbYQ7m4qlz0M7CD/yOjevlPFPSQMZpBVIU6gZB9YQiBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T16:34:32.839713Z"},"content_sha256":"e776d03a3ad37aa7d0c02362001876614d35cca8d2413331c12c2608a8e0d6d0","schema_version":"1.0","event_id":"sha256:e776d03a3ad37aa7d0c02362001876614d35cca8d2413331c12c2608a8e0d6d0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UBKSQLJL4QDFW7SJISFDYDUJXD/bundle.json","state_url":"https://pith.science/pith/UBKSQLJL4QDFW7SJISFDYDUJXD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UBKSQLJL4QDFW7SJISFDYDUJXD/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-08T16:34:32Z","links":{"resolver":"https://pith.science/pith/UBKSQLJL4QDFW7SJISFDYDUJXD","bundle":"https://pith.science/pith/UBKSQLJL4QDFW7SJISFDYDUJXD/bundle.json","state":"https://pith.science/pith/UBKSQLJL4QDFW7SJISFDYDUJXD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UBKSQLJL4QDFW7SJISFDYDUJXD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:UBKSQLJL4QDFW7SJISFDYDUJXD","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":"87e970b5f25afa5abb93907aee7965a864bdf6c1c0eb3234ef0eefe0d98acf65","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LO","submitted_at":"2024-09-16T11:02:47Z","title_canon_sha256":"20977c19769933473686d3dcbd38d4c9b217c3b57b387271ec85b7df755f0a6b"},"schema_version":"1.0","source":{"id":"2409.10170","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2409.10170","created_at":"2026-07-05T09:07:36Z"},{"alias_kind":"arxiv_version","alias_value":"2409.10170v1","created_at":"2026-07-05T09:07:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2409.10170","created_at":"2026-07-05T09:07:36Z"},{"alias_kind":"pith_short_12","alias_value":"UBKSQLJL4QDF","created_at":"2026-07-05T09:07:36Z"},{"alias_kind":"pith_short_16","alias_value":"UBKSQLJL4QDFW7SJ","created_at":"2026-07-05T09:07:36Z"},{"alias_kind":"pith_short_8","alias_value":"UBKSQLJL","created_at":"2026-07-05T09:07:36Z"}],"graph_snapshots":[{"event_id":"sha256:e776d03a3ad37aa7d0c02362001876614d35cca8d2413331c12c2608a8e0d6d0","target":"graph","created_at":"2026-07-05T09:07: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/2409.10170/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Counting the number of models of a Boolean formula is a fundamental problem in artificial intelligence and reasoning. Minimal models of a Boolean formula are critical in various reasoning systems, making the counting of minimal models essential for detailed inference tasks. Existing research primarily focused on decision problems related to minimal models. In this work, we extend beyond decision problems to address the challenge of counting minimal models. Specifically, we propose a novel knowledge compilation form that facilitates the efficient counting of minimal models. Our approach leverag","authors_text":"Mohimenul Kabir","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LO","submitted_at":"2024-09-16T11:02:47Z","title":"Minimal Model Counting via Knowledge Compilation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2409.10170","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:52b46314667c1d518ce8e7d9146bf72f9cdae73088a7af1a0c963e54aa2f0702","target":"record","created_at":"2026-07-05T09:07: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":"87e970b5f25afa5abb93907aee7965a864bdf6c1c0eb3234ef0eefe0d98acf65","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LO","submitted_at":"2024-09-16T11:02:47Z","title_canon_sha256":"20977c19769933473686d3dcbd38d4c9b217c3b57b387271ec85b7df755f0a6b"},"schema_version":"1.0","source":{"id":"2409.10170","kind":"arxiv","version":1}},"canonical_sha256":"a055282d2be4065b7e49448a3c0e89b8f398ec2a5e1614b538aa615a301d53b8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a055282d2be4065b7e49448a3c0e89b8f398ec2a5e1614b538aa615a301d53b8","first_computed_at":"2026-07-05T09:07:36.089102Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T09:07:36.089102Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"sue0B/lYzM/1AH8irDgbNjlYW1muL+AIujncvIqCsBnrX+kUG2tbD1qEPgS3a3ZYqBXr+NyXgUpy2cXknI4QDA==","signature_status":"signed_v1","signed_at":"2026-07-05T09:07:36.089559Z","signed_message":"canonical_sha256_bytes"},"source_id":"2409.10170","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:52b46314667c1d518ce8e7d9146bf72f9cdae73088a7af1a0c963e54aa2f0702","sha256:e776d03a3ad37aa7d0c02362001876614d35cca8d2413331c12c2608a8e0d6d0"],"state_sha256":"bb60a2a59a361147ee93e20139a5bfc95d8adf0742b11e5f49b234060faf4a0a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hzIR2xZmMh4AYFUVV8Z9i9PAz5xSwOgXhTT9gnRG4YaBBV9O80NeBwafC56HsdeyG33YW/EOzvwc5PSiTYWwBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-08T16:34:32.845042Z","bundle_sha256":"2052c0b247bf83b3f954a25daff295bb7c24184f72fd7d975fd33d2b22a282a1"}}