{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:GMKFKYRJ7Z325INOFSCKLSALEO","short_pith_number":"pith:GMKFKYRJ","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"},"canonical_sha256":"3314556229fe77aea1ae2c84a5c80b23986c0b12bbb5b727161cd02144f2bfd2","source":{"kind":"arxiv","id":"2602.06934","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2602.06934","created_at":"2026-06-09T02:07:19Z"},{"alias_kind":"arxiv_version","alias_value":"2602.06934v4","created_at":"2026-06-09T02:07:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2602.06934","created_at":"2026-06-09T02:07:19Z"},{"alias_kind":"pith_short_12","alias_value":"GMKFKYRJ7Z32","created_at":"2026-06-09T02:07:19Z"},{"alias_kind":"pith_short_16","alias_value":"GMKFKYRJ7Z325INO","created_at":"2026-06-09T02:07:19Z"},{"alias_kind":"pith_short_8","alias_value":"GMKFKYRJ","created_at":"2026-06-09T02:07:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:GMKFKYRJ7Z325INOFSCKLSALEO","target":"record","payload":{"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"},"canonical_sha256":"3314556229fe77aea1ae2c84a5c80b23986c0b12bbb5b727161cd02144f2bfd2","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"},"source_kind":"arxiv","source_id":"2602.06934","source_version":4,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-06-09T02:07:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2dVcelhBpUWZXgPOctiUbn+kIeh62YTZ8ALtBBDM1foN1WrBbjB7Lg14vjPjLwg8W9azY38ilEgQuGRPesyVCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T05:03:30.072625Z"},"content_sha256":"c4cd7e0c165db393199799d2ae9278aac29f024c6238e1efcaaa184b30d497b6","schema_version":"1.0","event_id":"sha256:c4cd7e0c165db393199799d2ae9278aac29f024c6238e1efcaaa184b30d497b6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:GMKFKYRJ7Z325INOFSCKLSALEO","target":"graph","payload":{"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"},"verdict_id":"57f070fd-7b2e-496f-80ae-c0ace5e9fc56"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-06-09T02:07:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PIFkwD4b3kHTPgcUIU4s32UvrQWEasU/f97kccUQ22OQZi9c+I42GO96kHNmItKUW1cNbg3slMpyAARrChMlAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T05:03:30.073454Z"},"content_sha256":"2b7058cf50c9caee4d8e674ed82cdf89e69d796c900c6cf4de20d46ad8bf61fa","schema_version":"1.0","event_id":"sha256:2b7058cf50c9caee4d8e674ed82cdf89e69d796c900c6cf4de20d46ad8bf61fa"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GMKFKYRJ7Z325INOFSCKLSALEO/bundle.json","state_url":"https://pith.science/pith/GMKFKYRJ7Z325INOFSCKLSALEO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GMKFKYRJ7Z325INOFSCKLSALEO/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-08-08T05:03:30Z","links":{"resolver":"https://pith.science/pith/GMKFKYRJ7Z325INOFSCKLSALEO","bundle":"https://pith.science/pith/GMKFKYRJ7Z325INOFSCKLSALEO/bundle.json","state":"https://pith.science/pith/GMKFKYRJ7Z325INOFSCKLSALEO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GMKFKYRJ7Z325INOFSCKLSALEO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:GMKFKYRJ7Z325INOFSCKLSALEO","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"b847c081fbec5501a7129a9a1c7d005dada562b88b75ad27f7413e201ce9cb34","cross_cats_sorted":["cs.AI","cs.DC","cs.LO","cs.MA"],"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.PL","submitted_at":"2026-02-06T18:30:11Z","title_canon_sha256":"10d5b857383eb7976c8d88e238589d30d3869ddf083a5689c208b4db031a3572"},"schema_version":"1.0","source":{"id":"2602.06934","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2602.06934","created_at":"2026-06-09T02:07:19Z"},{"alias_kind":"arxiv_version","alias_value":"2602.06934v4","created_at":"2026-06-09T02:07:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2602.06934","created_at":"2026-06-09T02:07:19Z"},{"alias_kind":"pith_short_12","alias_value":"GMKFKYRJ7Z32","created_at":"2026-06-09T02:07:19Z"},{"alias_kind":"pith_short_16","alias_value":"GMKFKYRJ7Z325INO","created_at":"2026-06-09T02:07:19Z"},{"alias_kind":"pith_short_8","alias_value":"GMKFKYRJ","created_at":"2026-06-09T02:07:19Z"}],"graph_snapshots":[{"event_id":"sha256:2b7058cf50c9caee4d8e674ed82cdf89e69d796c900c6cf4de20d46ad8bf61fa","target":"graph","created_at":"2026-06-09T02:07:19Z","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":"We prove that both madGLP and maGLP are grassroots. dGLP and madGLP are proved correct with respect to their abstract counterparts GLP and maGLP."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","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."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"Derives correct deterministic semantics for multiagent logic programs from abstract ones and uses them as specs for AI-generated Dart implementations."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"Grassroots logic programs can be implemented correctly via deterministic multiagent transition systems using local links for shared variables."}],"snapshot_sha256":"9f84fcb8d3171c3dfc9d9df50b0875376d99f081e5554c30d807cfb3c9c51d01"},"formal_canon":{"evidence_count":2,"snapshot_sha256":"92a4873dc89ac304903724b7c31c132b8d3ffce0a0b99f449c44da3400a7d7e7"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2602.06934/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Ehud Shapiro","cross_cats":["cs.AI","cs.DC","cs.LO","cs.MA"],"headline":"Grassroots logic programs can be implemented correctly via deterministic multiagent transition systems using local links for shared variables.","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.PL","submitted_at":"2026-02-06T18:30:11Z","title":"Implementing Grassroots Logic Programs with Multiagent Transition Systems and AI (Full Version)"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2602.06934","kind":"arxiv","version":4},"verdict":{"created_at":"2026-05-16T06:08:04.154394Z","id":"57f070fd-7b2e-496f-80ae-c0ace5e9fc56","model_set":{"reader":"grok-4.3"},"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","pith_extraction_headline":"Grassroots logic programs can be implemented correctly via deterministic multiagent transition systems using local links for shared variables.","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.","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."}},"verdict_id":"57f070fd-7b2e-496f-80ae-c0ace5e9fc56"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:c4cd7e0c165db393199799d2ae9278aac29f024c6238e1efcaaa184b30d497b6","target":"record","created_at":"2026-06-09T02:07:19Z","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":"b847c081fbec5501a7129a9a1c7d005dada562b88b75ad27f7413e201ce9cb34","cross_cats_sorted":["cs.AI","cs.DC","cs.LO","cs.MA"],"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.PL","submitted_at":"2026-02-06T18:30:11Z","title_canon_sha256":"10d5b857383eb7976c8d88e238589d30d3869ddf083a5689c208b4db031a3572"},"schema_version":"1.0","source":{"id":"2602.06934","kind":"arxiv","version":4}},"canonical_sha256":"3314556229fe77aea1ae2c84a5c80b23986c0b12bbb5b727161cd02144f2bfd2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3314556229fe77aea1ae2c84a5c80b23986c0b12bbb5b727161cd02144f2bfd2","first_computed_at":"2026-06-09T02:07:19.822111Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-09T02:07:19.822111Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"iO6AMF57SpW9az72tcEevyKnRVcY19W41SVAM6P78rFCKh8wcJx+7bfoym3zaBJBcT8NKYtZKcHI7+NaVswtAg==","signature_status":"signed_v1","signed_at":"2026-06-09T02:07:19.823255Z","signed_message":"canonical_sha256_bytes"},"source_id":"2602.06934","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c4cd7e0c165db393199799d2ae9278aac29f024c6238e1efcaaa184b30d497b6","sha256:2b7058cf50c9caee4d8e674ed82cdf89e69d796c900c6cf4de20d46ad8bf61fa"],"state_sha256":"d4cad8d4d49f7a4afa0a635803b61637d2609f3342e1ac22f9c66a0dcec3b945"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FbREhAreEJqkE+3xGjDAbHHDRsKYTH+JrU4o4DTWefYkxEwfwqPKjvxrwWZAMfmln78iTszmO1P6x+A+iilCBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-08T05:03:30.077818Z","bundle_sha256":"2f8964d530f4f37b8778924793cd03c72d88f648cc3b32c60282a8bb236ea280"}}