{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:XYYQ35M6QISLFGVCFOVWULA3HT","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":"0c45e645c3be9665ad0dfff1a5deb26d271ffaa88db1082338628040b1980fbf","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2026-05-03T09:22:26Z","title_canon_sha256":"1abbc0fc82d9e8e76aa6843080fadbed4c1e20772a59c6b304bfb7f3dcc81168"},"schema_version":"1.0","source":{"id":"2605.01797","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.01797","created_at":"2026-06-02T01:03:47Z"},{"alias_kind":"arxiv_version","alias_value":"2605.01797v2","created_at":"2026-06-02T01:03:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.01797","created_at":"2026-06-02T01:03:47Z"},{"alias_kind":"pith_short_12","alias_value":"XYYQ35M6QISL","created_at":"2026-06-02T01:03:47Z"},{"alias_kind":"pith_short_16","alias_value":"XYYQ35M6QISLFGVC","created_at":"2026-06-02T01:03:47Z"},{"alias_kind":"pith_short_8","alias_value":"XYYQ35M6","created_at":"2026-06-02T01:03:47Z"}],"graph_snapshots":[{"event_id":"sha256:66eb1b1188d90a2dc651cc1e02078f32268f873b833f6fb0dbd6c4917f922b65","target":"graph","created_at":"2026-06-02T01:03:47Z","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":"Successful DProp computations are shown to capture the stable model semantics. NDProp can learn to efficiently compute stable models, and it improves accuracy and scalability on neuro-symbolic benchmarks."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"That neural decisions combined with fuzzy propagations can reliably approximate exact stable-model computation while preserving correctness and generalizing beyond the training distribution used in the benchmarks."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"NDProp learns decision heuristics via neural networks and fuzzy propagation to compute stable models in ASP, improving accuracy and scalability over prior neuro-symbolic methods."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"Decision-propagation computes stable models by alternating falsity decisions and truth propagations, and its neural version learns to do so efficiently."}],"snapshot_sha256":"1ea4d7e85b17a7e5c005bddbafeff24a1d03251db439d9d604a4a5604b31c7bc"},"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-20T17:35:56.431865Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"doi_title_agreement","ran_at":"2026-05-20T05:01:22.689447Z","status":"completed","version":"1.0.0"},{"findings_count":2,"name":"doi_compliance","ran_at":"2026-05-19T16:58:34.590334Z","status":"completed","version":"1.0.0"}],"endpoint":"/pith/2605.01797/integrity.json","findings":[{"audited_at":"2026-05-19T16:58:34.590334Z","detected_arxiv_id":null,"detected_doi":"10.1007/978-3-540-24599-5\\_17","detector":"doi_compliance","finding_type":"recoverable_identifier","note":"DOI in the printed bibliography is fragmented by whitespace or line breaks. A longer candidate (10.1007/978-3-540-24599-5\\_17) was visible in the surrounding text but could not be confirmed against doi.org as printed.","ref_index":36,"severity":"advisory","verdict_class":"incontrovertible"},{"audited_at":"2026-05-19T16:58:34.590334Z","detected_arxiv_id":null,"detected_doi":"10.1007/978-3-540-28633-2\\_7","detector":"doi_compliance","finding_type":"recoverable_identifier","note":"DOI in the printed bibliography is fragmented by whitespace or line breaks. A longer candidate (10.1007/978-3-540-28633-2\\_7) was visible in the surrounding text but could not be confirmed against doi.org as printed.","ref_index":17,"severity":"advisory","verdict_class":"incontrovertible"}],"snapshot_sha256":"61f8e2bb53afe06f8875f711e1c9da804da550d0fdc6023697edf3cb4d675534","summary":{"advisory":2,"by_detector":{"doi_compliance":{"advisory":2,"critical":0,"informational":0,"total":2}},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Integration of Answer Set Programming (ASP) with neural networks has emerged as a promising tool in Neuro-symbolic AI. While existing approaches extend the capabilities of ASP to real world domains, their reasoning pipelines depend on classical solvers, which is a bottleneck for scalability. To tackle this problem, we propose a new method to compute stable models, called decision-propagation (DProp), which alternates falsity decisions and truth propagations. Successful DProp computations are shown to capture the stable model semantics. We then develop Neural DProp (NDProp), a differentiable ex","authors_text":"Katsumi Inoue, Sota Moriyama, Thomas Eiter","cross_cats":[],"headline":"Decision-propagation computes stable models by alternating falsity decisions and truth propagations, and its neural version learns to do so efficiently.","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2026-05-03T09:22:26Z","title":"Neural Decision-Propagation for Answer Set Programming"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.01797","kind":"arxiv","version":2},"verdict":{"created_at":"2026-05-10T15:08:45.540414Z","id":"aae59194-e594-4753-904f-9b56522f8db6","model_set":{"reader":"grok-4.3"},"one_line_summary":"NDProp learns decision heuristics via neural networks and fuzzy propagation to compute stable models in ASP, improving accuracy and scalability over prior neuro-symbolic methods.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"Decision-propagation computes stable models by alternating falsity decisions and truth propagations, and its neural version learns to do so efficiently.","strongest_claim":"Successful DProp computations are shown to capture the stable model semantics. NDProp can learn to efficiently compute stable models, and it improves accuracy and scalability on neuro-symbolic benchmarks.","weakest_assumption":"That neural decisions combined with fuzzy propagations can reliably approximate exact stable-model computation while preserving correctness and generalizing beyond the training distribution used in the benchmarks."}},"verdict_id":"aae59194-e594-4753-904f-9b56522f8db6"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:b96a92a8be012f5ec3d2456c6935a79e1a8a94dc2b13d6731c121217a2dc509c","target":"record","created_at":"2026-06-02T01:03:47Z","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":"0c45e645c3be9665ad0dfff1a5deb26d271ffaa88db1082338628040b1980fbf","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2026-05-03T09:22:26Z","title_canon_sha256":"1abbc0fc82d9e8e76aa6843080fadbed4c1e20772a59c6b304bfb7f3dcc81168"},"schema_version":"1.0","source":{"id":"2605.01797","kind":"arxiv","version":2}},"canonical_sha256":"be310df59e8224b29aa22bab6a2c1b3ccc7d6729a873b3945ace2acc94952e61","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"be310df59e8224b29aa22bab6a2c1b3ccc7d6729a873b3945ace2acc94952e61","first_computed_at":"2026-06-02T01:03:47.956346Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-02T01:03:47.956346Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"wXPpBRO+ZDf/uGJn+h6Encqb6N6yHw6dmZutes46PrSih4iIRXHzrW4T0ypN8Qkkxrf4bIf9mseXHC3DOPauBQ==","signature_status":"signed_v1","signed_at":"2026-06-02T01:03:47.956891Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.01797","source_kind":"arxiv","source_version":2}}},"equivocations":[{"signer_id":"pith.science","event_type":"integrity_finding","target":"integrity","event_ids":["sha256:94dfb0433a93229ed98668c3ac16506923423cf79f8980779997d99ce08a563d","sha256:cdf2a0ae8ec563b71389edb1f85a22515316b9f21549335f896326076bbf6712"]}],"invalid_events":[],"applied_event_ids":["sha256:b96a92a8be012f5ec3d2456c6935a79e1a8a94dc2b13d6731c121217a2dc509c","sha256:66eb1b1188d90a2dc651cc1e02078f32268f873b833f6fb0dbd6c4917f922b65"],"state_sha256":"5856151aa78075b283fdd7f36c2583ec43b1573a53d8580aad6526a365b79236"}