{"as_of":"2026-08-18T22:09:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:a01f49e36e58516d8373488b3f300a06db17c9fc782d4b8a58a8cb25c52ab1ef","coverage":[{"denominator":20,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":20,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-16T05:49:10.431274Z","state":"measured"},{"denominator":20,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":20,"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/2504.19852/citation-record","integrity":"/paper/2504.19852/integrity","json":"/paper/2504.19852/citation-record.json","paper":"/paper/2504.19852"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T05:49:10.977285Z","title":"Addison-Wesley, 2nd edn","venue":null,"work_id":"303ffdbd-ea8c-44eb-8d16-1c569d46d23d","year":2007},"citing_paper":{"arxiv_id":"2504.19852","last_updated":"2025-04-30T08:39:51Z","snapshot_observed_at":"2026-08-16T05:39:37.668503Z","submitted_at":"2025-04-28T14:47:20Z","title":"A Formal Framework for Naturally Specifying and Verifying Sequential Algorithms","version":2},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-16T05:49:10.323133Z"},"links":{"citing_paper":"/paper/2504.19852"},"observation_digest":"sha256:abc79e397988da292b79c59a1bb598e6c37dd9df543ea53d6144a95ef658025b","observation_id":"b8445e19-877d-40fe-bcc2-2d83ec6974b8","resolution":{"observed_at":"2026-08-16T05:49:10.984526Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T05:49:10.959259Z","title":null,"venue":null,"work_id":"bd9846e2-373b-4d5c-bb7c-53d224dd84f8","year":2024},"citing_paper":{"arxiv_id":"2504.19852","last_updated":"2025-04-30T08:39:51Z","snapshot_observed_at":"2026-08-16T05:39:37.668503Z","submitted_at":"2025-04-28T14:47:20Z","title":"A Formal Framework for Naturally Specifying and Verifying Sequential Algorithms","version":2},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-16T05:49:10.330053Z"},"links":{"citing_paper":"/paper/2504.19852"},"observation_digest":"sha256:d3a197ecf0d29c47eba398c6a0a019fd972b37c3ec8f38301a3181cc656b80ca","observation_id":"610452ee-ce51-4739-8c55-da7fdbf6a8f4","resolution":{"observed_at":"2026-08-16T05:49:10.964490Z","resolver_source":"raw_fallback","status":"unresolved"},"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.4204/eptcs.400.6","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T05:49:10.563613Z","title":"Electronic Proceedings in Theoretical Computer S cience 400, 79–95 (04 2024)","venue":null,"work_id":"7b7d0057-3ae3-4c8e-b3fa-9c64b758407b","year":2024},"citing_paper":{"arxiv_id":"2504.19852","last_updated":"2025-04-30T08:39:51Z","snapshot_observed_at":"2026-08-16T05:39:37.668503Z","submitted_at":"2025-04-28T14:47:20Z","title":"A Formal Framework for Naturally Specifying and Verifying Sequential Algorithms","version":2},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-16T05:49:10.335853Z"},"links":{"citing_paper":"/paper/2504.19852"},"observation_digest":"sha256:4fa3930f6a96ea88078b6b835c84847e92376b24dcb07ef19da852bf0684b2bb","observation_id":"cb23c5f8-ef27-4f57-9555-b304b346b230","resolution":{"observed_at":"2026-08-16T05:49:10.569152Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T05:49:10.937453Z","title":"The MIT Press, 3rd edn","venue":null,"work_id":"b8f64afa-2c5f-4a78-97fd-c10056f83984","year":2009},"citing_paper":{"arxiv_id":"2504.19852","last_updated":"2025-04-30T08:39:51Z","snapshot_observed_at":"2026-08-16T05:39:37.668503Z","submitted_at":"2025-04-28T14:47:20Z","title":"A Formal Framework for Naturally Specifying and Verifying Sequential Algorithms","version":2},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-16T05:49:10.342487Z"},"links":{"citing_paper":"/paper/2504.19852"},"observation_digest":"sha256:1daed23ab2095af40dd26b8d19760b19881df3c5e2fce6b280162569f614c218","observation_id":"64de3d89-4492-40af-823a-45bdc2b02537","resolution":{"observed_at":"2026-08-16T05:49:10.943995Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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-08-16T05:49:10.350348Z","title":null,"venue":null,"work_id":null,"year":1969},"citing_paper":{"arxiv_id":"2504.19852","last_updated":"2025-04-30T08:39:51Z","snapshot_observed_at":"2026-08-16T05:39:37.668503Z","submitted_at":"2025-04-28T14:47:20Z","title":"A Formal Framework for Naturally Specifying and Verifying Sequential Algorithms","version":2},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-16T05:49:10.350348Z"},"links":{"citing_paper":"/paper/2504.19852"},"observation_digest":"sha256:66b2f181e572b77337fa873e393ea45906cebe592faca5e4f13870724ff0ac3b","observation_id":"863e23b2-2cbb-4b27-9654-541ebd3fbf6e","resolution":{"observed_at":"2026-08-16T05:49:10.350348Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1017/s095679681800014x","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T05:49:10.547660Z","title":"Journal of Functional Programming 28, e20 (2018)","venue":null,"work_id":"b3c8cf16-2e4b-4806-bb04-d02c4e1e1756","year":2018},"citing_paper":{"arxiv_id":"2504.19852","last_updated":"2025-04-30T08:39:51Z","snapshot_observed_at":"2026-08-16T05:39:37.668503Z","submitted_at":"2025-04-28T14:47:20Z","title":"A Formal Framework for Naturally Specifying and Verifying Sequential Algorithms","version":2},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-16T05:49:10.357721Z"},"links":{"citing_paper":"/paper/2504.19852"},"observation_digest":"sha256:6b5041901de8a1d32b664ae5ef5e9c4db9cfeaf8a5affe9c4af3bd496a7b553a","observation_id":"7540b7a5-782e-4a6d-ab4c-ad45e130a5e5","resolution":{"observed_at":"2026-08-16T05:49:10.552170Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T05:49:10.915889Z","title":null,"venue":null,"work_id":"29900c89-d4fd-4a91-b1e5-bb5faa0e1a10","year":1977},"citing_paper":{"arxiv_id":"2504.19852","last_updated":"2025-04-30T08:39:51Z","snapshot_observed_at":"2026-08-16T05:39:37.668503Z","submitted_at":"2025-04-28T14:47:20Z","title":"A Formal Framework for Naturally Specifying and Verifying Sequential Algorithms","version":2},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-16T05:49:10.364312Z"},"links":{"citing_paper":"/paper/2504.19852"},"observation_digest":"sha256:bb029192de45e12a4a01410e8ceb9e6ab654fd80a79c8d9716c8ee805ac10655","observation_id":"2b41a2fb-ca3c-4684-95c9-d8871f54b6c5","resolution":{"observed_at":"2026-08-16T05:49:10.921112Z","resolver_source":"raw_fallback","status":"unresolved"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T05:49:10.893982Z","title":"Archive of F ormal Proofs (Jan- uary 2012), https://isa-afp.org/entries/Refine_Monadic.html, Formal proof development","venue":null,"work_id":"ccd4c777-1451-4f47-9c23-2d08f0e34b00","year":2012},"citing_paper":{"arxiv_id":"2504.19852","last_updated":"2025-04-30T08:39:51Z","snapshot_observed_at":"2026-08-16T05:39:37.668503Z","submitted_at":"2025-04-28T14:47:20Z","title":"A Formal Framework for Naturally Specifying and Verifying Sequential Algorithms","version":2},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-16T05:49:10.370712Z"},"links":{"citing_paper":"/paper/2504.19852"},"observation_digest":"sha256:7fda82f369eb8e33c13dcc37e2ddb7a61baecb5fdfbd8fae06686be4394761dc","observation_id":"6ec117e5-180f-4331-9215-c471f7c7bf38","resolution":{"observed_at":"2026-08-16T05:49:10.902611Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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-08-16T05:49:10.378609Z","title":null,"venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2504.19852","last_updated":"2025-04-30T08:39:51Z","snapshot_observed_at":"2026-08-16T05:39:37.668503Z","submitted_at":"2025-04-28T14:47:20Z","title":"A Formal Framework for Naturally Specifying and Verifying Sequential Algorithms","version":2},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-16T05:49:10.378609Z"},"links":{"citing_paper":"/paper/2504.19852"},"observation_digest":"sha256:48f1f2c5427a6c97ec4a52ee8023c546628b030af11e5bdcc4dfcdecae36b1f0","observation_id":"4f3154f6-c634-4d7e-97a1-c9b309af263c","resolution":{"observed_at":"2026-08-16T05:49:10.378609Z","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-16T05:49:10.383979Z","title":"Informati on and Computation 93(1), 55–92 (1991)","venue":null,"work_id":null,"year":1991},"citing_paper":{"arxiv_id":"2504.19852","last_updated":"2025-04-30T08:39:51Z","snapshot_observed_at":"2026-08-16T05:39:37.668503Z","submitted_at":"2025-04-28T14:47:20Z","title":"A Formal Framework for Naturally Specifying and Verifying Sequential Algorithms","version":2},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-16T05:49:10.383979Z"},"links":{"citing_paper":"/paper/2504.19852"},"observation_digest":"sha256:bc066e6f4a6de42b2e7299090ac3600b96b288ebb4a1966fb06873bb3b7d4cea","observation_id":"ed8e4cc6-503e-4e93-8f34-1dc22fbc983d","resolution":{"observed_at":"2026-08-16T05:49:10.383979Z","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-16T05:49:10.388453Z","title":null,"venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"2504.19852","last_updated":"2025-04-30T08:39:51Z","snapshot_observed_at":"2026-08-16T05:39:37.668503Z","submitted_at":"2025-04-28T14:47:20Z","title":"A Formal Framework for Naturally Specifying and Verifying Sequential Algorithms","version":2},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-16T05:49:10.388453Z"},"links":{"citing_paper":"/paper/2504.19852"},"observation_digest":"sha256:74022e362e7802b03309dec102f88978a19e07e1bbdaefe5cb249de6aab6fd34","observation_id":"6d545cc0-fede-499c-ab41-0ec1f0482f42","resolution":{"observed_at":"2026-08-16T05:49:10.388453Z","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.4230/lipics.itp.2021.29","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T05:49:10.498227Z","title":"In: Cohen, L., Kaliszyk, C","venue":null,"work_id":"8daa51f2-709b-4a7e-abc2-b45bea0044bc","year":2021},"citing_paper":{"arxiv_id":"2504.19852","last_updated":"2025-04-30T08:39:51Z","snapshot_observed_at":"2026-08-16T05:39:37.668503Z","submitted_at":"2025-04-28T14:47:20Z","title":"A Formal Framework for Naturally Specifying and Verifying Sequential Algorithms","version":2},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-16T05:49:10.393457Z"},"links":{"citing_paper":"/paper/2504.19852"},"observation_digest":"sha256:5860bd1836c838d937ca6a64b4e18ff6639de4e89f7bbfff6c934a6b1218764f","observation_id":"b7ae1f4a-916b-402d-a23d-3678601272d9","resolution":{"observed_at":"2026-08-16T05:49:10.502576Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T05:49:10.870260Z","title":"Springer-Verlag, Berlin, Heidelberg (2002)","venue":null,"work_id":"80e6c4eb-6cd7-488b-9ec5-495e7055a187","year":2002},"citing_paper":{"arxiv_id":"2504.19852","last_updated":"2025-04-30T08:39:51Z","snapshot_observed_at":"2026-08-16T05:39:37.668503Z","submitted_at":"2025-04-28T14:47:20Z","title":"A Formal Framework for Naturally Specifying and Verifying Sequential Algorithms","version":2},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-16T05:49:10.397494Z"},"links":{"citing_paper":"/paper/2504.19852"},"observation_digest":"sha256:7d14e6577e7a67049b112f854d939414774413002d3ed7d6661bfdaeb74c2250","observation_id":"4137c236-6ae3-4aa2-a700-0dad21dbb8d2","resolution":{"observed_at":"2026-08-16T05:49:10.879316Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T05:49:10.848283Z","title":"Arch ive of Formal Proofs (November 2023), https://isa-afp.org/entries/KnuthMorrisPratt.html, For- mal proof development","venue":null,"work_id":"0e48eed7-c0cc-4c2d-88ba-f906cd641edc","year":2023},"citing_paper":{"arxiv_id":"2504.19852","last_updated":"2025-04-30T08:39:51Z","snapshot_observed_at":"2026-08-16T05:39:37.668503Z","submitted_at":"2025-04-28T14:47:20Z","title":"A Formal Framework for Naturally Specifying and Verifying Sequential Algorithms","version":2},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-16T05:49:10.402258Z"},"links":{"citing_paper":"/paper/2504.19852"},"observation_digest":"sha256:82e1c15006797549b865b88da4300fd219405e827c7204c357ceb91c840cf2a3","observation_id":"02f0fbbf-08fa-4af3-ab85-fda1765f2749","resolution":{"observed_at":"2026-08-16T05:49:10.854129Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T05:49:10.832390Z","title":null,"venue":null,"work_id":"04897742-2a99-49f5-837f-fcdf7183a03f","year":2024},"citing_paper":{"arxiv_id":"2504.19852","last_updated":"2025-04-30T08:39:51Z","snapshot_observed_at":"2026-08-16T05:39:37.668503Z","submitted_at":"2025-04-28T14:47:20Z","title":"A Formal Framework for Naturally Specifying and Verifying Sequential Algorithms","version":2},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-16T05:49:10.407737Z"},"links":{"citing_paper":"/paper/2504.19852"},"observation_digest":"sha256:6b562de1970833af6bd50e402635b535e8a712eb5bd938be51ed4016805b2585","observation_id":"54be83e1-bcd0-492c-9d1f-decf66019d39","resolution":{"observed_at":"2026-08-16T05:49:10.837034Z","resolver_source":"raw_fallback","status":"unresolved"},"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":{"arxiv_id":"2002.10298","last_updated":"2020-09-03T20:58:25Z","snapshot_observed_at":"2026-07-06T08:59:36.401601Z","submitted_at":"2020-02-24T14:58:39Z","title":"Reducing urban traffic congestion due to localized routing decisions","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2002.10298","snapshot_observed_at":"2026-08-16T05:49:10.411941Z","title":"In: Proceedings of the 17th Annual IEEE Symposium on L ogic in Computer Science (LICS 2002)","venue":null,"work_id":null,"year":2002},"citing_paper":{"arxiv_id":"2504.19852","last_updated":"2025-04-30T08:39:51Z","snapshot_observed_at":"2026-08-16T05:39:37.668503Z","submitted_at":"2025-04-28T14:47:20Z","title":"A Formal Framework for Naturally Specifying and Verifying Sequential Algorithms","version":2},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-16T05:49:10.411941Z"},"links":{"cited_paper":"/paper/2002.10298","citing_paper":"/paper/2504.19852"},"observation_digest":"sha256:be0152e71e97e87061e638d4b71f20c607d16899fade0c289c324d87099b4d7b","observation_id":"ac20ae40-5fc7-4016-9dc5-a67566e69d82","resolution":{"observed_at":"2026-08-16T05:49:10.411941Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T05:49:10.809661Z","title":"https://coq.inria.fr/doc/V8.19.0/refman (2024)","venue":null,"work_id":"4802bb57-8b6c-4e2d-8e75-d00a4ba4116f","year":2024},"citing_paper":{"arxiv_id":"2504.19852","last_updated":"2025-04-30T08:39:51Z","snapshot_observed_at":"2026-08-16T05:39:37.668503Z","submitted_at":"2025-04-28T14:47:20Z","title":"A Formal Framework for Naturally Specifying and Verifying Sequential Algorithms","version":2},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-16T05:49:10.417137Z"},"links":{"citing_paper":"/paper/2504.19852"},"observation_digest":"sha256:530e9fef2f6f0ef1650eedbdc22ab464150abc9b53eba1bbf72b5a4f45107f17","observation_id":"ff95c3bf-a155-4213-a2f5-3513310bb6b9","resolution":{"observed_at":"2026-08-16T05:49:10.814728Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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/3360597","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T05:49:10.482177Z","title":null,"venue":null,"work_id":"6e2b0a72-ca89-4702-9178-403fbfe8e37b","year":2019},"citing_paper":{"arxiv_id":"2504.19852","last_updated":"2025-04-30T08:39:51Z","snapshot_observed_at":"2026-08-16T05:39:37.668503Z","submitted_at":"2025-04-28T14:47:20Z","title":"A Formal Framework for Naturally Specifying and Verifying Sequential Algorithms","version":2},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-16T05:49:10.421295Z"},"links":{"citing_paper":"/paper/2504.19852"},"observation_digest":"sha256:3a83ca735e9d8e675f46141e18f0ba1a565dd358dc3dd361bc4294c28076a70e","observation_id":"5a84dbf1-d538-46f3-96c1-133bafd0a653","resolution":{"observed_at":"2026-08-16T05:49:10.487839Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T05:49:10.785731Z","title":"MIT Press, Cambridge, MA, USA (1993)","venue":null,"work_id":"1f87678a-6a45-4d50-85c4-83ce122d450c","year":1993},"citing_paper":{"arxiv_id":"2504.19852","last_updated":"2025-04-30T08:39:51Z","snapshot_observed_at":"2026-08-16T05:39:37.668503Z","submitted_at":"2025-04-28T14:47:20Z","title":"A Formal Framework for Naturally Specifying and Verifying Sequential Algorithms","version":2},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-16T05:49:10.426305Z"},"links":{"citing_paper":"/paper/2504.19852"},"observation_digest":"sha256:1972247647663c99e86167d6c4ad47a68fd4c45915a6aed53c063569de04bf17","observation_id":"8d75cf04-fab4-41ea-badb-0ff8ed024845","resolution":{"observed_at":"2026-08-16T05:49:10.790191Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":{"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":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2504.17444","snapshot_observed_at":"2026-08-16T05:49:10.431274Z","title":"Al though we can use a state relation monad with unit state (as we’ve done in previous examples), it is more convenient and natural to use a monad that is intrin sically stateless","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2504.19852","last_updated":"2025-04-30T08:39:51Z","snapshot_observed_at":"2026-08-16T05:39:37.668503Z","submitted_at":"2025-04-28T14:47:20Z","title":"A Formal Framework for Naturally Specifying and Verifying Sequential Algorithms","version":2},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-16T05:49:10.431274Z"},"links":{"cited_paper":"/paper/2504.17444","citing_paper":"/paper/2504.19852"},"observation_digest":"sha256:8de533fbdbc1a7c794a8b6cc78f22a41fba6ca04dc7a57d88d19feb68956aeb3","observation_id":"1cc98e22-3e94-4613-8f0d-07e863a2ea01","resolution":{"observed_at":"2026-08-16T05:49:10.431274Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2504.19852","last_updated":"2025-04-30T08:39:51Z","latest_version":2,"primary_category":"cs.PL","snapshot_observed_at":"2026-08-16T05:39:37.668503Z","submitted_at":"2025-04-28T14:47:20Z","title":"A Formal Framework for Naturally Specifying and Verifying Sequential Algorithms"},"reference_resolution":{"displayed":20,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":9,"verified_exact":4,"verified_fuzzy":7},"total_outbound_references":20},"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 20 of 20 outbound references and 0 inbound Pith citation observations for arXiv:2504.19852."}