{"as_of":"2026-08-19T14:27:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:5a81f543501be45514f1d4b8dc3cf49cc973718b6e3dffc0857ded741ff5ecd6","coverage":[{"denominator":16,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":16,"source":"paper_references, paper_reference_links","source_observed_at":"2026-06-27T08:14:26.396179Z","state":"measured"},{"denominator":16,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":16,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-19T06:32:44.657259+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2606.11987/citation-record","integrity":"/paper/2606.11987/integrity","json":"/paper/2606.11987/citation-record.json","paper":"/paper/2606.11987"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-27T08:14:26.396179Z","title":"Fault-tolerant quantum computation with constant overhead,","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2606.11987","last_updated":"2026-06-10T12:11:25Z","snapshot_observed_at":"2026-08-12T19:26:09.042600Z","submitted_at":"2026-06-10T12:11:25Z","title":"Graphical Analysis of Lifted Product Code Constructions","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-06-27T08:14:26.396179Z"},"links":{"citing_paper":"/paper/2606.11987"},"observation_digest":"sha256:96658f9b26cf7d10bd6ac97370f0c702b94513d2c539ce52fd9501c07b7f5568","observation_id":"541a42d5-a1d8-4aa7-9f78-04c3aa28476f","resolution":{"observed_at":"2026-06-27T08:14:26.396179Z","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-06-27T08:14:26.396179Z","title":"Asymptotically good quantum and locally testable classical LDPC codes,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2606.11987","last_updated":"2026-06-10T12:11:25Z","snapshot_observed_at":"2026-08-12T19:26:09.042600Z","submitted_at":"2026-06-10T12:11:25Z","title":"Graphical Analysis of Lifted Product Code Constructions","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-06-27T08:14:26.396179Z"},"links":{"citing_paper":"/paper/2606.11987"},"observation_digest":"sha256:858c9b183e88fb524e9de8a7bdd2510efa7f5b9f67d2f6d2b36dc8bb38dfbccf","observation_id":"be193105-71ef-48a3-ac04-4357585c0328","resolution":{"observed_at":"2026-06-27T08:14:26.396179Z","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-06-27T08:14:26.396179Z","title":"Quasi-cyclic LDPC codes based on pre-lifted protographs,","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2606.11987","last_updated":"2026-06-10T12:11:25Z","snapshot_observed_at":"2026-08-12T19:26:09.042600Z","submitted_at":"2026-06-10T12:11:25Z","title":"Graphical Analysis of Lifted Product Code Constructions","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-06-27T08:14:26.396179Z"},"links":{"citing_paper":"/paper/2606.11987"},"observation_digest":"sha256:69d9f173e9dd0436813c784cb1450ae34978d66aecee737bd04f3263adf3c909","observation_id":"98cd4a44-13b9-4662-892e-7c08df417da7","resolution":{"observed_at":"2026-06-27T08:14:26.396179Z","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-06-27T08:14:26.396179Z","title":"Structural analysis of generalized quasi-cyclic LDPC codes: Rank, design and generator matrices,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2606.11987","last_updated":"2026-06-10T12:11:25Z","snapshot_observed_at":"2026-08-12T19:26:09.042600Z","submitted_at":"2026-06-10T12:11:25Z","title":"Graphical Analysis of Lifted Product Code Constructions","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-06-27T08:14:26.396179Z"},"links":{"citing_paper":"/paper/2606.11987"},"observation_digest":"sha256:4851a8a49ed0eeea496922a4e3a7d06051c6b67d8653b8a296b07facd0109b2f","observation_id":"90ed6307-f943-49fd-b2dc-a7ef2c4c0b8f","resolution":{"observed_at":"2026-06-27T08:14:26.396179Z","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-06-27T08:14:26.396179Z","title":"Non-binary protograph-based LDPC codes: Enumerators, analysis, and designs,","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2606.11987","last_updated":"2026-06-10T12:11:25Z","snapshot_observed_at":"2026-08-12T19:26:09.042600Z","submitted_at":"2026-06-10T12:11:25Z","title":"Graphical Analysis of Lifted Product Code Constructions","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-06-27T08:14:26.396179Z"},"links":{"citing_paper":"/paper/2606.11987"},"observation_digest":"sha256:ebcc8a59c4724183dfc3b3a31e3679a21211ee720d60ef85ce7e05e2469595ac","observation_id":"f4146368-3ed0-4bc9-8f43-3ce793878908","resolution":{"observed_at":"2026-06-27T08:14:26.396179Z","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-06-27T08:14:26.396179Z","title":"A heuristic search for good low-density parity-check codes at short block lengths,","venue":null,"work_id":null,"year":2001},"citing_paper":{"arxiv_id":"2606.11987","last_updated":"2026-06-10T12:11:25Z","snapshot_observed_at":"2026-08-12T19:26:09.042600Z","submitted_at":"2026-06-10T12:11:25Z","title":"Graphical Analysis of Lifted Product Code Constructions","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-06-27T08:14:26.396179Z"},"links":{"citing_paper":"/paper/2606.11987"},"observation_digest":"sha256:971a8f2432aabe72f6ebb0e6867e439c4926ef7845867010ae2865d0a1a2f903","observation_id":"b5ba5ad5-baed-46f0-bed3-9c48816775fd","resolution":{"observed_at":"2026-06-27T08:14:26.396179Z","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-06-27T08:14:26.396179Z","title":"An algorithm for counting short cycles in bipartite graphs,","venue":null,"work_id":null,"year":2005},"citing_paper":{"arxiv_id":"2606.11987","last_updated":"2026-06-10T12:11:25Z","snapshot_observed_at":"2026-08-12T19:26:09.042600Z","submitted_at":"2026-06-10T12:11:25Z","title":"Graphical Analysis of Lifted Product Code Constructions","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-06-27T08:14:26.396179Z"},"links":{"citing_paper":"/paper/2606.11987"},"observation_digest":"sha256:b05ad79ba671244729d36953fe82e8c4f2a71db2c5d929c97843e74ecf3406d0","observation_id":"1034ea0e-6036-4471-be65-cefae42758f4","resolution":{"observed_at":"2026-06-27T08:14:26.396179Z","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-06-27T08:14:26.396179Z","title":"Efficient algorithm for finding dominant trapping sets of LDPC codes,","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2606.11987","last_updated":"2026-06-10T12:11:25Z","snapshot_observed_at":"2026-08-12T19:26:09.042600Z","submitted_at":"2026-06-10T12:11:25Z","title":"Graphical Analysis of Lifted Product Code Constructions","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-06-27T08:14:26.396179Z"},"links":{"citing_paper":"/paper/2606.11987"},"observation_digest":"sha256:8e46c6ce592d31154cc9ecac68392d3727467261c41e3cfaf3ff9f68d1f94261","observation_id":"2898c45b-9704-4696-8bae-58968267c71b","resolution":{"observed_at":"2026-06-27T08:14:26.396179Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2503.07567","last_updated":"2025-03-10T17:38:30Z","snapshot_observed_at":"2026-08-18T18:02:50.949124Z","submitted_at":"2025-03-10T17:38:30Z","title":"On the Minimum Distances of Finite-Length Lifted Product Quantum LDPC Codes","version":1},"cited_work":{"arxiv_id":"2503.07567","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2503.07567","snapshot_observed_at":"2026-07-03T13:18:13.015625Z","title":"& Vasi´ c, B","venue":null,"work_id":"19696c73-4d8f-44e3-b477-200045058995","year":2025},"citing_paper":{"arxiv_id":"2606.11987","last_updated":"2026-06-10T12:11:25Z","snapshot_observed_at":"2026-08-12T19:26:09.042600Z","submitted_at":"2026-06-10T12:11:25Z","title":"Graphical Analysis of Lifted Product Code Constructions","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-06-27T08:14:26.396179Z"},"links":{"cited_paper":"/paper/2503.07567","citing_paper":"/paper/2606.11987"},"observation_digest":"sha256:169b793659ade0de32648cf8ad882178c76260c6b5cc8984bd47042fb9faa878","observation_id":"fce90860-8d5f-4989-a923-08e5c5e86276","resolution":{"observed_at":"2026-07-03T13:18:13.017623Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-27T08:14:26.396179Z","title":"A recursive approach to low complexity codes,","venue":null,"work_id":null,"year":1981},"citing_paper":{"arxiv_id":"2606.11987","last_updated":"2026-06-10T12:11:25Z","snapshot_observed_at":"2026-08-12T19:26:09.042600Z","submitted_at":"2026-06-10T12:11:25Z","title":"Graphical Analysis of Lifted Product Code Constructions","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-06-27T08:14:26.396179Z"},"links":{"citing_paper":"/paper/2606.11987"},"observation_digest":"sha256:ef024f2c5f0098c12a43d7253e43b537de48b8491d61973e38eafcbbdf466017","observation_id":"84f48282-fa98-4ef9-a613-41701edea2f4","resolution":{"observed_at":"2026-06-27T08:14:26.396179Z","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-06-27T08:14:26.396179Z","title":"Analysis of absorbing sets for array-based LDPC codes,","venue":null,"work_id":null,"year":2007},"citing_paper":{"arxiv_id":"2606.11987","last_updated":"2026-06-10T12:11:25Z","snapshot_observed_at":"2026-08-12T19:26:09.042600Z","submitted_at":"2026-06-10T12:11:25Z","title":"Graphical Analysis of Lifted Product Code Constructions","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-06-27T08:14:26.396179Z"},"links":{"citing_paper":"/paper/2606.11987"},"observation_digest":"sha256:cb8ffd806be8cedcad0d67b064e819343b85acdace3a8c4ff64266d5074d1c7e","observation_id":"48e1e705-1972-407d-aafb-3969c47ca225","resolution":{"observed_at":"2026-06-27T08:14:26.396179Z","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-06-27T08:14:26.396179Z","title":"Absorbing sets in quantum LDPC codes,","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2606.11987","last_updated":"2026-06-10T12:11:25Z","snapshot_observed_at":"2026-08-12T19:26:09.042600Z","submitted_at":"2026-06-10T12:11:25Z","title":"Graphical Analysis of Lifted Product Code Constructions","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-06-27T08:14:26.396179Z"},"links":{"citing_paper":"/paper/2606.11987"},"observation_digest":"sha256:63078685fccb57ddc9cee95a6d3913bd3ddca4060af67df473cf80384686bfdf","observation_id":"c75dc3d4-58f5-49a0-8212-12bf69bf768d","resolution":{"observed_at":"2026-06-27T08:14:26.396179Z","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-06-27T08:14:26.396179Z","title":null,"venue":null,"work_id":null,"year":2001},"citing_paper":{"arxiv_id":"2606.11987","last_updated":"2026-06-10T12:11:25Z","snapshot_observed_at":"2026-08-12T19:26:09.042600Z","submitted_at":"2026-06-10T12:11:25Z","title":"Graphical Analysis of Lifted Product Code Constructions","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-06-27T08:14:26.396179Z"},"links":{"citing_paper":"/paper/2606.11987"},"observation_digest":"sha256:9178f8ef47287e27ddc79b051632417eff223f228e70964e79a194f6bd666a59","observation_id":"ce67ada5-c851-44e8-be8e-732d420ef63b","resolution":{"observed_at":"2026-06-27T08:14:26.396179Z","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":"10.1103/physreva.54.1098","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Good quantum error-correcting codes ex- ist","venue":"Physical Review A","work_id":"0f614b04-e1e3-463f-b0a7-724e857358b2","year":1996},"citing_paper":{"arxiv_id":"2606.11987","last_updated":"2026-06-10T12:11:25Z","snapshot_observed_at":"2026-08-12T19:26:09.042600Z","submitted_at":"2026-06-10T12:11:25Z","title":"Graphical Analysis of Lifted Product Code Constructions","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-06-27T08:14:26.396179Z"},"links":{"citing_paper":"/paper/2606.11987"},"observation_digest":"sha256:204816a7975b94705c48eda82830af4aa473132fd19428829831ba83df8cc6a2","observation_id":"3cfeae5c-b6a8-401c-b219-86b8befdec4c","resolution":{"observed_at":"2026-06-27T08:20:44.934117Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-07-13T12:20:33.178866+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-13T12:20:33.178866+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-27T08:14:26.396179Z","title":"Sparse-graph codes for quantum error correction,","venue":null,"work_id":null,"year":2004},"citing_paper":{"arxiv_id":"2606.11987","last_updated":"2026-06-10T12:11:25Z","snapshot_observed_at":"2026-08-12T19:26:09.042600Z","submitted_at":"2026-06-10T12:11:25Z","title":"Graphical Analysis of Lifted Product Code Constructions","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-06-27T08:14:26.396179Z"},"links":{"citing_paper":"/paper/2606.11987"},"observation_digest":"sha256:060dc9f17b924acfcae03928d7cba9d4bb3752ac5c8342308888e19521f09bc0","observation_id":"7eee69c8-309a-4353-a198-440eec3c30dd","resolution":{"observed_at":"2026-06-27T08:14:26.396179Z","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-06-27T08:14:26.396179Z","title":"The vec-permutation matrix, the vec operator and kronecker products: A review,","venue":null,"work_id":null,"year":1981},"citing_paper":{"arxiv_id":"2606.11987","last_updated":"2026-06-10T12:11:25Z","snapshot_observed_at":"2026-08-12T19:26:09.042600Z","submitted_at":"2026-06-10T12:11:25Z","title":"Graphical Analysis of Lifted Product Code Constructions","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-06-27T08:14:26.396179Z"},"links":{"citing_paper":"/paper/2606.11987"},"observation_digest":"sha256:556627a0c2ea5a4743b95f14ce1c6105df0e128f375bb52588984d147faf95de","observation_id":"12d3ac11-88c8-497a-97a6-60cebcdeb8df","resolution":{"observed_at":"2026-06-27T08:14:26.396179Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2606.11987","last_updated":"2026-06-10T12:11:25Z","latest_version":1,"primary_category":"cs.IT","snapshot_observed_at":"2026-08-12T19:26:09.042600Z","submitted_at":"2026-06-10T12:11:25Z","title":"Graphical Analysis of Lifted Product Code Constructions"},"reference_resolution":{"displayed":16,"state_counts":{"malformed_identifier":0,"metadata_mismatch":1,"parse_uncertain":0,"unresolved":14,"verified_exact":1,"verified_fuzzy":0},"total_outbound_references":16},"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-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"thesis":"As of 19 August 2026, this Paper Citation Record lists 16 of 16 outbound references and 0 inbound Pith citation observations for arXiv:2606.11987."}