{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:XYGYOLXU6LPFWW2LTVEEFPLHMS","short_pith_number":"pith:XYGYOLXU","schema_version":"1.0","canonical_sha256":"be0d872ef4f2de5b5b4b9d4842bd6764afb6d234a28c5906e9cbe980a543ddb1","source":{"kind":"arxiv","id":"1012.1769","version":2},"attestation_state":"computed","paper":{"title":"Compactly generating all satisfying truth assignments of a Horn formula","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.LO"],"primary_cat":"cs.LO","authors_text":"Marcel Wild","submitted_at":"2010-12-08T14:24:43Z","abstract_excerpt":"As instance of an overarching principle of exclusion an algorithm is presented that compactly (thus not one by one) generates all models of a Horn formula. The principle of exclusion can be adapted to generate only the models of weight $k$. We compare and contrast it with constraint programming, $0,1$ integer programming, and binary decision diagrams."},"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":"1012.1769","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2010-12-08T14:24:43Z","cross_cats_sorted":["math.LO"],"title_canon_sha256":"353f13fe85c4340f705aa7121e59f424a5eeaabc4220bdc73bdabe60da3d4ffa","abstract_canon_sha256":"9d49cf50f54dd5351a1c180e6daaf6513ce532235e2e43dfb3c3507815f543b9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:49:52.971973Z","signature_b64":"Zm7qwCSQW6FW4GHvQ86GIo3TyBj4kCq0JNcqLq2PK8YbG7O5BMigV73GjXYogH1ilSmTttZt7JJjV2kEMytIAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"be0d872ef4f2de5b5b4b9d4842bd6764afb6d234a28c5906e9cbe980a543ddb1","last_reissued_at":"2026-05-18T00:49:52.971475Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:49:52.971475Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Compactly generating all satisfying truth assignments of a Horn formula","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.LO"],"primary_cat":"cs.LO","authors_text":"Marcel Wild","submitted_at":"2010-12-08T14:24:43Z","abstract_excerpt":"As instance of an overarching principle of exclusion an algorithm is presented that compactly (thus not one by one) generates all models of a Horn formula. The principle of exclusion can be adapted to generate only the models of weight $k$. We compare and contrast it with constraint programming, $0,1$ integer programming, and binary decision diagrams."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1012.1769","kind":"arxiv","version":2},"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":"1012.1769","created_at":"2026-05-18T00:49:52.971554+00:00"},{"alias_kind":"arxiv_version","alias_value":"1012.1769v2","created_at":"2026-05-18T00:49:52.971554+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1012.1769","created_at":"2026-05-18T00:49:52.971554+00:00"},{"alias_kind":"pith_short_12","alias_value":"XYGYOLXU6LPF","created_at":"2026-05-18T12:26:17.028572+00:00"},{"alias_kind":"pith_short_16","alias_value":"XYGYOLXU6LPFWW2L","created_at":"2026-05-18T12:26:17.028572+00:00"},{"alias_kind":"pith_short_8","alias_value":"XYGYOLXU","created_at":"2026-05-18T12:26:17.028572+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/XYGYOLXU6LPFWW2LTVEEFPLHMS","json":"https://pith.science/pith/XYGYOLXU6LPFWW2LTVEEFPLHMS.json","graph_json":"https://pith.science/api/pith-number/XYGYOLXU6LPFWW2LTVEEFPLHMS/graph.json","events_json":"https://pith.science/api/pith-number/XYGYOLXU6LPFWW2LTVEEFPLHMS/events.json","paper":"https://pith.science/paper/XYGYOLXU"},"agent_actions":{"view_html":"https://pith.science/pith/XYGYOLXU6LPFWW2LTVEEFPLHMS","download_json":"https://pith.science/pith/XYGYOLXU6LPFWW2LTVEEFPLHMS.json","view_paper":"https://pith.science/paper/XYGYOLXU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1012.1769&json=true","fetch_graph":"https://pith.science/api/pith-number/XYGYOLXU6LPFWW2LTVEEFPLHMS/graph.json","fetch_events":"https://pith.science/api/pith-number/XYGYOLXU6LPFWW2LTVEEFPLHMS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XYGYOLXU6LPFWW2LTVEEFPLHMS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XYGYOLXU6LPFWW2LTVEEFPLHMS/action/storage_attestation","attest_author":"https://pith.science/pith/XYGYOLXU6LPFWW2LTVEEFPLHMS/action/author_attestation","sign_citation":"https://pith.science/pith/XYGYOLXU6LPFWW2LTVEEFPLHMS/action/citation_signature","submit_replication":"https://pith.science/pith/XYGYOLXU6LPFWW2LTVEEFPLHMS/action/replication_record"}},"created_at":"2026-05-18T00:49:52.971554+00:00","updated_at":"2026-05-18T00:49:52.971554+00:00"}