{"as_of":"2026-08-21T23:07:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:73de69c6ce321a04a8cd22f381fd84b9cea5c304f782daaed6d89cfb4aa45f0b","coverage":[{"denominator":22,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":22,"source":"paper_references, paper_reference_links","source_observed_at":"2026-06-28T03:04:05.427043Z","state":"measured"},{"denominator":22,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":22,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-21T06:32:19.484+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.04697/citation-record","integrity":"/paper/2606.04697/integrity","json":"/paper/2606.04697/citation-record.json","paper":"/paper/2606.04697"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"1998.1575","doi":"10.1006/jcss.1998.1575","metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"The Relative Complexity of NP Search Problems , journal =","venue":"Journal of Computer and System Sciences","work_id":"f52e0d95-0386-4acc-a8b9-95180422a14e","year":1998},"citing_paper":{"arxiv_id":"2606.04697","last_updated":"2026-06-03T10:23:59Z","snapshot_observed_at":"2026-08-06T11:40:10.383004Z","submitted_at":"2026-06-03T10:23:59Z","title":"Randomized separations in black-box TFNP","version":1},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-06-28T03:04:05.427043Z"},"links":{"citing_paper":"/paper/2606.04697"},"observation_digest":"sha256:73674c42c0350728d6a8d486869e299a98c7aa4e75407f65df8b49b6c014a7b8","observation_id":"4d04af10-a748-4eb2-8a72-a0518340e2b0","resolution":{"observed_at":"2026-06-28T03:11:30.207376Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1145/3663758","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Separations in proof complexity and TFNP","venue":"Journal of the ACM","work_id":"c5aeb443-e189-473e-887f-f6e0d36ce377","year":2024},"citing_paper":{"arxiv_id":"2606.04697","last_updated":"2026-06-03T10:23:59Z","snapshot_observed_at":"2026-08-06T11:40:10.383004Z","submitted_at":"2026-06-03T10:23:59Z","title":"Randomized separations in black-box TFNP","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-06-28T03:04:05.427043Z"},"links":{"citing_paper":"/paper/2606.04697"},"observation_digest":"sha256:647980871e9041781a18aa3a2cedcb2c818f64164c6a9fea5dd758e4284d86b1","observation_id":"b55fe802-f281-462e-84ee-ad58cbd1d673","resolution":{"observed_at":"2026-06-28T03:11:30.209214Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-28T03:04:05.427043Z","title":"Classification of Search Problems and Their Definability in Bounded Arithmetic , url=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.04697","last_updated":"2026-06-03T10:23:59Z","snapshot_observed_at":"2026-08-06T11:40:10.383004Z","submitted_at":"2026-06-03T10:23:59Z","title":"Randomized separations in black-box TFNP","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-06-28T03:04:05.427043Z"},"links":{"citing_paper":"/paper/2606.04697"},"observation_digest":"sha256:8bd19043dd95f25448d1ee8164ce7889fe9a9d246b7b84f66f320a40e998f77c","observation_id":"8d923aef-4028-4037-a972-62d9cc5b9b7e","resolution":{"observed_at":"2026-06-28T03:04:05.427043Z","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":"2004.131379","doi":"10.1109/ccc.2004.1313795","metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"and Morioka, T","venue":null,"work_id":"f60f1d58-0655-4243-8c8e-585f8259ce2e","year":2004},"citing_paper":{"arxiv_id":"2606.04697","last_updated":"2026-06-03T10:23:59Z","snapshot_observed_at":"2026-08-06T11:40:10.383004Z","submitted_at":"2026-06-03T10:23:59Z","title":"Randomized separations in black-box TFNP","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-06-28T03:04:05.427043Z"},"links":{"citing_paper":"/paper/2606.04697"},"observation_digest":"sha256:97cfe15a06032f205a2ec097b6ef8c515ac5ef8553bdd29bb95185cc34ce04fc","observation_id":"4e98fd41-ea7e-41e8-af39-64d29de40aa5","resolution":{"observed_at":"2026-06-28T03:11:30.209016Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-28T03:04:05.427043Z","title":"2022 , eprint=","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2606.04697","last_updated":"2026-06-03T10:23:59Z","snapshot_observed_at":"2026-08-06T11:40:10.383004Z","submitted_at":"2026-06-03T10:23:59Z","title":"Randomized separations in black-box TFNP","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-06-28T03:04:05.427043Z"},"links":{"citing_paper":"/paper/2606.04697"},"observation_digest":"sha256:710d74726d7cf4c78024622af1d11cc9c36aed89d6e649287903b03b261d0fdf","observation_id":"dfe8fbd0-1441-4102-ae8a-e6050a1ce161","resolution":{"observed_at":"2026-06-28T03:04:05.427043Z","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.itcs.2024.75","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"On the Complexity of the Parity Argument and Other Inefficient Proofs of Existence","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","work_id":"a6942817-ba10-45a1-88c5-4fb54bae932d","year":2024},"citing_paper":{"arxiv_id":"2606.04697","last_updated":"2026-06-03T10:23:59Z","snapshot_observed_at":"2026-08-06T11:40:10.383004Z","submitted_at":"2026-06-03T10:23:59Z","title":"Randomized separations in black-box TFNP","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-06-28T03:04:05.427043Z"},"links":{"citing_paper":"/paper/2606.04697"},"observation_digest":"sha256:bdb3ad957f7e206bb0c903bea532da96736d12a4b6c784545ceab67b38c1be92","observation_id":"4fa05268-65aa-4060-aa42-910640b6f7aa","resolution":{"observed_at":"2026-06-28T03:11:30.211052Z","resolver_source":"doi","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1016/s0022-0000(05)80063-7","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"On the Complexity of the Parity Argument and Other Inefficient Proofs of Existence","venue":"Journal of Computer and System Sciences","work_id":"759841fc-59a8-45d8-9c49-4bdf336e25ce","year":1994},"citing_paper":{"arxiv_id":"2606.04697","last_updated":"2026-06-03T10:23:59Z","snapshot_observed_at":"2026-08-06T11:40:10.383004Z","submitted_at":"2026-06-03T10:23:59Z","title":"Randomized separations in black-box TFNP","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-06-28T03:04:05.427043Z"},"links":{"citing_paper":"/paper/2606.04697"},"observation_digest":"sha256:39b263fc7d310b72bf430b25f99a299d7057ca8d9bc75cbf3ad41f1e8020d8f7","observation_id":"2a1ca935-f1fe-4285-b54e-9250e7acb034","resolution":{"observed_at":"2026-06-28T03:11:30.204507Z","resolver_source":"doi","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-07T20:38:22.947902+00:00","source":"crossref_status_cache"},{"observed_at":"2026-08-07T20:38:22.947902+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1016/0022-0000(88)90046-3","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Johnson, Christos H","venue":"Journal of Computer and System Sciences","work_id":"11aa9258-16a7-4380-a1c6-c84ea3decf09","year":1988},"citing_paper":{"arxiv_id":"2606.04697","last_updated":"2026-06-03T10:23:59Z","snapshot_observed_at":"2026-08-06T11:40:10.383004Z","submitted_at":"2026-06-03T10:23:59Z","title":"Randomized separations in black-box TFNP","version":1},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-06-28T03:04:05.427043Z"},"links":{"citing_paper":"/paper/2606.04697"},"observation_digest":"sha256:33cc7474e75255f48ca7d7b23ea204e07b3a7e02aeb768eebb6f0f3748be43e3","observation_id":"4d367c17-5d9d-493d-8caa-b101eb962ada","resolution":{"observed_at":"2026-06-28T03:11:30.193440Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1811.03841","last_updated":"2018-11-09T10:06:17Z","snapshot_observed_at":"2026-08-14T18:01:44.232345Z","submitted_at":"2018-11-09T10:06:17Z","title":"Unique End of Potential Line","version":1},"cited_work":{"arxiv_id":"1811.03841","doi":null,"metadata_source":"pith","pith_arxiv_id":"1811.03841","snapshot_observed_at":"2026-07-02T11:46:55.619572Z","title":"Unique End of Potential Line","venue":"cs.CC","work_id":"3b1c2698-6736-426f-80c0-2543c4b53f7a","year":2018},"citing_paper":{"arxiv_id":"2606.04697","last_updated":"2026-06-03T10:23:59Z","snapshot_observed_at":"2026-08-06T11:40:10.383004Z","submitted_at":"2026-06-03T10:23:59Z","title":"Randomized separations in black-box TFNP","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-06-28T03:04:05.427043Z"},"links":{"cited_paper":"/paper/1811.03841","citing_paper":"/paper/2606.04697"},"observation_digest":"sha256:3f4faed2920bdd7e35fcc1d075cbd40f1ba26e971495cc14e71955d334de7bfb","observation_id":"6a2bc74e-b0fa-4e96-b7e7-745d1055a6c4","resolution":{"observed_at":"2026-07-02T11:46:55.621467Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-28T03:04:05.427043Z","title":"Hardness of Continuous Local Search: Query Complexity and Cryptographic Lower Bounds , volume =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.04697","last_updated":"2026-06-03T10:23:59Z","snapshot_observed_at":"2026-08-06T11:40:10.383004Z","submitted_at":"2026-06-03T10:23:59Z","title":"Randomized separations in black-box TFNP","version":1},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-06-28T03:04:05.427043Z"},"links":{"citing_paper":"/paper/2606.04697"},"observation_digest":"sha256:89b59453e685c4d6cb5b7d34922e4d047bd798c26206cb08653074adc6b1bc41","observation_id":"86d55e36-1cca-4ea4-8195-6bfca22cf093","resolution":{"observed_at":"2026-06-28T03:04:05.427043Z","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.itcs.2019.38","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"10th Innovations in Theoretical Computer Science Conference (ITCS 2019) , pages =","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","work_id":"724ca815-49b2-4b9d-a228-93c67713c601","year":2019},"citing_paper":{"arxiv_id":"2606.04697","last_updated":"2026-06-03T10:23:59Z","snapshot_observed_at":"2026-08-06T11:40:10.383004Z","submitted_at":"2026-06-03T10:23:59Z","title":"Randomized separations in black-box TFNP","version":1},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-06-28T03:04:05.427043Z"},"links":{"citing_paper":"/paper/2606.04697"},"observation_digest":"sha256:6184fb0abf58480039939d5f118bec4fcc84f5f2d3e91de63e864e5045b643d4","observation_id":"729617a9-6cbb-4514-b1af-5b12c97bb66e","resolution":{"observed_at":"2026-06-28T03:11:30.197770Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1016/j.apal.2012.01.015","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Buss and Alan S","venue":"Annals of Pure and Applied Logic","work_id":"2ac3521f-12b6-4523-9f22-8a6d2b4d5489","year":2012},"citing_paper":{"arxiv_id":"2606.04697","last_updated":"2026-06-03T10:23:59Z","snapshot_observed_at":"2026-08-06T11:40:10.383004Z","submitted_at":"2026-06-03T10:23:59Z","title":"Randomized separations in black-box TFNP","version":1},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-06-28T03:04:05.427043Z"},"links":{"citing_paper":"/paper/2606.04697"},"observation_digest":"sha256:258204133250ad7f3a6f066e99ed379570a68d077c1d607d187b291298c6cc8e","observation_id":"2236c806-b69d-4b50-bcda-48203598024c","resolution":{"observed_at":"2026-06-28T03:11:30.199706Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"8260.364976","doi":"10.1145/3618260.3649761","metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Naidu and Janani Sundaresan , title =","venue":null,"work_id":"eec6fa6e-41cd-46a9-82dd-4bb01c8bd1a2","year":2024},"citing_paper":{"arxiv_id":"2606.04697","last_updated":"2026-06-03T10:23:59Z","snapshot_observed_at":"2026-08-06T11:40:10.383004Z","submitted_at":"2026-06-03T10:23:59Z","title":"Randomized separations in black-box TFNP","version":1},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-06-28T03:04:05.427043Z"},"links":{"citing_paper":"/paper/2606.04697"},"observation_digest":"sha256:4d0b2a42930fef77878426ce93e530fa79cbae0903ed4d8cd5362b16855540ec","observation_id":"c7226ff8-a121-4b21-9594-2655a92ee62a","resolution":{"observed_at":"2026-06-28T03:11:30.196027Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-28T03:04:05.427043Z","title":"18th Annual Symposium on Foundations of Computer Science (sfcs 1977) , year=","venue":null,"work_id":null,"year":1977},"citing_paper":{"arxiv_id":"2606.04697","last_updated":"2026-06-03T10:23:59Z","snapshot_observed_at":"2026-08-06T11:40:10.383004Z","submitted_at":"2026-06-03T10:23:59Z","title":"Randomized separations in black-box TFNP","version":1},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-06-28T03:04:05.427043Z"},"links":{"citing_paper":"/paper/2606.04697"},"observation_digest":"sha256:4675d9a15db7d31dc659c0b448e3661e4750dab11d71ae6e02f7555326c60f5b","observation_id":"dbfe0c12-6448-4abd-ad05-765d017e29b6","resolution":{"observed_at":"2026-06-28T03:04:05.427043Z","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-28T03:04:05.427043Z","title":"2024 IEEE 65th Annual Symposium on Foundations of Computer Science (FOCS) , year=","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2606.04697","last_updated":"2026-06-03T10:23:59Z","snapshot_observed_at":"2026-08-06T11:40:10.383004Z","submitted_at":"2026-06-03T10:23:59Z","title":"Randomized separations in black-box TFNP","version":1},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-06-28T03:04:05.427043Z"},"links":{"citing_paper":"/paper/2606.04697"},"observation_digest":"sha256:5021b57622be70b8b6dc6970f23747b7c9a567b6c6d1a021cf3a9b4c1aff86a7","observation_id":"463b3815-d038-42b5-a1bc-d1c078a90c4b","resolution":{"observed_at":"2026-06-28T03:04:05.427043Z","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.itcs.2024.63","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T03:11:30.190142Z","title":"TFNP Intersections Through the Lens of Feasible Disjunction","venue":null,"work_id":"7a7da8f0-982f-41b6-8df5-a497958b45ce","year":2024},"citing_paper":{"arxiv_id":"2606.04697","last_updated":"2026-06-03T10:23:59Z","snapshot_observed_at":"2026-08-06T11:40:10.383004Z","submitted_at":"2026-06-03T10:23:59Z","title":"Randomized separations in black-box TFNP","version":1},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-06-28T03:04:05.427043Z"},"links":{"citing_paper":"/paper/2606.04697"},"observation_digest":"sha256:dd0228b2d4b02bb32eea6b987a0cdf1ba6f337c2fa03a81cbd7a6bf09fc26987","observation_id":"39c7acfd-ab35-4c5f-8211-6b19b608500f","resolution":{"observed_at":"2026-06-28T03:11:30.191600Z","resolver_source":"doi","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.4230/lipics.itcs.2024.74","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"15th Innovations in Theoretical Computer Science Conference (ITCS 2024) , pages =","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","work_id":"51ca54f4-8e91-4265-8cae-03ab9f6ed53a","year":2024},"citing_paper":{"arxiv_id":"2606.04697","last_updated":"2026-06-03T10:23:59Z","snapshot_observed_at":"2026-08-06T11:40:10.383004Z","submitted_at":"2026-06-03T10:23:59Z","title":"Randomized separations in black-box TFNP","version":1},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-06-28T03:04:05.427043Z"},"links":{"citing_paper":"/paper/2606.04697"},"observation_digest":"sha256:283bb9aa630a057f16ec1af683921e1df9f491015daea69a49002f3c47236e69","observation_id":"9df9c4c5-e197-4e94-9991-96d7201fb59c","resolution":{"observed_at":"2026-06-28T03:11:30.221995Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.4230/lipics.ccc.2022.37","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"37th Computational Complexity Conference (CCC 2022) , pages =","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","work_id":"21e5d303-99a7-4937-9bfc-d17987067819","year":2022},"citing_paper":{"arxiv_id":"2606.04697","last_updated":"2026-06-03T10:23:59Z","snapshot_observed_at":"2026-08-06T11:40:10.383004Z","submitted_at":"2026-06-03T10:23:59Z","title":"Randomized separations in black-box TFNP","version":1},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-06-28T03:04:05.427043Z"},"links":{"citing_paper":"/paper/2606.04697"},"observation_digest":"sha256:2e0fc0d794fea013776b33c3a8298a50280814109e6acf9e6e5509b625d5773e","observation_id":"a9966834-9221-4d3b-8d86-afa9b46b8211","resolution":{"observed_at":"2026-06-28T03:11:30.219581Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1016/j.jcss.2015.08.001","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Integer factoring and modular square roots , journal =","venue":"Journal of Computer and System Sciences","work_id":"c52aa7f5-0578-456a-94a6-648a357e9d4e","year":2016},"citing_paper":{"arxiv_id":"2606.04697","last_updated":"2026-06-03T10:23:59Z","snapshot_observed_at":"2026-08-06T11:40:10.383004Z","submitted_at":"2026-06-03T10:23:59Z","title":"Randomized separations in black-box TFNP","version":1},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-06-28T03:04:05.427043Z"},"links":{"citing_paper":"/paper/2606.04697"},"observation_digest":"sha256:9964764d00a67381677cba812294fd21cfdeceaf701cbc480b2e4573d78bf7b0","observation_id":"b9bcc1e0-b02d-425a-b491-872b8b11cd04","resolution":{"observed_at":"2026-06-28T03:11:30.220359Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.4230/lipics.itcs.2026.60","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"17th Innovations in Theoretical Computer Science Conference (ITCS 2026) , pages =","venue":"City Research Online (City University London)","work_id":"f3564984-a9fd-4708-9c85-56439bee4f9a","year":2026},"citing_paper":{"arxiv_id":"2606.04697","last_updated":"2026-06-03T10:23:59Z","snapshot_observed_at":"2026-08-06T11:40:10.383004Z","submitted_at":"2026-06-03T10:23:59Z","title":"Randomized separations in black-box TFNP","version":1},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-06-28T03:04:05.427043Z"},"links":{"citing_paper":"/paper/2606.04697"},"observation_digest":"sha256:88a9fd844ad097294b5bf9469a38050296fa04312868e8c365da7d3896c1d477","observation_id":"d3dcbbeb-7134-4b06-86d2-c824b068de0c","resolution":{"observed_at":"2026-06-28T03:11:30.218689Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.4230/lipics.itcs.2023.30","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"14th Innovations in Theoretical Computer Science Conference (ITCS 2023) , pages =","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","work_id":"cd21854b-9af6-464c-a11c-51e1682b72b8","year":2023},"citing_paper":{"arxiv_id":"2606.04697","last_updated":"2026-06-03T10:23:59Z","snapshot_observed_at":"2026-08-06T11:40:10.383004Z","submitted_at":"2026-06-03T10:23:59Z","title":"Randomized separations in black-box TFNP","version":1},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-06-28T03:04:05.427043Z"},"links":{"citing_paper":"/paper/2606.04697"},"observation_digest":"sha256:74309f3bbd1420f94665f4a1ee70df03307970ae12cf010794afb17ff2a0716e","observation_id":"01870d09-ee38-4bea-801b-ccea23062139","resolution":{"observed_at":"2026-06-28T03:11:30.212944Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.4230/lipics.ccc.2017.1","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"32nd Computational Complexity Conference (CCC 2017) , pages =","venue":"ASEP","work_id":"bbc5f793-9782-44b3-9713-a057c3d6667c","year":2017},"citing_paper":{"arxiv_id":"2606.04697","last_updated":"2026-06-03T10:23:59Z","snapshot_observed_at":"2026-08-06T11:40:10.383004Z","submitted_at":"2026-06-03T10:23:59Z","title":"Randomized separations in black-box TFNP","version":1},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-06-28T03:04:05.427043Z"},"links":{"citing_paper":"/paper/2606.04697"},"observation_digest":"sha256:3a4a4e2a8c28584f3b5e830f1dba972e525af2ced69891dfcf88e6484a9fe72b","observation_id":"45a6dcf3-a399-4ec5-be0b-059a2177f70e","resolution":{"observed_at":"2026-06-28T03:11:30.217998Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2606.04697","last_updated":"2026-06-03T10:23:59Z","latest_version":1,"primary_category":"cs.CC","snapshot_observed_at":"2026-08-06T11:40:10.383004Z","submitted_at":"2026-06-03T10:23:59Z","title":"Randomized separations in black-box TFNP"},"reference_resolution":{"displayed":22,"state_counts":{"malformed_identifier":0,"metadata_mismatch":4,"parse_uncertain":0,"unresolved":5,"verified_exact":13,"verified_fuzzy":0},"total_outbound_references":22},"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-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"thesis":"As of 21 August 2026, this Paper Citation Record lists 22 of 22 outbound references and 0 inbound Pith citation observations for arXiv:2606.04697."}