{"as_of":"2026-08-09T01:16:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:b8010e10039c9c9bebd555536c10417e53e3e5c34fd503c26ef78a63a7ba79b3","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":4,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":4,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-08T06:32:00.761636+00:00","state":"measured"},{"denominator":4,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":4,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-06T13:15:43.650568Z","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-02T09:06:49.042859Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2203.17216","last_updated":"2022-03-31T17:43:34Z","snapshot_observed_at":"2026-07-06T12:55:23.720351Z","submitted_at":"2022-03-31T17:43:34Z","title":"Distance bounds for generalized bicycle codes","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2203.17216","snapshot_observed_at":"2026-08-06T13:15:43.650568Z","title":"Distance bounds for generalized bicycle codes,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2507.21237","last_updated":"2025-07-28T18:00:40Z","snapshot_observed_at":"2026-08-08T20:58:45.725849Z","submitted_at":"2025-07-28T18:00:40Z","title":"(2,2)-GB Codes: Classification and Comparison with weight-4 Surface Codes","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-06T13:15:43.650568Z"},"links":{"cited_paper":"/paper/2203.17216","citing_paper":"/paper/2507.21237"},"observation_digest":"sha256:5177a639ac08f615c081c50f586c99e13456c4928923e47f0c5d10ff59961fb6","observation_id":"38f61afe-74a6-4b6b-afb6-391c68be25e5","resolution":{"observed_at":"2026-08-06T13:15:43.650568Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2203.17216","last_updated":"2022-03-31T17:43:34Z","snapshot_observed_at":"2026-07-06T12:55:23.720351Z","submitted_at":"2022-03-31T17:43:34Z","title":"Distance bounds for generalized bicycle codes","version":1},"cited_work":{"arxiv_id":"2203.17216","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2203.17216","snapshot_observed_at":"2026-07-02T09:06:49.042859Z","title":"Wang and L","venue":null,"work_id":"7d7eef79-b065-4ce1-a5fb-23a2ae4b92c0","year":2022},"citing_paper":{"arxiv_id":"2605.03218","last_updated":"2026-05-04T23:16:16Z","snapshot_observed_at":"2026-07-06T23:16:10.769968Z","submitted_at":"2026-05-04T23:16:16Z","title":"Edge-Based Anisotropic Decoding for Generalized Bicycle Codes","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-05-08T18:01:02.695918Z"},"links":{"cited_paper":"/paper/2203.17216","citing_paper":"/paper/2605.03218"},"observation_digest":"sha256:2f3cf419efbe31d48068f1edfe05ca2f24ab37ebaa8a0a89ba00f11b84579aaa","observation_id":"af1704fa-3b30-4f45-b40a-c60dc818690e","resolution":{"observed_at":"2026-05-12T10:51:29.843795Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2203.17216","last_updated":"2022-03-31T17:43:34Z","snapshot_observed_at":"2026-07-06T12:55:23.720351Z","submitted_at":"2022-03-31T17:43:34Z","title":"Distance bounds for generalized bicycle codes","version":1},"cited_work":{"arxiv_id":"2203.17216","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2203.17216","snapshot_observed_at":"2026-07-02T09:06:49.042859Z","title":"Wang and L","venue":null,"work_id":"7d7eef79-b065-4ce1-a5fb-23a2ae4b92c0","year":2022},"citing_paper":{"arxiv_id":"2605.19298","last_updated":"2026-05-19T03:18:11Z","snapshot_observed_at":"2026-07-29T14:49:16.049487Z","submitted_at":"2026-05-19T03:18:11Z","title":"Translation-invariant quantum low-density parity-check codes from compactified fracton models","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-05-20T06:28:11.017427Z"},"links":{"cited_paper":"/paper/2203.17216","citing_paper":"/paper/2605.19298"},"observation_digest":"sha256:71ab5b0a5e79ed157879d4baf2bd83c0b1acaf71816c871528faeef68fcb4cfb","observation_id":"4ca31b96-3a1c-4ffa-ad3a-6605ff2004ac","resolution":{"observed_at":"2026-05-20T06:33:05.916813Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2203.17216","last_updated":"2022-03-31T17:43:34Z","snapshot_observed_at":"2026-07-06T12:55:23.720351Z","submitted_at":"2022-03-31T17:43:34Z","title":"Distance bounds for generalized bicycle codes","version":1},"cited_work":{"arxiv_id":"2203.17216","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2203.17216","snapshot_observed_at":"2026-07-02T09:06:49.042859Z","title":"Wang and L","venue":null,"work_id":"7d7eef79-b065-4ce1-a5fb-23a2ae4b92c0","year":2022},"citing_paper":{"arxiv_id":"2606.05044","last_updated":"2026-06-03T16:05:40Z","snapshot_observed_at":"2026-07-06T23:45:02.342193Z","submitted_at":"2026-06-03T16:05:40Z","title":"Generalized Bicycle Codes as Cyclic Submodules and their Automorphism Structure","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-06-28T05:41:01.009335Z"},"links":{"cited_paper":"/paper/2203.17216","citing_paper":"/paper/2606.05044"},"observation_digest":"sha256:d997092b186af26d044920ed8bc38b6cbab0ba57a898faf0128a6a2cc649e68c","observation_id":"110cf570-7f43-4cb6-b51a-ff54b2701086","resolution":{"observed_at":"2026-07-02T09:06:49.044243Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2203.17216/citation-record","integrity":"/paper/2203.17216/integrity","json":"/paper/2203.17216/citation-record.json","paper":"/paper/2203.17216"},"outbound":[],"paper":{"arxiv_id":"2203.17216","last_updated":"2022-03-31T17:43:34Z","latest_version":1,"primary_category":"quant-ph","snapshot_observed_at":"2026-07-06T12:55:23.720351Z","submitted_at":"2022-03-31T17:43:34Z","title":"Distance bounds for generalized bicycle codes"},"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-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"thesis":"As of 9 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 4 inbound Pith citation observations for arXiv:2203.17216."}