{"as_of":"2026-08-16T04:21:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:1b99a043a55cd5d5cda0090b497df5f9e90cc3ce6457768ac4c8e03f8e28b0d4","coverage":[{"denominator":34,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":34,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-01T23:38:13.919765Z","state":"measured"},{"denominator":34,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":34,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-15T06:32:42.880941+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/2607.15383/citation-record","integrity":"/paper/2607.15383/integrity","json":"/paper/2607.15383/citation-record.json","paper":"/paper/2607.15383"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T23:38:09.725816Z","title":"2010.C0, an Imperative Programming Language for Novice Computer Scientists","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2607.15383","last_updated":"2026-07-16T18:33:42Z","snapshot_observed_at":"2026-08-14T21:19:07.867466Z","submitted_at":"2026-07-16T18:33:42Z","title":"Gradually Verifying Unfolding Expressions & Pure Functions","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-01T23:38:09.725816Z"},"links":{"citing_paper":"/paper/2607.15383"},"observation_digest":"sha256:8c0bc670cb92a7a19b7773e0382deb68e75547cc8b0970fe8e486f2902d6fd1c","observation_id":"d81724d5-3ad2-4c67-a501-d882fd744425","resolution":{"observed_at":"2026-08-01T23:38:09.725816Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T23:38:09.789576Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.15383","last_updated":"2026-07-16T18:33:42Z","snapshot_observed_at":"2026-08-14T21:19:07.867466Z","submitted_at":"2026-07-16T18:33:42Z","title":"Gradually Verifying Unfolding Expressions & Pure Functions","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-01T23:38:09.789576Z"},"links":{"citing_paper":"/paper/2607.15383"},"observation_digest":"sha256:f9807ae6e0d05b7a45bb3abec46bd9960a804789106377c5206bc8b508dcf9f1","observation_id":"42379819-7546-44a4-8ca8-b480b81c6672","resolution":{"observed_at":"2026-08-01T23:38:09.789576Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T23:38:09.856169Z","title":"Wolf, Joseph Lallemand, Ralf Sasse, Christoph Sprenger, Sven N","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.15383","last_updated":"2026-07-16T18:33:42Z","snapshot_observed_at":"2026-08-14T21:19:07.867466Z","submitted_at":"2026-07-16T18:33:42Z","title":"Gradually Verifying Unfolding Expressions & Pure Functions","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-01T23:38:09.856169Z"},"links":{"citing_paper":"/paper/2607.15383"},"observation_digest":"sha256:68598975fe9189d18a807de9bc7cf903d826fff6fe7c5ff0a2939c527c9dc4a2","observation_id":"5693fc9c-b8fc-41de-acb7-c0ee17dce81d","resolution":{"observed_at":"2026-08-01T23:38:09.856169Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T23:38:09.977210Z","title":null,"venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2607.15383","last_updated":"2026-07-16T18:33:42Z","snapshot_observed_at":"2026-08-14T21:19:07.867466Z","submitted_at":"2026-07-16T18:33:42Z","title":"Gradually Verifying Unfolding Expressions & Pure Functions","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-01T23:38:09.977210Z"},"links":{"citing_paper":"/paper/2607.15383"},"observation_digest":"sha256:cb818b5dc95da50283186e322a52167c95db1c6619890a70d03963869225e5cd","observation_id":"8b4ade88-bdde-4e82-a7dd-53ba9bfc4633","resolution":{"observed_at":"2026-08-01T23:38:09.977210Z","resolver_source":null,"status":"malformed_identifier"},"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-319-73721-8_2","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":"95ee3437-279d-411c-b377-fa4055e07525","year":2018},"citing_paper":{"arxiv_id":"2607.15383","last_updated":"2026-07-16T18:33:42Z","snapshot_observed_at":"2026-08-14T21:19:07.867466Z","submitted_at":"2026-07-16T18:33:42Z","title":"Gradually Verifying Unfolding Expressions & Pure Functions","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-01T23:38:10.045878Z"},"links":{"citing_paper":"/paper/2607.15383"},"observation_digest":"sha256:6124efb436727f6625486e49eca3c503ae26bb0064870c45a64cdfa06d5c0cdf","observation_id":"baa49d40-cba7-4bac-ae20-beca1e8e1d4c","resolution":{"observed_at":"2026-08-01T23:39:22.944262Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1145/3704856","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Summers, and Peter Müller","venue":"Proceedings of the ACM on Programming Languages","work_id":"60f4410b-3429-4b5e-8111-0c9520b57fb2","year":2025},"citing_paper":{"arxiv_id":"2607.15383","last_updated":"2026-07-16T18:33:42Z","snapshot_observed_at":"2026-08-14T21:19:07.867466Z","submitted_at":"2026-07-16T18:33:42Z","title":"Gradually Verifying Unfolding Expressions & Pure Functions","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-01T23:38:10.107247Z"},"links":{"citing_paper":"/paper/2607.15383"},"observation_digest":"sha256:da3eed6be56532e40bf3502cf4f99f9a5a0c7b310e5688dbd6480a047881ef40","observation_id":"8201261a-e0ec-4a90-8ee0-4a67d47f52ea","resolution":{"observed_at":"2026-08-01T23:39:22.789113Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1145/3704808","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":null,"venue":"ACM Transactions on Programming Languages and Systems","work_id":"e3645f2a-f66e-4f19-992b-23120facdb73","year":2025},"citing_paper":{"arxiv_id":"2607.15383","last_updated":"2026-07-16T18:33:42Z","snapshot_observed_at":"2026-08-14T21:19:07.867466Z","submitted_at":"2026-07-16T18:33:42Z","title":"Gradually Verifying Unfolding Expressions & Pure Functions","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-01T23:38:10.168724Z"},"links":{"citing_paper":"/paper/2607.15383"},"observation_digest":"sha256:772bee66a635def93f914f36c3593a591b46181d48b3d5e49e2a66f372085f07","observation_id":"35fc0dff-62f2-44ca-9add-0b8eec3f16e3","resolution":{"observed_at":"2026-08-01T23:39:22.637978Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-08-01T23:38:10.240620Z","title":null,"venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2607.15383","last_updated":"2026-07-16T18:33:42Z","snapshot_observed_at":"2026-08-14T21:19:07.867466Z","submitted_at":"2026-07-16T18:33:42Z","title":"Gradually Verifying Unfolding Expressions & Pure Functions","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-01T23:38:10.240620Z"},"links":{"citing_paper":"/paper/2607.15383"},"observation_digest":"sha256:4d3f7b72a65eb6682737cf220a6019f40a193ba0d85c9164d333091623d69e5e","observation_id":"8e76b7c1-9c84-4e45-97b3-3e0921ee6953","resolution":{"observed_at":"2026-08-01T23:38:10.240620Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T23:38:10.309583Z","title":"Clark, and Éric Tanter","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2607.15383","last_updated":"2026-07-16T18:33:42Z","snapshot_observed_at":"2026-08-14T21:19:07.867466Z","submitted_at":"2026-07-16T18:33:42Z","title":"Gradually Verifying Unfolding Expressions & Pure Functions","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-01T23:38:10.309583Z"},"links":{"citing_paper":"/paper/2607.15383"},"observation_digest":"sha256:47e60d8e25164bade58d3c357452364d84c5fd63b59361310b0411ea3387c5b7","observation_id":"733d05d3-33b9-43ad-9026-2da38c4639f7","resolution":{"observed_at":"2026-08-01T23:38:10.309583Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2507.13533","last_updated":"2025-07-17T20:50:52Z","snapshot_observed_at":"2026-08-14T21:18:32.740269Z","submitted_at":"2025-07-17T20:50:52Z","title":"Increasing the Expressiveness of a Gradual Verifier","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2507.13533","snapshot_observed_at":"2026-08-01T23:38:10.386220Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.15383","last_updated":"2026-07-16T18:33:42Z","snapshot_observed_at":"2026-08-14T21:19:07.867466Z","submitted_at":"2026-07-16T18:33:42Z","title":"Gradually Verifying Unfolding Expressions & Pure Functions","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-01T23:38:10.386220Z"},"links":{"cited_paper":"/paper/2507.13533","citing_paper":"/paper/2607.15383"},"observation_digest":"sha256:5ed24036950eb2dcbc8babda8233a44311f286b2584c38931603b1af3a786bb3","observation_id":"e521a835-1f42-475e-9269-ee8c3486e12f","resolution":{"observed_at":"2026-08-01T23:38:10.386220Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T23:38:10.466324Z","title":null,"venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2607.15383","last_updated":"2026-07-16T18:33:42Z","snapshot_observed_at":"2026-08-14T21:19:07.867466Z","submitted_at":"2026-07-16T18:33:42Z","title":"Gradually Verifying Unfolding Expressions & Pure Functions","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-01T23:38:10.466324Z"},"links":{"citing_paper":"/paper/2607.15383"},"observation_digest":"sha256:265fa99afa1429a87099aa3fff5aed22d4824912960db4172e3b216536176247","observation_id":"9d59b2c6-f863-46f9-b711-d87f1e996d30","resolution":{"observed_at":"2026-08-01T23:38:10.466324Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T23:38:10.547817Z","title":"2023.Verifying Go’s Standard Library","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.15383","last_updated":"2026-07-16T18:33:42Z","snapshot_observed_at":"2026-08-14T21:19:07.867466Z","submitted_at":"2026-07-16T18:33:42Z","title":"Gradually Verifying Unfolding Expressions & Pure Functions","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-01T23:38:10.547817Z"},"links":{"citing_paper":"/paper/2607.15383"},"observation_digest":"sha256:f65ddd04750622e98668255b59947c309c3192b64fe88e48881cc875bd756dfa","observation_id":"8d5b0b7d-ac1d-4640-b13e-bbf8d5635d4c","resolution":{"observed_at":"2026-08-01T23:38:10.547817Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T23:38:10.608326Z","title":null,"venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2607.15383","last_updated":"2026-07-16T18:33:42Z","snapshot_observed_at":"2026-08-14T21:19:07.867466Z","submitted_at":"2026-07-16T18:33:42Z","title":"Gradually Verifying Unfolding Expressions & Pure Functions","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-01T23:38:10.608326Z"},"links":{"citing_paper":"/paper/2607.15383"},"observation_digest":"sha256:e9b05c42bbf026a0e42543f93d249b797b749012a6e9c9c6bb180393bdbc3756","observation_id":"f3ec126d-41f2-406f-9f82-7ddeacbce5da","resolution":{"observed_at":"2026-08-01T23:38:10.608326Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T23:38:10.617154Z","title":"2025.Verifying Parts of the Go Standard Library","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.15383","last_updated":"2026-07-16T18:33:42Z","snapshot_observed_at":"2026-08-14T21:19:07.867466Z","submitted_at":"2026-07-16T18:33:42Z","title":"Gradually Verifying Unfolding Expressions & Pure Functions","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-01T23:38:10.617154Z"},"links":{"citing_paper":"/paper/2607.15383"},"observation_digest":"sha256:5c29a49633a7bc3da77a2814fa304427609b101b8b841b129a69ce4ddde5fdcc","observation_id":"1dedc590-917b-438d-b7b4-b4a0d6ddcb69","resolution":{"observed_at":"2026-08-01T23:38:10.617154Z","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-642-03829-7_7","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Rustan M","venue":"Lecture notes in computer science","work_id":"c78f7b3e-bc94-4729-9a7f-6880fb028a6f","year":2009},"citing_paper":{"arxiv_id":"2607.15383","last_updated":"2026-07-16T18:33:42Z","snapshot_observed_at":"2026-08-14T21:19:07.867466Z","submitted_at":"2026-07-16T18:33:42Z","title":"Gradually Verifying Unfolding Expressions & Pure Functions","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-01T23:38:10.778566Z"},"links":{"citing_paper":"/paper/2607.15383"},"observation_digest":"sha256:f81af731f10a217fdc0a7f9cf3af637f6c532289e41c4a817c3a4abd9b3514ed","observation_id":"4f525d36-c0ff-4cf6-b7ee-725acdc5dee5","resolution":{"observed_at":"2026-08-01T23:39:22.376929Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-08-01T23:38:11.028780Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.15383","last_updated":"2026-07-16T18:33:42Z","snapshot_observed_at":"2026-08-14T21:19:07.867466Z","submitted_at":"2026-07-16T18:33:42Z","title":"Gradually Verifying Unfolding Expressions & Pure Functions","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-01T23:38:11.028780Z"},"links":{"citing_paper":"/paper/2607.15383"},"observation_digest":"sha256:0263365cde546d2824dcb3adb7357b882c21334985ab330ed9a71645a59d379d","observation_id":"a05e9dce-dd54-482a-97b0-ee843c1f1487","resolution":{"observed_at":"2026-08-01T23:38:11.028780Z","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":"2511.22075","doi":"10.48550/arxiv.2511.22075","metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":null,"venue":"arXiv (Cornell University)","work_id":"06d6caa0-1898-48b3-b4f1-89594298159b","year":2025},"citing_paper":{"arxiv_id":"2607.15383","last_updated":"2026-07-16T18:33:42Z","snapshot_observed_at":"2026-08-14T21:19:07.867466Z","submitted_at":"2026-07-16T18:33:42Z","title":"Gradually Verifying Unfolding Expressions & Pure Functions","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-01T23:38:11.296644Z"},"links":{"citing_paper":"/paper/2607.15383"},"observation_digest":"sha256:01a55b10c0f8dba21bb8df59fd669828a39822e47229c7d27e3210aad9898fc2","observation_id":"828f3280-cd4c-4bd9-84be-44f8a754e085","resolution":{"observed_at":"2026-08-01T23:39:22.032131Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-08-01T23:38:11.394531Z","title":null,"venue":null,"work_id":null,"year":2005},"citing_paper":{"arxiv_id":"2607.15383","last_updated":"2026-07-16T18:33:42Z","snapshot_observed_at":"2026-08-14T21:19:07.867466Z","submitted_at":"2026-07-16T18:33:42Z","title":"Gradually Verifying Unfolding Expressions & Pure Functions","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-01T23:38:11.394531Z"},"links":{"citing_paper":"/paper/2607.15383"},"observation_digest":"sha256:5c268c59240b6002bc6d417ccc77e490ec451f23f57091e673b34dadfacd1003","observation_id":"d7710669-865b-4231-aa85-89b4ea53057e","resolution":{"observed_at":"2026-08-01T23:38:11.394531Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T23:38:11.497999Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.15383","last_updated":"2026-07-16T18:33:42Z","snapshot_observed_at":"2026-08-14T21:19:07.867466Z","submitted_at":"2026-07-16T18:33:42Z","title":"Gradually Verifying Unfolding Expressions & Pure Functions","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-01T23:38:11.497999Z"},"links":{"citing_paper":"/paper/2607.15383"},"observation_digest":"sha256:b15d05986df05cfa13d3f7394f74ca3b45a8e4c922a84342ab03f66633d5d27c","observation_id":"78ec64ad-cd81-42ac-a638-a491451ac249","resolution":{"observed_at":"2026-08-01T23:38:11.497999Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2405.06074","last_updated":"2024-05-09T19:57:59Z","snapshot_observed_at":"2026-08-13T00:10:42.093390Z","submitted_at":"2024-05-09T19:57:59Z","title":"Protocols to Code: Formal Verification of a Next-Generation Internet Router","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2405.06074","snapshot_observed_at":"2026-08-01T23:38:11.666596Z","title":"Pereira, Tobias Klenze, Sofia Giampietro, Markus Limbeck, Dionysios Spiliopoulos, Felix A","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.15383","last_updated":"2026-07-16T18:33:42Z","snapshot_observed_at":"2026-08-14T21:19:07.867466Z","submitted_at":"2026-07-16T18:33:42Z","title":"Gradually Verifying Unfolding Expressions & Pure Functions","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-01T23:38:11.666596Z"},"links":{"cited_paper":"/paper/2405.06074","citing_paper":"/paper/2607.15383"},"observation_digest":"sha256:70b0f33944088a61452b2e9a3e3089becec23d00fc0e96eabeaa5f4a0b7516a0","observation_id":"08af4f97-aeb7-4015-8627-de3b0f4d0d2f","resolution":{"observed_at":"2026-08-01T23:38:11.666596Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T23:38:11.754599Z","title":"2024.Verifying Kotlin Code with Viper by Controlling Aliasing","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.15383","last_updated":"2026-07-16T18:33:42Z","snapshot_observed_at":"2026-08-14T21:19:07.867466Z","submitted_at":"2026-07-16T18:33:42Z","title":"Gradually Verifying Unfolding Expressions & Pure Functions","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-01T23:38:11.754599Z"},"links":{"citing_paper":"/paper/2607.15383"},"observation_digest":"sha256:732b2542f27ea6085a74b51cefc7eafda432ba2f5a4d70c319153ed3b17bcd12","observation_id":"0569e913-bb43-49a7-b58c-3a81c16dcbb1","resolution":{"observed_at":"2026-08-01T23:38:11.754599Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T23:38:11.898612Z","title":"Reynolds","venue":null,"work_id":null,"year":2002},"citing_paper":{"arxiv_id":"2607.15383","last_updated":"2026-07-16T18:33:42Z","snapshot_observed_at":"2026-08-14T21:19:07.867466Z","submitted_at":"2026-07-16T18:33:42Z","title":"Gradually Verifying Unfolding Expressions & Pure Functions","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-01T23:38:11.898612Z"},"links":{"citing_paper":"/paper/2607.15383"},"observation_digest":"sha256:27988972207b0553b1bf924a895cb3a5f673c193aa9f4cc533ea89a4f3ebf0ef","observation_id":"551ce371-0d37-46a6-92cb-14f08a4f0f5b","resolution":{"observed_at":"2026-08-01T23:38:11.898612Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T23:38:12.077752Z","title":"2016.Advancing Automated, Permission-based Program Verification Using Symbolic Execution","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2607.15383","last_updated":"2026-07-16T18:33:42Z","snapshot_observed_at":"2026-08-14T21:19:07.867466Z","submitted_at":"2026-07-16T18:33:42Z","title":"Gradually Verifying Unfolding Expressions & Pure Functions","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-01T23:38:12.077752Z"},"links":{"citing_paper":"/paper/2607.15383"},"observation_digest":"sha256:68f07548efe6ac9e26e7163bde5572e24825d5d177af1a9a9bf3bf1f28a1c1fd","observation_id":"97cfe0d6-35ce-4193-a744-21b68df2d24f","resolution":{"observed_at":"2026-08-01T23:38:12.077752Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T23:38:12.180743Z","title":"Siek and Walid Taha","venue":null,"work_id":null,"year":2007},"citing_paper":{"arxiv_id":"2607.15383","last_updated":"2026-07-16T18:33:42Z","snapshot_observed_at":"2026-08-14T21:19:07.867466Z","submitted_at":"2026-07-16T18:33:42Z","title":"Gradually Verifying Unfolding Expressions & Pure Functions","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-01T23:38:12.180743Z"},"links":{"citing_paper":"/paper/2607.15383"},"observation_digest":"sha256:b68196e81bb132ad789bc07252082d33ef954c551ea4f79aa69efa9da4fed9a2","observation_id":"0fcc6294-be74-4849-a27c-f83c9f339766","resolution":{"observed_at":"2026-08-01T23:38:12.180743Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T23:38:12.444606Z","title":null,"venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2607.15383","last_updated":"2026-07-16T18:33:42Z","snapshot_observed_at":"2026-08-14T21:19:07.867466Z","submitted_at":"2026-07-16T18:33:42Z","title":"Gradually Verifying Unfolding Expressions & Pure Functions","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-01T23:38:12.444606Z"},"links":{"citing_paper":"/paper/2607.15383"},"observation_digest":"sha256:01e86ccd85a22f5b0cb7f6016d8ddef5519d368a235282b5bee0cb5d9baf9c16","observation_id":"7fb45039-cdb3-44f2-b34b-a08fd8e331b3","resolution":{"observed_at":"2026-08-01T23:38:12.444606Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T23:38:12.656563Z","title":"Summers and Sophia Drossopoulou","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2607.15383","last_updated":"2026-07-16T18:33:42Z","snapshot_observed_at":"2026-08-14T21:19:07.867466Z","submitted_at":"2026-07-16T18:33:42Z","title":"Gradually Verifying Unfolding Expressions & Pure Functions","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-01T23:38:12.656563Z"},"links":{"citing_paper":"/paper/2607.15383"},"observation_digest":"sha256:525ab100ec3d26acffcba19106e3f6cc82acceba8370a4e610fdd27d954e5503","observation_id":"8fc5c75a-7d89-4675-9060-7543bd21f119","resolution":{"observed_at":"2026-08-01T23:38:12.656563Z","resolver_source":null,"status":"malformed_identifier"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1145/3428296","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":null,"venue":"Proceedings of the ACM on Programming Languages","work_id":"b097295b-b31b-4a6b-a9df-43aecbb2f6db","year":2020},"citing_paper":{"arxiv_id":"2607.15383","last_updated":"2026-07-16T18:33:42Z","snapshot_observed_at":"2026-08-14T21:19:07.867466Z","submitted_at":"2026-07-16T18:33:42Z","title":"Gradually Verifying Unfolding Expressions & Pure Functions","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-01T23:38:12.838982Z"},"links":{"citing_paper":"/paper/2607.15383"},"observation_digest":"sha256:0161774007b9a99c46af72e70adbe170c205d901bc2f7d59f4ba6a0d11f75afd","observation_id":"1a773d6d-d066-403b-8b90-9723baa96e41","resolution":{"observed_at":"2026-08-01T23:39:21.679563Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-08-01T23:38:13.021232Z","title":"Wolf, Linard Arquint, Martin Clochard, Wytse Oortwijn, João C","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2607.15383","last_updated":"2026-07-16T18:33:42Z","snapshot_observed_at":"2026-08-14T21:19:07.867466Z","submitted_at":"2026-07-16T18:33:42Z","title":"Gradually Verifying Unfolding Expressions & Pure Functions","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-01T23:38:13.021232Z"},"links":{"citing_paper":"/paper/2607.15383"},"observation_digest":"sha256:422e945fb7365cd8f767f7cdada1793c3d191b3a21d6f90d819b52910bc72195","observation_id":"58b41166-e5d0-4938-8e59-e7703cdf382d","resolution":{"observed_at":"2026-08-01T23:38:13.021232Z","resolver_source":null,"status":"malformed_identifier"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T23:38:13.187819Z","title":"Wright and Matthias Felleisen","venue":null,"work_id":null,"year":1994},"citing_paper":{"arxiv_id":"2607.15383","last_updated":"2026-07-16T18:33:42Z","snapshot_observed_at":"2026-08-14T21:19:07.867466Z","submitted_at":"2026-07-16T18:33:42Z","title":"Gradually Verifying Unfolding Expressions & Pure Functions","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-01T23:38:13.187819Z"},"links":{"citing_paper":"/paper/2607.15383"},"observation_digest":"sha256:9e6f492cb42ced45624fe58e3fbbebb398a78c3035cd43a4f14776782492bfd9","observation_id":"cea34b4f-d9fc-4e26-9a65-5a5337f62d37","resolution":{"observed_at":"2026-08-01T23:38:13.187819Z","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/3632927","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":null,"venue":"Proceedings of the ACM on Programming Languages","work_id":"5eee6559-581f-413e-b2c1-74492d7df075","year":2024},"citing_paper":{"arxiv_id":"2607.15383","last_updated":"2026-07-16T18:33:42Z","snapshot_observed_at":"2026-08-14T21:19:07.867466Z","submitted_at":"2026-07-16T18:33:42Z","title":"Gradually Verifying Unfolding Expressions & Pure Functions","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-01T23:38:13.362817Z"},"links":{"citing_paper":"/paper/2607.15383"},"observation_digest":"sha256:863c3e6b2ae8264211f796d4b994791afafe750cd415b3dde7039da68a26957d","observation_id":"2ca9d90a-8327-4e59-84c8-78e7b7d79ee0","resolution":{"observed_at":"2026-08-01T23:39:21.390300Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2311.07559","last_updated":"2023-11-13T18:52:27Z","snapshot_observed_at":"2026-08-13T05:26:50.634803Z","submitted_at":"2023-11-13T18:52:27Z","title":"Sound Gradual Verification with Symbolic Execution","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2311.07559","snapshot_observed_at":"2026-08-01T23:38:13.540536Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.15383","last_updated":"2026-07-16T18:33:42Z","snapshot_observed_at":"2026-08-14T21:19:07.867466Z","submitted_at":"2026-07-16T18:33:42Z","title":"Gradually Verifying Unfolding Expressions & Pure Functions","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-01T23:38:13.540536Z"},"links":{"cited_paper":"/paper/2311.07559","citing_paper":"/paper/2607.15383"},"observation_digest":"sha256:a0a1363e029eedb09829efd9717a09bf5a4ca326afbd1b9481832f351eba8164","observation_id":"a7150206-bdf2-417a-9ec4-76bb5475114d","resolution":{"observed_at":"2026-08-01T23:38:13.540536Z","resolver_source":null,"status":"malformed_identifier"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T23:38:13.681511Z","title":"Part 34.2:We want to show thatΓ ′ corresponds toΣ′ 0","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.15383","last_updated":"2026-07-16T18:33:42Z","snapshot_observed_at":"2026-08-14T21:19:07.867466Z","submitted_at":"2026-07-16T18:33:42Z","title":"Gradually Verifying Unfolding Expressions & Pure Functions","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-01T23:38:13.681511Z"},"links":{"citing_paper":"/paper/2607.15383"},"observation_digest":"sha256:7ea6dc983cee9b49dab1c8bb4adda83a0bdbb4990abc8ed73cf1e8c24546f349","observation_id":"521a59ba-1590-4ba4-ad92-34662f2d86d3","resolution":{"observed_at":"2026-08-01T23:38:13.681511Z","resolver_source":null,"status":"malformed_identifier"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T23:38:13.785984Z","title":"Therefore𝑉′′ 0(𝑔(𝜎′ 0)&&𝑡 0)=𝑉 ′(𝑔(𝜎′ 0))∧𝑉 ′(𝑡′ 0)=true","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.15383","last_updated":"2026-07-16T18:33:42Z","snapshot_observed_at":"2026-08-14T21:19:07.867466Z","submitted_at":"2026-07-16T18:33:42Z","title":"Gradually Verifying Unfolding Expressions & Pure Functions","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-01T23:38:13.785984Z"},"links":{"citing_paper":"/paper/2607.15383"},"observation_digest":"sha256:00a3ec69ee9e8ca66bcc2e77648e61661bf0d421b47b1fd3a4bb146b59737cd7","observation_id":"511d6b4e-9c4f-4fc8-b2f3-934b01f81ac7","resolution":{"observed_at":"2026-08-01T23:38:13.785984Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T23:38:13.919765Z","title":"Part 34.2:Since ⟨𝐻, 𝛼′, 𝜌′⟩⊨ ˜𝜙, by lemma 4 T ˜𝜙U⟨𝐻,𝜌′⟩⊆𝛼′","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.15383","last_updated":"2026-07-16T18:33:42Z","snapshot_observed_at":"2026-08-14T21:19:07.867466Z","submitted_at":"2026-07-16T18:33:42Z","title":"Gradually Verifying Unfolding Expressions & Pure Functions","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-01T23:38:13.919765Z"},"links":{"citing_paper":"/paper/2607.15383"},"observation_digest":"sha256:49332085ebc12653e27c079ad6075db18d958ee0e2cee2b8933585c460005b1c","observation_id":"57c1b5ed-f1dc-4777-9693-b9e42d2e2111","resolution":{"observed_at":"2026-08-01T23:38:13.919765Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2607.15383","last_updated":"2026-07-16T18:33:42Z","latest_version":1,"primary_category":"cs.PL","snapshot_observed_at":"2026-08-14T21:19:07.867466Z","submitted_at":"2026-07-16T18:33:42Z","title":"Gradually Verifying Unfolding Expressions & Pure Functions"},"reference_resolution":{"displayed":34,"state_counts":{"malformed_identifier":5,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":22,"verified_exact":7,"verified_fuzzy":0},"total_outbound_references":34},"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-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"thesis":"As of 16 August 2026, this Paper Citation Record lists 34 of 34 outbound references and 0 inbound Pith citation observations for arXiv:2607.15383."}