{"as_of":"2026-08-13T05:49:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:6d64065cd7229ef4b96b1f5d6ab3ce8ed6e847104cce17aa2a1b99684f4ce14e","coverage":[{"denominator":0,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":8,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":8,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-12T06:34:41.77262+00:00","state":"measured"},{"denominator":8,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":8,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-12T19:45:07.454503Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"pith","source_observed_at":"2026-07-04T19:30:07.324472Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2410.21258","last_updated":"2026-06-17T14:55:18Z","snapshot_observed_at":"2026-08-12T22:13:33.392875Z","submitted_at":"2024-10-28T17:54:43Z","title":"Provable quantum speedups for computing persistence in topological data analysis","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2410.21258","snapshot_observed_at":"2026-08-12T19:45:07.454503Z","title":"https://arxiv","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2411.10511","last_updated":"2025-02-09T08:39:16Z","snapshot_observed_at":"2026-08-13T03:44:25.644780Z","submitted_at":"2024-11-15T16:50:05Z","title":"How quantum computing can enhance biomarker discovery","version":4},"reference_index":152,"source":"pdf_text","source_observed_at":"2026-08-12T19:45:07.454503Z"},"links":{"cited_paper":"/paper/2410.21258","citing_paper":"/paper/2411.10511"},"observation_digest":"sha256:5192e81ce30775be81d7027613d943a15d7ba7f23b014238faf83ccdd998f972","observation_id":"2507c69e-1337-4ac1-9cbb-20c7d76883de","resolution":{"observed_at":"2026-08-12T19:45:07.454503Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2410.21258","last_updated":"2026-06-17T14:55:18Z","snapshot_observed_at":"2026-08-12T22:13:33.392875Z","submitted_at":"2024-10-28T17:54:43Z","title":"Provable quantum speedups for computing persistence in topological data analysis","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2410.21258","snapshot_observed_at":"2026-08-11T11:52:37.138169Z","title":"Gyurik, A","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2412.14932","last_updated":"2024-12-19T15:10:04Z","snapshot_observed_at":"2026-08-11T20:00:11.853373Z","submitted_at":"2024-12-19T15:10:04Z","title":"Testing the presence of balanced and bipartite components in a sparse graph is QMA1-hard","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-11T11:52:37.138169Z"},"links":{"cited_paper":"/paper/2410.21258","citing_paper":"/paper/2412.14932"},"observation_digest":"sha256:119665599ee531079977d50607cdcabac67048c5ee575ed31464196516ba2f88","observation_id":"925ce362-8e73-4767-85f5-72bb9b0e4454","resolution":{"observed_at":"2026-08-11T11:52:37.138169Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2410.21258","last_updated":"2026-06-17T14:55:18Z","snapshot_observed_at":"2026-08-12T22:13:33.392875Z","submitted_at":"2024-10-28T17:54:43Z","title":"Provable quantum speedups for computing persistence in topological data analysis","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2410.21258","snapshot_observed_at":"2026-08-10T17:21:47.871676Z","title":"Quantum computing and persistence in topological data analysis","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2501.12378","last_updated":"2025-01-23T20:54:24Z","snapshot_observed_at":"2026-08-11T20:07:12.222181Z","submitted_at":"2025-01-21T18:54:59Z","title":"A quantum algorithm for Khovanov homology","version":2},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-10T17:21:47.871676Z"},"links":{"cited_paper":"/paper/2410.21258","citing_paper":"/paper/2501.12378"},"observation_digest":"sha256:d12fbfa36f70a299a9cf5b6083cb310ff19186a792f446abcde7dfe6ea7d1955","observation_id":"17b450f7-9b15-4a56-a45a-0115cf91ddef","resolution":{"observed_at":"2026-08-10T17:21:47.871676Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2410.21258","last_updated":"2026-06-17T14:55:18Z","snapshot_observed_at":"2026-08-12T22:13:33.392875Z","submitted_at":"2024-10-28T17:54:43Z","title":"Provable quantum speedups for computing persistence in topological data analysis","version":2},"cited_work":{"arxiv_id":"2410.21258","doi":null,"metadata_source":"pith","pith_arxiv_id":"2410.21258","snapshot_observed_at":"2026-07-04T19:30:07.324472Z","title":"Quantum computing and persistence in topological data analysis","venue":"quant-ph","work_id":"a2acc3d3-0b0f-4ca0-b16b-b56444e8d5ae","year":2024},"citing_paper":{"arxiv_id":"2506.01432","last_updated":"2026-04-27T09:33:29Z","snapshot_observed_at":"2026-07-06T21:34:53.033109Z","submitted_at":"2025-06-02T08:43:58Z","title":"New aspects of quantum topological data analysis: Betti number estimation, and testing and tracking of homology and cohomology classes","version":4},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-05-19T12:06:38.050214Z"},"links":{"cited_paper":"/paper/2410.21258","citing_paper":"/paper/2506.01432"},"observation_digest":"sha256:ee914a64d4d63c8339c91bb1217c3fcd3c4726e44e049213dcfa1b5f9d3dc77e","observation_id":"60c83d21-78b7-4c4d-a99d-57301b61d727","resolution":{"observed_at":"2026-06-19T17:10:41.991216Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2410.21258","last_updated":"2026-06-17T14:55:18Z","snapshot_observed_at":"2026-08-12T22:13:33.392875Z","submitted_at":"2024-10-28T17:54:43Z","title":"Provable quantum speedups for computing persistence in topological data analysis","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2410.21258","snapshot_observed_at":"2026-08-06T18:30:45.919926Z","title":"& Hayakawa, R., Quantum computing and persistence in topological data analysis","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2507.08157","last_updated":"2025-07-14T14:59:25Z","snapshot_observed_at":"2026-08-10T03:59:50.168108Z","submitted_at":"2025-07-10T20:33:52Z","title":"Topological network analysis using a programmable photonic quantum processor","version":2},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-06T18:30:45.919926Z"},"links":{"cited_paper":"/paper/2410.21258","citing_paper":"/paper/2507.08157"},"observation_digest":"sha256:3fc0fb840c5a4b9a80049d2525678133b660ae626362367c3233d6f357a80343","observation_id":"b17a6d68-2123-43d4-84f1-0ae3a508e4f4","resolution":{"observed_at":"2026-08-06T18:30:45.919926Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2410.21258","last_updated":"2026-06-17T14:55:18Z","snapshot_observed_at":"2026-08-12T22:13:33.392875Z","submitted_at":"2024-10-28T17:54:43Z","title":"Provable quantum speedups for computing persistence in topological data analysis","version":2},"cited_work":{"arxiv_id":"2410.21258","doi":null,"metadata_source":"pith","pith_arxiv_id":"2410.21258","snapshot_observed_at":"2026-07-04T19:30:07.324472Z","title":"Quantum computing and persistence in topological data analysis","venue":"quant-ph","work_id":"a2acc3d3-0b0f-4ca0-b16b-b56444e8d5ae","year":2024},"citing_paper":{"arxiv_id":"2512.00751","last_updated":"2026-05-07T03:25:02Z","snapshot_observed_at":"2026-07-06T22:37:21.536027Z","submitted_at":"2025-11-30T06:04:58Z","title":"Fragmentation is Efficiently Learnable by Quantum Neural Networks","version":3},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-05-17T03:31:39.276583Z"},"links":{"cited_paper":"/paper/2410.21258","citing_paper":"/paper/2512.00751"},"observation_digest":"sha256:8d3c9a719c6f87af40bfb1a1edc794cd06bdd9db8a9a587e2ccde4033088417b","observation_id":"a96104dc-e30e-4d68-8674-c41b49b390ba","resolution":{"observed_at":"2026-06-19T17:10:41.991216Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2410.21258","last_updated":"2026-06-17T14:55:18Z","snapshot_observed_at":"2026-08-12T22:13:33.392875Z","submitted_at":"2024-10-28T17:54:43Z","title":"Provable quantum speedups for computing persistence in topological data analysis","version":2},"cited_work":{"arxiv_id":"2410.21258","doi":null,"metadata_source":"pith","pith_arxiv_id":"2410.21258","snapshot_observed_at":"2026-07-04T19:30:07.324472Z","title":"Quantum computing and persistence in topological data analysis","venue":"quant-ph","work_id":"a2acc3d3-0b0f-4ca0-b16b-b56444e8d5ae","year":2024},"citing_paper":{"arxiv_id":"2605.28326","last_updated":"2026-05-27T11:27:10Z","snapshot_observed_at":"2026-08-06T10:03:14.495675Z","submitted_at":"2026-05-27T11:27:10Z","title":"Gauge Geometry of Hodge Zero-Mode Transport in Parameter-Dependent Topological Data Analysis","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-06-29T09:25:28.119291Z"},"links":{"cited_paper":"/paper/2410.21258","citing_paper":"/paper/2605.28326"},"observation_digest":"sha256:86c9a4ef325126c52d76e4f5a81c9cda3aa1990cad78b1b0fe1b44764441f381","observation_id":"a528d33b-cafd-4dfa-a0fa-fdad2ad9781f","resolution":{"observed_at":"2026-06-29T13:53:29.531848Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2410.21258","last_updated":"2026-06-17T14:55:18Z","snapshot_observed_at":"2026-08-12T22:13:33.392875Z","submitted_at":"2024-10-28T17:54:43Z","title":"Provable quantum speedups for computing persistence in topological data analysis","version":2},"cited_work":{"arxiv_id":"2410.21258","doi":null,"metadata_source":"pith","pith_arxiv_id":"2410.21258","snapshot_observed_at":"2026-07-04T19:30:07.324472Z","title":"Quantum computing and persistence in topological data analysis","venue":"quant-ph","work_id":"a2acc3d3-0b0f-4ca0-b16b-b56444e8d5ae","year":2024},"citing_paper":{"arxiv_id":"2606.25194","last_updated":"2026-06-23T21:38:32Z","snapshot_observed_at":"2026-08-09T15:39:55.861790Z","submitted_at":"2026-06-23T21:38:32Z","title":"Hodge Spectral Surrogates for Topology-Constrained Optimization","version":1},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-06-25T21:19:23.602906Z"},"links":{"cited_paper":"/paper/2410.21258","citing_paper":"/paper/2606.25194"},"observation_digest":"sha256:4821519b364c8f9b311c10730157dc58c322c65b26c3461a91d86e891cb266fa","observation_id":"db0e7ada-1f5a-48df-82ed-6a789668cbf4","resolution":{"observed_at":"2026-07-04T19:30:07.325828Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2410.21258/citation-record","integrity":"/paper/2410.21258/integrity","json":"/paper/2410.21258/citation-record.json","paper":"/paper/2410.21258"},"outbound":[],"paper":{"arxiv_id":"2410.21258","last_updated":"2026-06-17T14:55:18Z","latest_version":2,"primary_category":"quant-ph","snapshot_observed_at":"2026-08-12T22:13:33.392875Z","submitted_at":"2024-10-28T17:54:43Z","title":"Provable quantum speedups for computing persistence in topological data analysis"},"reference_resolution":{"displayed":0,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":0,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":0},"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-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"thesis":"As of 13 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 8 inbound Pith citation observations for arXiv:2410.21258."}