{"as_of":"2026-08-08T02:15:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:253781d13aabc0eac6ad0222b25bbcb15935d409a8dbaa02a911f07d35d74563","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-07T06:34:17.273281+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-07-06T20:02:12.866050Z","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:b4dae7d765111d49c4371c85b2dcf1f76b6adf5ad7c707aba790d1ccb05aa0c8","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-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07-06T20:02:12.866050Z","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-08T01:16:12.362545Z","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:d3748ecbb319c183341c4687a9f992ff8f260936a1d867b4f64c51d0be5b23a0","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-07-06T20:02:12.866050Z","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:fe67e577f7c38ce6e31310edaa4b405cdd0e2212be4ff04d3f6ad6497d13b85e","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-07-06T20:02:12.866050Z","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:a06d7415f9f9a9821c59fb67cedd0f9b288dd0d3237a1c9c5aef6a67efe1a8e3","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-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07-06T20:02:12.866050Z","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:c93434467a07cfe8b45f67022f20bcb0d6e70603b8d5f090cfcc75acc4d6d9d3","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-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07-06T20:02:12.866050Z","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:2b2058004cfcbe94ef7ac87f49415591b9f101c58c5f579b510d1ce253d72c70","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-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07-06T20:02:12.866050Z","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:eb6d0028cbcecf3be4120d3ddb1d913da9440b96251100f3894ae405163b180d","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-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07-06T20:02:12.866050Z","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:083c9b64b7fecd2d0cc511b904bb46a2f0550af31bf61d38ba8c78526c21c339","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-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07-06T20:02:12.866050Z","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:2bd889898133a282e692b3195892622b179c8f78498fed3839aa0ca24d8709ae","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-07-06T20:02:12.866050Z","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-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"thesis":"As of 8 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 9 inbound Pith citation observations for arXiv:2412.04181."}