{"as_of":"2026-08-18T19:16:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:0556d12fa6d08f24b42d9c4b6bcca296fb2931bf679c111e08b88caedeed1342","coverage":[{"denominator":12,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":12,"source":"paper_references, paper_reference_links","source_observed_at":"2026-06-29T02:20:43.214338Z","state":"measured"},{"denominator":12,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":12,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-18T06:34:40.430872+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.27916/citation-record","integrity":"/paper/2606.27916/integrity","json":"/paper/2606.27916/citation-record.json","paper":"/paper/2606.27916"},"outbound":[{"citation":{"cited_paper":{"arxiv_id":"2504.17444","last_updated":"2025-08-21T05:06:36Z","snapshot_observed_at":"2026-08-16T10:37:39.603272Z","submitted_at":"2025-04-24T11:13:54Z","title":"Encode the $\\forall\\exists$ Relational Hoare Logic into Standard Hoare Logic","version":2},"cited_work":{"arxiv_id":"2504.17444","doi":"10.48550/arxiv.2504.17444","metadata_source":"arxiv_reference","pith_arxiv_id":"2504.17444","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"CoRR , volume =","venue":"arXiv (Cornell University)","work_id":"72e89084-2a6f-41cb-a60f-a8caaee4a2f7","year":2025},"citing_paper":{"arxiv_id":"2606.27916","last_updated":"2026-06-26T10:06:36Z","snapshot_observed_at":"2026-08-13T07:26:47.006664Z","submitted_at":"2026-06-26T10:06:36Z","title":"Combining Axiomatic Models for Refinement Proofs","version":1},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-06-29T02:20:43.214338Z"},"links":{"cited_paper":"/paper/2504.17444","citing_paper":"/paper/2606.27916"},"observation_digest":"sha256:599caccca20fb6547157ba421d51a513b31c5aa6fe9ff802d6cd10850aab9533","observation_id":"8ce80c53-0f2b-424e-8ac5-e01dd56c167c","resolution":{"observed_at":"2026-06-29T02:23:00.851809Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"1995.1134","doi":"10.1006/inco.1995.1134","metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Lynch and Frits W","venue":"Information and Computation","work_id":"a7658450-a0ce-41a1-8074-29b7f8d4220c","year":1995},"citing_paper":{"arxiv_id":"2606.27916","last_updated":"2026-06-26T10:06:36Z","snapshot_observed_at":"2026-08-13T07:26:47.006664Z","submitted_at":"2026-06-26T10:06:36Z","title":"Combining Axiomatic Models for Refinement Proofs","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-06-29T02:20:43.214338Z"},"links":{"citing_paper":"/paper/2606.27916"},"observation_digest":"sha256:9bf5092fa8f4a7e1d92dd0d95a69ad1b8810b8f03f278aec2e0224c279454c7c","observation_id":"eea92f83-8f06-4490-87a0-5c3723a40ca1","resolution":{"observed_at":"2026-06-29T02:23:00.854052Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2310.18156","doi":"10.48550/arxiv.2310.18156","metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Sufficient incorrectness logic: SIL and separation SIL","venue":"arXiv (Cornell University)","work_id":"85ebb7be-5712-4a45-a18d-422e4f444eaf","year":2023},"citing_paper":{"arxiv_id":"2606.27916","last_updated":"2026-06-26T10:06:36Z","snapshot_observed_at":"2026-08-13T07:26:47.006664Z","submitted_at":"2026-06-26T10:06:36Z","title":"Combining Axiomatic Models for Refinement Proofs","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-06-29T02:20:43.214338Z"},"links":{"citing_paper":"/paper/2606.27916"},"observation_digest":"sha256:05afd1d2e18a621ad1a6d95030d25296a77f939ac0e8006432d2e96037f89d6c","observation_id":"8c2a02dd-8fa1-4e51-9cc3-2bed7d701165","resolution":{"observed_at":"2026-06-29T02:23:00.849522Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1145/3704896","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":"a2335aff-fee1-4c15-a8a7-c5abc2d05d31","year":2025},"citing_paper":{"arxiv_id":"2606.27916","last_updated":"2026-06-26T10:06:36Z","snapshot_observed_at":"2026-08-13T07:26:47.006664Z","submitted_at":"2026-06-26T10:06:36Z","title":"Combining Axiomatic Models for Refinement Proofs","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-06-29T02:20:43.214338Z"},"links":{"citing_paper":"/paper/2606.27916"},"observation_digest":"sha256:8f4639fed1f966fd8edc30c045226a90066ee0d2c2c686e917d4073a028ecdce","observation_id":"acc5ee42-ceb7-4cc3-a177-d809348239cc","resolution":{"observed_at":"2026-06-29T02:23:00.855576Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-29T02:20:43.214338Z","title":"Acta Informatica , volume =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.27916","last_updated":"2026-06-26T10:06:36Z","snapshot_observed_at":"2026-08-13T07:26:47.006664Z","submitted_at":"2026-06-26T10:06:36Z","title":"Combining Axiomatic Models for Refinement Proofs","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-06-29T02:20:43.214338Z"},"links":{"citing_paper":"/paper/2606.27916"},"observation_digest":"sha256:2db1de88713aec83c1a3d5eb7e720966da2d33bb3fe990b777e533b73bb6ef16","observation_id":"a8c31ed7-3c40-4401-9cc3-a95370794cc7","resolution":{"observed_at":"2026-06-29T02:20:43.214338Z","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-29T02:20:43.214338Z","title":"Theoretical Computer Science , volume =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.27916","last_updated":"2026-06-26T10:06:36Z","snapshot_observed_at":"2026-08-13T07:26:47.006664Z","submitted_at":"2026-06-26T10:06:36Z","title":"Combining Axiomatic Models for Refinement Proofs","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-06-29T02:20:43.214338Z"},"links":{"citing_paper":"/paper/2606.27916"},"observation_digest":"sha256:ec00288dbfb2ee056adc7175d0aa611d057bf02ae67070588b2c0fedf66d8168","observation_id":"a82eb13f-35ac-4a83-9d5a-85c1edd5b0f6","resolution":{"observed_at":"2026-06-29T02:20:43.214338Z","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-29T02:20:43.214338Z","title":"Floyd , title =","venue":null,"work_id":null,"year":1967},"citing_paper":{"arxiv_id":"2606.27916","last_updated":"2026-06-26T10:06:36Z","snapshot_observed_at":"2026-08-13T07:26:47.006664Z","submitted_at":"2026-06-26T10:06:36Z","title":"Combining Axiomatic Models for Refinement Proofs","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-06-29T02:20:43.214338Z"},"links":{"citing_paper":"/paper/2606.27916"},"observation_digest":"sha256:2fc357070ce9dae9b98b407f640ee49e03cbb1222bbda06ae8b4270f0fc150d5","observation_id":"65bef1ab-4a6e-42e2-a0f0-75e59f55cac6","resolution":{"observed_at":"2026-06-29T02:20:43.214338Z","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-29T02:20:43.214338Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.27916","last_updated":"2026-06-26T10:06:36Z","snapshot_observed_at":"2026-08-13T07:26:47.006664Z","submitted_at":"2026-06-26T10:06:36Z","title":"Combining Axiomatic Models for Refinement Proofs","version":1},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-06-29T02:20:43.214338Z"},"links":{"citing_paper":"/paper/2606.27916"},"observation_digest":"sha256:a48ddc3e9a0d069aac9119ad216344da4f9c52f6d2b42c63f6e98020075396c2","observation_id":"49a7d71c-d8d2-45cf-b4b1-0c5d9fd1070e","resolution":{"observed_at":"2026-06-29T02:20:43.214338Z","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-29T02:20:43.214338Z","title":"POPL , pages =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.27916","last_updated":"2026-06-26T10:06:36Z","snapshot_observed_at":"2026-08-13T07:26:47.006664Z","submitted_at":"2026-06-26T10:06:36Z","title":"Combining Axiomatic Models for Refinement Proofs","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-06-29T02:20:43.214338Z"},"links":{"citing_paper":"/paper/2606.27916"},"observation_digest":"sha256:a8e868e0ed97b95e9ac0726a07cdad8da967b9700f9838cc49e2de7589535fac","observation_id":"ab25dcb0-0347-4b4c-a751-ab4b5181cebd","resolution":{"observed_at":"2026-06-29T02:20:43.214338Z","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-29T02:20:43.214338Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.27916","last_updated":"2026-06-26T10:06:36Z","snapshot_observed_at":"2026-08-13T07:26:47.006664Z","submitted_at":"2026-06-26T10:06:36Z","title":"Combining Axiomatic Models for Refinement Proofs","version":1},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-06-29T02:20:43.214338Z"},"links":{"citing_paper":"/paper/2606.27916"},"observation_digest":"sha256:51da60297acca8801fea6c9cb3c4a7d9bf10b0481e843da6c21f0bf6e42f3092","observation_id":"2e1d421e-2544-4b11-bb39-159519df89f7","resolution":{"observed_at":"2026-06-29T02:20:43.214338Z","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/3371078","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"org/abs/2504.20415v1","venue":"Proceedings of the ACM on Programming Languages","work_id":"f023f3eb-c0c2-4cf0-b136-77973a53fb3a","year":2019},"citing_paper":{"arxiv_id":"2606.27916","last_updated":"2026-06-26T10:06:36Z","snapshot_observed_at":"2026-08-13T07:26:47.006664Z","submitted_at":"2026-06-26T10:06:36Z","title":"Combining Axiomatic Models for Refinement Proofs","version":1},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-06-29T02:20:43.214338Z"},"links":{"citing_paper":"/paper/2606.27916"},"observation_digest":"sha256:82c1d061b37b2ba95bd8d546b6007b943d3e7ce9fba0ccde6289208753717dbb","observation_id":"9ac2a32f-fd96-4044-906f-99c2462e8b71","resolution":{"observed_at":"2026-06-29T02:23:00.857209Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-29T02:20:43.214338Z","title":"Automatic Inference of Necessary Preconditions","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2606.27916","last_updated":"2026-06-26T10:06:36Z","snapshot_observed_at":"2026-08-13T07:26:47.006664Z","submitted_at":"2026-06-26T10:06:36Z","title":"Combining Axiomatic Models for Refinement Proofs","version":1},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-06-29T02:20:43.214338Z"},"links":{"citing_paper":"/paper/2606.27916"},"observation_digest":"sha256:168caa73072b4ea4bfc6ec90e5289800ac3ac61e9761064ec5d056d802d8990f","observation_id":"e5e97636-6ad5-4d4b-ad50-c9c56823372b","resolution":{"observed_at":"2026-06-29T02:20:43.214338Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2606.27916","last_updated":"2026-06-26T10:06:36Z","latest_version":1,"primary_category":"cs.LO","snapshot_observed_at":"2026-08-13T07:26:47.006664Z","submitted_at":"2026-06-26T10:06:36Z","title":"Combining Axiomatic Models for Refinement Proofs"},"reference_resolution":{"displayed":12,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":7,"verified_exact":5,"verified_fuzzy":0},"total_outbound_references":12},"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-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"thesis":"As of 18 August 2026, this Paper Citation Record lists 12 of 12 outbound references and 0 inbound Pith citation observations for arXiv:2606.27916."}