{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:D75M5TPVNQDTLXRVGYSXD2CGCQ","short_pith_number":"pith:D75M5TPV","schema_version":"1.0","canonical_sha256":"1ffacecdf56c0735de35362571e8461412bcc0302f27e2ad4b39f30dada5f14b","source":{"kind":"arxiv","id":"2601.17957","version":4},"attestation_state":"computed","paper":{"title":"Moded Types for Grassroots Logic Programs, by AI, for AI (Full Version)","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["cs.DC","cs.FL","cs.LO","cs.MA"],"primary_cat":"cs.PL","authors_text":"Ehud Shapiro","submitted_at":"2026-01-25T19:18:27Z","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  ``Logic Programs as Types for Logic Programs'' (LICS'91) defined types as regular sets of paths over the Herbrand atom semantics of a logic program. Here, we develop a \\emph{moded-atom semantics} that extends t"},"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":"2601.17957","kind":"arxiv","version":4},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.PL","submitted_at":"2026-01-25T19:18:27Z","cross_cats_sorted":["cs.DC","cs.FL","cs.LO","cs.MA"],"title_canon_sha256":"b681aaf5d2bbe01319c99be47eedc51f7939c7bc98d3a95207102c8406cfab13","abstract_canon_sha256":"0954d954da5cbdba073d4977ad10b1107f792d308f315c9c185a5eb1bb80d8ee"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-09T01:05:46.767165Z","signature_b64":"815Lur1Vpnr4o17FOTGUPYOqYdl/4lWFfKCFLOs+yTnZwL1Z/TriIRdia2cGZ4S5TAilwJ8QokbvixURkmDuAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1ffacecdf56c0735de35362571e8461412bcc0302f27e2ad4b39f30dada5f14b","last_reissued_at":"2026-06-09T01:05:46.766631Z","signature_status":"signed_v1","first_computed_at":"2026-06-09T01:05:46.766631Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Moded Types for Grassroots Logic Programs, by AI, for AI (Full Version)","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["cs.DC","cs.FL","cs.LO","cs.MA"],"primary_cat":"cs.PL","authors_text":"Ehud Shapiro","submitted_at":"2026-01-25T19:18:27Z","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  ``Logic Programs as Types for Logic Programs'' (LICS'91) defined types as regular sets of paths over the Herbrand atom semantics of a logic program. Here, we develop a \\emph{moded-atom semantics} that extends t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2601.17957","kind":"arxiv","version":4},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2601.17957/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":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":"2601.17957","created_at":"2026-06-09T01:05:46.766696+00:00"},{"alias_kind":"arxiv_version","alias_value":"2601.17957v4","created_at":"2026-06-09T01:05:46.766696+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2601.17957","created_at":"2026-06-09T01:05:46.766696+00:00"},{"alias_kind":"pith_short_12","alias_value":"D75M5TPVNQDT","created_at":"2026-06-09T01:05:46.766696+00:00"},{"alias_kind":"pith_short_16","alias_value":"D75M5TPVNQDTLXRV","created_at":"2026-06-09T01:05:46.766696+00:00"},{"alias_kind":"pith_short_8","alias_value":"D75M5TPV","created_at":"2026-06-09T01:05:46.766696+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2604.25596","citing_title":"Volitional Multiagent Atomic Transactions: Describing People and their Machines","ref_index":17,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/D75M5TPVNQDTLXRVGYSXD2CGCQ","json":"https://pith.science/pith/D75M5TPVNQDTLXRVGYSXD2CGCQ.json","graph_json":"https://pith.science/api/pith-number/D75M5TPVNQDTLXRVGYSXD2CGCQ/graph.json","events_json":"https://pith.science/api/pith-number/D75M5TPVNQDTLXRVGYSXD2CGCQ/events.json","paper":"https://pith.science/paper/D75M5TPV"},"agent_actions":{"view_html":"https://pith.science/pith/D75M5TPVNQDTLXRVGYSXD2CGCQ","download_json":"https://pith.science/pith/D75M5TPVNQDTLXRVGYSXD2CGCQ.json","view_paper":"https://pith.science/paper/D75M5TPV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2601.17957&json=true","fetch_graph":"https://pith.science/api/pith-number/D75M5TPVNQDTLXRVGYSXD2CGCQ/graph.json","fetch_events":"https://pith.science/api/pith-number/D75M5TPVNQDTLXRVGYSXD2CGCQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/D75M5TPVNQDTLXRVGYSXD2CGCQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/D75M5TPVNQDTLXRVGYSXD2CGCQ/action/storage_attestation","attest_author":"https://pith.science/pith/D75M5TPVNQDTLXRVGYSXD2CGCQ/action/author_attestation","sign_citation":"https://pith.science/pith/D75M5TPVNQDTLXRVGYSXD2CGCQ/action/citation_signature","submit_replication":"https://pith.science/pith/D75M5TPVNQDTLXRVGYSXD2CGCQ/action/replication_record"}},"created_at":"2026-06-09T01:05:46.766696+00:00","updated_at":"2026-06-09T01:05:46.766696+00:00"}