{"as_of":"2026-08-09T11:38:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:10bf0e47f78a6b24b2278f51251e3a725c33f2682e495a4ebc7e0606a66f3fcc","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-09T06:31:02.800959+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-08T02:02:48.356322Z","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:039191af242723e5ab3ba9a7e82837a1faea29495b47b28c807c6fc502d7294e","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-08T02:02:48.356322Z","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:1c48cb0c9f18eca6beb402400c9b4823d76ae41714af6393bfbd5e20eb3bce52","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-08T02:02:48.356322Z","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:7772ec53e14f8dcf23deb9f1d1ec11466d18d016d9034a365fa53b185e40e908","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-08T02:02:48.356322Z","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:e3638a0e2d1ce73704a1ee499cf9d3c7f75b550a331765585c804e2cd96c41aa","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-08T02:02:48.356322Z","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:0c170878506ed23ec4deb5c0b708d45ed7283542b0fbe93a6885b7aecfe08cad","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-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-08T02:02:48.356322Z","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:7f09a70d8549e7f57271bad7d6f16338e4eecaed2f7ab1b852d275e1b0ebce96","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-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-08T02:02:48.356322Z","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:55dcb72fa61075d5021a994df08481cbd4a799e1c4a45e1b5380dfc51c4ba98d","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-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-08T02:02:48.356322Z","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:668925524b4b6731ca8c7908ae816ceffd6a5ef2c495e39af4ef8ad3673ddf67","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-08T02:02:48.356322Z","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:a54a5cc40811091b19bc25879cc0f18347dcf4cb632a8daba6a610366033ac9c","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-06T16:20:20.374997Z","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-08T02:02:48.356322Z","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:c040762e26abe3539085a609b98bc3c4850547e1bb0bddb374fa1a85897460fd","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-08T02:02:48.356322Z","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:cecaf37c35f1e908363addfed1fa47288fcb4277c684f3a01328c80474cb8a4d","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-08T02:02:48.356322Z","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:23ff39231871d7ad817d78e72ea0fcc8a482fdf3248e53f5dfb2a616d6443235","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-08T02:02:48.356322Z","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:a00949d3c85bc1d56aaeef2f86469a42ed93d3837ec2a3588c971ad940d1b4e7","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-08T02:02:48.356322Z","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:be5f9d05a7aa8983897d5ba9360da2a4e620faa189c80ee9baac8289e58349b6","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-08T02:02:48.356322Z","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:de3dd4b036b3c82a5d89c7d0d4e93d2558ce03a6d755fec6097f3413e658ac61","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-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-08T02:02:48.356322Z","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:f38dd06f954c33dbe4632d79c848554df7c6902e54180a087bba221a3e252e28","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-08T02:02:48.356322Z","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:d90b18d1b7f3cfb90108c7304877fe3721301ca37df8a2dd82f906205f4fd7a6","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-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-08T02:02:48.356322Z","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:7fd40bf4c41d7920b2d7c06b62efd7e37f9ac75295ea7b5bbb74778ded9450ec","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-08T02:02:48.356322Z","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:7ec2662b61964dc9ae844810cdff870aadd43b1792c1ba03b489cc75a2c62072","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-07-06T18:12:18.103577Z","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-08T02:02:48.356322Z","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:d3a8482738f5dba75dedb1bea875fdb1c468d3b2f9f20d77a94714c3f6ac4278","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-08T02:02:48.356322Z","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:a442d1f74ebaa34cb74764131e21d46494baee9fd4c5072946d367d591ab1eee","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-08T02:02:48.356322Z","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:eaff7013373ed789c980757383dd9029271f379e5d0d10e6bac9179986d36a3b","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-08T02:02:48.356322Z","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:5589a90f2a3a940df6c117ad28eb3c7e951e6206082c19545477d17e79908ba9","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-08T02:02:48.356322Z","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:0a5f5286dfec8068ed9b536e55b8345d8c756361147cebf45faaded18cb8a0e3","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-08T02:02:48.356322Z","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:1ff4a698623f075aa4d42156e9d366e38ecb3ccf52cd4ca238d20fae1426c0ce","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-08T02:02:48.356322Z","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:3398affb6c8ba87c65db6ad13e77ba86ee8757562d42859ff40c844faba52e91","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-08T02:02:48.356322Z","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:ab174b8eac213fa00280e816b11ff2a2c22cee7e0b25fa8e1dd403569a7ac898","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-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-08T02:02:48.356322Z","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:32ae2cf174eb00086b7a487ca478ba02f0632264db3460ac705498867c899fec","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-08T02:02:48.356322Z","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:43188113dc0d1954d6418d1dd3710a364689bbfb2cf067f7b9aea0757c2ec9dc","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-08T02:02:48.356322Z","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:ba31d58dff53d030351165112c407ed1e4997d9892446f1b43c6629675041b28","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-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-08T02:11:52.625844Z","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-08T02:02:48.356322Z","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:af8c226e6eaa48aa373b48ccd652772558ab6d06f839de03dbc525327e34d828","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-08T02:02:48.356322Z","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:70c775f443df17533a071d7164bd360cf0439d30a17e58eba35cf80efdfbc4e1","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-08T02:02:48.356322Z","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:a0c62ca1eb70ea0af8469995a306e45f0ce4136785e22b71c252cb7b5d324070","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-08T02:02:48.356322Z","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:7e57edc6de2c57df741b4837f9829cdaff309a1aa70c6ac4378ab58cc895e3da","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-08T02:02:48.356322Z","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-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"thesis":"As of 9 August 2026, this Paper Citation Record lists 34 of 34 outbound references and 0 inbound Pith citation observations for arXiv:2607.15383."}