{"as_of":"2026-08-11T08:46:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:2ff8d1be274290aa6227c00b09024d2aea524b87fb03324dd340347c7c17654e","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":5,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":5,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-11T06:34:44.6726+00:00","state":"measured"},{"denominator":5,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":5,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-03T18:48:52.404857Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":1,"source":"arxiv_reference","source_observed_at":"2026-08-05T02:28:24.338817Z","state":"measured"}],"external_citation_measurements":[{"count":0,"observed_at":"2026-08-05T02:28:24.338817Z","source":"arxiv_reference"}],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2505.00701","last_updated":"2025-05-25T20:30:24Z","snapshot_observed_at":"2026-08-07T15:57:18.484553Z","submitted_at":"2025-05-01T17:58:36Z","title":"A log-depth in-place quantum Fourier transform that rarely needs ancillas","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2505.00701","snapshot_observed_at":"2026-08-03T18:48:52.404857Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2512.03898","last_updated":"2026-06-30T10:33:08Z","snapshot_observed_at":"2026-08-07T22:12:58.438369Z","submitted_at":"2025-12-03T15:48:08Z","title":"A Quantum Algorithm with Polylogarithmic Depth per Trotter Step for the Extended Hubbard Model","version":5},"reference_index":95,"source":"pdf_text","source_observed_at":"2026-08-03T18:48:52.404857Z"},"links":{"cited_paper":"/paper/2505.00701","citing_paper":"/paper/2512.03898"},"observation_digest":"sha256:c21a9f33a64ac4a15e5b174a27007eaf88d42873b6d8d7601456ad336648d3a0","observation_id":"2c3374e5-08cd-4e29-8760-c419b86d793d","resolution":{"observed_at":"2026-08-03T18:48:52.404857Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2505.00701","last_updated":"2025-05-25T20:30:24Z","snapshot_observed_at":"2026-08-07T15:57:18.484553Z","submitted_at":"2025-05-01T17:58:36Z","title":"A log-depth in-place quantum Fourier transform that rarely needs ancillas","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2505.00701","snapshot_observed_at":"2026-07-12T21:32:53.918063Z","title":"A log-depth in-place quantum fourier transform that rarely needs ancillas.arXiv preprint arXiv:2505.00701, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2604.12156","last_updated":"2026-06-29T13:53:37Z","snapshot_observed_at":"2026-07-12T21:32:50.820566Z","submitted_at":"2026-04-14T00:12:48Z","title":"Impact of Position Uncertainty on the Secrecy Performance of Pinching Antenna Systems","version":2},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-07-12T21:32:53.918063Z"},"links":{"cited_paper":"/paper/2505.00701","citing_paper":"/paper/2604.12156"},"observation_digest":"sha256:a89ecccd68679e467f15219cae0889363085d2300cf24da1f77717e14c33e21f","observation_id":"01d51604-6b9d-4888-b9f9-248da5f63c32","resolution":{"observed_at":"2026-07-12T21:32:53.918063Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2505.00701","last_updated":"2025-05-25T20:30:24Z","snapshot_observed_at":"2026-08-07T15:57:18.484553Z","submitted_at":"2025-05-01T17:58:36Z","title":"A log-depth in-place quantum Fourier transform that rarely needs ancillas","version":2},"cited_work":{"arxiv_id":"2505.00701","doi":"10.48550/arxiv.2505.00701","metadata_source":"arxiv_reference","pith_arxiv_id":"2505.00701","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"A log-depth in-place quantum fourier transform that rarely needs ancillas","venue":"ArXiv.org","work_id":"5cd7207e-802c-416f-83a6-458c138aa405","year":2025},"citing_paper":{"arxiv_id":"2604.12157","last_updated":"2026-04-14T00:18:41Z","snapshot_observed_at":"2026-08-02T11:51:01.684203Z","submitted_at":"2026-04-14T00:18:41Z","title":"Scalable Qumode-Qubit State Transfer and Fast-forward Quantum Fourier Transform using Oscillators","version":1},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-05-10T15:08:53.597905Z"},"links":{"cited_paper":"/paper/2505.00701","citing_paper":"/paper/2604.12157"},"observation_digest":"sha256:83921cdb17c68aeceae65ad4fb0a887690dacf771021507941a5f7c05aeee920","observation_id":"c8407f41-94d0-488e-8a4a-d17a069c50b5","resolution":{"observed_at":"2026-05-11T11:11:00.977354Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2505.00701","last_updated":"2025-05-25T20:30:24Z","snapshot_observed_at":"2026-08-07T15:57:18.484553Z","submitted_at":"2025-05-01T17:58:36Z","title":"A log-depth in-place quantum Fourier transform that rarely needs ancillas","version":2},"cited_work":{"arxiv_id":"2505.00701","doi":"10.48550/arxiv.2505.00701","metadata_source":"arxiv_reference","pith_arxiv_id":"2505.00701","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"A log-depth in-place quantum fourier transform that rarely needs ancillas","venue":"ArXiv.org","work_id":"5cd7207e-802c-416f-83a6-458c138aa405","year":2025},"citing_paper":{"arxiv_id":"2605.15297","last_updated":"2026-05-14T18:11:04Z","snapshot_observed_at":"2026-07-06T23:26:37.362117Z","submitted_at":"2026-05-14T18:11:04Z","title":"Towards Deploying Optimistic Quantum Fourier Transforms: An Architecture-Algorithm Co-Design Study","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-05-19T16:06:33.998019Z"},"links":{"cited_paper":"/paper/2505.00701","citing_paper":"/paper/2605.15297"},"observation_digest":"sha256:44fb079a58b7dc0731647b2a66aa63a908008283a012370ef2cbdf30c363528e","observation_id":"21eb4510-5653-4d20-9171-d4863e6fbbe6","resolution":{"observed_at":"2026-05-19T16:07:40.910933Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2505.00701","last_updated":"2025-05-25T20:30:24Z","snapshot_observed_at":"2026-08-07T15:57:18.484553Z","submitted_at":"2025-05-01T17:58:36Z","title":"A log-depth in-place quantum Fourier transform that rarely needs ancillas","version":2},"cited_work":{"arxiv_id":"2505.00701","doi":"10.48550/arxiv.2505.00701","metadata_source":"arxiv_reference","pith_arxiv_id":"2505.00701","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"A log-depth in-place quantum fourier transform that rarely needs ancillas","venue":"ArXiv.org","work_id":"5cd7207e-802c-416f-83a6-458c138aa405","year":2025},"citing_paper":{"arxiv_id":"2606.18494","last_updated":"2026-06-16T21:07:53Z","snapshot_observed_at":"2026-08-08T01:33:58.642807Z","submitted_at":"2026-06-16T21:07:53Z","title":"Towards an Optimally Distributed Quantum Fourier Transform Circuit","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-06-27T00:00:52.965850Z"},"links":{"cited_paper":"/paper/2505.00701","citing_paper":"/paper/2606.18494"},"observation_digest":"sha256:e35cdf871b51a50da0d89c6297671272892fc8a2841b29591177ebeb135efaed","observation_id":"cd8f7f3f-ff4b-434d-b9a3-c81e42a0abaf","resolution":{"observed_at":"2026-06-27T00:10:16.900795Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2505.00701/citation-record","integrity":"/paper/2505.00701/integrity","json":"/paper/2505.00701/citation-record.json","paper":"/paper/2505.00701"},"outbound":[],"paper":{"arxiv_id":"2505.00701","last_updated":"2025-05-25T20:30:24Z","latest_version":2,"primary_category":"quant-ph","snapshot_observed_at":"2026-08-07T15:57:18.484553Z","submitted_at":"2025-05-01T17:58:36Z","title":"A log-depth in-place quantum Fourier transform that rarely needs ancillas"},"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-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"thesis":"As of 11 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 5 inbound Pith citation observations for arXiv:2505.00701."}