{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:PAVRJDMVK474PNPP5EWTSLQCPI","short_pith_number":"pith:PAVRJDMV","schema_version":"1.0","canonical_sha256":"782b148d95573fc7b5efe92d392e027a3ae7cf616aaea87cd2dae057c57e3764","source":{"kind":"arxiv","id":"2605.03613","version":2},"attestation_state":"computed","paper":{"title":"Set-like operations on propositional logic programs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"Every minimalist Horn logic program decomposes into Krom programs so its least model can be recovered exactly from the least models of those components.","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Christian Anti\\'c","submitted_at":"2026-05-05T10:39:59Z","abstract_excerpt":"A systematic algebraic framework for composing and decomposing logic programs is currently missing, limiting our ability to analyze and construct programs in a modular way. In this paper, we introduce set-like operations for (propositional Horn) logic programs that allow for a structured manipulation of rule bodies. Our main technical result shows that programs can be decomposed into simpler components in such a way that their least model semantics can be reconstructed or approximated from the semantics of these components. In particular, we prove that every minimalist program can be decompose"},"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":"2605.03613","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2026-05-05T10:39:59Z","cross_cats_sorted":[],"title_canon_sha256":"26f5958f1fb541f11081aeb66e8f3a660af494b43a268128eca072645d1220bc","abstract_canon_sha256":"dc7da99be9dad2c440c420b6ba588a350ffe77aae615b7c7a4ba1ec78db52ea0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-03T01:05:14.453440Z","signature_b64":"fT/C7feJVjF9/hE6jg9N9tqEJ2TkVVvrl27Oxwjgz/CVfQkPx5JgOTTDrcOTOsKEiMwx4ldg5GDZznQx+dOHBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"782b148d95573fc7b5efe92d392e027a3ae7cf616aaea87cd2dae057c57e3764","last_reissued_at":"2026-06-03T01:05:14.453022Z","signature_status":"signed_v1","first_computed_at":"2026-06-03T01:05:14.453022Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Set-like operations on propositional logic programs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"Every minimalist Horn logic program decomposes into Krom programs so its least model can be recovered exactly from the least models of those components.","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Christian Anti\\'c","submitted_at":"2026-05-05T10:39:59Z","abstract_excerpt":"A systematic algebraic framework for composing and decomposing logic programs is currently missing, limiting our ability to analyze and construct programs in a modular way. In this paper, we introduce set-like operations for (propositional Horn) logic programs that allow for a structured manipulation of rule bodies. Our main technical result shows that programs can be decomposed into simpler components in such a way that their least model semantics can be reconstructed or approximated from the semantics of these components. In particular, we prove that every minimalist program can be decompose"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"every minimalist program can be decomposed into Krom programs -- consisting only of rules with at most one body atom -- such that its least model can be computed from the least models of its components","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"The definitions of 'minimalist program' and 'Krom program' together with the set-like operations allow exact reconstruction of least-model semantics for the minimalist case; this assumption is stated as the main technical result but its precise scope and any hidden restrictions on rule forms are not detailed in the abstract.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"Propositional Horn logic programs can be decomposed into Krom programs such that least models of the original programs can be reconstructed or approximated from the least models of the components.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"Every minimalist Horn logic program decomposes into Krom programs so its least model can be recovered exactly from the least models of those components.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"d68b54595b49f6cb0271a7ac0944567c528fd6b2211611ea8236d9015acf4e84"},"source":{"id":"2605.03613","kind":"arxiv","version":2},"verdict":{"id":"caca9d61-43ce-4779-bea5-480969e22551","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-07T13:32:29.320210Z","strongest_claim":"every minimalist program can be decomposed into Krom programs -- consisting only of rules with at most one body atom -- such that its least model can be computed from the least models of its components","one_line_summary":"Propositional Horn logic programs can be decomposed into Krom programs such that least models of the original programs can be reconstructed or approximated from the least models of the components.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"The definitions of 'minimalist program' and 'Krom program' together with the set-like operations allow exact reconstruction of least-model semantics for the minimalist case; this assumption is stated as the main technical result but its precise scope and any hidden restrictions on rule forms are not detailed in the abstract.","pith_extraction_headline":"Every minimalist Horn logic program decomposes into Krom programs so its least model can be recovered exactly from the least models of those components."},"integrity":{"clean":false,"summary":{"advisory":1,"critical":1,"by_detector":{"doi_compliance":{"total":2,"advisory":1,"critical":1,"informational":0}},"informational":0},"endpoint":"/pith/2605.03613/integrity.json","findings":[{"note":"DOI in the printed bibliography is fragmented by whitespace or line breaks. A longer candidate (10.46298/lmcs-20(2:2) was visible in the surrounding text but could not be confirmed against doi.org as printed.","detector":"doi_compliance","severity":"advisory","ref_index":4,"audited_at":"2026-05-19T15:12:13.055913Z","detected_doi":"10.46298/lmcs-20(2:2","finding_type":"recoverable_identifier","verdict_class":"incontrovertible","detected_arxiv_id":null},{"note":"Identifier '10.1007/s10994-013-5353-8.pdf' is syntactically valid but the DOI registry (doi.org) returned 404, and Crossref / OpenAlex / internal corpus also have no record. The cited work could not be located through any authoritative source.","detector":"doi_compliance","severity":"critical","ref_index":45,"audited_at":"2026-05-19T15:12:13.055913Z","detected_doi":"10.1007/s10994-013-5353-8.pdf","finding_type":"unresolvable_identifier","verdict_class":"cross_source","detected_arxiv_id":null}],"available":true,"detectors_run":[{"name":"ai_meta_artifact","ran_at":"2026-05-20T13:37:36.404517Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"doi_title_agreement","ran_at":"2026-05-20T00:31:21.929367Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"doi_compliance","ran_at":"2026-05-19T15:12:13.055913Z","status":"completed","version":"1.0.0","findings_count":2}],"snapshot_sha256":"5ee0d6b483d14a58bc51855b36bbb7e6c865e92d0a4fed01cd3230082baff97b"},"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":"2605.03613","created_at":"2026-06-03T01:05:14.453084+00:00"},{"alias_kind":"arxiv_version","alias_value":"2605.03613v2","created_at":"2026-06-03T01:05:14.453084+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.03613","created_at":"2026-06-03T01:05:14.453084+00:00"},{"alias_kind":"pith_short_12","alias_value":"PAVRJDMVK474","created_at":"2026-06-03T01:05:14.453084+00:00"},{"alias_kind":"pith_short_16","alias_value":"PAVRJDMVK474PNPP","created_at":"2026-06-03T01:05:14.453084+00:00"},{"alias_kind":"pith_short_8","alias_value":"PAVRJDMV","created_at":"2026-06-03T01:05:14.453084+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/PAVRJDMVK474PNPP5EWTSLQCPI","json":"https://pith.science/pith/PAVRJDMVK474PNPP5EWTSLQCPI.json","graph_json":"https://pith.science/api/pith-number/PAVRJDMVK474PNPP5EWTSLQCPI/graph.json","events_json":"https://pith.science/api/pith-number/PAVRJDMVK474PNPP5EWTSLQCPI/events.json","paper":"https://pith.science/paper/PAVRJDMV"},"agent_actions":{"view_html":"https://pith.science/pith/PAVRJDMVK474PNPP5EWTSLQCPI","download_json":"https://pith.science/pith/PAVRJDMVK474PNPP5EWTSLQCPI.json","view_paper":"https://pith.science/paper/PAVRJDMV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2605.03613&json=true","fetch_graph":"https://pith.science/api/pith-number/PAVRJDMVK474PNPP5EWTSLQCPI/graph.json","fetch_events":"https://pith.science/api/pith-number/PAVRJDMVK474PNPP5EWTSLQCPI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PAVRJDMVK474PNPP5EWTSLQCPI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PAVRJDMVK474PNPP5EWTSLQCPI/action/storage_attestation","attest_author":"https://pith.science/pith/PAVRJDMVK474PNPP5EWTSLQCPI/action/author_attestation","sign_citation":"https://pith.science/pith/PAVRJDMVK474PNPP5EWTSLQCPI/action/citation_signature","submit_replication":"https://pith.science/pith/PAVRJDMVK474PNPP5EWTSLQCPI/action/replication_record"}},"created_at":"2026-06-03T01:05:14.453084+00:00","updated_at":"2026-06-03T01:05:14.453084+00:00"}