{"as_of":"2026-08-17T19:01:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:461fc750c237042d7a70b366081396bd8c0c5cbecafda387a27e0ce43774e841","coverage":[{"denominator":23,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":23,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-05T23:14:19.825861Z","state":"measured"},{"denominator":23,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":23,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-17T06:30:58.91139+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/2508.05798/citation-record","integrity":"/paper/2508.05798/integrity","json":"/paper/2508.05798/citation-record.json","paper":"/paper/2508.05798"},"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-05T23:14:20.126885Z","title":null,"venue":null,"work_id":"ddf8d7b0-c20b-44d4-8fed-b4b180d94ae6","year":2003},"citing_paper":{"arxiv_id":"2508.05798","last_updated":"2025-08-07T19:13:47Z","snapshot_observed_at":"2026-08-17T17:28:23.916968Z","submitted_at":"2025-08-07T19:13:47Z","title":"Basic interactive algorithms: Preview","version":1},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-05T23:14:19.718957Z"},"links":{"citing_paper":"/paper/2508.05798"},"observation_digest":"sha256:03ba425c694b17aae2151d105f5fe0f29194840217e945f23803fb5ca147b8a8","observation_id":"2d2d0644-ad21-49d2-87b1-b916fe24da2b","resolution":{"observed_at":"2026-08-05T23:14:20.130479Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-05T23:14:20.114491Z","title":null,"venue":null,"work_id":"9d068a1a-348e-4181-9588-9aa737ac0994","year":2006},"citing_paper":{"arxiv_id":"2508.05798","last_updated":"2025-08-07T19:13:47Z","snapshot_observed_at":"2026-08-17T17:28:23.916968Z","submitted_at":"2025-08-07T19:13:47Z","title":"Basic interactive algorithms: Preview","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-05T23:14:19.724226Z"},"links":{"citing_paper":"/paper/2508.05798"},"observation_digest":"sha256:463ce84232947722ae863ed22f53684c83edbec68b3d9b66634dfa04f838d6c3","observation_id":"3d0c9c5f-ccbb-4d3d-83f8-08a92685971a","resolution":{"observed_at":"2026-08-05T23:14:20.119180Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-05T23:14:20.102760Z","title":null,"venue":null,"work_id":"b90e9b8f-b61e-4567-908f-38a6a9e346f6","year":2007},"citing_paper":{"arxiv_id":"2508.05798","last_updated":"2025-08-07T19:13:47Z","snapshot_observed_at":"2026-08-17T17:28:23.916968Z","submitted_at":"2025-08-07T19:13:47Z","title":"Basic interactive algorithms: Preview","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-05T23:14:19.728866Z"},"links":{"citing_paper":"/paper/2508.05798"},"observation_digest":"sha256:e4910f5e4d3751bd9ffe59162107aff153dced49508f547981aaad4f12006f7b","observation_id":"d2b85d2f-649d-4207-875b-85cb100edeec","resolution":{"observed_at":"2026-08-05T23:14:20.106998Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-05T23:14:20.091785Z","title":null,"venue":null,"work_id":"4906cd2c-350b-4f55-a308-5465be604820","year":1936},"citing_paper":{"arxiv_id":"2508.05798","last_updated":"2025-08-07T19:13:47Z","snapshot_observed_at":"2026-08-17T17:28:23.916968Z","submitted_at":"2025-08-07T19:13:47Z","title":"Basic interactive algorithms: Preview","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-05T23:14:19.733494Z"},"links":{"citing_paper":"/paper/2508.05798"},"observation_digest":"sha256:42e484b1b217836c7c073f32b10b04169b639a06bad74173ff6192c44a5d6c73","observation_id":"36326053-8047-4e4e-af34-5bb86f4a2c32","resolution":{"observed_at":"2026-08-05T23:14:20.095597Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-05T23:14:20.080967Z","title":null,"venue":null,"work_id":"61695263-55a6-4ee0-a95d-da56d923e4b3","year":1971},"citing_paper":{"arxiv_id":"2508.05798","last_updated":"2025-08-07T19:13:47Z","snapshot_observed_at":"2026-08-17T17:28:23.916968Z","submitted_at":"2025-08-07T19:13:47Z","title":"Basic interactive algorithms: Preview","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-05T23:14:19.739358Z"},"links":{"citing_paper":"/paper/2508.05798"},"observation_digest":"sha256:47aa6329eaddc7066b8a4f1cfc2a2450898a9248d0cb722386b7d7bc3e42022e","observation_id":"a37f7927-20ed-4126-880d-e430ac10c7bb","resolution":{"observed_at":"2026-08-05T23:14:20.084569Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-05T23:14:20.068674Z","title":"Gandy, ``Church's thesis and principles for mechanisms'', In ``The Kleene Symposium'' (eds","venue":null,"work_id":"a91d946c-f49b-4e53-b955-f1ce68f00f7b","year":1980},"citing_paper":{"arxiv_id":"2508.05798","last_updated":"2025-08-07T19:13:47Z","snapshot_observed_at":"2026-08-17T17:28:23.916968Z","submitted_at":"2025-08-07T19:13:47Z","title":"Basic interactive algorithms: Preview","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-05T23:14:19.746349Z"},"links":{"citing_paper":"/paper/2508.05798"},"observation_digest":"sha256:cd876bd89ef0f258eb098141efb5b3cb5822e5d36e2bc9088d73f4d38325203d","observation_id":"470c0c6a-f3ad-49dd-aa8f-5ccd9066185d","resolution":{"observed_at":"2026-08-05T23:14:20.073271Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-05T23:14:20.057250Z","title":null,"venue":null,"work_id":"cedf884c-efa5-4684-802d-b22ceb71f385","year":2008},"citing_paper":{"arxiv_id":"2508.05798","last_updated":"2025-08-07T19:13:47Z","snapshot_observed_at":"2026-08-17T17:28:23.916968Z","submitted_at":"2025-08-07T19:13:47Z","title":"Basic interactive algorithms: Preview","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-05T23:14:19.751044Z"},"links":{"citing_paper":"/paper/2508.05798"},"observation_digest":"sha256:f1cf7aea778f29c9307dade1fcbe704b5c6fef9a0c0500cc84ac41bfc5a46e99","observation_id":"8463f7e4-c237-4bc6-ac8f-8d94d2f31be2","resolution":{"observed_at":"2026-08-05T23:14:20.061814Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/978-3-642-11447-2_4","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T11:07:33.414567Z","title":null,"venue":"Lecture notes in computer science","work_id":"5c93a1c7-2f0e-49de-a926-1009650a52d3","year":null},"citing_paper":{"arxiv_id":"2508.05798","last_updated":"2025-08-07T19:13:47Z","snapshot_observed_at":"2026-08-17T17:28:23.916968Z","submitted_at":"2025-08-07T19:13:47Z","title":"Basic interactive algorithms: Preview","version":1},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-05T23:14:19.754915Z"},"links":{"citing_paper":"/paper/2508.05798"},"observation_digest":"sha256:ad6465c97b7eaa01b0f99709b6770a976a83e3880233f87520484ff95c000e4e","observation_id":"2e7906d1-8fe4-4ad7-8a39-703b64caa350","resolution":{"observed_at":"2026-08-05T23:14:19.859423Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-05T23:14:20.046548Z","title":"Also (slightly revised) in ``Current Trends in Theoretical Computer Science: Essays and Tutorials\" (eds","venue":null,"work_id":"bda2412b-ed8d-43be-a260-8d21fef3125f","year":1991},"citing_paper":{"arxiv_id":"2508.05798","last_updated":"2025-08-07T19:13:47Z","snapshot_observed_at":"2026-08-17T17:28:23.916968Z","submitted_at":"2025-08-07T19:13:47Z","title":"Basic interactive algorithms: Preview","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-05T23:14:19.759204Z"},"links":{"citing_paper":"/paper/2508.05798"},"observation_digest":"sha256:5bd36cc779f3ab4f6113056a5c254f052d675a007a7a587a6fff8115b9b6ef0e","observation_id":"70eef7d2-df9c-4a09-857b-6b9a0f93ccab","resolution":{"observed_at":"2026-08-05T23:14:20.050520Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1808.06255","last_updated":"2018-08-19T20:49:31Z","snapshot_observed_at":"2026-08-17T01:59:54.371885Z","submitted_at":"2018-08-19T20:49:31Z","title":"Evolving Algebras 1993: Lipari Guide","version":1},"cited_work":{"arxiv_id":"1808.06255","doi":null,"metadata_source":"pith","pith_arxiv_id":"1808.06255","snapshot_observed_at":"2026-08-05T23:14:19.907464Z","title":"Evolving Algebras 1993: Lipari Guide","venue":"cs.LO","work_id":"7bcc9e0d-6e97-4015-98af-fc636496004a","year":2018},"citing_paper":{"arxiv_id":"2508.05798","last_updated":"2025-08-07T19:13:47Z","snapshot_observed_at":"2026-08-17T17:28:23.916968Z","submitted_at":"2025-08-07T19:13:47Z","title":"Basic interactive algorithms: Preview","version":1},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-05T23:14:19.763408Z"},"links":{"cited_paper":"/paper/1808.06255","citing_paper":"/paper/2508.05798"},"observation_digest":"sha256:5c621444edb082055af35b8e14c81b6ac2b6a1067c60471b289985f5e6484077","observation_id":"16ec0eff-48d0-4824-b7f6-6f03286680b1","resolution":{"observed_at":"2026-08-05T23:14:19.912473Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-05T23:14:20.036058Z","title":null,"venue":null,"work_id":"eb01edb0-4ced-4f1f-89bb-fd9b10c2f0d9","year":2000},"citing_paper":{"arxiv_id":"2508.05798","last_updated":"2025-08-07T19:13:47Z","snapshot_observed_at":"2026-08-17T17:28:23.916968Z","submitted_at":"2025-08-07T19:13:47Z","title":"Basic interactive algorithms: Preview","version":1},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-05T23:14:19.767977Z"},"links":{"citing_paper":"/paper/2508.05798"},"observation_digest":"sha256:a5a91767b677fa901fd79062f9e372b63810f84d8d6b5e8951be28a50aef8998","observation_id":"5a12af37-9e67-49b1-9d68-42f9f3d909a5","resolution":{"observed_at":"2026-08-05T23:14:20.039592Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2002.03145","last_updated":"2020-02-20T17:27:10Z","snapshot_observed_at":"2026-08-07T22:15:31.792249Z","submitted_at":"2020-02-08T11:28:24Z","title":"Means-fit effectivity","version":2},"cited_work":{"arxiv_id":"2002.03145","doi":null,"metadata_source":"pith","pith_arxiv_id":"2002.03145","snapshot_observed_at":"2026-08-05T23:14:19.890795Z","title":"Means-fit effectivity","venue":"cs.LO","work_id":"83c19780-7276-482d-8986-10d6cd7a3fc9","year":2020},"citing_paper":{"arxiv_id":"2508.05798","last_updated":"2025-08-07T19:13:47Z","snapshot_observed_at":"2026-08-17T17:28:23.916968Z","submitted_at":"2025-08-07T19:13:47Z","title":"Basic interactive algorithms: Preview","version":1},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-05T23:14:19.772136Z"},"links":{"cited_paper":"/paper/2002.03145","citing_paper":"/paper/2508.05798"},"observation_digest":"sha256:e6ced11abaad09da1ebd49f5547f613a5436a5d4be761dcfbe162c035d3be5bf","observation_id":"425ed879-f8b4-48cc-9155-e83f8f606fdf","resolution":{"observed_at":"2026-08-05T23:14:19.895224Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2209.13731","last_updated":"2023-03-22T19:05:59Z","snapshot_observed_at":"2026-08-16T16:29:23.590055Z","submitted_at":"2022-09-27T22:49:13Z","title":"Software science view on quantum circuit algorithms","version":2},"cited_work":{"arxiv_id":"2209.13731","doi":null,"metadata_source":"pith","pith_arxiv_id":"2209.13731","snapshot_observed_at":"2026-08-05T23:14:19.872574Z","title":"Software science view on quantum circuit algorithms","venue":"quant-ph","work_id":"96e576e9-7d2b-49d4-a6dd-b3e708a3e82b","year":2022},"citing_paper":{"arxiv_id":"2508.05798","last_updated":"2025-08-07T19:13:47Z","snapshot_observed_at":"2026-08-17T17:28:23.916968Z","submitted_at":"2025-08-07T19:13:47Z","title":"Basic interactive algorithms: Preview","version":1},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-05T23:14:19.776786Z"},"links":{"cited_paper":"/paper/2209.13731","citing_paper":"/paper/2508.05798"},"observation_digest":"sha256:cdb622c773150327fb8a62132d567017b4093ef3ca726909f0ecdf0c3eaaedcb","observation_id":"352d2e94-a831-4f95-874b-c155bdd9c272","resolution":{"observed_at":"2026-08-05T23:14:19.878609Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-05T23:14:20.025263Z","title":null,"venue":null,"work_id":"11aa8346-53f3-4264-839c-e18ce6674225","year":1993},"citing_paper":{"arxiv_id":"2508.05798","last_updated":"2025-08-07T19:13:47Z","snapshot_observed_at":"2026-08-17T17:28:23.916968Z","submitted_at":"2025-08-07T19:13:47Z","title":"Basic interactive algorithms: Preview","version":1},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-05T23:14:19.781532Z"},"links":{"citing_paper":"/paper/2508.05798"},"observation_digest":"sha256:9af60e215fc786de447661e8e096adbc978c5495cb2774b9be1f8d3ef97adbd1","observation_id":"750b4708-7948-4133-88b9-cb5be1bdf13e","resolution":{"observed_at":"2026-08-05T23:14:20.028834Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-05T23:14:20.012754Z","title":"Kleene, ``Introduction to metamathematics,'' Wolters-Noordhoff Publishing and North-Holland Publishing Company, 1971 (First published by D","venue":null,"work_id":"fa502e3d-b198-45ed-93cc-fa68373d7095","year":1971},"citing_paper":{"arxiv_id":"2508.05798","last_updated":"2025-08-07T19:13:47Z","snapshot_observed_at":"2026-08-17T17:28:23.916968Z","submitted_at":"2025-08-07T19:13:47Z","title":"Basic interactive algorithms: Preview","version":1},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-05T23:14:19.785460Z"},"links":{"citing_paper":"/paper/2508.05798"},"observation_digest":"sha256:b008b3aba37e5619c785aa7495a586d62993d58624f8c9ee58426da35ea34257","observation_id":"93b8085d-061d-4b07-abdc-d102fc5e6a42","resolution":{"observed_at":"2026-08-05T23:14:20.017417Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-05T23:14:20.000872Z","title":"Kolmogorov, ``On the notion of algorithm,'' Uspekhi Matematicheskikh Nauk (in Russian) vol","venue":null,"work_id":"c1aeee15-94cb-4504-a09b-b4b33e749822","year":1953},"citing_paper":{"arxiv_id":"2508.05798","last_updated":"2025-08-07T19:13:47Z","snapshot_observed_at":"2026-08-17T17:28:23.916968Z","submitted_at":"2025-08-07T19:13:47Z","title":"Basic interactive algorithms: Preview","version":1},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-05T23:14:19.789710Z"},"links":{"citing_paper":"/paper/2508.05798"},"observation_digest":"sha256:ca3f6d6430173b1e37c2b68edbb120a11bdf1e5ca4db1ec5e675c0b192eb9f4e","observation_id":"4787ccb4-3efd-4878-9998-f4a361001638","resolution":{"observed_at":"2026-08-05T23:14:20.005086Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-05T23:14:19.989449Z","title":"9:3 (1973) 115--116","venue":null,"work_id":"aea28d27-707c-4768-88cc-b4345589bd86","year":1973},"citing_paper":{"arxiv_id":"2508.05798","last_updated":"2025-08-07T19:13:47Z","snapshot_observed_at":"2026-08-17T17:28:23.916968Z","submitted_at":"2025-08-07T19:13:47Z","title":"Basic interactive algorithms: Preview","version":1},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-05T23:14:19.795272Z"},"links":{"citing_paper":"/paper/2508.05798"},"observation_digest":"sha256:fd37e304a93c88c58f3475ffd269fe8468d2978e3a03eab02c5e47ed5697bdc2","observation_id":"6ddb96d0-f7b7-4ec2-91b4-fab7b0cc56fb","resolution":{"observed_at":"2026-08-05T23:14:19.993671Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-05T23:14:19.979272Z","title":null,"venue":null,"work_id":"bfffb5ff-544d-4e54-b81b-1d8ce68bf27f","year":1959},"citing_paper":{"arxiv_id":"2508.05798","last_updated":"2025-08-07T19:13:47Z","snapshot_observed_at":"2026-08-17T17:28:23.916968Z","submitted_at":"2025-08-07T19:13:47Z","title":"Basic interactive algorithms: Preview","version":1},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-05T23:14:19.804799Z"},"links":{"citing_paper":"/paper/2508.05798"},"observation_digest":"sha256:446fb8179f7f6df75a15449ec19071eddd7fc2bf26ce38dea175146b0f842946","observation_id":"f5dc5bd7-e145-431f-9960-30c9496b2bba","resolution":{"observed_at":"2026-08-05T23:14:19.982669Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-05T23:14:19.967804Z","title":"``Theory of recursive functions and effective computability,'' McGraw-Hill 1967","venue":null,"work_id":"a1c44507-3874-48dd-a070-140015aa524a","year":1967},"citing_paper":{"arxiv_id":"2508.05798","last_updated":"2025-08-07T19:13:47Z","snapshot_observed_at":"2026-08-17T17:28:23.916968Z","submitted_at":"2025-08-07T19:13:47Z","title":"Basic interactive algorithms: Preview","version":1},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-05T23:14:19.809180Z"},"links":{"citing_paper":"/paper/2508.05798"},"observation_digest":"sha256:52566cedc3d8777ae4142973d9e9ba0c999a67bbc85c6d951e5539c57978660d","observation_id":"16716866-e813-4be2-8d4c-93feb4f3ea37","resolution":{"observed_at":"2026-08-05T23:14:19.971823Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-05T23:14:19.956435Z","title":"Shoenfield, ``Recursion theory,'' Springer Verlag 1993","venue":null,"work_id":"6691f361-0aca-4938-ba64-265857c9bac0","year":1993},"citing_paper":{"arxiv_id":"2508.05798","last_updated":"2025-08-07T19:13:47Z","snapshot_observed_at":"2026-08-17T17:28:23.916968Z","submitted_at":"2025-08-07T19:13:47Z","title":"Basic interactive algorithms: Preview","version":1},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-05T23:14:19.812973Z"},"links":{"citing_paper":"/paper/2508.05798"},"observation_digest":"sha256:2df2b1c6b7fac531a6395b1be9662478146ac2cfae668e6edd32a6ae8f1a9b4c","observation_id":"8c535e70-4dd0-40c5-b49a-f4e040713fa7","resolution":{"observed_at":"2026-08-05T23:14:19.960348Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-05T23:14:19.944986Z","title":null,"venue":null,"work_id":"a38a7d56-fabc-47ce-b16c-0944ed7b74b8","year":2010},"citing_paper":{"arxiv_id":"2508.05798","last_updated":"2025-08-07T19:13:47Z","snapshot_observed_at":"2026-08-17T17:28:23.916968Z","submitted_at":"2025-08-07T19:13:47Z","title":"Basic interactive algorithms: Preview","version":1},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-05T23:14:19.816889Z"},"links":{"citing_paper":"/paper/2508.05798"},"observation_digest":"sha256:29c5de56c42fb40642d2cbb671388fc6d6b9a7bb24cc8d048d1f296a082bfabd","observation_id":"49f8552a-c052-4931-a281-da843fc50f27","resolution":{"observed_at":"2026-08-05T23:14:19.949148Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-05T23:14:19.933020Z","title":"Turing, ``On computable numbers, with an application to the Entscheidungsproblem,'' Proceedings of the London Mathematical Society , ser","venue":null,"work_id":"6246793e-3f13-46e3-90b4-ee23f857a7c9","year":1936},"citing_paper":{"arxiv_id":"2508.05798","last_updated":"2025-08-07T19:13:47Z","snapshot_observed_at":"2026-08-17T17:28:23.916968Z","submitted_at":"2025-08-07T19:13:47Z","title":"Basic interactive algorithms: Preview","version":1},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-05T23:14:19.821289Z"},"links":{"citing_paper":"/paper/2508.05798"},"observation_digest":"sha256:8f1cbdd9f1d2184f25cd7f2c71d9d6ecfd6b3438a49a811282caa9b88c2f1131","observation_id":"29be27e4-778c-4d56-a2b3-3d4f554e1cb2","resolution":{"observed_at":"2026-08-05T23:14:19.937082Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-05T23:14:19.920506Z","title":null,"venue":null,"work_id":"2af45756-5dae-4044-a3b9-64bcc9f53ea9","year":2025},"citing_paper":{"arxiv_id":"2508.05798","last_updated":"2025-08-07T19:13:47Z","snapshot_observed_at":"2026-08-17T17:28:23.916968Z","submitted_at":"2025-08-07T19:13:47Z","title":"Basic interactive algorithms: Preview","version":1},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-05T23:14:19.825861Z"},"links":{"citing_paper":"/paper/2508.05798"},"observation_digest":"sha256:d57d87d94f75830b5e08cf221a89d4cddb4bdd4b41c9977913b80e7d48e770ac","observation_id":"e4e86b0c-14cc-4d37-80af-eb8f5ba6932a","resolution":{"observed_at":"2026-08-05T23:14:19.924513Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2508.05798","last_updated":"2025-08-07T19:13:47Z","latest_version":1,"primary_category":"cs.LO","snapshot_observed_at":"2026-08-17T17:28:23.916968Z","submitted_at":"2025-08-07T19:13:47Z","title":"Basic interactive algorithms: Preview"},"reference_resolution":{"displayed":23,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":11,"verified_exact":4,"verified_fuzzy":8},"total_outbound_references":23},"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-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"thesis":"As of 17 August 2026, this Paper Citation Record lists 23 of 23 outbound references and 0 inbound Pith citation observations for arXiv:2508.05798."}