{"as_of":"2026-08-09T22:47:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:8d4380ecc0863bbef44ae78a5e82f670493b9e513c92d7ef9bfde793ce5e74d6","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":9,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":9,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-09T06:31:02.800959+00:00","state":"measured"},{"denominator":9,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":9,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-03T21:53:45.072458Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-07-04T10:49:46.823320Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2412.04181","last_updated":"2024-12-05T14:20:44Z","snapshot_observed_at":"2026-08-09T02:33:52.388524Z","submitted_at":"2024-12-05T14:20:44Z","title":"Pruning qLDPC codes: Towards bivariate bicycle codes with open boundary conditions","version":1},"cited_work":{"arxiv_id":"2412.04181","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2412.04181","snapshot_observed_at":"2026-07-04T10:49:46.823320Z","title":"N., Pereira, F","venue":null,"work_id":"cf62ba23-ecdd-4b67-a7e2-274ee7badd77","year":2024},"citing_paper":{"arxiv_id":"2511.04430","last_updated":"2026-05-06T23:02:15Z","snapshot_observed_at":"2026-07-06T22:35:02.737645Z","submitted_at":"2025-11-06T15:05:17Z","title":"Symmetry-enriched topological order and quasifractonic behavior in $\\mathbb{Z}_N$ stabilizer codes","version":2},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-05-18T01:01:08.043585Z"},"links":{"cited_paper":"/paper/2412.04181","citing_paper":"/paper/2511.04430"},"observation_digest":"sha256:d0a868e8a0f90f7b41664e5b591bf2fc6ec9c62efd742f5c708b32e7e6036193","observation_id":"8661e1b0-1a79-41c8-a4d3-39175f5a9bec","resolution":{"observed_at":"2026-05-18T01:02:15.434969Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2412.04181","last_updated":"2024-12-05T14:20:44Z","snapshot_observed_at":"2026-08-09T02:33:52.388524Z","submitted_at":"2024-12-05T14:20:44Z","title":"Pruning qLDPC codes: Towards bivariate bicycle codes with open boundary conditions","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2412.04181","snapshot_observed_at":"2026-08-03T21:53:45.072458Z","title":"Pruning qLDPC codes: Towards bivariate bicycle codes with open boundary conditions","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2511.13560","last_updated":"2026-08-06T13:04:59Z","snapshot_observed_at":"2026-08-09T22:12:19.472696Z","submitted_at":"2025-11-17T16:26:15Z","title":"Sequences of Bivariate Bicycle Codes from Covering Graphs","version":2},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-03T21:53:45.072458Z"},"links":{"cited_paper":"/paper/2412.04181","citing_paper":"/paper/2511.13560"},"observation_digest":"sha256:2c40561b5ef558c86a4abe7796eeb349b4541e717308f4bc1ea1e2ffa717b0e0","observation_id":"9c13e176-dac7-42f0-92e7-a3b731e398de","resolution":{"observed_at":"2026-08-03T21:53:45.072458Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2412.04181","last_updated":"2024-12-05T14:20:44Z","snapshot_observed_at":"2026-08-09T02:33:52.388524Z","submitted_at":"2024-12-05T14:20:44Z","title":"Pruning qLDPC codes: Towards bivariate bicycle codes with open boundary conditions","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2412.04181","snapshot_observed_at":"2026-08-03T03:01:35.687337Z","title":"Pruning qLDPC codes: Towards bivariate bicycle codes with open boundary conditions","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2602.09788","last_updated":"2026-06-01T03:43:50Z","snapshot_observed_at":"2026-08-06T22:16:51.797295Z","submitted_at":"2026-02-10T13:49:00Z","title":"Construction of the full logical Clifford group for high-rate quantum Reed-Muller codes using only transversal and fold-transversal gates","version":3},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-03T03:01:35.687337Z"},"links":{"cited_paper":"/paper/2412.04181","citing_paper":"/paper/2602.09788"},"observation_digest":"sha256:20e3eb6935345c35f0ce08f9ad51011b7ee65454967f2137a81c15bf7de5adfc","observation_id":"adfd0e30-78bd-43de-8f2a-bad4c7f26494","resolution":{"observed_at":"2026-08-03T03:01:35.687337Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2412.04181","last_updated":"2024-12-05T14:20:44Z","snapshot_observed_at":"2026-08-09T02:33:52.388524Z","submitted_at":"2024-12-05T14:20:44Z","title":"Pruning qLDPC codes: Towards bivariate bicycle codes with open boundary conditions","version":1},"cited_work":{"arxiv_id":"2412.04181","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2412.04181","snapshot_observed_at":"2026-07-04T10:49:46.823320Z","title":"N., Pereira, F","venue":null,"work_id":"cf62ba23-ecdd-4b67-a7e2-274ee7badd77","year":2024},"citing_paper":{"arxiv_id":"2606.02418","last_updated":"2026-06-01T15:58:52Z","snapshot_observed_at":"2026-08-07T12:41:50.696478Z","submitted_at":"2026-06-01T15:58:52Z","title":"Evolutionary Discovery of Bivariate Bicycle Codes with LLM-Guided Search","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-06-28T14:38:55.748985Z"},"links":{"cited_paper":"/paper/2412.04181","citing_paper":"/paper/2606.02418"},"observation_digest":"sha256:9cdb3da091b4b25c1fb10f455de3c40af3d270cfdc5c87811f5c9016bb52445c","observation_id":"d029ee35-13d7-4055-881a-04741b662819","resolution":{"observed_at":"2026-07-01T23:06:20.981326Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2412.04181","last_updated":"2024-12-05T14:20:44Z","snapshot_observed_at":"2026-08-09T02:33:52.388524Z","submitted_at":"2024-12-05T14:20:44Z","title":"Pruning qLDPC codes: Towards bivariate bicycle codes with open boundary conditions","version":1},"cited_work":{"arxiv_id":"2412.04181","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2412.04181","snapshot_observed_at":"2026-07-04T10:49:46.823320Z","title":"N., Pereira, F","venue":null,"work_id":"cf62ba23-ecdd-4b67-a7e2-274ee7badd77","year":2024},"citing_paper":{"arxiv_id":"2606.06062","last_updated":"2026-06-04T12:01:24Z","snapshot_observed_at":"2026-08-06T22:43:50.932175Z","submitted_at":"2026-06-04T12:01:24Z","title":"Barbell Codes: qLDPC Codes for Superconducting Quantum Hardware","version":1},"reference_index":47,"source":"arxiv_source","source_observed_at":"2026-06-28T00:41:15.817095Z"},"links":{"cited_paper":"/paper/2412.04181","citing_paper":"/paper/2606.06062"},"observation_digest":"sha256:4031fa7468cc59dbcaa13cb8f2414314ebe164395130755389d40129caf53f64","observation_id":"d195d4aa-665d-410b-9e9d-32b1705f6945","resolution":{"observed_at":"2026-07-02T14:07:03.459497Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2412.04181","last_updated":"2024-12-05T14:20:44Z","snapshot_observed_at":"2026-08-09T02:33:52.388524Z","submitted_at":"2024-12-05T14:20:44Z","title":"Pruning qLDPC codes: Towards bivariate bicycle codes with open boundary conditions","version":1},"cited_work":{"arxiv_id":"2412.04181","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2412.04181","snapshot_observed_at":"2026-07-04T10:49:46.823320Z","title":"N., Pereira, F","venue":null,"work_id":"cf62ba23-ecdd-4b67-a7e2-274ee7badd77","year":2024},"citing_paper":{"arxiv_id":"2606.08771","last_updated":"2026-06-07T18:24:32Z","snapshot_observed_at":"2026-08-06T09:02:52.510978Z","submitted_at":"2026-06-07T18:24:32Z","title":"Algebra of Bivariate-Bicycle Surface Codes","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-06-27T18:17:06.305544Z"},"links":{"cited_paper":"/paper/2412.04181","citing_paper":"/paper/2606.08771"},"observation_digest":"sha256:82ecd33518cb5460e417ec7bd60cb6672ee5ccbee81759b2f16bff8c3977c107","observation_id":"81bc7875-1e93-49d3-8fb0-2c26b72624fd","resolution":{"observed_at":"2026-07-02T23:27:26.774334Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2412.04181","last_updated":"2024-12-05T14:20:44Z","snapshot_observed_at":"2026-08-09T02:33:52.388524Z","submitted_at":"2024-12-05T14:20:44Z","title":"Pruning qLDPC codes: Towards bivariate bicycle codes with open boundary conditions","version":1},"cited_work":{"arxiv_id":"2412.04181","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2412.04181","snapshot_observed_at":"2026-07-04T10:49:46.823320Z","title":"N., Pereira, F","venue":null,"work_id":"cf62ba23-ecdd-4b67-a7e2-274ee7badd77","year":2024},"citing_paper":{"arxiv_id":"2606.20263","last_updated":"2026-06-18T14:11:14Z","snapshot_observed_at":"2026-07-06T23:55:25.144457Z","submitted_at":"2026-06-18T14:11:14Z","title":"Vine Codes: Low-Overhead Quantum LDPC Codes on a Planar Square Grid","version":1},"reference_index":59,"source":"pdf_text","source_observed_at":"2026-06-26T16:51:59.233119Z"},"links":{"cited_paper":"/paper/2412.04181","citing_paper":"/paper/2606.20263"},"observation_digest":"sha256:17f010325dca335626e8f62776dd82b3989a38e4976d96c285844a7441188801","observation_id":"08ba06bd-0588-422a-ad46-d0ce5f00cca8","resolution":{"observed_at":"2026-07-04T04:39:34.766699Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2412.04181","last_updated":"2024-12-05T14:20:44Z","snapshot_observed_at":"2026-08-09T02:33:52.388524Z","submitted_at":"2024-12-05T14:20:44Z","title":"Pruning qLDPC codes: Towards bivariate bicycle codes with open boundary conditions","version":1},"cited_work":{"arxiv_id":"2412.04181","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2412.04181","snapshot_observed_at":"2026-07-04T10:49:46.823320Z","title":"N., Pereira, F","venue":null,"work_id":"cf62ba23-ecdd-4b67-a7e2-274ee7badd77","year":2024},"citing_paper":{"arxiv_id":"2606.22853","last_updated":"2026-06-22T04:57:16Z","snapshot_observed_at":"2026-08-07T23:37:54.728830Z","submitted_at":"2026-06-22T04:57:16Z","title":"Bunny Codes: Broadening Superconducting Quantum Error Correction Capability through Advanced Control Engineering","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-06-26T08:23:35.745765Z"},"links":{"cited_paper":"/paper/2412.04181","citing_paper":"/paper/2606.22853"},"observation_digest":"sha256:01b1043d13de810479ccbb303113bb14f16875f84e15612cf4fecb8e36b482bb","observation_id":"ffecacc8-7cdb-4fc5-877a-ae1960307e80","resolution":{"observed_at":"2026-07-04T10:49:46.824893Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2412.04181","last_updated":"2024-12-05T14:20:44Z","snapshot_observed_at":"2026-08-09T02:33:52.388524Z","submitted_at":"2024-12-05T14:20:44Z","title":"Pruning qLDPC codes: Towards bivariate bicycle codes with open boundary conditions","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2412.04181","snapshot_observed_at":"2026-07-14T13:00:22.366341Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.10274","last_updated":"2026-07-11T12:09:27Z","snapshot_observed_at":"2026-08-06T07:07:27.518632Z","submitted_at":"2026-07-11T12:09:27Z","title":"Efficient Circuit Transpilation of Commuting Gates on 2D Grids","version":1},"reference_index":59,"source":"pdf_text","source_observed_at":"2026-07-14T13:00:22.366341Z"},"links":{"cited_paper":"/paper/2412.04181","citing_paper":"/paper/2607.10274"},"observation_digest":"sha256:4191580f7c6ec2f5e8d79d643d8dba1876106926643b1f1ffb441a4b3ea77939","observation_id":"7bbaaea2-d511-44b5-a2bc-06d78bc9acfb","resolution":{"observed_at":"2026-07-14T13:00:22.366341Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2412.04181/citation-record","integrity":"/paper/2412.04181/integrity","json":"/paper/2412.04181/citation-record.json","paper":"/paper/2412.04181"},"outbound":[],"paper":{"arxiv_id":"2412.04181","last_updated":"2024-12-05T14:20:44Z","latest_version":1,"primary_category":"quant-ph","snapshot_observed_at":"2026-08-09T02:33:52.388524Z","submitted_at":"2024-12-05T14:20:44Z","title":"Pruning qLDPC codes: Towards bivariate bicycle codes with open boundary conditions"},"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-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"thesis":"As of 9 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 9 inbound Pith citation observations for arXiv:2412.04181."}