{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:PAVRJDMVK474PNPP5EWTSLQCPI","merge_version":"pith-open-graph-merge-v1","event_count":4,"valid_event_count":4,"invalid_event_count":0,"equivocation_count":1,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"dc7da99be9dad2c440c420b6ba588a350ffe77aae615b7c7a4ba1ec78db52ea0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2026-05-05T10:39:59Z","title_canon_sha256":"26f5958f1fb541f11081aeb66e8f3a660af494b43a268128eca072645d1220bc"},"schema_version":"1.0","source":{"id":"2605.03613","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.03613","created_at":"2026-06-03T01:05:14Z"},{"alias_kind":"arxiv_version","alias_value":"2605.03613v2","created_at":"2026-06-03T01:05:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.03613","created_at":"2026-06-03T01:05:14Z"},{"alias_kind":"pith_short_12","alias_value":"PAVRJDMVK474","created_at":"2026-06-03T01:05:14Z"},{"alias_kind":"pith_short_16","alias_value":"PAVRJDMVK474PNPP","created_at":"2026-06-03T01:05:14Z"},{"alias_kind":"pith_short_8","alias_value":"PAVRJDMV","created_at":"2026-06-03T01:05:14Z"}],"graph_snapshots":[{"event_id":"sha256:c58c5d53ca5aee426ec6ab5476cc0b78958cc04f92f97037411b04446d6981a4","target":"graph","created_at":"2026-06-03T01:05:14Z","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":4,"items":[{"attestation":"unclaimed","claim_id":"C1","kind":"strongest_claim","source":"verdict.strongest_claim","status":"machine_extracted","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"},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","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."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","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."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","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."}],"snapshot_sha256":"d68b54595b49f6cb0271a7ac0944567c528fd6b2211611ea8236d9015acf4e84"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":false,"detectors_run":[{"findings_count":0,"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":2,"name":"doi_compliance","ran_at":"2026-05-19T15:12:13.055913Z","status":"completed","version":"1.0.0"}],"endpoint":"/pith/2605.03613/integrity.json","findings":[{"audited_at":"2026-05-19T15:12:13.055913Z","detected_arxiv_id":null,"detected_doi":"10.46298/lmcs-20(2:2","detector":"doi_compliance","finding_type":"recoverable_identifier","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.","ref_index":4,"severity":"advisory","verdict_class":"incontrovertible"},{"audited_at":"2026-05-19T15:12:13.055913Z","detected_arxiv_id":null,"detected_doi":"10.1007/s10994-013-5353-8.pdf","detector":"doi_compliance","finding_type":"unresolvable_identifier","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.","ref_index":45,"severity":"critical","verdict_class":"cross_source"}],"snapshot_sha256":"5ee0d6b483d14a58bc51855b36bbb7e6c865e92d0a4fed01cd3230082baff97b","summary":{"advisory":1,"by_detector":{"doi_compliance":{"advisory":1,"critical":1,"informational":0,"total":2}},"critical":1,"informational":0}},"paper":{"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","authors_text":"Christian Anti\\'c","cross_cats":[],"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.","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2026-05-05T10:39:59Z","title":"Set-like operations on propositional logic programs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.03613","kind":"arxiv","version":2},"verdict":{"created_at":"2026-05-07T13:32:29.320210Z","id":"caca9d61-43ce-4779-bea5-480969e22551","model_set":{"reader":"grok-4.3"},"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","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.","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","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."}},"verdict_id":"caca9d61-43ce-4779-bea5-480969e22551"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:b23934ae294bd4c5220903a285b55240f51f164fc2a7f6e3ddb63e3ae4b4b55b","target":"record","created_at":"2026-06-03T01:05:14Z","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":"dc7da99be9dad2c440c420b6ba588a350ffe77aae615b7c7a4ba1ec78db52ea0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2026-05-05T10:39:59Z","title_canon_sha256":"26f5958f1fb541f11081aeb66e8f3a660af494b43a268128eca072645d1220bc"},"schema_version":"1.0","source":{"id":"2605.03613","kind":"arxiv","version":2}},"canonical_sha256":"782b148d95573fc7b5efe92d392e027a3ae7cf616aaea87cd2dae057c57e3764","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"782b148d95573fc7b5efe92d392e027a3ae7cf616aaea87cd2dae057c57e3764","first_computed_at":"2026-06-03T01:05:14.453022Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-03T01:05:14.453022Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"fT/C7feJVjF9/hE6jg9N9tqEJ2TkVVvrl27Oxwjgz/CVfQkPx5JgOTTDrcOTOsKEiMwx4ldg5GDZznQx+dOHBg==","signature_status":"signed_v1","signed_at":"2026-06-03T01:05:14.453440Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.03613","source_kind":"arxiv","source_version":2}}},"equivocations":[{"signer_id":"pith.science","event_type":"integrity_finding","target":"integrity","event_ids":["sha256:4379378eeecf172ac619037fea4713c182fc5764fe7bc085dcf7fcdbd70f74c1","sha256:e142403b3d5a01fd147e3a7e7abbef14bbfdbbf7d06f593c03a4fa5be4d07d8f"]}],"invalid_events":[],"applied_event_ids":["sha256:b23934ae294bd4c5220903a285b55240f51f164fc2a7f6e3ddb63e3ae4b4b55b","sha256:c58c5d53ca5aee426ec6ab5476cc0b78958cc04f92f97037411b04446d6981a4"],"state_sha256":"90be93808b32ff5a26e81279a859cb9796cd41c961f090e1c196702263ad39a8"}