{"as_of":"2026-08-21T00:03:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:fe8a9e5b994bb74ef06d98775f442d3e0dc2cea5849b8b78f91db0f5e13d26c9","coverage":[{"denominator":9,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":9,"source":"paper_references, paper_reference_links","source_observed_at":"2026-07-13T07:59:20.904938Z","state":"measured"},{"denominator":10,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":10,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-20T06:33:59.587034+00:00","state":"measured"},{"denominator":1,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-05T21:16:03.762069Z","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-08-05T21:16:06.347302Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2605.13929","last_updated":"2026-07-10T15:03:03Z","snapshot_observed_at":"2026-08-11T12:53:00.347622Z","submitted_at":"2026-05-13T15:54:13Z","title":"Linear-Time T-Gate Optimization via Random Abstraction","version":2},"cited_work":{"arxiv_id":"2605.13929","doi":null,"metadata_source":"pith","pith_arxiv_id":"2605.13929","snapshot_observed_at":"2026-08-05T21:16:06.347302Z","title":"Linear-Time T-Gate Optimization via Random Abstraction","venue":"cs.PL","work_id":"048798e3-ed7b-4c9c-8024-3998434763c1","year":2026},"citing_paper":{"arxiv_id":"2608.03315","last_updated":"2026-08-04T08:21:59Z","snapshot_observed_at":"2026-08-17T10:50:42.921080Z","submitted_at":"2026-08-04T08:21:59Z","title":"Harvest: Resource-Aware Quantum Compilation for Magic State Protocols","version":1},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-08-05T21:16:03.762069Z"},"links":{"cited_paper":"/paper/2605.13929","citing_paper":"/paper/2608.03315"},"observation_digest":"sha256:22e8a3f95858bf1febd9f36d388fad9c180c599d1f57c229f3d0adb707c0c692","observation_id":"ca64ed1c-18f2-4c36-95ed-90851e1caedc","resolution":{"observed_at":"2026-08-05T21:16:06.438024Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2605.13929/citation-record","integrity":"/paper/2605.13929/integrity","json":"/paper/2605.13929/citation-record.json","paper":"/paper/2605.13929"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-13T07:59:20.904938Z","title":"Chen, and Fabian J","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2605.13929","last_updated":"2026-07-10T15:03:03Z","snapshot_observed_at":"2026-08-11T12:53:00.347622Z","submitted_at":"2026-05-13T15:54:13Z","title":"Linear-Time T-Gate Optimization via Random Abstraction","version":2},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-07-13T07:59:20.904938Z"},"links":{"citing_paper":"/paper/2605.13929"},"observation_digest":"sha256:f9188d93992a67b48277d122a7d9ade0ab43039360aeab88f8c8b08f94eac85f","observation_id":"98cd3552-2c90-48cf-ab37-9a6ae4fa8b92","resolution":{"observed_at":"2026-07-13T07:59:20.904938Z","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-07-13T07:59:20.904938Z","title":"Evaluating accuracy and performance tradeoffs in gpu accelerated single cell rna-seq analysis","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2605.13929","last_updated":"2026-07-10T15:03:03Z","snapshot_observed_at":"2026-08-11T12:53:00.347622Z","submitted_at":"2026-05-13T15:54:13Z","title":"Linear-Time T-Gate Optimization via Random Abstraction","version":2},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-07-13T07:59:20.904938Z"},"links":{"citing_paper":"/paper/2605.13929"},"observation_digest":"sha256:d49fd157dc562f49a76600f18aa00903e3a344d05419295f4bd09d0517294da1","observation_id":"e22a3f26-6e69-465f-b3a7-2dc7b60dacea","resolution":{"observed_at":"2026-07-13T07:59:20.904938Z","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-07-13T07:59:20.904938Z","title":"Scalable, fast and accurate differential gene expression testing from millions of cells of multiple patients.biorxiv, pages 2025–07, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2605.13929","last_updated":"2026-07-10T15:03:03Z","snapshot_observed_at":"2026-08-11T12:53:00.347622Z","submitted_at":"2026-05-13T15:54:13Z","title":"Linear-Time T-Gate Optimization via Random Abstraction","version":2},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-07-13T07:59:20.904938Z"},"links":{"citing_paper":"/paper/2605.13929"},"observation_digest":"sha256:a27a7de734d34af86aab068079694ee74c5b7aec616a9e9389c667aa560d1e20","observation_id":"30a3a3ee-a537-4134-b394-997952e45b8e","resolution":{"observed_at":"2026-07-13T07:59:20.904938Z","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-07-13T07:59:20.904938Z","title":"Nvidia management library (nvml)","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2605.13929","last_updated":"2026-07-10T15:03:03Z","snapshot_observed_at":"2026-08-11T12:53:00.347622Z","submitted_at":"2026-05-13T15:54:13Z","title":"Linear-Time T-Gate Optimization via Random Abstraction","version":2},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-07-13T07:59:20.904938Z"},"links":{"citing_paper":"/paper/2605.13929"},"observation_digest":"sha256:34bde52b7252d7552a7fe4cf34cf6087a69bb322289f52ec28eae95ced4392cd","observation_id":"2a6c1d12-fc34-40fc-95e8-a1fdeefdaf2e","resolution":{"observed_at":"2026-07-13T07:59:20.904938Z","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-07-13T07:59:20.904938Z","title":"R package version 1.46.0","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2605.13929","last_updated":"2026-07-10T15:03:03Z","snapshot_observed_at":"2026-08-11T12:53:00.347622Z","submitted_at":"2026-05-13T15:54:13Z","title":"Linear-Time T-Gate Optimization via Random Abstraction","version":2},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-07-13T07:59:20.904938Z"},"links":{"citing_paper":"/paper/2605.13929"},"observation_digest":"sha256:1d0744a10bc39d3951e4c78f6b6088baedbf5e01847e2568ad2a8c2fb2d0c774","observation_id":"5ab34a40-6caf-4524-b393-cd6e2776580d","resolution":{"observed_at":"2026-07-13T07:59:20.904938Z","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-07-13T07:59:20.904938Z","title":"https://figshare.com/articles/software/ CudaMon_An_R_Package_to_Monitor_NVIDIA_GPUs_Showcased_by_Monitoring_a_ GPU-accelerated_Single-cell_Analysis_Workflow_in_R/32153880","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2605.13929","last_updated":"2026-07-10T15:03:03Z","snapshot_observed_at":"2026-08-11T12:53:00.347622Z","submitted_at":"2026-05-13T15:54:13Z","title":"Linear-Time T-Gate Optimization via Random Abstraction","version":2},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-07-13T07:59:20.904938Z"},"links":{"citing_paper":"/paper/2605.13929"},"observation_digest":"sha256:bb043a8a522ce39937d24ff3602dc5dbdb0ff85c24ad98da94452dc5d73205e5","observation_id":"fcf5800c-5994-49ec-a834-48cf848a7583","resolution":{"observed_at":"2026-07-13T07:59:20.904938Z","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-07-13T07:59:20.904938Z","title":null,"venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2605.13929","last_updated":"2026-07-10T15:03:03Z","snapshot_observed_at":"2026-08-11T12:53:00.347622Z","submitted_at":"2026-05-13T15:54:13Z","title":"Linear-Time T-Gate Optimization via Random Abstraction","version":2},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-07-13T07:59:20.904938Z"},"links":{"citing_paper":"/paper/2605.13929"},"observation_digest":"sha256:033c5ca79b747dd5136fa67b384d4d6f96f900b642d6b8c6a0bbdd6d2f910d77","observation_id":"ef42e708-801f-440b-97c7-77dce913fe63","resolution":{"observed_at":"2026-07-13T07:59:20.904938Z","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-07-13T07:59:20.904938Z","title":"Scanpy: large-scale single-cell gene expression data analysis.Genome biology, 19(1):15, 2018","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2605.13929","last_updated":"2026-07-10T15:03:03Z","snapshot_observed_at":"2026-08-11T12:53:00.347622Z","submitted_at":"2026-05-13T15:54:13Z","title":"Linear-Time T-Gate Optimization via Random Abstraction","version":2},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-07-13T07:59:20.904938Z"},"links":{"citing_paper":"/paper/2605.13929"},"observation_digest":"sha256:6ba6ae5db1213a5fcff6d40a8151573f43cd6b6e1985092266457347412ef9f5","observation_id":"a18aa7c9-6130-4b57-869b-01733edbf634","resolution":{"observed_at":"2026-07-13T07:59:20.904938Z","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-07-13T07:59:20.904938Z","title":"R package version 1.12.0","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2605.13929","last_updated":"2026-07-10T15:03:03Z","snapshot_observed_at":"2026-08-11T12:53:00.347622Z","submitted_at":"2026-05-13T15:54:13Z","title":"Linear-Time T-Gate Optimization via Random Abstraction","version":2},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-07-13T07:59:20.904938Z"},"links":{"citing_paper":"/paper/2605.13929"},"observation_digest":"sha256:539498edc4e44051b3ca5961ec264ff76dd5357046489ee635005bb7c7d2b2af","observation_id":"c4c35538-0ec1-464b-92d9-f1a8e2585e49","resolution":{"observed_at":"2026-07-13T07:59:20.904938Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2605.13929","last_updated":"2026-07-10T15:03:03Z","latest_version":2,"primary_category":"cs.PL","snapshot_observed_at":"2026-08-11T12:53:00.347622Z","submitted_at":"2026-05-13T15:54:13Z","title":"Linear-Time T-Gate Optimization via Random Abstraction"},"reference_resolution":{"displayed":9,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":9,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":9},"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-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"thesis":"As of 21 August 2026, this Paper Citation Record lists 9 of 9 outbound references and 1 inbound Pith citation observation for arXiv:2605.13929."}