{"as_of":"2026-08-08T05:10:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:37bd1e532cd3b4f7d0b4aa226a7d90ddce89d59d2bfa86d0ab2d54d441a4df72","coverage":[{"denominator":43,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":43,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-03T08:20:28.292304Z","state":"measured"},{"denominator":47,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":47,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-07T06:34:17.273281+00:00","state":"measured"},{"denominator":4,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":4,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-02T07:44:30.568567Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-05-12T00:31:17.100028Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2601.17957","last_updated":"2026-07-25T13:03:38Z","snapshot_observed_at":"2026-08-03T08:20:21.550284Z","submitted_at":"2026-01-25T19:18:27Z","title":"Moded Types for Grassroots Logic Programs, by AI, for AI (Full Version)","version":5},"cited_work":{"arxiv_id":"2601.17957","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2601.17957","snapshot_observed_at":"2026-06-09T02:06:11.750177Z","title":"Types for grassroots logic programs.arXiv preprint arXiv:2601.17957","venue":null,"work_id":"106269f9-f833-45af-bcd3-d18b80eec8eb","year":null},"citing_paper":{"arxiv_id":"2604.25596","last_updated":"2026-07-04T10:24:56Z","snapshot_observed_at":"2026-07-12T18:11:15.020131Z","submitted_at":"2026-04-28T13:02:49Z","title":"Volition-Guarded Multiagent Atomic Transactions: Describing People and their Machines","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-05-07T15:13:17.088491Z"},"links":{"cited_paper":"/paper/2601.17957","citing_paper":"/paper/2604.25596"},"observation_digest":"sha256:b9fa839fc48bc0e656d987688c37b61705092d5d22630c2737456ef488241417","observation_id":"4385c418-8188-4b2d-8f21-1e4f34b48f76","resolution":{"observed_at":"2026-06-09T02:06:11.750177Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2601.17957","last_updated":"2026-07-25T13:03:38Z","snapshot_observed_at":"2026-08-03T08:20:21.550284Z","submitted_at":"2026-01-25T19:18:27Z","title":"Moded Types for Grassroots Logic Programs, by AI, for AI (Full Version)","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2601.17957","snapshot_observed_at":"2026-07-12T18:11:17.044928Z","title":"Types for grassroots logic programs.arXiv preprint arXiv:2601.17957,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2604.25596","last_updated":"2026-07-04T10:24:56Z","snapshot_observed_at":"2026-07-12T18:11:15.020131Z","submitted_at":"2026-04-28T13:02:49Z","title":"Volition-Guarded Multiagent Atomic Transactions: Describing People and their Machines","version":2},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-07-12T18:11:17.044928Z"},"links":{"cited_paper":"/paper/2601.17957","citing_paper":"/paper/2604.25596"},"observation_digest":"sha256:b1ff23b8a80c459ba544bf5b0f0c93fbfc233f8d215a96ee48d9de69fd453013","observation_id":"deb17ea5-ca02-47ce-97b1-e427ed92dd02","resolution":{"observed_at":"2026-07-12T18:11:17.044928Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2601.17957","last_updated":"2026-07-25T13:03:38Z","snapshot_observed_at":"2026-08-03T08:20:21.550284Z","submitted_at":"2026-01-25T19:18:27Z","title":"Moded Types for Grassroots Logic Programs, by AI, for AI (Full Version)","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2601.17957","snapshot_observed_at":"2026-08-02T07:44:30.568567Z","title":"Types for grassroots logic programs (full version).arXiv preprint arXiv:2601.17957, 2026","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.14138","last_updated":"2026-07-10T14:43:30Z","snapshot_observed_at":"2026-08-06T14:19:15.363607Z","submitted_at":"2026-07-10T14:43:30Z","title":"Volition Elicitation: Operational Semantics for People and Their Machines","version":1},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-02T07:44:30.568567Z"},"links":{"cited_paper":"/paper/2601.17957","citing_paper":"/paper/2607.14138"},"observation_digest":"sha256:bcc4c1a4c28888658d25716c79623f04b0c2857771725cb98e333347976b8964","observation_id":"c9450165-1260-4f55-9116-3e4ff360cd50","resolution":{"observed_at":"2026-08-02T07:44:30.568567Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2601.17957","last_updated":"2026-07-25T13:03:38Z","snapshot_observed_at":"2026-08-03T08:20:21.550284Z","submitted_at":"2026-01-25T19:18:27Z","title":"Moded Types for Grassroots Logic Programs, by AI, for AI (Full Version)","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2601.17957","snapshot_observed_at":"2026-08-01T08:19:39.261599Z","title":"arXiv preprint arXiv:2601.17957","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.21189","last_updated":"2026-07-23T11:16:12Z","snapshot_observed_at":"2026-08-07T06:39:55.154979Z","submitted_at":"2026-07-23T11:16:12Z","title":"GLP: A Grassroots, Multiagent, Concurrent, Logic Programming Language for AI","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-01T08:19:39.261599Z"},"links":{"cited_paper":"/paper/2601.17957","citing_paper":"/paper/2607.21189"},"observation_digest":"sha256:1bf3c61634d9fb0d3a40a93d3b3f93d1d406323ea90b391e0af6678b1b53355f","observation_id":"ebe2d940-3a09-4f4a-aa62-76f83667cee2","resolution":{"observed_at":"2026-08-01T08:19:39.261599Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2601.17957/citation-record","integrity":"/paper/2601.17957/integrity","json":"/paper/2601.17957/citation-record.json","paper":"/paper/2601.17957"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T08:20:23.176918Z","title":"Baker and Carl Hewitt","venue":null,"work_id":null,"year":1977},"citing_paper":{"arxiv_id":"2601.17957","last_updated":"2026-07-25T13:03:38Z","snapshot_observed_at":"2026-08-03T08:20:21.550284Z","submitted_at":"2026-01-25T19:18:27Z","title":"Moded Types for Grassroots Logic Programs, by AI, for AI (Full Version)","version":5},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-03T08:20:23.176918Z"},"links":{"citing_paper":"/paper/2601.17957"},"observation_digest":"sha256:5560e941f0bea9daf4a3f3b4f658342b4e5773a5f9947d4ea7eff03a6c39b76f","observation_id":"f9d3bfe4-f7b8-419a-af66-e78fce173f55","resolution":{"observed_at":"2026-08-03T08:20:23.176918Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T08:20:23.325105Z","title":"Manifest sharing with session types","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2601.17957","last_updated":"2026-07-25T13:03:38Z","snapshot_observed_at":"2026-08-03T08:20:21.550284Z","submitted_at":"2026-01-25T19:18:27Z","title":"Moded Types for Grassroots Logic Programs, by AI, for AI (Full Version)","version":5},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-03T08:20:23.325105Z"},"links":{"citing_paper":"/paper/2601.17957"},"observation_digest":"sha256:4349eec458cf851c7149130507a1727f020d0056536fe3b4974d2fff32d93f75","observation_id":"6417b4e6-e1cc-40c6-a29e-be89074d0a0a","resolution":{"observed_at":"2026-08-03T08:20:23.325105Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T08:20:23.490877Z","title":"Statically contextu- alizing large language models with typed holes","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2601.17957","last_updated":"2026-07-25T13:03:38Z","snapshot_observed_at":"2026-08-03T08:20:21.550284Z","submitted_at":"2026-01-25T19:18:27Z","title":"Moded Types for Grassroots Logic Programs, by AI, for AI (Full Version)","version":5},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-03T08:20:23.490877Z"},"links":{"citing_paper":"/paper/2601.17957"},"observation_digest":"sha256:cfc23f3a3392a83ee7ad546ea1d27bb7c3c283d17483aaa3c6508a62c43cb657","observation_id":"1d90bde2-ec9a-4745-b25e-0fc7832e7da3","resolution":{"observed_at":"2026-08-03T08:20:23.490877Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T08:20:23.673633Z","title":"Manning Publications, 2017","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2601.17957","last_updated":"2026-07-25T13:03:38Z","snapshot_observed_at":"2026-08-03T08:20:21.550284Z","submitted_at":"2026-01-25T19:18:27Z","title":"Moded Types for Grassroots Logic Programs, by AI, for AI (Full Version)","version":5},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-03T08:20:23.673633Z"},"links":{"citing_paper":"/paper/2601.17957"},"observation_digest":"sha256:92dbe53ff44272fb7d04f138f75d0eb0d45321aa01e9cdbf50bde44b9c7c20d8","observation_id":"19ddac30-db2d-469f-8ca6-fa244e9aebd3","resolution":{"observed_at":"2026-08-03T08:20:23.673633Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T08:20:23.802400Z","title":"On understanding types, data abstraction, and polymorphism.Computing Surveys, 17(4):471–523, 1985","venue":null,"work_id":null,"year":1985},"citing_paper":{"arxiv_id":"2601.17957","last_updated":"2026-07-25T13:03:38Z","snapshot_observed_at":"2026-08-03T08:20:21.550284Z","submitted_at":"2026-01-25T19:18:27Z","title":"Moded Types for Grassroots Logic Programs, by AI, for AI (Full Version)","version":5},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-03T08:20:23.802400Z"},"links":{"citing_paper":"/paper/2601.17957"},"observation_digest":"sha256:d1f89673a55a87c525bf51af939a3628b43e2354e6182effbfd3c10975cd7704","observation_id":"41ca6742-ce8d-48f5-9616-97f84a987f87","resolution":{"observed_at":"2026-08-03T08:20:23.802400Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T08:20:23.903796Z","title":"Colf logic programming as infinitary proof exploration.arXiv preprint arXiv:2510.12302, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2601.17957","last_updated":"2026-07-25T13:03:38Z","snapshot_observed_at":"2026-08-03T08:20:21.550284Z","submitted_at":"2026-01-25T19:18:27Z","title":"Moded Types for Grassroots Logic Programs, by AI, for AI (Full Version)","version":5},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-03T08:20:23.903796Z"},"links":{"citing_paper":"/paper/2601.17957"},"observation_digest":"sha256:3ac9218afca15b1d8f7e7f966c5d9715b5e787d3dff9bd49cd90d324b1e37b65","observation_id":"4c8bfe3c-3e1d-4b99-8902-3b91a940205c","resolution":{"observed_at":"2026-08-03T08:20:23.903796Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T08:20:24.002223Z","title":"Parlog: parallel programming in logic.ACM Transactions on Programming Languages and Systems (TOPLAS), 8(1):1–49, 1986","venue":null,"work_id":null,"year":1986},"citing_paper":{"arxiv_id":"2601.17957","last_updated":"2026-07-25T13:03:38Z","snapshot_observed_at":"2026-08-03T08:20:21.550284Z","submitted_at":"2026-01-25T19:18:27Z","title":"Moded Types for Grassroots Logic Programs, by AI, for AI (Full Version)","version":5},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-03T08:20:24.002223Z"},"links":{"citing_paper":"/paper/2601.17957"},"observation_digest":"sha256:30f5b4aa0407de97ed5e41cf682695a501cbbe4570b56711daf4faeb1b8a2d76","observation_id":"f98a2afa-629d-41a5-add4-6afdfc8b7bee","resolution":{"observed_at":"2026-08-03T08:20:24.002223Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T08:20:24.113250Z","title":null,"venue":null,"work_id":null,"year":1993},"citing_paper":{"arxiv_id":"2601.17957","last_updated":"2026-07-25T13:03:38Z","snapshot_observed_at":"2026-08-03T08:20:21.550284Z","submitted_at":"2026-01-25T19:18:27Z","title":"Moded Types for Grassroots Logic Programs, by AI, for AI (Full Version)","version":5},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-03T08:20:24.113250Z"},"links":{"citing_paper":"/paper/2601.17957"},"observation_digest":"sha256:45612d35bbf90c9f72fdd52f34c40497a0c8d054235216e211420454a6fbaa40","observation_id":"c57c4fd5-e00e-4ba6-b1b1-f54cbbf1d25c","resolution":{"observed_at":"2026-08-03T08:20:24.113250Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T08:20:24.216745Z","title":"Understanding spec-driven-development: Kiro, spec-kit, and tessl.MartinFowler.com, October 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2601.17957","last_updated":"2026-07-25T13:03:38Z","snapshot_observed_at":"2026-08-03T08:20:21.550284Z","submitted_at":"2026-01-25T19:18:27Z","title":"Moded Types for Grassroots Logic Programs, by AI, for AI (Full Version)","version":5},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-03T08:20:24.216745Z"},"links":{"citing_paper":"/paper/2601.17957"},"observation_digest":"sha256:e661066dde0d023e5652ef99efd2fc1d5178af0028a3d429f051f44b9368d4ea","observation_id":"c7f73ed7-8efb-4988-b22f-cee42d7a9151","resolution":{"observed_at":"2026-08-03T08:20:24.216745Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T08:20:24.333745Z","title":"Friedman and David S","venue":null,"work_id":null,"year":1976},"citing_paper":{"arxiv_id":"2601.17957","last_updated":"2026-07-25T13:03:38Z","snapshot_observed_at":"2026-08-03T08:20:21.550284Z","submitted_at":"2026-01-25T19:18:27Z","title":"Moded Types for Grassroots Logic Programs, by AI, for AI (Full Version)","version":5},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-03T08:20:24.333745Z"},"links":{"citing_paper":"/paper/2601.17957"},"observation_digest":"sha256:4f3e5187ef70f9c7c91ed5d8a20d7c6904665c736669c350cc6bc6b0e1ec7bfa","observation_id":"e96c80df-a95b-4cc2-babd-fc9cfa871678","resolution":{"observed_at":"2026-08-03T08:20:24.333745Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T08:20:24.405536Z","title":"Vardi, and Eyal Yardeni","venue":null,"work_id":null,"year":1991},"citing_paper":{"arxiv_id":"2601.17957","last_updated":"2026-07-25T13:03:38Z","snapshot_observed_at":"2026-08-03T08:20:21.550284Z","submitted_at":"2026-01-25T19:18:27Z","title":"Moded Types for Grassroots Logic Programs, by AI, for AI (Full Version)","version":5},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-03T08:20:24.405536Z"},"links":{"citing_paper":"/paper/2601.17957"},"observation_digest":"sha256:55201c1ab3bc2d8dc6fcfe2569d86a8185ac7bc8ed0f5a6dbd19cde1e386d683","observation_id":"17259cb6-a3d6-4378-b3c7-a1e61d177067","resolution":{"observed_at":"2026-08-03T08:20:24.405536Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T08:20:24.517465Z","title":"Fully abstract compositional semantics for logic programs","venue":null,"work_id":null,"year":1989},"citing_paper":{"arxiv_id":"2601.17957","last_updated":"2026-07-25T13:03:38Z","snapshot_observed_at":"2026-08-03T08:20:21.550284Z","submitted_at":"2026-01-25T19:18:27Z","title":"Moded Types for Grassroots Logic Programs, by AI, for AI (Full Version)","version":5},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-03T08:20:24.517465Z"},"links":{"citing_paper":"/paper/2601.17957"},"observation_digest":"sha256:5caabb81066c151ec154781363829cbd2f3f4679c9ef0d08907dca96f0e5e9ca","observation_id":"e077c3ab-72d4-4400-9ecf-c2c986daa36a","resolution":{"observed_at":"2026-08-03T08:20:24.517465Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T08:20:24.594319Z","title":"Subtyping for session types in the pi calculus","venue":null,"work_id":null,"year":2005},"citing_paper":{"arxiv_id":"2601.17957","last_updated":"2026-07-25T13:03:38Z","snapshot_observed_at":"2026-08-03T08:20:21.550284Z","submitted_at":"2026-01-25T19:18:27Z","title":"Moded Types for Grassroots Logic Programs, by AI, for AI (Full Version)","version":5},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-03T08:20:24.594319Z"},"links":{"citing_paper":"/paper/2601.17957"},"observation_digest":"sha256:5e51b7f4212d0faa8488d7c0c924b35ac1155212c0b13f43096b71b0f631b81f","observation_id":"5bfef20c-1c70-4f79-bfd9-9fbcedae79c4","resolution":{"observed_at":"2026-08-03T08:20:24.594319Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T08:20:24.760778Z","title":"Linear logic.Theoretical Computer Science, 50(1):1–101, 1987","venue":null,"work_id":null,"year":1987},"citing_paper":{"arxiv_id":"2601.17957","last_updated":"2026-07-25T13:03:38Z","snapshot_observed_at":"2026-08-03T08:20:21.550284Z","submitted_at":"2026-01-25T19:18:27Z","title":"Moded Types for Grassroots Logic Programs, by AI, for AI (Full Version)","version":5},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-03T08:20:24.760778Z"},"links":{"citing_paper":"/paper/2601.17957"},"observation_digest":"sha256:6920a2c65d980985fd2168f1442d4009d6887c8f2cbe9a3f83e3d20bdc7da8c0","observation_id":"eb9a6085-041a-4b64-9fc7-352fb20af3e8","resolution":{"observed_at":"2026-08-03T08:20:24.760778Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T08:20:24.869174Z","title":"Dart programming language","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2601.17957","last_updated":"2026-07-25T13:03:38Z","snapshot_observed_at":"2026-08-03T08:20:21.550284Z","submitted_at":"2026-01-25T19:18:27Z","title":"Moded Types for Grassroots Logic Programs, by AI, for AI (Full Version)","version":5},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-03T08:20:24.869174Z"},"links":{"citing_paper":"/paper/2601.17957"},"observation_digest":"sha256:a191976f6386f6b8053b20c09ef45960e38b48a3610f143eddcd093db804a250","observation_id":"6383b719-18a8-4d28-8128-6b758520e722","resolution":{"observed_at":"2026-08-03T08:20:24.869174Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T08:20:24.942950Z","title":"Types for dyadic interaction","venue":null,"work_id":null,"year":1993},"citing_paper":{"arxiv_id":"2601.17957","last_updated":"2026-07-25T13:03:38Z","snapshot_observed_at":"2026-08-03T08:20:21.550284Z","submitted_at":"2026-01-25T19:18:27Z","title":"Moded Types for Grassroots Logic Programs, by AI, for AI (Full Version)","version":5},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-03T08:20:24.942950Z"},"links":{"citing_paper":"/paper/2601.17957"},"observation_digest":"sha256:091bcc88bbc4ecf69c9017a4ea034e4ad9b47352f52e355c1d0095d29ec22e59","observation_id":"6b2ebdff-f7a2-424e-9061-6a2a24862f6b","resolution":{"observed_at":"2026-08-03T08:20:24.942950Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T08:20:25.017811Z","title":null,"venue":null,"work_id":null,"year":1984},"citing_paper":{"arxiv_id":"2601.17957","last_updated":"2026-07-25T13:03:38Z","snapshot_observed_at":"2026-08-03T08:20:21.550284Z","submitted_at":"2026-01-25T19:18:27Z","title":"Moded Types for Grassroots Logic Programs, by AI, for AI (Full Version)","version":5},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-03T08:20:25.017811Z"},"links":{"citing_paper":"/paper/2601.17957"},"observation_digest":"sha256:9baf5504c8da3c4373e78f7c7356b40f6b1c4fcb34f10351a02d44991c076d75","observation_id":"16d786e0-09dc-46f4-a6ad-b58d8029e10a","resolution":{"observed_at":"2026-08-03T08:20:25.017811Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T08:20:25.124972Z","title":"Interaction nets","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2601.17957","last_updated":"2026-07-25T13:03:38Z","snapshot_observed_at":"2026-08-03T08:20:21.550284Z","submitted_at":"2026-01-25T19:18:27Z","title":"Moded Types for Grassroots Logic Programs, by AI, for AI (Full Version)","version":5},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-03T08:20:25.124972Z"},"links":{"citing_paper":"/paper/2601.17957"},"observation_digest":"sha256:ed8b49a40c25a42170b7e456f42131a38f6f4173f5ead383a9392ef08295e06f","observation_id":"b0f643ae-f612-43fd-a2a2-d3009491d2ae","resolution":{"observed_at":"2026-08-03T08:20:25.124972Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T08:20:25.274793Z","title":"The semantics of the read-only variable","venue":null,"work_id":null,"year":1985},"citing_paper":{"arxiv_id":"2601.17957","last_updated":"2026-07-25T13:03:38Z","snapshot_observed_at":"2026-08-03T08:20:21.550284Z","submitted_at":"2026-01-25T19:18:27Z","title":"Moded Types for Grassroots Logic Programs, by AI, for AI (Full Version)","version":5},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-03T08:20:25.274793Z"},"links":{"citing_paper":"/paper/2601.17957"},"observation_digest":"sha256:59fe3b0c740ca22251ab5927a5a5b917343048086dd020cb2a73f9f9fbe9fe31","observation_id":"f390c2ae-5f85-483c-98e8-1f1164040422","resolution":{"observed_at":"2026-08-03T08:20:25.274793Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T08:20:25.357436Z","title":"Prentice Hall, 2nd edition,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2601.17957","last_updated":"2026-07-25T13:03:38Z","snapshot_observed_at":"2026-08-03T08:20:21.550284Z","submitted_at":"2026-01-25T19:18:27Z","title":"Moded Types for Grassroots Logic Programs, by AI, for AI (Full Version)","version":5},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-03T08:20:25.357436Z"},"links":{"citing_paper":"/paper/2601.17957"},"observation_digest":"sha256:a8ed597ac92bb227e6b136f2ad2d36abb00bfd72faf8b79e01fc17b4ea7b3893","observation_id":"f2e2a18c-0838-4917-9059-4037db91968a","resolution":{"observed_at":"2026-08-03T08:20:25.357436Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T08:20:25.731758Z","title":"Mierowsky, S","venue":null,"work_id":null,"year":1985},"citing_paper":{"arxiv_id":"2601.17957","last_updated":"2026-07-25T13:03:38Z","snapshot_observed_at":"2026-08-03T08:20:21.550284Z","submitted_at":"2026-01-25T19:18:27Z","title":"Moded Types for Grassroots Logic Programs, by AI, for AI (Full Version)","version":5},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-03T08:20:25.731758Z"},"links":{"citing_paper":"/paper/2601.17957"},"observation_digest":"sha256:474e1c780c8d860d5936e08f27252302acf18e0ab36f32397830e2d02936f5c4","observation_id":"b5497497-9d84-4384-9884-5e4758f4a3cf","resolution":{"observed_at":"2026-08-03T08:20:25.731758Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T08:20:25.821650Z","title":"Cambridge University Press, 1999","venue":null,"work_id":null,"year":1999},"citing_paper":{"arxiv_id":"2601.17957","last_updated":"2026-07-25T13:03:38Z","snapshot_observed_at":"2026-08-03T08:20:21.550284Z","submitted_at":"2026-01-25T19:18:27Z","title":"Moded Types for Grassroots Logic Programs, by AI, for AI (Full Version)","version":5},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-03T08:20:25.821650Z"},"links":{"citing_paper":"/paper/2601.17957"},"observation_digest":"sha256:bdfdf7dc6c114facdcd1827bdc8ca7cdd813e83574831f99bf508c103c702a55","observation_id":"1d5258de-0dc1-46b7-a5d9-6f55ba7c08da","resolution":{"observed_at":"2026-08-03T08:20:25.821650Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T08:20:25.870335Z","title":"Towards a theory of types in prolog","venue":null,"work_id":null,"year":1984},"citing_paper":{"arxiv_id":"2601.17957","last_updated":"2026-07-25T13:03:38Z","snapshot_observed_at":"2026-08-03T08:20:21.550284Z","submitted_at":"2026-01-25T19:18:27Z","title":"Moded Types for Grassroots Logic Programs, by AI, for AI (Full Version)","version":5},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-03T08:20:25.870335Z"},"links":{"citing_paper":"/paper/2601.17957"},"observation_digest":"sha256:9f4870ea49f370d153cdc803fc8c5da74e6a6a91c68bdc796914a51b07a9b7de","observation_id":"de1d6f1e-319d-434e-8fdb-4a8f9ced886f","resolution":{"observed_at":"2026-08-03T08:20:25.870335Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T08:20:25.992534Z","title":"Type-constrained code generation with language models","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2601.17957","last_updated":"2026-07-25T13:03:38Z","snapshot_observed_at":"2026-08-03T08:20:21.550284Z","submitted_at":"2026-01-25T19:18:27Z","title":"Moded Types for Grassroots Logic Programs, by AI, for AI (Full Version)","version":5},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-03T08:20:25.992534Z"},"links":{"citing_paper":"/paper/2601.17957"},"observation_digest":"sha256:55e450cc76ff0b070e1d3a77e936d5bbc9fdc812ecb632c46030a3060c472803","observation_id":"cbb43af9-5433-4df9-8213-fb4b4c966efe","resolution":{"observed_at":"2026-08-03T08:20:25.992534Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T08:20:26.277414Z","title":null,"venue":null,"work_id":null,"year":1984},"citing_paper":{"arxiv_id":"2601.17957","last_updated":"2026-07-25T13:03:38Z","snapshot_observed_at":"2026-08-03T08:20:21.550284Z","submitted_at":"2026-01-25T19:18:27Z","title":"Moded Types for Grassroots Logic Programs, by AI, for AI (Full Version)","version":5},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-03T08:20:26.277414Z"},"links":{"citing_paper":"/paper/2601.17957"},"observation_digest":"sha256:4ea09d41348fdb67f7a2c62d922c6f4347d695094710002d280f951e1013f3ce","observation_id":"c1ea1bf9-fe24-4ce6-83a6-dffdc05cbb2c","resolution":{"observed_at":"2026-08-03T08:20:26.277414Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T08:20:26.365169Z","title":"Pierce.Types and Programming Languages","venue":null,"work_id":null,"year":2002},"citing_paper":{"arxiv_id":"2601.17957","last_updated":"2026-07-25T13:03:38Z","snapshot_observed_at":"2026-08-03T08:20:21.550284Z","submitted_at":"2026-01-25T19:18:27Z","title":"Moded Types for Grassroots Logic Programs, by AI, for AI (Full Version)","version":5},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-03T08:20:26.365169Z"},"links":{"citing_paper":"/paper/2601.17957"},"observation_digest":"sha256:715447f34ddf7f33988693d5027de56e271ce747494f09ae50bdb6d34a5de569","observation_id":"477ba343-5f1f-40e0-913e-c6537386f53b","resolution":{"observed_at":"2026-08-03T08:20:26.365169Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T08:20:26.441012Z","title":"Saraswat, Kenneth M","venue":null,"work_id":null,"year":1990},"citing_paper":{"arxiv_id":"2601.17957","last_updated":"2026-07-25T13:03:38Z","snapshot_observed_at":"2026-08-03T08:20:21.550284Z","submitted_at":"2026-01-25T19:18:27Z","title":"Moded Types for Grassroots Logic Programs, by AI, for AI (Full Version)","version":5},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-03T08:20:26.441012Z"},"links":{"citing_paper":"/paper/2601.17957"},"observation_digest":"sha256:267c3c1f6b3543f1fa0bb93558a50ec653543eba158e0b53e7492130a161fd81","observation_id":"b7f8c177-3943-4712-8b03-63ecc4bf258b","resolution":{"observed_at":"2026-08-03T08:20:26.441012Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T08:20:26.535162Z","title":"A subset of concurrent prolog and its interpreter.ICOT Technical Report, TR-003, 1983","venue":null,"work_id":null,"year":1983},"citing_paper":{"arxiv_id":"2601.17957","last_updated":"2026-07-25T13:03:38Z","snapshot_observed_at":"2026-08-03T08:20:21.550284Z","submitted_at":"2026-01-25T19:18:27Z","title":"Moded Types for Grassroots Logic Programs, by AI, for AI (Full Version)","version":5},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-03T08:20:26.535162Z"},"links":{"citing_paper":"/paper/2601.17957"},"observation_digest":"sha256:174c6b2ef9cba5d38d87a55dcfbf068b1fd5abf0c1598bcb415aea9df50d97d4","observation_id":"2c29b734-eeb9-4f44-8947-3855221667d6","resolution":{"observed_at":"2026-08-03T08:20:26.535162Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T08:20:26.657583Z","title":"The family of concurrent logic programming languages.ACM Computing Surveys (CSUR), 21(3):413–510, 1989","venue":null,"work_id":null,"year":1989},"citing_paper":{"arxiv_id":"2601.17957","last_updated":"2026-07-25T13:03:38Z","snapshot_observed_at":"2026-08-03T08:20:21.550284Z","submitted_at":"2026-01-25T19:18:27Z","title":"Moded Types for Grassroots Logic Programs, by AI, for AI (Full Version)","version":5},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-03T08:20:26.657583Z"},"links":{"citing_paper":"/paper/2601.17957"},"observation_digest":"sha256:0b041e6e59ab2ec01371ec04b19f0cd16794b9de88b9515ac45b5d0ca29b4c3f","observation_id":"6a547098-8574-426d-aa1f-80b53c0eb6e5","resolution":{"observed_at":"2026-08-03T08:20:26.657583Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T08:20:26.797684Z","title":"Grassroots distributed systems: Concept, examples, implementa- tion and applications (brief announcement)","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2601.17957","last_updated":"2026-07-25T13:03:38Z","snapshot_observed_at":"2026-08-03T08:20:21.550284Z","submitted_at":"2026-01-25T19:18:27Z","title":"Moded Types for Grassroots Logic Programs, by AI, for AI (Full Version)","version":5},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-03T08:20:26.797684Z"},"links":{"citing_paper":"/paper/2601.17957"},"observation_digest":"sha256:4b0de326a7f55e837e4698b6791e492124b04be3983809c2422ae6eb0260a967","observation_id":"1841542b-b435-4dbd-b3d1-b6a6be29bd64","resolution":{"observed_at":"2026-08-03T08:20:26.797684Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2510.15747","last_updated":"2026-07-02T20:41:11Z","snapshot_observed_at":"2026-08-04T09:24:49.755541Z","submitted_at":"2025-10-17T15:34:27Z","title":"GLP: A Grassroots, Multiagent, Concurrent, Logic Programming Language for AI (Full Version)","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2510.15747","snapshot_observed_at":"2026-08-03T08:20:26.934228Z","title":"Glp: A grassroots, multiagent, concurrent, logic programming language.arXiv preprint arXiv:2510.15747, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2601.17957","last_updated":"2026-07-25T13:03:38Z","snapshot_observed_at":"2026-08-03T08:20:21.550284Z","submitted_at":"2026-01-25T19:18:27Z","title":"Moded Types for Grassroots Logic Programs, by AI, for AI (Full Version)","version":5},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-03T08:20:26.934228Z"},"links":{"cited_paper":"/paper/2510.15747","citing_paper":"/paper/2601.17957"},"observation_digest":"sha256:c9aafbb9f3e692a358e500e95297c8a5eae1118fa48d5e2467e40a893e0100ba","observation_id":"b68b0bde-d7ea-43bc-a0a4-fa2a6b8573d3","resolution":{"observed_at":"2026-08-03T08:20:26.934228Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T08:20:27.085913Z","title":"Grassroots platforms with atomic transactions: Social graphs, cryptocurrencies, and democratic federations","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2601.17957","last_updated":"2026-07-25T13:03:38Z","snapshot_observed_at":"2026-08-03T08:20:21.550284Z","submitted_at":"2026-01-25T19:18:27Z","title":"Moded Types for Grassroots Logic Programs, by AI, for AI (Full Version)","version":5},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-03T08:20:27.085913Z"},"links":{"citing_paper":"/paper/2601.17957"},"observation_digest":"sha256:08349b2b6bc067f97109e6cfcbfa44c1dc38d0b19feffbb5414954ad6787ca4d","observation_id":"966ffbcc-bf50-4e28-b02b-b0c83b5e837d","resolution":{"observed_at":"2026-08-03T08:20:27.085913Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T08:20:27.222115Z","title":"The execution algo- rithm of mercury: An efficient purely declarative logic programming language","venue":null,"work_id":null,"year":1996},"citing_paper":{"arxiv_id":"2601.17957","last_updated":"2026-07-25T13:03:38Z","snapshot_observed_at":"2026-08-03T08:20:21.550284Z","submitted_at":"2026-01-25T19:18:27Z","title":"Moded Types for Grassroots Logic Programs, by AI, for AI (Full Version)","version":5},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-03T08:20:27.222115Z"},"links":{"citing_paper":"/paper/2601.17957"},"observation_digest":"sha256:95657e2d266fdb042bc7e1a2dd2cd99ef62f3cd50966cff4939ddf2c0aeda0f7","observation_id":"cb57a35d-27c5-405a-acb3-955ca2e253e4","resolution":{"observed_at":"2026-08-03T08:20:27.222115Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T08:20:27.339807Z","title":"The deevolution of concurrent logic programming languages.The Journal of Logic Programming, 23(2):89–123, 1995","venue":null,"work_id":null,"year":1995},"citing_paper":{"arxiv_id":"2601.17957","last_updated":"2026-07-25T13:03:38Z","snapshot_observed_at":"2026-08-03T08:20:21.550284Z","submitted_at":"2026-01-25T19:18:27Z","title":"Moded Types for Grassroots Logic Programs, by AI, for AI (Full Version)","version":5},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-03T08:20:27.339807Z"},"links":{"citing_paper":"/paper/2601.17957"},"observation_digest":"sha256:e605e7a846c0341d488e926517a5ec90ba11c9c3dd8a1441322c1b4483024408","observation_id":"77109d42-5505-4367-8349-a9a8099dd980","resolution":{"observed_at":"2026-08-03T08:20:27.339807Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T08:20:27.460964Z","title":"Guarded horn clauses","venue":null,"work_id":null,"year":1986},"citing_paper":{"arxiv_id":"2601.17957","last_updated":"2026-07-25T13:03:38Z","snapshot_observed_at":"2026-08-03T08:20:21.550284Z","submitted_at":"2026-01-25T19:18:27Z","title":"Moded Types for Grassroots Logic Programs, by AI, for AI (Full Version)","version":5},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-03T08:20:27.460964Z"},"links":{"citing_paper":"/paper/2601.17957"},"observation_digest":"sha256:32b43a5c55f327b7067a42b29d97f4bdc0df959ac7c026fde550f89ca6b49bab","observation_id":"75a92efd-f463-4012-b4b1-f51b2df1604f","resolution":{"observed_at":"2026-08-03T08:20:27.460964Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T08:20:27.592933Z","title":"Moded flat ghc and its message-oriented implementation tech- nique.New Generation Computing, 12(4):337–368, 1994","venue":null,"work_id":null,"year":1994},"citing_paper":{"arxiv_id":"2601.17957","last_updated":"2026-07-25T13:03:38Z","snapshot_observed_at":"2026-08-03T08:20:21.550284Z","submitted_at":"2026-01-25T19:18:27Z","title":"Moded Types for Grassroots Logic Programs, by AI, for AI (Full Version)","version":5},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-03T08:20:27.592933Z"},"links":{"citing_paper":"/paper/2601.17957"},"observation_digest":"sha256:429006e10054eb4ff68573081702eeb45decdd4c2cc291bfd14229976d12a9c0","observation_id":"ebd00caa-b28f-4ed3-a07a-ba35beed0d08","resolution":{"observed_at":"2026-08-03T08:20:27.592933Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T08:20:27.755273Z","title":"Resource-passing concurrent programming.Proceedings of TACS 2001, pages 95–126, 2001","venue":null,"work_id":null,"year":2001},"citing_paper":{"arxiv_id":"2601.17957","last_updated":"2026-07-25T13:03:38Z","snapshot_observed_at":"2026-08-03T08:20:21.550284Z","submitted_at":"2026-01-25T19:18:27Z","title":"Moded Types for Grassroots Logic Programs, by AI, for AI (Full Version)","version":5},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-03T08:20:27.755273Z"},"links":{"citing_paper":"/paper/2601.17957"},"observation_digest":"sha256:8c9f3fdd4d391315f2e3b9cd24ad65c27cf7cd9e4664898cc5a7b859c03673c7","observation_id":"c4f9ffc2-d111-423b-b652-2a9d2aea86e6","resolution":{"observed_at":"2026-08-03T08:20:27.755273Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T08:20:27.954601Z","title":"I/o mode analysis in concurrent logic pro- gramming","venue":null,"work_id":null,"year":1995},"citing_paper":{"arxiv_id":"2601.17957","last_updated":"2026-07-25T13:03:38Z","snapshot_observed_at":"2026-08-03T08:20:21.550284Z","submitted_at":"2026-01-25T19:18:27Z","title":"Moded Types for Grassroots Logic Programs, by AI, for AI (Full Version)","version":5},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-03T08:20:27.954601Z"},"links":{"citing_paper":"/paper/2601.17957"},"observation_digest":"sha256:5736a32acb6256bb19bc9c981986fb452a349f8a4d8ec40663864820d9d5ce43","observation_id":"839f4b42-513f-4c29-9a20-27c2f2a0cbca","resolution":{"observed_at":"2026-08-03T08:20:27.954601Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T08:20:28.082463Z","title":"Propositions as sessions","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2601.17957","last_updated":"2026-07-25T13:03:38Z","snapshot_observed_at":"2026-08-03T08:20:21.550284Z","submitted_at":"2026-01-25T19:18:27Z","title":"Moded Types for Grassroots Logic Programs, by AI, for AI (Full Version)","version":5},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-03T08:20:28.082463Z"},"links":{"citing_paper":"/paper/2601.17957"},"observation_digest":"sha256:a4485eab1f166afff6c24e890ec8c600ba32d304706a3221bcc8ab7c36119a96","observation_id":"94205bd2-7f20-498b-a171-8c5ac9f099f6","resolution":{"observed_at":"2026-08-03T08:20:28.082463Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T08:20:28.213059Z","title":"Polymorphically typed logic pro- grams","venue":null,"work_id":null,"year":1991},"citing_paper":{"arxiv_id":"2601.17957","last_updated":"2026-07-25T13:03:38Z","snapshot_observed_at":"2026-08-03T08:20:21.550284Z","submitted_at":"2026-01-25T19:18:27Z","title":"Moded Types for Grassroots Logic Programs, by AI, for AI (Full Version)","version":5},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-03T08:20:28.213059Z"},"links":{"citing_paper":"/paper/2601.17957"},"observation_digest":"sha256:fa01ebde9cb3cd90a4b31ac131e78dd462efe7d1a70acada80855b426416e1a2","observation_id":"1f30c3d8-7269-423a-a5e2-0f9669b78147","resolution":{"observed_at":"2026-08-03T08:20:28.213059Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T08:20:28.292304Z","title":"\"/2 1: X 2: Xs 2: Ys 3:","venue":null,"work_id":null,"year":1991},"citing_paper":{"arxiv_id":"2601.17957","last_updated":"2026-07-25T13:03:38Z","snapshot_observed_at":"2026-08-03T08:20:21.550284Z","submitted_at":"2026-01-25T19:18:27Z","title":"Moded Types for Grassroots Logic Programs, by AI, for AI (Full Version)","version":5},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-03T08:20:28.292304Z"},"links":{"citing_paper":"/paper/2601.17957"},"observation_digest":"sha256:ad2ddbb3e0985cf752d542e91f39937cd76d0f071123eb9a4f04781dcb87904c","observation_id":"eff40640-b0d1-4202-962f-c3b8b267e6cc","resolution":{"observed_at":"2026-08-03T08:20:28.292304Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T08:20:25.478073Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2601.17957","last_updated":"2026-07-25T13:03:38Z","snapshot_observed_at":"2026-08-03T08:20:21.550284Z","submitted_at":"2026-01-25T19:18:27Z","title":"Moded Types for Grassroots Logic Programs, by AI, for AI (Full Version)","version":5},"reference_index":1997,"source":"pdf_text","source_observed_at":"2026-08-03T08:20:25.478073Z"},"links":{"citing_paper":"/paper/2601.17957"},"observation_digest":"sha256:0815a435c7e94c3dbeac88a0780cd49fd027d37ee3da0b86064f36fa5c55fb7d","observation_id":"e8968b44-2733-4790-ba56-d2b2195be3cb","resolution":{"observed_at":"2026-08-03T08:20:25.478073Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2504.09246","last_updated":"2025-05-08T09:33:40Z","snapshot_observed_at":"2026-08-07T16:06:18.047837Z","submitted_at":"2025-04-12T15:03:00Z","title":"Type-Constrained Code Generation with Language Models","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2504.09246","snapshot_observed_at":"2026-08-03T08:20:26.189626Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2601.17957","last_updated":"2026-07-25T13:03:38Z","snapshot_observed_at":"2026-08-03T08:20:21.550284Z","submitted_at":"2026-01-25T19:18:27Z","title":"Moded Types for Grassroots Logic Programs, by AI, for AI (Full Version)","version":5},"reference_index":2025,"source":"pdf_text","source_observed_at":"2026-08-03T08:20:26.189626Z"},"links":{"cited_paper":"/paper/2504.09246","citing_paper":"/paper/2601.17957"},"observation_digest":"sha256:c53002e4f6e8a6c013dcd7dbb1f4c3b9044e72c47c53d84eb662f9d427e1e268","observation_id":"aee4d875-277e-47e0-be83-ee1c503ea13c","resolution":{"observed_at":"2026-08-03T08:20:26.189626Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2601.17957","last_updated":"2026-07-25T13:03:38Z","latest_version":5,"primary_category":"cs.PL","snapshot_observed_at":"2026-08-03T08:20:21.550284Z","submitted_at":"2026-01-25T19:18:27Z","title":"Moded Types for Grassroots Logic Programs, by AI, for AI (Full Version)"},"reference_resolution":{"displayed":43,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":43,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":43},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"thesis":"As of 8 August 2026, this Paper Citation Record lists 43 of 43 outbound references and 4 inbound Pith citation observations for arXiv:2601.17957."}