{"as_of":"2026-08-20T20:42:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:10493e347ef40f3653392fad61df0f8f87a4f3fae5e5dc311cb640f3b10e1eaf","coverage":[{"denominator":102,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":100,"source":"paper_references, paper_reference_links","source_observed_at":"2026-06-28T11:25:47.093260Z","state":"measured"},{"denominator":100,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":100,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-20T06:33:59.587034+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2606.02926/citation-record","integrity":"/paper/2606.02926/integrity","json":"/paper/2606.02926/citation-record.json","paper":"/paper/2606.02926"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T11:25:47.093260Z","title":"1998 , xnote =","venue":null,"work_id":null,"year":1998},"citing_paper":{"arxiv_id":"2606.02926","last_updated":"2026-06-03T04:16:10Z","snapshot_observed_at":"2026-08-14T03:46:52.069826Z","submitted_at":"2026-06-01T22:05:25Z","title":"Diamonds Are Forever: Stabilization Semantics for Unrestricted Aggregation and Recursion in Logica","version":2},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-06-28T11:25:47.093260Z"},"links":{"citing_paper":"/paper/2606.02926"},"observation_digest":"sha256:03af7b11aeccf96b2b34b13df8f1b052192d47993472a6ceaf2e160c86689a72","observation_id":"9c0db08e-1cb8-4a7a-bb12-93a4efb75e53","resolution":{"observed_at":"2026-06-28T11:25:47.093260Z","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-06-28T11:25:47.093260Z","title":"1988 , publisher=","venue":null,"work_id":null,"year":1988},"citing_paper":{"arxiv_id":"2606.02926","last_updated":"2026-06-03T04:16:10Z","snapshot_observed_at":"2026-08-14T03:46:52.069826Z","submitted_at":"2026-06-01T22:05:25Z","title":"Diamonds Are Forever: Stabilization Semantics for Unrestricted Aggregation and Recursion in Logica","version":2},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-06-28T11:25:47.093260Z"},"links":{"citing_paper":"/paper/2606.02926"},"observation_digest":"sha256:250f701181f1a149dc01f3bf10c25d0efc42ec13bbe6184b546028e1a95d886c","observation_id":"b6c20b30-4594-4db3-a3b0-36c58604f1ef","resolution":{"observed_at":"2026-06-28T11:25:47.093260Z","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-06-28T11:25:47.093260Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.02926","last_updated":"2026-06-03T04:16:10Z","snapshot_observed_at":"2026-08-14T03:46:52.069826Z","submitted_at":"2026-06-01T22:05:25Z","title":"Diamonds Are Forever: Stabilization Semantics for Unrestricted Aggregation and Recursion in Logica","version":2},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-06-28T11:25:47.093260Z"},"links":{"citing_paper":"/paper/2606.02926"},"observation_digest":"sha256:ec26b5e4271d92c74c3cdf3054b2a4f3c00c6b80c16360c9234ce87b0d4515ea","observation_id":"0863b9e0-603a-47f0-b695-ae7604173b62","resolution":{"observed_at":"2026-06-28T11:25:47.093260Z","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-06-28T11:25:47.093260Z","title":"and Ross, K","venue":null,"work_id":null,"year":1991},"citing_paper":{"arxiv_id":"2606.02926","last_updated":"2026-06-03T04:16:10Z","snapshot_observed_at":"2026-08-14T03:46:52.069826Z","submitted_at":"2026-06-01T22:05:25Z","title":"Diamonds Are Forever: Stabilization Semantics for Unrestricted Aggregation and Recursion in Logica","version":2},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-06-28T11:25:47.093260Z"},"links":{"citing_paper":"/paper/2606.02926"},"observation_digest":"sha256:852ccad97ffd6db20c6d436b2ae46b41061b5cae08192292b57c6679b9dc60c4","observation_id":"3f0c5645-edbd-46e9-86db-e0666ea64d66","resolution":{"observed_at":"2026-06-28T11:25:47.093260Z","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-06-28T11:25:47.093260Z","title":"and Lifschitz, V","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.02926","last_updated":"2026-06-03T04:16:10Z","snapshot_observed_at":"2026-08-14T03:46:52.069826Z","submitted_at":"2026-06-01T22:05:25Z","title":"Diamonds Are Forever: Stabilization Semantics for Unrestricted Aggregation and Recursion in Logica","version":2},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-06-28T11:25:47.093260Z"},"links":{"citing_paper":"/paper/2606.02926"},"observation_digest":"sha256:9beb15ca04d4daf725d7f3112d0b140069fbf25e0d13322b3e9ab4f10a011396","observation_id":"0f4c01a0-7533-4cac-a2bb-fb975c1f530a","resolution":{"observed_at":"2026-06-28T11:25:47.093260Z","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-06-28T11:25:47.093260Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.02926","last_updated":"2026-06-03T04:16:10Z","snapshot_observed_at":"2026-08-14T03:46:52.069826Z","submitted_at":"2026-06-01T22:05:25Z","title":"Diamonds Are Forever: Stabilization Semantics for Unrestricted Aggregation and Recursion in Logica","version":2},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-06-28T11:25:47.093260Z"},"links":{"citing_paper":"/paper/2606.02926"},"observation_digest":"sha256:d51c231efa114ba2438aa3f2bc33fcf6cd87189fb0ad31f49535fa353e2076c5","observation_id":"b37e2a28-6a8b-4e9d-acb7-0f8df20468e4","resolution":{"observed_at":"2026-06-28T11:25:47.093260Z","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-06-28T11:25:47.093260Z","title":null,"venue":null,"work_id":null,"year":1997},"citing_paper":{"arxiv_id":"2606.02926","last_updated":"2026-06-03T04:16:10Z","snapshot_observed_at":"2026-08-14T03:46:52.069826Z","submitted_at":"2026-06-01T22:05:25Z","title":"Diamonds Are Forever: Stabilization Semantics for Unrestricted Aggregation and Recursion in Logica","version":2},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-06-28T11:25:47.093260Z"},"links":{"citing_paper":"/paper/2606.02926"},"observation_digest":"sha256:6b36716d3de6a372dbf534d6b90ec903f3ea8edc292e6c5dd3531bb37c39325e","observation_id":"73def84e-bc95-42b6-9b72-26f396aa8fcd","resolution":{"observed_at":"2026-06-28T11:25:47.093260Z","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-06-28T11:25:47.093260Z","title":", title =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.02926","last_updated":"2026-06-03T04:16:10Z","snapshot_observed_at":"2026-08-14T03:46:52.069826Z","submitted_at":"2026-06-01T22:05:25Z","title":"Diamonds Are Forever: Stabilization Semantics for Unrestricted Aggregation and Recursion in Logica","version":2},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-06-28T11:25:47.093260Z"},"links":{"citing_paper":"/paper/2606.02926"},"observation_digest":"sha256:e081953098251969f7d255192e15ab0c58138ac1149ee78745f6714455782e6f","observation_id":"6d9dc0f7-7f6a-403d-9a40-c393f2e67c54","resolution":{"observed_at":"2026-06-28T11:25:47.093260Z","resolver_source":null,"status":"parse_uncertain"},"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-06-28T11:25:47.093260Z","title":"and Leone, N","venue":null,"work_id":null,"year":2004},"citing_paper":{"arxiv_id":"2606.02926","last_updated":"2026-06-03T04:16:10Z","snapshot_observed_at":"2026-08-14T03:46:52.069826Z","submitted_at":"2026-06-01T22:05:25Z","title":"Diamonds Are Forever: Stabilization Semantics for Unrestricted Aggregation and Recursion in Logica","version":2},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-06-28T11:25:47.093260Z"},"links":{"citing_paper":"/paper/2606.02926"},"observation_digest":"sha256:3e0f7075d299f94a882c1a2200ed8e7c74e58c055c0eb45efbe41bb7d09668a9","observation_id":"4438c751-cd02-4bc1-9adc-e0ecc58f9a3a","resolution":{"observed_at":"2026-06-28T11:25:47.093260Z","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-06-28T11:25:47.093260Z","title":null,"venue":null,"work_id":null,"year":1993},"citing_paper":{"arxiv_id":"2606.02926","last_updated":"2026-06-03T04:16:10Z","snapshot_observed_at":"2026-08-14T03:46:52.069826Z","submitted_at":"2026-06-01T22:05:25Z","title":"Diamonds Are Forever: Stabilization Semantics for Unrestricted Aggregation and Recursion in Logica","version":2},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-06-28T11:25:47.093260Z"},"links":{"citing_paper":"/paper/2606.02926"},"observation_digest":"sha256:1e3c99159cf6e4b2d02bcaeed93526a804c7e6c4e051454392e8b3feed8b94a4","observation_id":"7d027bff-dfc1-45bc-a0ce-f8e6a6c62124","resolution":{"observed_at":"2026-06-28T11:25:47.093260Z","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-06-28T11:25:47.093260Z","title":"and Ramakrishnan, Raghu and Srivastava, Divesh and Ullman, Jeffrey D","venue":null,"work_id":null,"year":1989},"citing_paper":{"arxiv_id":"2606.02926","last_updated":"2026-06-03T04:16:10Z","snapshot_observed_at":"2026-08-14T03:46:52.069826Z","submitted_at":"2026-06-01T22:05:25Z","title":"Diamonds Are Forever: Stabilization Semantics for Unrestricted Aggregation and Recursion in Logica","version":2},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-06-28T11:25:47.093260Z"},"links":{"citing_paper":"/paper/2606.02926"},"observation_digest":"sha256:1a62beb5d6dcdd252b8221420c67821add952eeb178032543630aba302689dc0","observation_id":"621d30de-1674-4d0d-b290-cf9564c64cf6","resolution":{"observed_at":"2026-06-28T11:25:47.093260Z","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-06-28T11:25:47.093260Z","title":"Kemp and Peter J","venue":null,"work_id":null,"year":1991},"citing_paper":{"arxiv_id":"2606.02926","last_updated":"2026-06-03T04:16:10Z","snapshot_observed_at":"2026-08-14T03:46:52.069826Z","submitted_at":"2026-06-01T22:05:25Z","title":"Diamonds Are Forever: Stabilization Semantics for Unrestricted Aggregation and Recursion in Logica","version":2},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-06-28T11:25:47.093260Z"},"links":{"citing_paper":"/paper/2606.02926"},"observation_digest":"sha256:9b864a7c55b264e57987f278d5d38222a1c66c87cee30c95674f71db21ab3e9e","observation_id":"2fdf782b-2186-4d22-8796-33deccbc5c79","resolution":{"observed_at":"2026-06-28T11:25:47.093260Z","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-06-28T11:25:47.093260Z","title":"Intl.\\ Conf.\\ on Database Theory (ICDT) , publisher =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.02926","last_updated":"2026-06-03T04:16:10Z","snapshot_observed_at":"2026-08-14T03:46:52.069826Z","submitted_at":"2026-06-01T22:05:25Z","title":"Diamonds Are Forever: Stabilization Semantics for Unrestricted Aggregation and Recursion in Logica","version":2},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-06-28T11:25:47.093260Z"},"links":{"citing_paper":"/paper/2606.02926"},"observation_digest":"sha256:251a7f2431045bdf4192da259e5d5ca3e8c9b8a89dc89543a2f2efbe582a2747","observation_id":"5b6a9a61-5ae1-4790-920f-1360fb9b5a76","resolution":{"observed_at":"2026-06-28T11:25:47.093260Z","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-06-28T11:25:47.093260Z","title":"Order , volume = 17, number = 1, pages =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.02926","last_updated":"2026-06-03T04:16:10Z","snapshot_observed_at":"2026-08-14T03:46:52.069826Z","submitted_at":"2026-06-01T22:05:25Z","title":"Diamonds Are Forever: Stabilization Semantics for Unrestricted Aggregation and Recursion in Logica","version":2},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-06-28T11:25:47.093260Z"},"links":{"citing_paper":"/paper/2606.02926"},"observation_digest":"sha256:4de021384c68fc0fa9038eb7596cf720e6551734aa982f3ea7a42590e1274548","observation_id":"275ef8ca-c213-47e6-9622-a5bcdfec3a11","resolution":{"observed_at":"2026-06-28T11:25:47.093260Z","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-06-28T11:25:47.093260Z","title":"Algorithmica , month = sep, pages =","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2606.02926","last_updated":"2026-06-03T04:16:10Z","snapshot_observed_at":"2026-08-14T03:46:52.069826Z","submitted_at":"2026-06-01T22:05:25Z","title":"Diamonds Are Forever: Stabilization Semantics for Unrestricted Aggregation and Recursion in Logica","version":2},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-06-28T11:25:47.093260Z"},"links":{"citing_paper":"/paper/2606.02926"},"observation_digest":"sha256:3134b8adef5d79dd47809f8d67b4ec9519b704d7a40817153acdce45b0d6a6aa","observation_id":"3f3e3f0e-87bd-4424-8691-096bbb986c64","resolution":{"observed_at":"2026-06-28T11:25:47.093260Z","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-06-28T11:25:47.093260Z","title":null,"venue":null,"work_id":null,"year":2002},"citing_paper":{"arxiv_id":"2606.02926","last_updated":"2026-06-03T04:16:10Z","snapshot_observed_at":"2026-08-14T03:46:52.069826Z","submitted_at":"2026-06-01T22:05:25Z","title":"Diamonds Are Forever: Stabilization Semantics for Unrestricted Aggregation and Recursion in Logica","version":2},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-06-28T11:25:47.093260Z"},"links":{"citing_paper":"/paper/2606.02926"},"observation_digest":"sha256:91fadd34d889af0ae5bfc1aa5190ca410f88589becdab27bab19ec0b60cdb057","observation_id":"18288a69-34d2-4ea5-9f80-c83051075477","resolution":{"observed_at":"2026-06-28T11:25:47.093260Z","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-06-28T11:25:47.093260Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.02926","last_updated":"2026-06-03T04:16:10Z","snapshot_observed_at":"2026-08-14T03:46:52.069826Z","submitted_at":"2026-06-01T22:05:25Z","title":"Diamonds Are Forever: Stabilization Semantics for Unrestricted Aggregation and Recursion in Logica","version":2},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-06-28T11:25:47.093260Z"},"links":{"citing_paper":"/paper/2606.02926"},"observation_digest":"sha256:e5dc54f29f5d8c22782873b482ef2d00b442bf8e69683afdf0d5249325f139c1","observation_id":"31782973-f9e1-4b03-a372-e95ae197f920","resolution":{"observed_at":"2026-06-28T11:25:47.093260Z","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-06-28T11:25:47.093260Z","title":"SIAM Journal on Computing , volume =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.02926","last_updated":"2026-06-03T04:16:10Z","snapshot_observed_at":"2026-08-14T03:46:52.069826Z","submitted_at":"2026-06-01T22:05:25Z","title":"Diamonds Are Forever: Stabilization Semantics for Unrestricted Aggregation and Recursion in Logica","version":2},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-06-28T11:25:47.093260Z"},"links":{"citing_paper":"/paper/2606.02926"},"observation_digest":"sha256:0ea3e7ed8289e4b3db0654059af229ae748d936109c4469cf4410f4cf758f2d3","observation_id":"85a2cd4e-57c9-4b2c-9db8-912c5764934b","resolution":{"observed_at":"2026-06-28T11:25:47.093260Z","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-06-28T11:25:47.093260Z","title":"Journal of Combinatorial Theory , volume = 1, number = 1, pages =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.02926","last_updated":"2026-06-03T04:16:10Z","snapshot_observed_at":"2026-08-14T03:46:52.069826Z","submitted_at":"2026-06-01T22:05:25Z","title":"Diamonds Are Forever: Stabilization Semantics for Unrestricted Aggregation and Recursion in Logica","version":2},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-06-28T11:25:47.093260Z"},"links":{"citing_paper":"/paper/2606.02926"},"observation_digest":"sha256:72132a580ec5ccdd277fc7887bee5ff2953d24bc3e4f396a58e7e555d51d4c88","observation_id":"53d114dc-a0ed-48de-9076-075c61ad33ec","resolution":{"observed_at":"2026-06-28T11:25:47.093260Z","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-06-28T11:25:47.093260Z","title":"Gelfond , xeditor =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.02926","last_updated":"2026-06-03T04:16:10Z","snapshot_observed_at":"2026-08-14T03:46:52.069826Z","submitted_at":"2026-06-01T22:05:25Z","title":"Diamonds Are Forever: Stabilization Semantics for Unrestricted Aggregation and Recursion in Logica","version":2},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-06-28T11:25:47.093260Z"},"links":{"citing_paper":"/paper/2606.02926"},"observation_digest":"sha256:6c2a712bf8965305f989720d24a60265b67666b8053df2b89247c8aab97a5e40","observation_id":"661c86ba-6c50-42e5-9b3f-5f2560aa08c5","resolution":{"observed_at":"2026-06-28T11:25:47.093260Z","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-06-28T11:25:47.093260Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.02926","last_updated":"2026-06-03T04:16:10Z","snapshot_observed_at":"2026-08-14T03:46:52.069826Z","submitted_at":"2026-06-01T22:05:25Z","title":"Diamonds Are Forever: Stabilization Semantics for Unrestricted Aggregation and Recursion in Logica","version":2},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-06-28T11:25:47.093260Z"},"links":{"citing_paper":"/paper/2606.02926"},"observation_digest":"sha256:28072c6ae7f4404a82127a0db4fea4b4afed501ad559325d831f9c9ed12ccbf7","observation_id":"b413e119-1250-4e9b-9fc6-1baaa18e93e3","resolution":{"observed_at":"2026-06-28T11:25:47.093260Z","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-06-28T11:25:47.093260Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.02926","last_updated":"2026-06-03T04:16:10Z","snapshot_observed_at":"2026-08-14T03:46:52.069826Z","submitted_at":"2026-06-01T22:05:25Z","title":"Diamonds Are Forever: Stabilization Semantics for Unrestricted Aggregation and Recursion in Logica","version":2},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-06-28T11:25:47.093260Z"},"links":{"citing_paper":"/paper/2606.02926"},"observation_digest":"sha256:878584a3fe7bad1473d962968a748272fe0afebae35b80ac0eb17d0f2c848b17","observation_id":"cf31f6d2-b097-493f-a502-eab4ae1fb1eb","resolution":{"observed_at":"2026-06-28T11:25:47.093260Z","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-06-28T11:25:47.093260Z","title":"2005 , note =","venue":null,"work_id":null,"year":2005},"citing_paper":{"arxiv_id":"2606.02926","last_updated":"2026-06-03T04:16:10Z","snapshot_observed_at":"2026-08-14T03:46:52.069826Z","submitted_at":"2026-06-01T22:05:25Z","title":"Diamonds Are Forever: Stabilization Semantics for Unrestricted Aggregation and Recursion in Logica","version":2},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-06-28T11:25:47.093260Z"},"links":{"citing_paper":"/paper/2606.02926"},"observation_digest":"sha256:c74aaae39b47bddb1bc0116838f0df61457b85f89aa30c9a27020bc61282e782","observation_id":"d77ee085-cd92-404a-a2e2-22bb5a894817","resolution":{"observed_at":"2026-06-28T11:25:47.093260Z","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":"10.1007/978-3-540-31847-7_7","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Graph Transformation in Molecular Biology https://doi.org/10.1007/978-3-540-31847-7_7","venue":"Lecture notes in computer science","work_id":"d52a7f05-7f8d-4070-8ef8-0701b30f7fa9","year":2005},"citing_paper":{"arxiv_id":"2606.02926","last_updated":"2026-06-03T04:16:10Z","snapshot_observed_at":"2026-08-14T03:46:52.069826Z","submitted_at":"2026-06-01T22:05:25Z","title":"Diamonds Are Forever: Stabilization Semantics for Unrestricted Aggregation and Recursion in Logica","version":2},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-06-28T11:25:47.093260Z"},"links":{"citing_paper":"/paper/2606.02926"},"observation_digest":"sha256:37b56a0c451d734a4ade21b6c50b6ecd36e94eec46fd4f0d4f9f76000731d88a","observation_id":"1584bf3c-82ac-488e-b563-1f5269b0ba3d","resolution":{"observed_at":"2026-06-28T11:32:02.762003Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T11:25:47.093260Z","title":"Graph Rewriting Systems and their Application in Biology","venue":null,"work_id":null,"year":1976},"citing_paper":{"arxiv_id":"2606.02926","last_updated":"2026-06-03T04:16:10Z","snapshot_observed_at":"2026-08-14T03:46:52.069826Z","submitted_at":"2026-06-01T22:05:25Z","title":"Diamonds Are Forever: Stabilization Semantics for Unrestricted Aggregation and Recursion in Logica","version":2},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-06-28T11:25:47.093260Z"},"links":{"citing_paper":"/paper/2606.02926"},"observation_digest":"sha256:c77a378470714d6bbc872b09f9aeda21ea783098b063ffa6147723b8be1ecce4","observation_id":"1cb3766e-c6d8-4f75-8052-27a8a5044f6b","resolution":{"observed_at":"2026-06-28T11:25:47.093260Z","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-06-28T11:25:47.093260Z","title":"International Workshop on Rewriting Logic and Its Applications , series =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.02926","last_updated":"2026-06-03T04:16:10Z","snapshot_observed_at":"2026-08-14T03:46:52.069826Z","submitted_at":"2026-06-01T22:05:25Z","title":"Diamonds Are Forever: Stabilization Semantics for Unrestricted Aggregation and Recursion in Logica","version":2},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-06-28T11:25:47.093260Z"},"links":{"citing_paper":"/paper/2606.02926"},"observation_digest":"sha256:7c66a52a2abc2ec1406a9500c19fded6143698d663455fc066c0d8f6d23b6de0","observation_id":"8c0d0198-5248-4040-aff0-6f95805b9164","resolution":{"observed_at":"2026-06-28T11:25:47.093260Z","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-06-28T11:25:47.093260Z","title":"2023 , booktitle =","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2606.02926","last_updated":"2026-06-03T04:16:10Z","snapshot_observed_at":"2026-08-14T03:46:52.069826Z","submitted_at":"2026-06-01T22:05:25Z","title":"Diamonds Are Forever: Stabilization Semantics for Unrestricted Aggregation and Recursion in Logica","version":2},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-06-28T11:25:47.093260Z"},"links":{"citing_paper":"/paper/2606.02926"},"observation_digest":"sha256:b42e3d0a71518a16b0cefee2fe629bc0544f60a32fefc40a7a0faa3eb9e894f9","observation_id":"58a2366a-55e4-453a-9e2b-76deb50339a7","resolution":{"observed_at":"2026-06-28T11:25:47.093260Z","resolver_source":null,"status":"parse_uncertain"},"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-06-28T11:25:47.093260Z","title":"2014 , pages=","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2606.02926","last_updated":"2026-06-03T04:16:10Z","snapshot_observed_at":"2026-08-14T03:46:52.069826Z","submitted_at":"2026-06-01T22:05:25Z","title":"Diamonds Are Forever: Stabilization Semantics for Unrestricted Aggregation and Recursion in Logica","version":2},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-06-28T11:25:47.093260Z"},"links":{"citing_paper":"/paper/2606.02926"},"observation_digest":"sha256:67e41431a32228505a675478c1c461a37398b2ffcd1e40853855a789dbc91ee9","observation_id":"e55dd693-cbc6-430f-9232-18c73308f586","resolution":{"observed_at":"2026-06-28T11:25:47.093260Z","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-06-28T11:25:47.093260Z","title":"Software System Modeling , year =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.02926","last_updated":"2026-06-03T04:16:10Z","snapshot_observed_at":"2026-08-14T03:46:52.069826Z","submitted_at":"2026-06-01T22:05:25Z","title":"Diamonds Are Forever: Stabilization Semantics for Unrestricted Aggregation and Recursion in Logica","version":2},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-06-28T11:25:47.093260Z"},"links":{"citing_paper":"/paper/2606.02926"},"observation_digest":"sha256:8bd1f5a9b59a62e4a375d5b077497b8f6b4b8dfe9b9eafa83a5e8950c7c92670","observation_id":"fc7da603-479b-4d12-8448-2c1b3ca649e9","resolution":{"observed_at":"2026-06-28T11:25:47.093260Z","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-06-28T11:25:47.093260Z","title":"Datalog 2.0 2022 , series =","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2606.02926","last_updated":"2026-06-03T04:16:10Z","snapshot_observed_at":"2026-08-14T03:46:52.069826Z","submitted_at":"2026-06-01T22:05:25Z","title":"Diamonds Are Forever: Stabilization Semantics for Unrestricted Aggregation and Recursion in Logica","version":2},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-06-28T11:25:47.093260Z"},"links":{"citing_paper":"/paper/2606.02926"},"observation_digest":"sha256:8729fd5c46127e9bc672fe75f60a8314892f538b7d3c4061c6c214cd2b07020c","observation_id":"abe76f80-bbbd-43cf-8423-21436eaade5d","resolution":{"observed_at":"2026-06-28T11:25:47.093260Z","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-06-28T11:25:47.093260Z","title":"1998 , booktitle =","venue":null,"work_id":null,"year":1998},"citing_paper":{"arxiv_id":"2606.02926","last_updated":"2026-06-03T04:16:10Z","snapshot_observed_at":"2026-08-14T03:46:52.069826Z","submitted_at":"2026-06-01T22:05:25Z","title":"Diamonds Are Forever: Stabilization Semantics for Unrestricted Aggregation and Recursion in Logica","version":2},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-06-28T11:25:47.093260Z"},"links":{"citing_paper":"/paper/2606.02926"},"observation_digest":"sha256:37aedeaef1a558d62273160fb4be3140ec9ad4f94b6f30e3528b7f77482076df","observation_id":"85ff7202-ce32-4f01-b0bd-2b01e5ecadb0","resolution":{"observed_at":"2026-06-28T11:25:47.093260Z","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-06-28T11:25:47.093260Z","title":"and Kaminski, R","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2606.02926","last_updated":"2026-06-03T04:16:10Z","snapshot_observed_at":"2026-08-14T03:46:52.069826Z","submitted_at":"2026-06-01T22:05:25Z","title":"Diamonds Are Forever: Stabilization Semantics for Unrestricted Aggregation and Recursion in Logica","version":2},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-06-28T11:25:47.093260Z"},"links":{"citing_paper":"/paper/2606.02926"},"observation_digest":"sha256:262c5f8b81a229149dc6f4cdeda51a25b12ae55f803a9d7dabf13f668a792130","observation_id":"1ec7cdc9-6392-40b0-aedb-31790f938b8b","resolution":{"observed_at":"2026-06-28T11:25:47.093260Z","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-06-28T11:25:47.093260Z","title":", month = sep, year =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.02926","last_updated":"2026-06-03T04:16:10Z","snapshot_observed_at":"2026-08-14T03:46:52.069826Z","submitted_at":"2026-06-01T22:05:25Z","title":"Diamonds Are Forever: Stabilization Semantics for Unrestricted Aggregation and Recursion in Logica","version":2},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-06-28T11:25:47.093260Z"},"links":{"citing_paper":"/paper/2606.02926"},"observation_digest":"sha256:db5c35d1ccfcbb5200fe66036aea66adde7a05582b60a5232cd01201e9808b03","observation_id":"054c2e8e-073f-48cf-afd6-0d7f9797d236","resolution":{"observed_at":"2026-06-28T11:25:47.093260Z","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-06-28T11:25:47.093260Z","title":"Yedalog: Exploring Knowledge at Scale , xauthor=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.02926","last_updated":"2026-06-03T04:16:10Z","snapshot_observed_at":"2026-08-14T03:46:52.069826Z","submitted_at":"2026-06-01T22:05:25Z","title":"Diamonds Are Forever: Stabilization Semantics for Unrestricted Aggregation and Recursion in Logica","version":2},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-06-28T11:25:47.093260Z"},"links":{"citing_paper":"/paper/2606.02926"},"observation_digest":"sha256:84669a4d4dba46d195f1565f3ba04b1f3c77ea7cecca699a083e46024250be4a","observation_id":"ff8775dd-a22c-47e5-bf24-f25e53085084","resolution":{"observed_at":"2026-06-28T11:25:47.093260Z","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-06-28T11:25:47.093260Z","title":"and Och, Franz and Olston, Christopher and Pereira, Fernando , year =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.02926","last_updated":"2026-06-03T04:16:10Z","snapshot_observed_at":"2026-08-14T03:46:52.069826Z","submitted_at":"2026-06-01T22:05:25Z","title":"Diamonds Are Forever: Stabilization Semantics for Unrestricted Aggregation and Recursion in Logica","version":2},"reference_index":36,"source":"arxiv_source","source_observed_at":"2026-06-28T11:25:47.093260Z"},"links":{"citing_paper":"/paper/2606.02926"},"observation_digest":"sha256:4379a45a2efca74ffb60527f1f6c07a97b8bcd9845b11adc5abbf61cbe9b168e","observation_id":"dda82819-0992-4179-a5a5-63b055aa0377","resolution":{"observed_at":"2026-06-28T11:25:47.093260Z","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-06-28T11:25:47.093260Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.02926","last_updated":"2026-06-03T04:16:10Z","snapshot_observed_at":"2026-08-14T03:46:52.069826Z","submitted_at":"2026-06-01T22:05:25Z","title":"Diamonds Are Forever: Stabilization Semantics for Unrestricted Aggregation and Recursion in Logica","version":2},"reference_index":37,"source":"arxiv_source","source_observed_at":"2026-06-28T11:25:47.093260Z"},"links":{"citing_paper":"/paper/2606.02926"},"observation_digest":"sha256:5bfe60b559f760c0436472392695da13d8839be1c72086504a1b3686af7f1bd5","observation_id":"00837779-838e-4377-99b6-320376b30e9f","resolution":{"observed_at":"2026-06-28T11:25:47.093260Z","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-06-28T11:25:47.093260Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.02926","last_updated":"2026-06-03T04:16:10Z","snapshot_observed_at":"2026-08-14T03:46:52.069826Z","submitted_at":"2026-06-01T22:05:25Z","title":"Diamonds Are Forever: Stabilization Semantics for Unrestricted Aggregation and Recursion in Logica","version":2},"reference_index":38,"source":"arxiv_source","source_observed_at":"2026-06-28T11:25:47.093260Z"},"links":{"citing_paper":"/paper/2606.02926"},"observation_digest":"sha256:b7283f4afb6df566656989a1ed4fa35f9a516c9188d0ee2dc950416779b123bc","observation_id":"afc5cca9-3bdd-4b54-b86a-908a17634fd4","resolution":{"observed_at":"2026-06-28T11:25:47.093260Z","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-06-28T11:25:47.093260Z","title":"ACM SIGMOD Record , author =","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2606.02926","last_updated":"2026-06-03T04:16:10Z","snapshot_observed_at":"2026-08-14T03:46:52.069826Z","submitted_at":"2026-06-01T22:05:25Z","title":"Diamonds Are Forever: Stabilization Semantics for Unrestricted Aggregation and Recursion in Logica","version":2},"reference_index":39,"source":"arxiv_source","source_observed_at":"2026-06-28T11:25:47.093260Z"},"links":{"citing_paper":"/paper/2606.02926"},"observation_digest":"sha256:090ac5a54b7d611244da58d1c267280e47fe5eb6c0a15109c72ecf5c5844df63","observation_id":"497edebb-0c8f-40ce-96dc-25b9821bafc8","resolution":{"observed_at":"2026-06-28T11:25:47.093260Z","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-06-28T11:25:47.093260Z","title":"and Köhler, Sven and Bowers, Shawn and Ludäscher, Bertram , editor =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.02926","last_updated":"2026-06-03T04:16:10Z","snapshot_observed_at":"2026-08-14T03:46:52.069826Z","submitted_at":"2026-06-01T22:05:25Z","title":"Diamonds Are Forever: Stabilization Semantics for Unrestricted Aggregation and Recursion in Logica","version":2},"reference_index":40,"source":"arxiv_source","source_observed_at":"2026-06-28T11:25:47.093260Z"},"links":{"citing_paper":"/paper/2606.02926"},"observation_digest":"sha256:3ae3099ab74d073b4ebc11e158036381b7900945be3ca91c6127180804be50a0","observation_id":"ea5a0a06-e301-47b3-931f-171eca3d99a1","resolution":{"observed_at":"2026-06-28T11:25:47.093260Z","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-06-28T11:25:47.093260Z","title":"IBM Systems Journal , author =","venue":null,"work_id":null,"year":1977},"citing_paper":{"arxiv_id":"2606.02926","last_updated":"2026-06-03T04:16:10Z","snapshot_observed_at":"2026-08-14T03:46:52.069826Z","submitted_at":"2026-06-01T22:05:25Z","title":"Diamonds Are Forever: Stabilization Semantics for Unrestricted Aggregation and Recursion in Logica","version":2},"reference_index":41,"source":"arxiv_source","source_observed_at":"2026-06-28T11:25:47.093260Z"},"links":{"citing_paper":"/paper/2606.02926"},"observation_digest":"sha256:b022794d7508fc1c0e76cdc2a47fe4445aed0dddeb4ba692f77a98a7dacaa5d4","observation_id":"3c015ee1-57d0-4e20-87b4-6183d8c1a31e","resolution":{"observed_at":"2026-06-28T11:25:47.093260Z","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-06-28T11:25:47.093260Z","title":"Logica Project , url =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.02926","last_updated":"2026-06-03T04:16:10Z","snapshot_observed_at":"2026-08-14T03:46:52.069826Z","submitted_at":"2026-06-01T22:05:25Z","title":"Diamonds Are Forever: Stabilization Semantics for Unrestricted Aggregation and Recursion in Logica","version":2},"reference_index":42,"source":"arxiv_source","source_observed_at":"2026-06-28T11:25:47.093260Z"},"links":{"citing_paper":"/paper/2606.02926"},"observation_digest":"sha256:deb9c599787754f4a6060eea53b410e614256b57c87d82ec8c4d2d18daadbc61","observation_id":"075873e7-3da1-4201-9002-d46c29d2d4b2","resolution":{"observed_at":"2026-06-28T11:25:47.093260Z","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-06-28T11:25:47.093260Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.02926","last_updated":"2026-06-03T04:16:10Z","snapshot_observed_at":"2026-08-14T03:46:52.069826Z","submitted_at":"2026-06-01T22:05:25Z","title":"Diamonds Are Forever: Stabilization Semantics for Unrestricted Aggregation and Recursion in Logica","version":2},"reference_index":43,"source":"arxiv_source","source_observed_at":"2026-06-28T11:25:47.093260Z"},"links":{"citing_paper":"/paper/2606.02926"},"observation_digest":"sha256:31cc0efa9af464a48f66783261b134e0a5123c46e109c0014ab8a105af8d1e6c","observation_id":"ca525a24-6a65-4654-81c7-d0a87dd4c13a","resolution":{"observed_at":"2026-06-28T11:25:47.093260Z","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-06-28T11:25:47.093260Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.02926","last_updated":"2026-06-03T04:16:10Z","snapshot_observed_at":"2026-08-14T03:46:52.069826Z","submitted_at":"2026-06-01T22:05:25Z","title":"Diamonds Are Forever: Stabilization Semantics for Unrestricted Aggregation and Recursion in Logica","version":2},"reference_index":44,"source":"arxiv_source","source_observed_at":"2026-06-28T11:25:47.093260Z"},"links":{"citing_paper":"/paper/2606.02926"},"observation_digest":"sha256:d38bda0f92d086444aeae358ad1faca1ce02c2f65d6bc646463b9de67f47926e","observation_id":"7eda41a0-385a-434e-a078-33ed5544d106","resolution":{"observed_at":"2026-06-28T11:25:47.093260Z","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-06-28T11:25:47.093260Z","title":", month = may, year = 2015, keywords =","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2606.02926","last_updated":"2026-06-03T04:16:10Z","snapshot_observed_at":"2026-08-14T03:46:52.069826Z","submitted_at":"2026-06-01T22:05:25Z","title":"Diamonds Are Forever: Stabilization Semantics for Unrestricted Aggregation and Recursion in Logica","version":2},"reference_index":45,"source":"arxiv_source","source_observed_at":"2026-06-28T11:25:47.093260Z"},"links":{"citing_paper":"/paper/2606.02926"},"observation_digest":"sha256:9abfccf53e046a096440cd870bd4ddbd8253ebbf4e40fb0d4506410e4a4dfe18","observation_id":"c83990ae-fd87-4dc3-ad8c-f34b12ee1da6","resolution":{"observed_at":"2026-06-28T11:25:47.093260Z","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-06-28T11:25:47.093260Z","title":"The VLDB Journal , author =","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2606.02926","last_updated":"2026-06-03T04:16:10Z","snapshot_observed_at":"2026-08-14T03:46:52.069826Z","submitted_at":"2026-06-01T22:05:25Z","title":"Diamonds Are Forever: Stabilization Semantics for Unrestricted Aggregation and Recursion in Logica","version":2},"reference_index":46,"source":"arxiv_source","source_observed_at":"2026-06-28T11:25:47.093260Z"},"links":{"citing_paper":"/paper/2606.02926"},"observation_digest":"sha256:9e2301ee152aacc70d223413d6621d66e0d1342b740faaacd9b2ca424e868870","observation_id":"1dded65c-384d-449d-8409-73a7ffe2df2b","resolution":{"observed_at":"2026-06-28T11:25:47.093260Z","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-06-28T11:25:47.093260Z","title":"and Hellerstein, Joseph M","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.02926","last_updated":"2026-06-03T04:16:10Z","snapshot_observed_at":"2026-08-14T03:46:52.069826Z","submitted_at":"2026-06-01T22:05:25Z","title":"Diamonds Are Forever: Stabilization Semantics for Unrestricted Aggregation and Recursion in Logica","version":2},"reference_index":47,"source":"arxiv_source","source_observed_at":"2026-06-28T11:25:47.093260Z"},"links":{"citing_paper":"/paper/2606.02926"},"observation_digest":"sha256:0096e54aaf5c13aa487017f435def7fd45accb0e1daf0ef8e76545d3eb303092","observation_id":"380b2151-dd45-41ab-85a4-4ba691e7a385","resolution":{"observed_at":"2026-06-28T11:25:47.093260Z","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-06-28T11:25:47.093260Z","title":"On fast large-scale program analysis in","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2606.02926","last_updated":"2026-06-03T04:16:10Z","snapshot_observed_at":"2026-08-14T03:46:52.069826Z","submitted_at":"2026-06-01T22:05:25Z","title":"Diamonds Are Forever: Stabilization Semantics for Unrestricted Aggregation and Recursion in Logica","version":2},"reference_index":48,"source":"arxiv_source","source_observed_at":"2026-06-28T11:25:47.093260Z"},"links":{"citing_paper":"/paper/2606.02926"},"observation_digest":"sha256:4262107e014c5beee1675dba4cc27d9617d26458966fc561f7ae106fdf56ddd7","observation_id":"c5ca7c03-fe39-44b4-b519-21772326179e","resolution":{"observed_at":"2026-06-28T11:25:47.093260Z","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-06-28T11:25:47.093260Z","title":"Soufflé:","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2606.02926","last_updated":"2026-06-03T04:16:10Z","snapshot_observed_at":"2026-08-14T03:46:52.069826Z","submitted_at":"2026-06-01T22:05:25Z","title":"Diamonds Are Forever: Stabilization Semantics for Unrestricted Aggregation and Recursion in Logica","version":2},"reference_index":49,"source":"arxiv_source","source_observed_at":"2026-06-28T11:25:47.093260Z"},"links":{"citing_paper":"/paper/2606.02926"},"observation_digest":"sha256:d2cce67719d39dc8c5fe5d323f70d130227f2427acc01cf92d1344ce630da445","observation_id":"38895ddd-429b-4639-89e2-acb86a5df587","resolution":{"observed_at":"2026-06-28T11:25:47.093260Z","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-06-28T11:25:47.093260Z","title":", xeditor =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.02926","last_updated":"2026-06-03T04:16:10Z","snapshot_observed_at":"2026-08-14T03:46:52.069826Z","submitted_at":"2026-06-01T22:05:25Z","title":"Diamonds Are Forever: Stabilization Semantics for Unrestricted Aggregation and Recursion in Logica","version":2},"reference_index":50,"source":"arxiv_source","source_observed_at":"2026-06-28T11:25:47.093260Z"},"links":{"citing_paper":"/paper/2606.02926"},"observation_digest":"sha256:315c85599bcc19f96654726d3c97888250945ca2227db36866aec93dbfd9ac54","observation_id":"105488f7-c4c6-44c5-8127-2d980048bc0a","resolution":{"observed_at":"2026-06-28T11:25:47.093260Z","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-06-28T11:25:47.093260Z","title":"2011 , xurl =","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2606.02926","last_updated":"2026-06-03T04:16:10Z","snapshot_observed_at":"2026-08-14T03:46:52.069826Z","submitted_at":"2026-06-01T22:05:25Z","title":"Diamonds Are Forever: Stabilization Semantics for Unrestricted Aggregation and Recursion in Logica","version":2},"reference_index":51,"source":"arxiv_source","source_observed_at":"2026-06-28T11:25:47.093260Z"},"links":{"citing_paper":"/paper/2606.02926"},"observation_digest":"sha256:6effbf16ebbbe34229186133347cdbde261e7f86531b42f42f7db679e5d2848e","observation_id":"49c51e1f-08e5-4c38-93ea-3250294ffe23","resolution":{"observed_at":"2026-06-28T11:25:47.093260Z","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-06-28T11:25:47.093260Z","title":"2022 , xurl =","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2606.02926","last_updated":"2026-06-03T04:16:10Z","snapshot_observed_at":"2026-08-14T03:46:52.069826Z","submitted_at":"2026-06-01T22:05:25Z","title":"Diamonds Are Forever: Stabilization Semantics for Unrestricted Aggregation and Recursion in Logica","version":2},"reference_index":52,"source":"arxiv_source","source_observed_at":"2026-06-28T11:25:47.093260Z"},"links":{"citing_paper":"/paper/2606.02926"},"observation_digest":"sha256:b1562c33141a9b9fc2c2a6b3c95b79baf49c8dfed5176f75bab95ab0195bf5a8","observation_id":"88c385f2-9fb4-4d1a-80a2-bca999595d6d","resolution":{"observed_at":"2026-06-28T11:25:47.093260Z","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-06-28T11:25:47.093260Z","title":"Journal of the ACM , author =","venue":null,"work_id":null,"year":1991},"citing_paper":{"arxiv_id":"2606.02926","last_updated":"2026-06-03T04:16:10Z","snapshot_observed_at":"2026-08-14T03:46:52.069826Z","submitted_at":"2026-06-01T22:05:25Z","title":"Diamonds Are Forever: Stabilization Semantics for Unrestricted Aggregation and Recursion in Logica","version":2},"reference_index":53,"source":"arxiv_source","source_observed_at":"2026-06-28T11:25:47.093260Z"},"links":{"citing_paper":"/paper/2606.02926"},"observation_digest":"sha256:c71defc0a8294728c358dff27c61a2217050ba9ffe421f9ddd56fe8401196628","observation_id":"71fdb7ed-a346-4495-88f2-39d7df19a767","resolution":{"observed_at":"2026-06-28T11:25:47.093260Z","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-06-28T11:25:47.093260Z","title":"Journal of Computer and System Sciences , author =","venue":null,"work_id":null,"year":1991},"citing_paper":{"arxiv_id":"2606.02926","last_updated":"2026-06-03T04:16:10Z","snapshot_observed_at":"2026-08-14T03:46:52.069826Z","submitted_at":"2026-06-01T22:05:25Z","title":"Diamonds Are Forever: Stabilization Semantics for Unrestricted Aggregation and Recursion in Logica","version":2},"reference_index":54,"source":"arxiv_source","source_observed_at":"2026-06-28T11:25:47.093260Z"},"links":{"citing_paper":"/paper/2606.02926"},"observation_digest":"sha256:cf89022aeca64dac29d2a47a217e1ee8e20d802f0a1a499a27f01a8836abab44","observation_id":"a730354b-0d33-4dbb-9bea-6c3b758f14f3","resolution":{"observed_at":"2026-06-28T11:25:47.093260Z","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-06-28T11:25:47.093260Z","title":"and Hull, R","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.02926","last_updated":"2026-06-03T04:16:10Z","snapshot_observed_at":"2026-08-14T03:46:52.069826Z","submitted_at":"2026-06-01T22:05:25Z","title":"Diamonds Are Forever: Stabilization Semantics for Unrestricted Aggregation and Recursion in Logica","version":2},"reference_index":55,"source":"arxiv_source","source_observed_at":"2026-06-28T11:25:47.093260Z"},"links":{"citing_paper":"/paper/2606.02926"},"observation_digest":"sha256:38c26a37513d22be4d3caaee71968641dc55c256ede45e17ece4ed2760824790","observation_id":"893ee581-e54b-4e7c-8d79-55921c6177d2","resolution":{"observed_at":"2026-06-28T11:25:47.093260Z","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-06-28T11:25:47.093260Z","title":"and Vianu, V , title =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.02926","last_updated":"2026-06-03T04:16:10Z","snapshot_observed_at":"2026-08-14T03:46:52.069826Z","submitted_at":"2026-06-01T22:05:25Z","title":"Diamonds Are Forever: Stabilization Semantics for Unrestricted Aggregation and Recursion in Logica","version":2},"reference_index":56,"source":"arxiv_source","source_observed_at":"2026-06-28T11:25:47.093260Z"},"links":{"citing_paper":"/paper/2606.02926"},"observation_digest":"sha256:0cdbb913e6fbe19968fa6b85e90faefc6f8662619eb014bff5f1ef1492c4a645","observation_id":"646babec-19a2-4923-914b-42f6e5501218","resolution":{"observed_at":"2026-06-28T11:25:47.093260Z","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-06-28T11:25:47.093260Z","title":"SIGMOD Record , author =","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2606.02926","last_updated":"2026-06-03T04:16:10Z","snapshot_observed_at":"2026-08-14T03:46:52.069826Z","submitted_at":"2026-06-01T22:05:25Z","title":"Diamonds Are Forever: Stabilization Semantics for Unrestricted Aggregation and Recursion in Logica","version":2},"reference_index":57,"source":"arxiv_source","source_observed_at":"2026-06-28T11:25:47.093260Z"},"links":{"citing_paper":"/paper/2606.02926"},"observation_digest":"sha256:2eced48d6b18c77d6a25c224db931ce25605bcdb53bb2092121979ceb3ef6651","observation_id":"29073a46-2b9e-4baf-be87-c0d67783ab4d","resolution":{"observed_at":"2026-06-28T11:25:47.093260Z","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-06-28T11:25:47.093260Z","title":"2012 , file =","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2606.02926","last_updated":"2026-06-03T04:16:10Z","snapshot_observed_at":"2026-08-14T03:46:52.069826Z","submitted_at":"2026-06-01T22:05:25Z","title":"Diamonds Are Forever: Stabilization Semantics for Unrestricted Aggregation and Recursion in Logica","version":2},"reference_index":59,"source":"arxiv_source","source_observed_at":"2026-06-28T11:25:47.093260Z"},"links":{"citing_paper":"/paper/2606.02926"},"observation_digest":"sha256:5df5c0f842c136fb0f838c61c98f084957df4bf79dc1a2f00728171af3a3df4c","observation_id":"f0a3412d-38d4-4c33-9b61-6d023ff071cb","resolution":{"observed_at":"2026-06-28T11:25:47.093260Z","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-06-28T11:25:47.093260Z","title":"2011 , file =","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2606.02926","last_updated":"2026-06-03T04:16:10Z","snapshot_observed_at":"2026-08-14T03:46:52.069826Z","submitted_at":"2026-06-01T22:05:25Z","title":"Diamonds Are Forever: Stabilization Semantics for Unrestricted Aggregation and Recursion in Logica","version":2},"reference_index":60,"source":"arxiv_source","source_observed_at":"2026-06-28T11:25:47.093260Z"},"links":{"citing_paper":"/paper/2606.02926"},"observation_digest":"sha256:06bcaac6b2b3345a4ca1c2e6f5845756b2b454490ccea0ebc3150d159e8bcd9b","observation_id":"b87c3d57-74c2-495d-9481-38e410be358c","resolution":{"observed_at":"2026-06-28T11:25:47.093260Z","resolver_source":null,"status":"parse_uncertain"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"5558.105556","doi":"10.1145/1055558.1055560","metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":null,"venue":null,"work_id":"52d2212c-c2a5-4a74-833b-acc6ec3d08dd","year":null},"citing_paper":{"arxiv_id":"2606.02926","last_updated":"2026-06-03T04:16:10Z","snapshot_observed_at":"2026-08-14T03:46:52.069826Z","submitted_at":"2026-06-01T22:05:25Z","title":"Diamonds Are Forever: Stabilization Semantics for Unrestricted Aggregation and Recursion in Logica","version":2},"reference_index":61,"source":"arxiv_source","source_observed_at":"2026-06-28T11:25:47.093260Z"},"links":{"citing_paper":"/paper/2606.02926"},"observation_digest":"sha256:b1716541a08ad450a900a047977972b724245f657771163910475da3b51d205d","observation_id":"cdf9d262-d26e-45e1-a9e5-bab4df522ed8","resolution":{"observed_at":"2026-06-28T11:32:02.756221Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1016/j.entcs.2011.02.011","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"2011 , keywords =","venue":"Electronic Notes in Theoretical Computer Science","work_id":"6ffec67e-6c62-4f82-91d0-1ebb665d8ed7","year":2011},"citing_paper":{"arxiv_id":"2606.02926","last_updated":"2026-06-03T04:16:10Z","snapshot_observed_at":"2026-08-14T03:46:52.069826Z","submitted_at":"2026-06-01T22:05:25Z","title":"Diamonds Are Forever: Stabilization Semantics for Unrestricted Aggregation and Recursion in Logica","version":2},"reference_index":62,"source":"arxiv_source","source_observed_at":"2026-06-28T11:25:47.093260Z"},"links":{"citing_paper":"/paper/2606.02926"},"observation_digest":"sha256:6b45604984ee9e4fe7811d6688c039ba086417fa32f0be3fcbd56d89d35eb405","observation_id":"4f5f0218-843c-4577-8f88-fc254a5c0af8","resolution":{"observed_at":"2026-06-28T11:32:02.763536Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1016/0169-023x(90)90017-8","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Data & Knowledge Engineering , author =","venue":"Data & Knowledge Engineering","work_id":"3cb24bbd-ff3e-407a-b668-5ff720e9e204","year":1990},"citing_paper":{"arxiv_id":"2606.02926","last_updated":"2026-06-03T04:16:10Z","snapshot_observed_at":"2026-08-14T03:46:52.069826Z","submitted_at":"2026-06-01T22:05:25Z","title":"Diamonds Are Forever: Stabilization Semantics for Unrestricted Aggregation and Recursion in Logica","version":2},"reference_index":63,"source":"arxiv_source","source_observed_at":"2026-06-28T11:25:47.093260Z"},"links":{"citing_paper":"/paper/2606.02926"},"observation_digest":"sha256:50ce7ceb191589e882ff7061b328b30d8555355fd78c906ca67a67a9997c7cd9","observation_id":"f709708e-49b1-4703-8461-c04b13ce264c","resolution":{"observed_at":"2026-06-28T11:32:02.742296Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/978-3-642-24206-9_11","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":", year =","venue":"Lecture notes in computer science","work_id":"29a84aac-a968-4495-8521-bf47f2bb91dd","year":null},"citing_paper":{"arxiv_id":"2606.02926","last_updated":"2026-06-03T04:16:10Z","snapshot_observed_at":"2026-08-14T03:46:52.069826Z","submitted_at":"2026-06-01T22:05:25Z","title":"Diamonds Are Forever: Stabilization Semantics for Unrestricted Aggregation and Recursion in Logica","version":2},"reference_index":64,"source":"arxiv_source","source_observed_at":"2026-06-28T11:25:47.093260Z"},"links":{"citing_paper":"/paper/2606.02926"},"observation_digest":"sha256:98d10e2dc74fe32720d9f3ace39530e6d11f5a181b51c722626905677f7f5602","observation_id":"a4b2fd5b-7ef9-4f07-8990-b69aa7f365e5","resolution":{"observed_at":"2026-06-28T11:32:02.765715Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T11:25:47.093260Z","title":null,"venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2606.02926","last_updated":"2026-06-03T04:16:10Z","snapshot_observed_at":"2026-08-14T03:46:52.069826Z","submitted_at":"2026-06-01T22:05:25Z","title":"Diamonds Are Forever: Stabilization Semantics for Unrestricted Aggregation and Recursion in Logica","version":2},"reference_index":65,"source":"arxiv_source","source_observed_at":"2026-06-28T11:25:47.093260Z"},"links":{"citing_paper":"/paper/2606.02926"},"observation_digest":"sha256:89555c22be259270c3df59e08bc10d4bdedaa261414b275c109cb4284eecb624","observation_id":"2bf865c0-cdfa-4cb5-b212-8b1f5792bf07","resolution":{"observed_at":"2026-06-28T11:25:47.093260Z","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-06-28T11:25:47.093260Z","title":"VLDB , author =","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2606.02926","last_updated":"2026-06-03T04:16:10Z","snapshot_observed_at":"2026-08-14T03:46:52.069826Z","submitted_at":"2026-06-01T22:05:25Z","title":"Diamonds Are Forever: Stabilization Semantics for Unrestricted Aggregation and Recursion in Logica","version":2},"reference_index":66,"source":"arxiv_source","source_observed_at":"2026-06-28T11:25:47.093260Z"},"links":{"citing_paper":"/paper/2606.02926"},"observation_digest":"sha256:474c3dd2ce6ed160fd4a4a5797d09d2548bad4a16e9c8704b02385a615cd5924","observation_id":"8d68a567-7798-4ab4-a802-b88c6fb9dde0","resolution":{"observed_at":"2026-06-28T11:25:47.093260Z","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":"10.14279/tuj.eceasst.64.985","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Electronic Communications of the EASST , author =","venue":"Technische Universität Berlin – Universitätsbibliothek","work_id":"592034d4-783b-44c6-8b3e-026700c4a717","year":2014},"citing_paper":{"arxiv_id":"2606.02926","last_updated":"2026-06-03T04:16:10Z","snapshot_observed_at":"2026-08-14T03:46:52.069826Z","submitted_at":"2026-06-01T22:05:25Z","title":"Diamonds Are Forever: Stabilization Semantics for Unrestricted Aggregation and Recursion in Logica","version":2},"reference_index":67,"source":"arxiv_source","source_observed_at":"2026-06-28T11:25:47.093260Z"},"links":{"citing_paper":"/paper/2606.02926"},"observation_digest":"sha256:cfef04570abaa48578fad3519e6ccc090f200c41308333ac14f6854595d1d42b","observation_id":"3485ec19-9db2-4e28-a14f-883cb07d94e5","resolution":{"observed_at":"2026-06-28T11:32:02.758296Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T11:25:47.093260Z","title":"Expert Systems with Applications , author =","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2606.02926","last_updated":"2026-06-03T04:16:10Z","snapshot_observed_at":"2026-08-14T03:46:52.069826Z","submitted_at":"2026-06-01T22:05:25Z","title":"Diamonds Are Forever: Stabilization Semantics for Unrestricted Aggregation and Recursion in Logica","version":2},"reference_index":68,"source":"arxiv_source","source_observed_at":"2026-06-28T11:25:47.093260Z"},"links":{"citing_paper":"/paper/2606.02926"},"observation_digest":"sha256:fe56f5999a12fef36cd337406afc66095742612ba5fc5b8e969e572485721b66","observation_id":"e7d1af2b-9b96-4d0b-b42a-87eaad97cdd3","resolution":{"observed_at":"2026-06-28T11:25:47.093260Z","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-06-28T11:25:47.093260Z","title":"Proceedings of the Seventh ACM SIGACT-SIGMOD-SIGART Symposium: Principles of Database Systems , author =","venue":null,"work_id":null,"year":1988},"citing_paper":{"arxiv_id":"2606.02926","last_updated":"2026-06-03T04:16:10Z","snapshot_observed_at":"2026-08-14T03:46:52.069826Z","submitted_at":"2026-06-01T22:05:25Z","title":"Diamonds Are Forever: Stabilization Semantics for Unrestricted Aggregation and Recursion in Logica","version":2},"reference_index":69,"source":"arxiv_source","source_observed_at":"2026-06-28T11:25:47.093260Z"},"links":{"citing_paper":"/paper/2606.02926"},"observation_digest":"sha256:cc263aadcf3e715bd92a4c8fdeb103b7cdb4c978970104fd2bf20d5ec501b16d","observation_id":"7cbcb436-a38e-481f-9613-6346370514d7","resolution":{"observed_at":"2026-06-28T11:25:47.093260Z","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":"10.1023/a:1018907806177","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Annals of Mathematics and Artificial Intelligence , author =","venue":"Annals of Mathematics and Artificial Intelligence","work_id":"76fa0f37-b59e-40f5-b704-f3263be6cfae","year":1997},"citing_paper":{"arxiv_id":"2606.02926","last_updated":"2026-06-03T04:16:10Z","snapshot_observed_at":"2026-08-14T03:46:52.069826Z","submitted_at":"2026-06-01T22:05:25Z","title":"Diamonds Are Forever: Stabilization Semantics for Unrestricted Aggregation and Recursion in Logica","version":2},"reference_index":70,"source":"arxiv_source","source_observed_at":"2026-06-28T11:25:47.093260Z"},"links":{"citing_paper":"/paper/2606.02926"},"observation_digest":"sha256:839b7fbe83b1bfab7b5e2dae55dfb1ab7a86b8177d4d090ddcbbdd3ca4dce6bf","observation_id":"04a36a73-b33d-443e-8faf-85dac4ce3cea","resolution":{"observed_at":"2026-06-28T11:32:02.753742Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T11:25:47.093260Z","title":null,"venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2606.02926","last_updated":"2026-06-03T04:16:10Z","snapshot_observed_at":"2026-08-14T03:46:52.069826Z","submitted_at":"2026-06-01T22:05:25Z","title":"Diamonds Are Forever: Stabilization Semantics for Unrestricted Aggregation and Recursion in Logica","version":2},"reference_index":71,"source":"arxiv_source","source_observed_at":"2026-06-28T11:25:47.093260Z"},"links":{"citing_paper":"/paper/2606.02926"},"observation_digest":"sha256:d6a1bcb382749af5618debae3376f70793e804c5865d707dbff9b9503e2ce57f","observation_id":"043b17de-0fd9-4f6f-a591-be151414b7fe","resolution":{"observed_at":"2026-06-28T11:25:47.093260Z","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-06-28T11:25:47.093260Z","title":"2017 , pages =","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2606.02926","last_updated":"2026-06-03T04:16:10Z","snapshot_observed_at":"2026-08-14T03:46:52.069826Z","submitted_at":"2026-06-01T22:05:25Z","title":"Diamonds Are Forever: Stabilization Semantics for Unrestricted Aggregation and Recursion in Logica","version":2},"reference_index":72,"source":"arxiv_source","source_observed_at":"2026-06-28T11:25:47.093260Z"},"links":{"citing_paper":"/paper/2606.02926"},"observation_digest":"sha256:ab36e04ad732f6e0578b9443389de4d29cc4dfee1da9db821c1dc70405ccd8dd","observation_id":"96a03877-945f-40b9-9588-6f2e81b4b5d5","resolution":{"observed_at":"2026-06-28T11:25:47.093260Z","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":"10.1007/s00778-018-0518-5","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"2019 , note =","venue":"The VLDB Journal","work_id":"ba99b97a-e95a-4c63-addc-6c3cf62fc71e","year":2019},"citing_paper":{"arxiv_id":"2606.02926","last_updated":"2026-06-03T04:16:10Z","snapshot_observed_at":"2026-08-14T03:46:52.069826Z","submitted_at":"2026-06-01T22:05:25Z","title":"Diamonds Are Forever: Stabilization Semantics for Unrestricted Aggregation and Recursion in Logica","version":2},"reference_index":73,"source":"arxiv_source","source_observed_at":"2026-06-28T11:25:47.093260Z"},"links":{"citing_paper":"/paper/2606.02926"},"observation_digest":"sha256:e1e1e815c6c3d01c2bd39a9923ae19fdae09f9d9e7d3894122f793fcbb7f2f0d","observation_id":"b9bdab49-e7cb-4dd7-91df-36fb41e17564","resolution":{"observed_at":"2026-06-28T11:32:02.760021Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/978-3-642-24206-9_19","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":null,"venue":"Lecture notes in computer science","work_id":"b778f36a-2aaf-403f-829f-208ae8226274","year":2011},"citing_paper":{"arxiv_id":"2606.02926","last_updated":"2026-06-03T04:16:10Z","snapshot_observed_at":"2026-08-14T03:46:52.069826Z","submitted_at":"2026-06-01T22:05:25Z","title":"Diamonds Are Forever: Stabilization Semantics for Unrestricted Aggregation and Recursion in Logica","version":2},"reference_index":74,"source":"arxiv_source","source_observed_at":"2026-06-28T11:25:47.093260Z"},"links":{"citing_paper":"/paper/2606.02926"},"observation_digest":"sha256:c9bc1c81f761f082f3dbb7935be14211351bd34cc69fb266100174931b84a117","observation_id":"f6df0bb1-7c8b-4d0d-94bf-cd358aba3033","resolution":{"observed_at":"2026-06-28T11:32:02.767458Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1901.01930","last_updated":"2019-01-26T00:16:08Z","snapshot_observed_at":"2026-08-14T17:34:10.215551Z","submitted_at":"2019-01-07T17:20:25Z","title":"Keeping CALM: When Distributed Consistency is Easy","version":2},"cited_work":{"arxiv_id":"1901.01930","doi":null,"metadata_source":"pith","pith_arxiv_id":"1901.01930","snapshot_observed_at":"2026-07-02T01:56:27.632109Z","title":"Keeping CALM: When Distributed Consistency is Easy","venue":"cs.DC","work_id":"7dc08dcd-1305-4c85-8768-7f5e3d457506","year":2019},"citing_paper":{"arxiv_id":"2606.02926","last_updated":"2026-06-03T04:16:10Z","snapshot_observed_at":"2026-08-14T03:46:52.069826Z","submitted_at":"2026-06-01T22:05:25Z","title":"Diamonds Are Forever: Stabilization Semantics for Unrestricted Aggregation and Recursion in Logica","version":2},"reference_index":75,"source":"arxiv_source","source_observed_at":"2026-06-28T11:25:47.093260Z"},"links":{"cited_paper":"/paper/1901.01930","citing_paper":"/paper/2606.02926"},"observation_digest":"sha256:e4af4a4d1e39b7b38cb7f53ffbde099d2e6ba0c1394d8d02300682f46c59df66","observation_id":"b68cd2a6-c92d-4c73-859f-6b1eaf98756f","resolution":{"observed_at":"2026-07-02T01:56:27.634162Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1907.05045","last_updated":"2019-07-11T08:33:13Z","snapshot_observed_at":"2026-08-19T02:41:27.914646Z","submitted_at":"2019-07-11T08:33:13Z","title":"Provenance for Large-scale Datalog","version":1},"cited_work":{"arxiv_id":"1907.05045","doi":null,"metadata_source":"pith","pith_arxiv_id":"1907.05045","snapshot_observed_at":"2026-07-02T01:56:27.636061Z","title":"Provenance for Large-scale Datalog","venue":"cs.PL","work_id":"bc174d78-0e4d-48cd-a9b9-341967952c52","year":2019},"citing_paper":{"arxiv_id":"2606.02926","last_updated":"2026-06-03T04:16:10Z","snapshot_observed_at":"2026-08-14T03:46:52.069826Z","submitted_at":"2026-06-01T22:05:25Z","title":"Diamonds Are Forever: Stabilization Semantics for Unrestricted Aggregation and Recursion in Logica","version":2},"reference_index":76,"source":"arxiv_source","source_observed_at":"2026-06-28T11:25:47.093260Z"},"links":{"cited_paper":"/paper/1907.05045","citing_paper":"/paper/2606.02926"},"observation_digest":"sha256:dcf2a76b040cb4f197322e99115378173544bd482169b6c3765865c4b369514b","observation_id":"09971fbb-b852-4a10-98a6-bae3c131478a","resolution":{"observed_at":"2026-07-02T01:56:27.638790Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T11:25:47.093260Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.02926","last_updated":"2026-06-03T04:16:10Z","snapshot_observed_at":"2026-08-14T03:46:52.069826Z","submitted_at":"2026-06-01T22:05:25Z","title":"Diamonds Are Forever: Stabilization Semantics for Unrestricted Aggregation and Recursion in Logica","version":2},"reference_index":77,"source":"arxiv_source","source_observed_at":"2026-06-28T11:25:47.093260Z"},"links":{"citing_paper":"/paper/2606.02926"},"observation_digest":"sha256:b789e88f60817b5a1031e0a89e8ad783ba3e06e4f20d373b1f6c62f12b935044","observation_id":"3bbcfcf6-c800-4e59-96c8-85cc8c1ba635","resolution":{"observed_at":"2026-06-28T11:25:47.093260Z","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-06-28T11:25:47.093260Z","title":"Future Generation Computer Systems , author =","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2606.02926","last_updated":"2026-06-03T04:16:10Z","snapshot_observed_at":"2026-08-14T03:46:52.069826Z","submitted_at":"2026-06-01T22:05:25Z","title":"Diamonds Are Forever: Stabilization Semantics for Unrestricted Aggregation and Recursion in Logica","version":2},"reference_index":78,"source":"arxiv_source","source_observed_at":"2026-06-28T11:25:47.093260Z"},"links":{"citing_paper":"/paper/2606.02926"},"observation_digest":"sha256:ebc3deb297593e3dc34e6e048ea26f8152bba806f63dc9100c800ec1d3eb390c","observation_id":"fd082e60-8e26-4b83-ae2b-d9434e53df10","resolution":{"observed_at":"2026-06-28T11:25:47.093260Z","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":"10.1561/1900000068","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Data Provenance","venue":"Foundations and Trends in Databases","work_id":"9dd8e9b6-db2b-4030-9211-c3c22e176a98","year":2021},"citing_paper":{"arxiv_id":"2606.02926","last_updated":"2026-06-03T04:16:10Z","snapshot_observed_at":"2026-08-14T03:46:52.069826Z","submitted_at":"2026-06-01T22:05:25Z","title":"Diamonds Are Forever: Stabilization Semantics for Unrestricted Aggregation and Recursion in Logica","version":2},"reference_index":79,"source":"arxiv_source","source_observed_at":"2026-06-28T11:25:47.093260Z"},"links":{"citing_paper":"/paper/2606.02926"},"observation_digest":"sha256:165f0a614fe369f16e2520a9ad9e85a3f52370b2ff9d5faf0f7b62ea79f04db2","observation_id":"63db6930-8bc7-48b1-a74d-7cc2eff0d444","resolution":{"observed_at":"2026-06-28T11:32:02.744085Z","resolver_source":"doi","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T11:25:47.093260Z","title":"and Tekle, K","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.02926","last_updated":"2026-06-03T04:16:10Z","snapshot_observed_at":"2026-08-14T03:46:52.069826Z","submitted_at":"2026-06-01T22:05:25Z","title":"Diamonds Are Forever: Stabilization Semantics for Unrestricted Aggregation and Recursion in Logica","version":2},"reference_index":80,"source":"arxiv_source","source_observed_at":"2026-06-28T11:25:47.093260Z"},"links":{"citing_paper":"/paper/2606.02926"},"observation_digest":"sha256:087e29fafe78ae522c77dd4a7c8ffee329d39fd29a0c27ba1573c2066059267e","observation_id":"dcaabc66-d184-418f-9dda-dd58b5cde861","resolution":{"observed_at":"2026-06-28T11:25:47.093260Z","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-06-28T11:25:47.093260Z","title":"Aggregates in","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.02926","last_updated":"2026-06-03T04:16:10Z","snapshot_observed_at":"2026-08-14T03:46:52.069826Z","submitted_at":"2026-06-01T22:05:25Z","title":"Diamonds Are Forever: Stabilization Semantics for Unrestricted Aggregation and Recursion in Logica","version":2},"reference_index":81,"source":"arxiv_source","source_observed_at":"2026-06-28T11:25:47.093260Z"},"links":{"citing_paper":"/paper/2606.02926"},"observation_digest":"sha256:dbdacc41c09a769691092dffe20536de374972cd87659c0dfa708d038cb501f4","observation_id":"c1a02874-791b-4da0-8543-d9457a1b7d21","resolution":{"observed_at":"2026-06-28T11:25:47.093260Z","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":"10.1145/3379446","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"ACM Transactions on Programming Languages and Systems , author =","venue":"ACM Transactions on Programming Languages and Systems","work_id":"daca264e-f490-41db-b616-fb30fd1e6699","year":2020},"citing_paper":{"arxiv_id":"2606.02926","last_updated":"2026-06-03T04:16:10Z","snapshot_observed_at":"2026-08-14T03:46:52.069826Z","submitted_at":"2026-06-01T22:05:25Z","title":"Diamonds Are Forever: Stabilization Semantics for Unrestricted Aggregation and Recursion in Logica","version":2},"reference_index":82,"source":"arxiv_source","source_observed_at":"2026-06-28T11:25:47.093260Z"},"links":{"citing_paper":"/paper/2606.02926"},"observation_digest":"sha256:74aeca64a7f28e5a462c3fb5a87b56b4e99e473f35e717dfcb93a80b4abf610f","observation_id":"b1b0e653-04e9-4870-bc30-2d96598e59d3","resolution":{"observed_at":"2026-06-28T11:32:02.752020Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T11:25:47.093260Z","title":"and Gottlob, G","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.02926","last_updated":"2026-06-03T04:16:10Z","snapshot_observed_at":"2026-08-14T03:46:52.069826Z","submitted_at":"2026-06-01T22:05:25Z","title":"Diamonds Are Forever: Stabilization Semantics for Unrestricted Aggregation and Recursion in Logica","version":2},"reference_index":83,"source":"arxiv_source","source_observed_at":"2026-06-28T11:25:47.093260Z"},"links":{"citing_paper":"/paper/2606.02926"},"observation_digest":"sha256:fe13e4dd460f537d9c73e137fb7033aed0a6bfef3cbc93e13aa7e209cdb637a4","observation_id":"afd653cd-5041-4320-9487-e4af4c7791ca","resolution":{"observed_at":"2026-06-28T11:25:47.093260Z","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":"10.48786/edbt.2023.66","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Reasoning over financial scenarios with the vadalog system , url =","venue":"Iris (Roma Tre University)","work_id":"b7ce8e90-93ae-4d9a-b3dd-e51314b19487","year":2023},"citing_paper":{"arxiv_id":"2606.02926","last_updated":"2026-06-03T04:16:10Z","snapshot_observed_at":"2026-08-14T03:46:52.069826Z","submitted_at":"2026-06-01T22:05:25Z","title":"Diamonds Are Forever: Stabilization Semantics for Unrestricted Aggregation and Recursion in Logica","version":2},"reference_index":84,"source":"arxiv_source","source_observed_at":"2026-06-28T11:25:47.093260Z"},"links":{"citing_paper":"/paper/2606.02926"},"observation_digest":"sha256:e258f453826456ec7626f7b2de73147e147ed79d50fed1a64b460aaf19315f3f","observation_id":"928635a8-965b-4390-b5d3-1b5c12bd7ae3","resolution":{"observed_at":"2026-06-28T11:32:02.747832Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T11:25:47.093260Z","title":"Logic and","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2606.02926","last_updated":"2026-06-03T04:16:10Z","snapshot_observed_at":"2026-08-14T03:46:52.069826Z","submitted_at":"2026-06-01T22:05:25Z","title":"Diamonds Are Forever: Stabilization Semantics for Unrestricted Aggregation and Recursion in Logica","version":2},"reference_index":85,"source":"arxiv_source","source_observed_at":"2026-06-28T11:25:47.093260Z"},"links":{"citing_paper":"/paper/2606.02926"},"observation_digest":"sha256:136709a640ec7c916b0a6551a7b72e7c63daf841972af7b157503b0f8b4f9ed0","observation_id":"30d20f15-7f89-413c-b192-2214fe36b842","resolution":{"observed_at":"2026-06-28T11:25:47.093260Z","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":"10.1017/s147106840100103x","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Theory and Practice of Logic Programming , author =","venue":"Theory and Practice of Logic Programming","work_id":"04f940f0-28e4-485a-8425-ad311d7b80ee","year":2001},"citing_paper":{"arxiv_id":"2606.02926","last_updated":"2026-06-03T04:16:10Z","snapshot_observed_at":"2026-08-14T03:46:52.069826Z","submitted_at":"2026-06-01T22:05:25Z","title":"Diamonds Are Forever: Stabilization Semantics for Unrestricted Aggregation and Recursion in Logica","version":2},"reference_index":86,"source":"arxiv_source","source_observed_at":"2026-06-28T11:25:47.093260Z"},"links":{"citing_paper":"/paper/2606.02926"},"observation_digest":"sha256:e625b7b126c6ecb67f4a044e863be34efc6cab22d8e13c65fa72356419942122","observation_id":"4ad66b4e-de82-4e77-9d40-3442b71498b2","resolution":{"observed_at":"2026-06-28T11:32:02.746047Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T11:25:47.093260Z","title":"Logic Comput","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2606.02926","last_updated":"2026-06-03T04:16:10Z","snapshot_observed_at":"2026-08-14T03:46:52.069826Z","submitted_at":"2026-06-01T22:05:25Z","title":"Diamonds Are Forever: Stabilization Semantics for Unrestricted Aggregation and Recursion in Logica","version":2},"reference_index":87,"source":"arxiv_source","source_observed_at":"2026-06-28T11:25:47.093260Z"},"links":{"citing_paper":"/paper/2606.02926"},"observation_digest":"sha256:a1d7570cfe86e049ea660dac3ff6b4b59d3b8ad9a912188262ead9f518557958","observation_id":"b583565b-eedd-4f9d-9590-9008e1c8620b","resolution":{"observed_at":"2026-06-28T11:25:47.093260Z","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":"2251.290230","doi":"10.1145/2902251.2902307","metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Hypertree decompositions: Questions and answers","venue":null,"work_id":"9a3cd4ee-fe96-46d0-a824-e26c0d0ff4fb","year":2016},"citing_paper":{"arxiv_id":"2606.02926","last_updated":"2026-06-03T04:16:10Z","snapshot_observed_at":"2026-08-14T03:46:52.069826Z","submitted_at":"2026-06-01T22:05:25Z","title":"Diamonds Are Forever: Stabilization Semantics for Unrestricted Aggregation and Recursion in Logica","version":2},"reference_index":88,"source":"arxiv_source","source_observed_at":"2026-06-28T11:25:47.093260Z"},"links":{"citing_paper":"/paper/2606.02926"},"observation_digest":"sha256:cec4e6fcb1d24551af39d575766362cc7d2d67085b486bcee3bf482b8879dbf7","observation_id":"d882f437-0912-4199-b1be-b3340815f04d","resolution":{"observed_at":"2026-06-28T11:32:02.773548Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T11:25:47.093260Z","title":"CACM , author =","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2606.02926","last_updated":"2026-06-03T04:16:10Z","snapshot_observed_at":"2026-08-14T03:46:52.069826Z","submitted_at":"2026-06-01T22:05:25Z","title":"Diamonds Are Forever: Stabilization Semantics for Unrestricted Aggregation and Recursion in Logica","version":2},"reference_index":89,"source":"arxiv_source","source_observed_at":"2026-06-28T11:25:47.093260Z"},"links":{"citing_paper":"/paper/2606.02926"},"observation_digest":"sha256:8ceb6b9a93c130ee6514817854f679d76af21b2f67ab1274cf3f519049c20ba3","observation_id":"6d9f3638-d8a0-4316-9df3-993023303755","resolution":{"observed_at":"2026-06-28T11:25:47.093260Z","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":"10.1016/j.jcss.2014.01.005","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Journal of Computer and System Sciences , author =","venue":"Journal of Computer and System Sciences","work_id":"ef2554a7-ce4e-40d0-95f4-6568a683a659","year":2014},"citing_paper":{"arxiv_id":"2606.02926","last_updated":"2026-06-03T04:16:10Z","snapshot_observed_at":"2026-08-14T03:46:52.069826Z","submitted_at":"2026-06-01T22:05:25Z","title":"Diamonds Are Forever: Stabilization Semantics for Unrestricted Aggregation and Recursion in Logica","version":2},"reference_index":90,"source":"arxiv_source","source_observed_at":"2026-06-28T11:25:47.093260Z"},"links":{"citing_paper":"/paper/2606.02926"},"observation_digest":"sha256:c8ecbb5cdf4d5a237da9cbf01ff6086b3db37094445dfd141e863ca0b885f68e","observation_id":"b416be25-79e4-43dd-b256-82064f9f81d0","resolution":{"observed_at":"2026-06-28T11:32:02.775838Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"9323.198945","doi":"10.1145/1989323.1989456","metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Datalog and emerging applications: an interactive tutorial , isbn =","venue":null,"work_id":"7d3c4ce6-e6f1-4c11-91bf-fd6c50b216bd","year":2011},"citing_paper":{"arxiv_id":"2606.02926","last_updated":"2026-06-03T04:16:10Z","snapshot_observed_at":"2026-08-14T03:46:52.069826Z","submitted_at":"2026-06-01T22:05:25Z","title":"Diamonds Are Forever: Stabilization Semantics for Unrestricted Aggregation and Recursion in Logica","version":2},"reference_index":91,"source":"arxiv_source","source_observed_at":"2026-06-28T11:25:47.093260Z"},"links":{"citing_paper":"/paper/2606.02926"},"observation_digest":"sha256:e5e9c4e48cf88521e402274bd59d4ec1f7a27e88e40aab91b2b7aeeee8a7bcef","observation_id":"832c306d-c988-424b-93fe-021d3bd8148a","resolution":{"observed_at":"2026-06-28T11:32:02.740369Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T11:25:47.093260Z","title":"Logic and data bases , isbn =","venue":null,"work_id":null,"year":1978},"citing_paper":{"arxiv_id":"2606.02926","last_updated":"2026-06-03T04:16:10Z","snapshot_observed_at":"2026-08-14T03:46:52.069826Z","submitted_at":"2026-06-01T22:05:25Z","title":"Diamonds Are Forever: Stabilization Semantics for Unrestricted Aggregation and Recursion in Logica","version":2},"reference_index":92,"source":"arxiv_source","source_observed_at":"2026-06-28T11:25:47.093260Z"},"links":{"citing_paper":"/paper/2606.02926"},"observation_digest":"sha256:84fc82482566e1dad707feb88cee23cbf5852d708ca3e8dc09ad066c7e05473f","observation_id":"2dfce26c-dce3-432b-b0d6-0d51ecf1f99e","resolution":{"observed_at":"2026-06-28T11:25:47.093260Z","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":"2490.355249","doi":"10.1145/3552490.3552492","metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"and Pichler, Reinhard and Suciu, Dan and Remy Wang, Yisu , title =","venue":"ACM SIGMOD Record","work_id":"8bd8502a-3090-49b0-ad16-af78c87f80a0","year":2022},"citing_paper":{"arxiv_id":"2606.02926","last_updated":"2026-06-03T04:16:10Z","snapshot_observed_at":"2026-08-14T03:46:52.069826Z","submitted_at":"2026-06-01T22:05:25Z","title":"Diamonds Are Forever: Stabilization Semantics for Unrestricted Aggregation and Recursion in Logica","version":2},"reference_index":93,"source":"arxiv_source","source_observed_at":"2026-06-28T11:25:47.093260Z"},"links":{"citing_paper":"/paper/2606.02926"},"observation_digest":"sha256:5f05d7c311731c71e1aad3dfd5786e04067936e3ecb0404678109f5978cc2252","observation_id":"7d226930-a6c9-49e9-9157-574ef9e3d407","resolution":{"observed_at":"2026-06-28T11:32:02.750306Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2991.134299","doi":"10.1145/1342991.1342994","metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Durations and parametric model-checking in timed automata","venue":"ACM Transactions on Computational Logic","work_id":"ca5d5c5f-b029-4988-b9b7-ba7369273299","year":2008},"citing_paper":{"arxiv_id":"2606.02926","last_updated":"2026-06-03T04:16:10Z","snapshot_observed_at":"2026-08-14T03:46:52.069826Z","submitted_at":"2026-06-01T22:05:25Z","title":"Diamonds Are Forever: Stabilization Semantics for Unrestricted Aggregation and Recursion in Logica","version":2},"reference_index":94,"source":"arxiv_source","source_observed_at":"2026-06-28T11:25:47.093260Z"},"links":{"citing_paper":"/paper/2606.02926"},"observation_digest":"sha256:d71bc31547c42f55d653925c80e2e2aa820a18b9e1f410b98077d62cbb5d8910","observation_id":"dffe0463-fff5-442f-96ad-3b2b0851e3d2","resolution":{"observed_at":"2026-06-28T11:32:02.770584Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-05-24T21:23:19.839578+00:00","source":"crossref_status_cache"},{"observed_at":"2026-05-24T21:23:19.839578+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T11:25:47.093260Z","title":"Mathematical Logic , year =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.02926","last_updated":"2026-06-03T04:16:10Z","snapshot_observed_at":"2026-08-14T03:46:52.069826Z","submitted_at":"2026-06-01T22:05:25Z","title":"Diamonds Are Forever: Stabilization Semantics for Unrestricted Aggregation and Recursion in Logica","version":2},"reference_index":95,"source":"arxiv_source","source_observed_at":"2026-06-28T11:25:47.093260Z"},"links":{"citing_paper":"/paper/2606.02926"},"observation_digest":"sha256:4962aeca03d48e25c81c523e42c36d1676d6302bfe35c1521e6fa3fcf857f5d6","observation_id":"a80f630c-6b76-4702-8bbb-2b534172e14a","resolution":{"observed_at":"2026-06-28T11:25:47.093260Z","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-06-28T11:25:47.093260Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.02926","last_updated":"2026-06-03T04:16:10Z","snapshot_observed_at":"2026-08-14T03:46:52.069826Z","submitted_at":"2026-06-01T22:05:25Z","title":"Diamonds Are Forever: Stabilization Semantics for Unrestricted Aggregation and Recursion in Logica","version":2},"reference_index":96,"source":"arxiv_source","source_observed_at":"2026-06-28T11:25:47.093260Z"},"links":{"citing_paper":"/paper/2606.02926"},"observation_digest":"sha256:5bd4f6c475e92851f05cc5e205394beed99f8389df5d2e84daff7049e26825fb","observation_id":"c6e2e00c-96bd-467b-a272-97d34f5a4280","resolution":{"observed_at":"2026-06-28T11:25:47.093260Z","resolver_source":null,"status":"parse_uncertain"},"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-06-28T11:25:47.093260Z","title":", title =","venue":null,"work_id":null,"year":1961},"citing_paper":{"arxiv_id":"2606.02926","last_updated":"2026-06-03T04:16:10Z","snapshot_observed_at":"2026-08-14T03:46:52.069826Z","submitted_at":"2026-06-01T22:05:25Z","title":"Diamonds Are Forever: Stabilization Semantics for Unrestricted Aggregation and Recursion in Logica","version":2},"reference_index":97,"source":"arxiv_source","source_observed_at":"2026-06-28T11:25:47.093260Z"},"links":{"citing_paper":"/paper/2606.02926"},"observation_digest":"sha256:98482157bffacd0446fa45ea65b85862a74618799bd0ea6b8965cdb5ab302693","observation_id":"b372e1e4-a49f-4262-8dee-0f55d8e8bd88","resolution":{"observed_at":"2026-06-28T11:25:47.093260Z","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-06-28T11:25:47.093260Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.02926","last_updated":"2026-06-03T04:16:10Z","snapshot_observed_at":"2026-08-14T03:46:52.069826Z","submitted_at":"2026-06-01T22:05:25Z","title":"Diamonds Are Forever: Stabilization Semantics for Unrestricted Aggregation and Recursion in Logica","version":2},"reference_index":98,"source":"arxiv_source","source_observed_at":"2026-06-28T11:25:47.093260Z"},"links":{"citing_paper":"/paper/2606.02926"},"observation_digest":"sha256:3f7872f58afc4c46f147bc6e6898930e265df830c16164f8aa912c8dc5f6e09a","observation_id":"3982c1c4-fada-4f6c-b418-2528a9939843","resolution":{"observed_at":"2026-06-28T11:25:47.093260Z","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-06-28T11:25:47.093260Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.02926","last_updated":"2026-06-03T04:16:10Z","snapshot_observed_at":"2026-08-14T03:46:52.069826Z","submitted_at":"2026-06-01T22:05:25Z","title":"Diamonds Are Forever: Stabilization Semantics for Unrestricted Aggregation and Recursion in Logica","version":2},"reference_index":99,"source":"arxiv_source","source_observed_at":"2026-06-28T11:25:47.093260Z"},"links":{"citing_paper":"/paper/2606.02926"},"observation_digest":"sha256:244c4a80fd7469ba934877301fb59d65609c05c07e120acd0f02755937463052","observation_id":"152c7f55-9b62-4202-9326-e5c8268df500","resolution":{"observed_at":"2026-06-28T11:25:47.093260Z","resolver_source":null,"status":"parse_uncertain"},"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-06-28T11:25:47.093260Z","title":"and Han, W","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.02926","last_updated":"2026-06-03T04:16:10Z","snapshot_observed_at":"2026-08-14T03:46:52.069826Z","submitted_at":"2026-06-01T22:05:25Z","title":"Diamonds Are Forever: Stabilization Semantics for Unrestricted Aggregation and Recursion in Logica","version":2},"reference_index":100,"source":"arxiv_source","source_observed_at":"2026-06-28T11:25:47.093260Z"},"links":{"citing_paper":"/paper/2606.02926"},"observation_digest":"sha256:f1438be130579bb03842ccda92d5f5068d55f0d4b78b76af7e05619313f55cbe","observation_id":"6595417b-70d1-44c0-a0fb-2acb059fb677","resolution":{"observed_at":"2026-06-28T11:25:47.093260Z","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-06-28T11:25:47.093260Z","title":"and Schneider, F","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.02926","last_updated":"2026-06-03T04:16:10Z","snapshot_observed_at":"2026-08-14T03:46:52.069826Z","submitted_at":"2026-06-01T22:05:25Z","title":"Diamonds Are Forever: Stabilization Semantics for Unrestricted Aggregation and Recursion in Logica","version":2},"reference_index":101,"source":"arxiv_source","source_observed_at":"2026-06-28T11:25:47.093260Z"},"links":{"citing_paper":"/paper/2606.02926"},"observation_digest":"sha256:1590afe37fe8f219b24ca0c220dcd6e79ca2b36f608a121ab83e18ae79ce1ed3","observation_id":"51c84bc8-d9a8-4abb-9f07-ffe19d882048","resolution":{"observed_at":"2026-06-28T11:25:47.093260Z","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-06-28T11:25:47.093260Z","title":"Proceedings of the 41st International Conference on Logic Programming (ICLP 2025) , series =","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2606.02926","last_updated":"2026-06-03T04:16:10Z","snapshot_observed_at":"2026-08-14T03:46:52.069826Z","submitted_at":"2026-06-01T22:05:25Z","title":"Diamonds Are Forever: Stabilization Semantics for Unrestricted Aggregation and Recursion in Logica","version":2},"reference_index":102,"source":"arxiv_source","source_observed_at":"2026-06-28T11:25:47.093260Z"},"links":{"citing_paper":"/paper/2606.02926"},"observation_digest":"sha256:11b5f7a32fc6562d566d37813c6bb9453d4fa4864f249339d6a0a39683176c09","observation_id":"cf2adc0f-54b0-44d5-aca3-a39f82058483","resolution":{"observed_at":"2026-06-28T11:25:47.093260Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2606.02926","last_updated":"2026-06-03T04:16:10Z","latest_version":2,"primary_category":"cs.LO","snapshot_observed_at":"2026-08-14T03:46:52.069826Z","submitted_at":"2026-06-01T22:05:25Z","title":"Diamonds Are Forever: Stabilization Semantics for Unrestricted Aggregation and Recursion in Logica"},"reference_resolution":{"displayed":100,"state_counts":{"malformed_identifier":0,"metadata_mismatch":4,"parse_uncertain":5,"unresolved":75,"verified_exact":16,"verified_fuzzy":0},"total_outbound_references":102},"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-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"thesis":"As of 20 August 2026, this Paper Citation Record lists 100 of 102 outbound references and 0 inbound Pith citation observations for arXiv:2606.02926."}