{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:GMKFKYRJ7Z325INOFSCKLSALEO","short_pith_number":"pith:GMKFKYRJ","schema_version":"1.0","canonical_sha256":"3314556229fe77aea1ae2c84a5c80b23986c0b12bbb5b727161cd02144f2bfd2","source":{"kind":"arxiv","id":"2602.06934","version":4},"attestation_state":"computed","paper":{"title":"Implementing Grassroots Logic Programs with Multiagent Transition Systems and AI (Full Version)","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"Grassroots logic programs can be implemented correctly via deterministic multiagent transition systems using local links for shared variables.","cross_cats":["cs.AI","cs.DC","cs.LO","cs.MA"],"primary_cat":"cs.PL","authors_text":"Ehud Shapiro","submitted_at":"2026-02-06T18:30:11Z","abstract_excerpt":"Grassroots Logic Programs (GLP) is a concurrent logic programming language in which logic variables are partitioned into paired readers and writers. An assignment is produced at most once via a writer and consumed at most once via its paired reader, and may contain additional readers and/or writers. This enables the concise expression of rich multidirectional communication modalities.\n  The language was introduced together with concurrent (cGLP) and multiagent (maGLP) operational semantics. Here, we derive from these (\\ia)~dGLP, a deterministic counterpart of cGLP, and (\\ib)~madGLP, a counterp"},"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":true},"canonical_record":{"source":{"id":"2602.06934","kind":"arxiv","version":4},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.PL","submitted_at":"2026-02-06T18:30:11Z","cross_cats_sorted":["cs.AI","cs.DC","cs.LO","cs.MA"],"title_canon_sha256":"10d5b857383eb7976c8d88e238589d30d3869ddf083a5689c208b4db031a3572","abstract_canon_sha256":"b847c081fbec5501a7129a9a1c7d005dada562b88b75ad27f7413e201ce9cb34"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-09T02:07:19.823255Z","signature_b64":"iO6AMF57SpW9az72tcEevyKnRVcY19W41SVAM6P78rFCKh8wcJx+7bfoym3zaBJBcT8NKYtZKcHI7+NaVswtAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3314556229fe77aea1ae2c84a5c80b23986c0b12bbb5b727161cd02144f2bfd2","last_reissued_at":"2026-06-09T02:07:19.822111Z","signature_status":"signed_v1","first_computed_at":"2026-06-09T02:07:19.822111Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Implementing Grassroots Logic Programs with Multiagent Transition Systems and AI (Full Version)","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"Grassroots logic programs can be implemented correctly via deterministic multiagent transition systems using local links for shared variables.","cross_cats":["cs.AI","cs.DC","cs.LO","cs.MA"],"primary_cat":"cs.PL","authors_text":"Ehud Shapiro","submitted_at":"2026-02-06T18:30:11Z","abstract_excerpt":"Grassroots Logic Programs (GLP) is a concurrent logic programming language in which logic variables are partitioned into paired readers and writers. An assignment is produced at most once via a writer and consumed at most once via its paired reader, and may contain additional readers and/or writers. This enables the concise expression of rich multidirectional communication modalities.\n  The language was introduced together with concurrent (cGLP) and multiagent (maGLP) operational semantics. Here, we derive from these (\\ia)~dGLP, a deterministic counterpart of cGLP, and (\\ib)~madGLP, a counterp"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"We prove that both madGLP and maGLP are grassroots. dGLP and madGLP are proved correct with respect to their abstract counterparts GLP and maGLP.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"The single-occurrence invariant of GLP programs, which is invoked to establish disjoint substitution commutativity and thereby the correctness of the shared-variable implementation via local links.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"Derives correct deterministic semantics for multiagent logic programs from abstract ones and uses them as specs for AI-generated Dart implementations.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"Grassroots logic programs can be implemented correctly via deterministic multiagent transition systems using local links for shared variables.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"9f84fcb8d3171c3dfc9d9df50b0875376d99f081e5554c30d807cfb3c9c51d01"},"source":{"id":"2602.06934","kind":"arxiv","version":4},"verdict":{"id":"57f070fd-7b2e-496f-80ae-c0ace5e9fc56","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-16T06:08:04.154394Z","strongest_claim":"We prove that both madGLP and maGLP are grassroots. dGLP and madGLP are proved correct with respect to their abstract counterparts GLP and maGLP.","one_line_summary":"Derives correct deterministic semantics for multiagent logic programs from abstract ones and uses them as specs for AI-generated Dart implementations.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"The single-occurrence invariant of GLP programs, which is invoked to establish disjoint substitution commutativity and thereby the correctness of the shared-variable implementation via local links.","pith_extraction_headline":"Grassroots logic programs can be implemented correctly via deterministic multiagent transition systems using local links for shared variables."},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2602.06934/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":2,"snapshot_sha256":"92a4873dc89ac304903724b7c31c132b8d3ffce0a0b99f449c44da3400a7d7e7"},"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":"2602.06934","created_at":"2026-06-09T02:07:19.822292+00:00"},{"alias_kind":"arxiv_version","alias_value":"2602.06934v4","created_at":"2026-06-09T02:07:19.822292+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2602.06934","created_at":"2026-06-09T02:07:19.822292+00:00"},{"alias_kind":"pith_short_12","alias_value":"GMKFKYRJ7Z32","created_at":"2026-06-09T02:07:19.822292+00:00"},{"alias_kind":"pith_short_16","alias_value":"GMKFKYRJ7Z325INO","created_at":"2026-06-09T02:07:19.822292+00:00"},{"alias_kind":"pith_short_8","alias_value":"GMKFKYRJ","created_at":"2026-06-09T02:07:19.822292+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":2,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/GMKFKYRJ7Z325INOFSCKLSALEO","json":"https://pith.science/pith/GMKFKYRJ7Z325INOFSCKLSALEO.json","graph_json":"https://pith.science/api/pith-number/GMKFKYRJ7Z325INOFSCKLSALEO/graph.json","events_json":"https://pith.science/api/pith-number/GMKFKYRJ7Z325INOFSCKLSALEO/events.json","paper":"https://pith.science/paper/GMKFKYRJ"},"agent_actions":{"view_html":"https://pith.science/pith/GMKFKYRJ7Z325INOFSCKLSALEO","download_json":"https://pith.science/pith/GMKFKYRJ7Z325INOFSCKLSALEO.json","view_paper":"https://pith.science/paper/GMKFKYRJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2602.06934&json=true","fetch_graph":"https://pith.science/api/pith-number/GMKFKYRJ7Z325INOFSCKLSALEO/graph.json","fetch_events":"https://pith.science/api/pith-number/GMKFKYRJ7Z325INOFSCKLSALEO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GMKFKYRJ7Z325INOFSCKLSALEO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GMKFKYRJ7Z325INOFSCKLSALEO/action/storage_attestation","attest_author":"https://pith.science/pith/GMKFKYRJ7Z325INOFSCKLSALEO/action/author_attestation","sign_citation":"https://pith.science/pith/GMKFKYRJ7Z325INOFSCKLSALEO/action/citation_signature","submit_replication":"https://pith.science/pith/GMKFKYRJ7Z325INOFSCKLSALEO/action/replication_record"}},"created_at":"2026-06-09T02:07:19.822292+00:00","updated_at":"2026-06-09T02:07:19.822292+00:00"}