{"as_of":"2026-08-13T07:08:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:dff80edaefa57d3519ac07a1d73301a2ba9638bde7aeb82b17c72e5a83a5d12d","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":6,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":6,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-13T06:32:02.005865+00:00","state":"measured"},{"denominator":6,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":6,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-12T04:28:05.729743Z","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-03T01:07:30.456021Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2407.16336","last_updated":"2025-03-26T12:39:33Z","snapshot_observed_at":"2026-08-12T23:16:36.259084Z","submitted_at":"2024-07-23T09:35:49Z","title":"Lowering Connectivity Requirements For Bivariate Bicycle Codes Using Morphing Circuits","version":3},"cited_work":{"arxiv_id":"2407.16336","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2407.16336","snapshot_observed_at":"2026-07-03T01:07:30.456021Z","title":"arXiv preprint arXiv:2407.16336 (2024)","venue":null,"work_id":"85107202-1641-4099-9999-59520ee07d35","year":2025},"citing_paper":{"arxiv_id":"2410.11942","last_updated":"2026-05-11T04:48:38Z","snapshot_observed_at":"2026-07-06T19:34:05.643989Z","submitted_at":"2024-10-15T18:00:00Z","title":"Operator algebra and algorithmic construction of boundaries and defects in (2+1)D topological Pauli stabilizer codes","version":5},"reference_index":121,"source":"pdf_text","source_observed_at":"2026-05-23T18:41:14.926900Z"},"links":{"cited_paper":"/paper/2407.16336","citing_paper":"/paper/2410.11942"},"observation_digest":"sha256:07563f5182ee5c31a52e8f4edce14040d150f1310470501354c4ffd9073deebb","observation_id":"4b4f93a7-b024-4051-afa5-dc5822efc8d7","resolution":{"observed_at":"2026-05-23T18:43:19.037924Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2407.16336","last_updated":"2025-03-26T12:39:33Z","snapshot_observed_at":"2026-08-12T23:16:36.259084Z","submitted_at":"2024-07-23T09:35:49Z","title":"Lowering Connectivity Requirements For Bivariate Bicycle Codes Using Morphing Circuits","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2407.16336","snapshot_observed_at":"2026-08-12T04:28:05.729743Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2412.01391","last_updated":"2024-12-02T11:24:46Z","snapshot_observed_at":"2026-08-12T04:22:29.409168Z","submitted_at":"2024-12-02T11:24:46Z","title":"Transversal Logical Clifford gates on rotated surface codes with reconfigurable neutral atom arrays","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-12T04:28:05.729743Z"},"links":{"cited_paper":"/paper/2407.16336","citing_paper":"/paper/2412.01391"},"observation_digest":"sha256:a9305fe452375189384670970a88780fc63fb751f93d234403cc1ab932c13574","observation_id":"0435cf3b-9287-4a2b-867f-b0e505883dc3","resolution":{"observed_at":"2026-08-12T04:28:05.729743Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2407.16336","last_updated":"2025-03-26T12:39:33Z","snapshot_observed_at":"2026-08-12T23:16:36.259084Z","submitted_at":"2024-07-23T09:35:49Z","title":"Lowering Connectivity Requirements For Bivariate Bicycle Codes Using Morphing Circuits","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2407.16336","snapshot_observed_at":"2026-08-07T18:23:40.684318Z","title":"Lowering connectivity requirements for bivariate bicycle codes using morphing circuits,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2502.10355","last_updated":"2025-02-14T18:33:43Z","snapshot_observed_at":"2026-08-09T03:42:10.051213Z","submitted_at":"2025-02-14T18:33:43Z","title":"Diamond Circuits for Surface Codes","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-07T18:23:40.684318Z"},"links":{"cited_paper":"/paper/2407.16336","citing_paper":"/paper/2502.10355"},"observation_digest":"sha256:c3b67c997c848e86cec347625824e1cc59c59b7862d237061d05c5d2c14ae40f","observation_id":"08183b5c-8bce-47ac-abdc-44b3921735a2","resolution":{"observed_at":"2026-08-07T18:23:40.684318Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2407.16336","last_updated":"2025-03-26T12:39:33Z","snapshot_observed_at":"2026-08-12T23:16:36.259084Z","submitted_at":"2024-07-23T09:35:49Z","title":"Lowering Connectivity Requirements For Bivariate Bicycle Codes Using Morphing Circuits","version":3},"cited_work":{"arxiv_id":"2407.16336","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2407.16336","snapshot_observed_at":"2026-07-03T01:07:30.456021Z","title":"arXiv preprint arXiv:2407.16336 (2024)","venue":null,"work_id":"85107202-1641-4099-9999-59520ee07d35","year":2025},"citing_paper":{"arxiv_id":"2604.01040","last_updated":"2026-04-14T20:52:40Z","snapshot_observed_at":"2026-08-11T04:40:10.221260Z","submitted_at":"2026-04-01T15:50:51Z","title":"Geometry-induced correlated noise in qLDPC syndrome extraction","version":2},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-05-13T22:08:43.050338Z"},"links":{"cited_paper":"/paper/2407.16336","citing_paper":"/paper/2604.01040"},"observation_digest":"sha256:544255ed33de1f4e7993460edda57f1d72e982000af8fc877be3b5242a50bf43","observation_id":"70b65f1e-cc90-4dd6-a94a-833e97c250e7","resolution":{"observed_at":"2026-05-13T22:13:20.957455Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2407.16336","last_updated":"2025-03-26T12:39:33Z","snapshot_observed_at":"2026-08-12T23:16:36.259084Z","submitted_at":"2024-07-23T09:35:49Z","title":"Lowering Connectivity Requirements For Bivariate Bicycle Codes Using Morphing Circuits","version":3},"cited_work":{"arxiv_id":"2407.16336","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2407.16336","snapshot_observed_at":"2026-07-03T01:07:30.456021Z","title":"arXiv preprint arXiv:2407.16336 (2024)","venue":null,"work_id":"85107202-1641-4099-9999-59520ee07d35","year":2025},"citing_paper":{"arxiv_id":"2606.09678","last_updated":"2026-06-08T15:59:47Z","snapshot_observed_at":"2026-08-11T00:36:33.734595Z","submitted_at":"2026-06-08T15:59:47Z","title":"The dynamic 4.8.8 Floquet code","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-06-27T16:48:32.905893Z"},"links":{"cited_paper":"/paper/2407.16336","citing_paper":"/paper/2606.09678"},"observation_digest":"sha256:1f08f6ae38fe223d8ed4c4d58f6b4c0b809202a784fb7eb6aea1bed808da3189","observation_id":"b806b7f2-e1c8-465c-aa33-f221ff9387e3","resolution":{"observed_at":"2026-07-03T01:07:30.457438Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2407.16336","last_updated":"2025-03-26T12:39:33Z","snapshot_observed_at":"2026-08-12T23:16:36.259084Z","submitted_at":"2024-07-23T09:35:49Z","title":"Lowering Connectivity Requirements For Bivariate Bicycle Codes Using Morphing Circuits","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2407.16336","snapshot_observed_at":"2026-08-11T23:22:37.671803Z","title":"Lowering connectivity requirements for bivariate bicycle codes using morphing circuits,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2608.09115","last_updated":"2026-08-10T04:45:08Z","snapshot_observed_at":"2026-08-13T06:17:39.220814Z","submitted_at":"2026-08-10T04:45:08Z","title":"Quantum Bicycle LDPC Codes with High $kd^2/n$ from Divisor-Driven Search","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-11T23:22:37.671803Z"},"links":{"cited_paper":"/paper/2407.16336","citing_paper":"/paper/2608.09115"},"observation_digest":"sha256:d78c1c36ceffd07641be65a9de295096d512558accb3d67ac3a32989a90bdf65","observation_id":"82eb7875-2443-4e8e-9412-534af35d0ad8","resolution":{"observed_at":"2026-08-11T23:22:37.671803Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2407.16336/citation-record","integrity":"/paper/2407.16336/integrity","json":"/paper/2407.16336/citation-record.json","paper":"/paper/2407.16336"},"outbound":[],"paper":{"arxiv_id":"2407.16336","last_updated":"2025-03-26T12:39:33Z","latest_version":3,"primary_category":"quant-ph","snapshot_observed_at":"2026-08-12T23:16:36.259084Z","submitted_at":"2024-07-23T09:35:49Z","title":"Lowering Connectivity Requirements For Bivariate Bicycle Codes Using Morphing Circuits"},"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-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"thesis":"As of 13 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 6 inbound Pith citation observations for arXiv:2407.16336."}