{"as_of":"2026-08-19T19:29:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:4cc90503bbdf0400cf888ec51bd81096cc7121318d949355a572a527ab83b476","coverage":[{"denominator":89,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":89,"source":"paper_references, paper_reference_links","source_observed_at":"2026-06-28T09:33:11.546881Z","state":"measured"},{"denominator":90,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":90,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-19T06:32:44.657259+00:00","state":"measured"},{"denominator":1,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-07-31T02:25:48.776062Z","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":[{"citation":{"cited_paper":{"arxiv_id":"2606.03507","last_updated":"2026-06-02T11:25:18Z","snapshot_observed_at":"2026-08-06T10:56:13.310448Z","submitted_at":"2026-06-02T11:25:18Z","title":"Full Extractors for Logical Processing in Hypergraph Product Codes","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2606.03507","snapshot_observed_at":"2026-07-31T02:25:48.776062Z","title":null,"venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.28605","last_updated":"2026-07-30T17:55:34Z","snapshot_observed_at":"2026-08-16T16:19:13.639033Z","submitted_at":"2026-07-30T17:55:34Z","title":"Logical computation with canonical lifted product codes","version":1},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-07-31T02:25:48.776062Z"},"links":{"cited_paper":"/paper/2606.03507","citing_paper":"/paper/2607.28605"},"observation_digest":"sha256:69b4b213d17904459ad1c8bad45e56a4f194078b5e09a1868b2e02543b90fa6b","observation_id":"fc987169-aa66-4562-9b4e-32b16f09f9d4","resolution":{"observed_at":"2026-07-31T02:25:48.776062Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2606.03507/citation-record","integrity":"/paper/2606.03507/integrity","json":"/paper/2606.03507/citation-record.json","paper":"/paper/2606.03507"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T09:33:11.546881Z","title":null,"venue":null,"work_id":null,"year":1922},"citing_paper":{"arxiv_id":"2606.03507","last_updated":"2026-06-02T11:25:18Z","snapshot_observed_at":"2026-08-06T10:56:13.310448Z","submitted_at":"2026-06-02T11:25:18Z","title":"Full Extractors for Logical Processing in Hypergraph Product Codes","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-06-28T09:33:11.546881Z"},"links":{"citing_paper":"/paper/2606.03507"},"observation_digest":"sha256:d45bb93adaafc0259bee46ef1d75abac5fc0b1b15d9224b16ac57ae559dcc77f","observation_id":"2e94f56e-3cfa-4ba4-b1bf-ec55794d1033","resolution":{"observed_at":"2026-06-28T09:33:11.546881Z","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-28T09:33:11.546881Z","title":"high rate","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.03507","last_updated":"2026-06-02T11:25:18Z","snapshot_observed_at":"2026-08-06T10:56:13.310448Z","submitted_at":"2026-06-02T11:25:18Z","title":"Full Extractors for Logical Processing in Hypergraph Product Codes","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-06-28T09:33:11.546881Z"},"links":{"citing_paper":"/paper/2606.03507"},"observation_digest":"sha256:3b8617fdc5c98cddcb8d20fb98eb33ec549dad662fd1f6bdfbf2ae08f188ca59","observation_id":"20740772-a7ff-4dd2-ae11-c496d28ba302","resolution":{"observed_at":"2026-06-28T09:33:11.546881Z","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-28T09:33:11.546881Z","title":"In order to useAto measure P M, we use the following code-deformation protocol:","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.03507","last_updated":"2026-06-02T11:25:18Z","snapshot_observed_at":"2026-08-06T10:56:13.310448Z","submitted_at":"2026-06-02T11:25:18Z","title":"Full Extractors for Logical Processing in Hypergraph Product Codes","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-06-28T09:33:11.546881Z"},"links":{"citing_paper":"/paper/2606.03507"},"observation_digest":"sha256:0736c2ec5137131869c574aed461f6c456632f3ea7e67fd3d393e12dfffc058b","observation_id":"b6928400-54f1-49e7-8ec6-c9acd231e251","resolution":{"observed_at":"2026-06-28T09:33:11.546881Z","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-28T09:33:11.546881Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.03507","last_updated":"2026-06-02T11:25:18Z","snapshot_observed_at":"2026-08-06T10:56:13.310448Z","submitted_at":"2026-06-02T11:25:18Z","title":"Full Extractors for Logical Processing in Hypergraph Product Codes","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-06-28T09:33:11.546881Z"},"links":{"citing_paper":"/paper/2606.03507"},"observation_digest":"sha256:f15a4ca9594235bc22ed843bea038bcd767abfe7dac0c06f3a524cb46a14b430","observation_id":"ae2716f7-b200-4fa3-b00e-41f5d8616f3d","resolution":{"observed_at":"2026-06-28T09:33:11.546881Z","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-28T09:33:11.546881Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.03507","last_updated":"2026-06-02T11:25:18Z","snapshot_observed_at":"2026-08-06T10:56:13.310448Z","submitted_at":"2026-06-02T11:25:18Z","title":"Full Extractors for Logical Processing in Hypergraph Product Codes","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-06-28T09:33:11.546881Z"},"links":{"citing_paper":"/paper/2606.03507"},"observation_digest":"sha256:8bac29b32f4a51b4215274dcbe7540f5826ad23e49512466a0eb7d4e66a217f5","observation_id":"bb3d0410-ba1a-40fd-ba99-c125465b586f","resolution":{"observed_at":"2026-06-28T09:33:11.546881Z","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-28T09:33:11.546881Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.03507","last_updated":"2026-06-02T11:25:18Z","snapshot_observed_at":"2026-08-06T10:56:13.310448Z","submitted_at":"2026-06-02T11:25:18Z","title":"Full Extractors for Logical Processing in Hypergraph Product Codes","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-06-28T09:33:11.546881Z"},"links":{"citing_paper":"/paper/2606.03507"},"observation_digest":"sha256:401b13a35d0f022f5da9c9cf5ad25de2e653c3b56f04e311064a50229c0843a2","observation_id":"3d51c310-3a25-41d4-92dd-4ee3048bb750","resolution":{"observed_at":"2026-06-28T09:33:11.546881Z","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-28T09:33:11.546881Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.03507","last_updated":"2026-06-02T11:25:18Z","snapshot_observed_at":"2026-08-06T10:56:13.310448Z","submitted_at":"2026-06-02T11:25:18Z","title":"Full Extractors for Logical Processing in Hypergraph Product Codes","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-06-28T09:33:11.546881Z"},"links":{"citing_paper":"/paper/2606.03507"},"observation_digest":"sha256:6cd25a845cd5f105dc22b8ee046706e294e00b847efd3ac79b28585e40873e8a","observation_id":"9ed5b9f1-9d49-4d6d-9849-df26bae23a69","resolution":{"observed_at":"2026-06-28T09:33:11.546881Z","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-28T09:33:11.546881Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.03507","last_updated":"2026-06-02T11:25:18Z","snapshot_observed_at":"2026-08-06T10:56:13.310448Z","submitted_at":"2026-06-02T11:25:18Z","title":"Full Extractors for Logical Processing in Hypergraph Product Codes","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-06-28T09:33:11.546881Z"},"links":{"citing_paper":"/paper/2606.03507"},"observation_digest":"sha256:1ac027723e40d184d9b8e4a4126da4098a2c7f39c83794dbcfc6b2eaf12171f6","observation_id":"8ec38137-e4a9-4a46-9ef7-b8f1279a1be6","resolution":{"observed_at":"2026-06-28T09:33:11.546881Z","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-28T09:33:11.546881Z","title":"single-column","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.03507","last_updated":"2026-06-02T11:25:18Z","snapshot_observed_at":"2026-08-06T10:56:13.310448Z","submitted_at":"2026-06-02T11:25:18Z","title":"Full Extractors for Logical Processing in Hypergraph Product Codes","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-06-28T09:33:11.546881Z"},"links":{"citing_paper":"/paper/2606.03507"},"observation_digest":"sha256:61745a59eadeacbfacfd0eceed64a74cca397fe6bdf796496a4d91247d8dbe5b","observation_id":"61ae826f-b444-482b-b1ae-636b44b1a0ce","resolution":{"observed_at":"2026-06-28T09:33:11.546881Z","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-28T09:33:11.546881Z","title":"For the rest of the appendices, unless otherwise specified, we will only consider cyclic HGP codes (described in Section D 2)","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.03507","last_updated":"2026-06-02T11:25:18Z","snapshot_observed_at":"2026-08-06T10:56:13.310448Z","submitted_at":"2026-06-02T11:25:18Z","title":"Full Extractors for Logical Processing in Hypergraph Product Codes","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-06-28T09:33:11.546881Z"},"links":{"citing_paper":"/paper/2606.03507"},"observation_digest":"sha256:5d5820d596183d14d65679422fc9e74d2785ba2613fc7e2905de2da8ac9268ac","observation_id":"b1897e75-5ae6-4735-bc50-4adda15a66c2","resolution":{"observed_at":"2026-06-28T09:33:11.546881Z","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-28T09:33:11.546881Z","title":"In this section, we demonstrate how to connect these two extractors to perform non-CSS measurements, thus yielding a full extractor","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.03507","last_updated":"2026-06-02T11:25:18Z","snapshot_observed_at":"2026-08-06T10:56:13.310448Z","submitted_at":"2026-06-02T11:25:18Z","title":"Full Extractors for Logical Processing in Hypergraph Product Codes","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-06-28T09:33:11.546881Z"},"links":{"citing_paper":"/paper/2606.03507"},"observation_digest":"sha256:7820c1df2d6368d34c2cd5aa2dc76eb58cc0d39fed0670c1f3d2f281a24fadb0","observation_id":"bbd6584f-1d84-4e98-b2a4-13d0623b7dfe","resolution":{"observed_at":"2026-06-28T09:33:11.546881Z","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-28T09:33:11.546881Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.03507","last_updated":"2026-06-02T11:25:18Z","snapshot_observed_at":"2026-08-06T10:56:13.310448Z","submitted_at":"2026-06-02T11:25:18Z","title":"Full Extractors for Logical Processing in Hypergraph Product Codes","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-06-28T09:33:11.546881Z"},"links":{"citing_paper":"/paper/2606.03507"},"observation_digest":"sha256:13f30ecf26520c4da8e349bb1eaa903fc3405a0b3d56e50d47fca226d495111a","observation_id":"4b359d26-406e-4e31-b129-56a29ba84909","resolution":{"observed_at":"2026-06-28T09:33:11.546881Z","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-28T09:33:11.546881Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.03507","last_updated":"2026-06-02T11:25:18Z","snapshot_observed_at":"2026-08-06T10:56:13.310448Z","submitted_at":"2026-06-02T11:25:18Z","title":"Full Extractors for Logical Processing in Hypergraph Product Codes","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-06-28T09:33:11.546881Z"},"links":{"citing_paper":"/paper/2606.03507"},"observation_digest":"sha256:580a69f3403ef883a34463352e0598b35959dc62ec5347fe874b512d58b7efea","observation_id":"3c92a1ce-8438-451e-928f-ac7396d72fdf","resolution":{"observed_at":"2026-06-28T09:33:11.546881Z","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-28T09:33:11.546881Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.03507","last_updated":"2026-06-02T11:25:18Z","snapshot_observed_at":"2026-08-06T10:56:13.310448Z","submitted_at":"2026-06-02T11:25:18Z","title":"Full Extractors for Logical Processing in Hypergraph Product Codes","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-06-28T09:33:11.546881Z"},"links":{"citing_paper":"/paper/2606.03507"},"observation_digest":"sha256:2c8acdb6363284684f26ed02f994dda7394aecb479c612c5c9b6848d1cf6f2c3","observation_id":"ce84fb96-cce1-4ff3-9316-5c8302dc8c83","resolution":{"observed_at":"2026-06-28T09:33:11.546881Z","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-28T09:33:11.546881Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.03507","last_updated":"2026-06-02T11:25:18Z","snapshot_observed_at":"2026-08-06T10:56:13.310448Z","submitted_at":"2026-06-02T11:25:18Z","title":"Full Extractors for Logical Processing in Hypergraph Product Codes","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-06-28T09:33:11.546881Z"},"links":{"citing_paper":"/paper/2606.03507"},"observation_digest":"sha256:f1afeba6de7e9a79fbfeb1ac17848fa63feb83799aeddef28737a76c29163e8e","observation_id":"e7309444-6868-4e76-b69a-2eb4c2245a9f","resolution":{"observed_at":"2026-06-28T09:33:11.546881Z","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-28T09:33:11.546881Z","title":"Chunked Circuit Construction","venue":null,"work_id":null,"year":1922},"citing_paper":{"arxiv_id":"2606.03507","last_updated":"2026-06-02T11:25:18Z","snapshot_observed_at":"2026-08-06T10:56:13.310448Z","submitted_at":"2026-06-02T11:25:18Z","title":"Full Extractors for Logical Processing in Hypergraph Product Codes","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-06-28T09:33:11.546881Z"},"links":{"citing_paper":"/paper/2606.03507"},"observation_digest":"sha256:8d5b50f98a1a86f2cbfe0e0ad5ba4ffb7669b7d676decb41cbf3f3c411de5b77","observation_id":"1f5b4f8c-a9a9-4af1-ae7f-497b72e41c7b","resolution":{"observed_at":"2026-06-28T09:33:11.546881Z","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":"2503.10390","doi":"10.48550/arxiv.2503.10390","metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"arXiv preprint arXiv:2503.10390 , year=","venue":"ArXiv.org","work_id":"35f06c74-0202-4ee4-a24f-fb0a4fdd67f0","year":2025},"citing_paper":{"arxiv_id":"2606.03507","last_updated":"2026-06-02T11:25:18Z","snapshot_observed_at":"2026-08-06T10:56:13.310448Z","submitted_at":"2026-06-02T11:25:18Z","title":"Full Extractors for Logical Processing in Hypergraph Product Codes","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-06-28T09:33:11.546881Z"},"links":{"citing_paper":"/paper/2606.03507"},"observation_digest":"sha256:50a34d3c8e5ff09b2a74a86ed050f407cd86207faee0d9f42012fe3f5dfa1d16","observation_id":"d191627b-602a-4fec-b041-b74d885c4502","resolution":{"observed_at":"2026-07-02T03:56:34.950620Z","resolver_source":"arxiv_id","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-05-22T18:53:51.600468+00:00","source":"crossref_status_cache"},{"observed_at":"2026-05-22T18:53:51.600468+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-28T09:33:11.546881Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2606.03507","last_updated":"2026-06-02T11:25:18Z","snapshot_observed_at":"2026-08-06T10:56:13.310448Z","submitted_at":"2026-06-02T11:25:18Z","title":"Full Extractors for Logical Processing in Hypergraph Product Codes","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-06-28T09:33:11.546881Z"},"links":{"citing_paper":"/paper/2606.03507"},"observation_digest":"sha256:b6fc704c541d9260dcf65b03fcc40133aeab069976fb22ad739544f9d8791588","observation_id":"3f875783-ddeb-49eb-885e-7ac9a635d14a","resolution":{"observed_at":"2026-06-28T09:33:11.546881Z","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.1126/sciadv.abn1717","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Science Advances 8(20) (2022) https://doi.org/ 10.1126/sciadv.abn1717","venue":"Science Advances","work_id":"7c1e5231-f67b-43c2-b76b-f1774a1430c1","year":2022},"citing_paper":{"arxiv_id":"2606.03507","last_updated":"2026-06-02T11:25:18Z","snapshot_observed_at":"2026-08-06T10:56:13.310448Z","submitted_at":"2026-06-02T11:25:18Z","title":"Full Extractors for Logical Processing in Hypergraph Product Codes","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-06-28T09:33:11.546881Z"},"links":{"citing_paper":"/paper/2606.03507"},"observation_digest":"sha256:2515af10267e40956d08ba66e9b3fcf1ece444e93ca450bb1a6ff05c92e44235","observation_id":"948d2e91-40c6-4f63-a69e-e1c673ea60e3","resolution":{"observed_at":"2026-06-28T09:41:51.274703Z","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-08-08T07:08:18.643368+00:00","source":"crossref_status_cache"},{"observed_at":"2026-08-08T07:08:18.643368+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":"2407.18393","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-02T09:06:48.985263Z","title":"Cross, Z","venue":null,"work_id":"586e42e2-89ab-4f30-9951-9789627fffc0","year":2024},"citing_paper":{"arxiv_id":"2606.03507","last_updated":"2026-06-02T11:25:18Z","snapshot_observed_at":"2026-08-06T10:56:13.310448Z","submitted_at":"2026-06-02T11:25:18Z","title":"Full Extractors for Logical Processing in Hypergraph Product Codes","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-06-28T09:33:11.546881Z"},"links":{"citing_paper":"/paper/2606.03507"},"observation_digest":"sha256:4454ce49ca9ff46af0abfb95b921274b8da9364a1f8a15872597e490d1287e5b","observation_id":"059e6061-3835-4553-ba75-e4700ef91ab6","resolution":{"observed_at":"2026-07-02T03:56:34.953178Z","resolver_source":"arxiv_id","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-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-28T09:33:11.546881Z","title":null,"venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2606.03507","last_updated":"2026-06-02T11:25:18Z","snapshot_observed_at":"2026-08-06T10:56:13.310448Z","submitted_at":"2026-06-02T11:25:18Z","title":"Full Extractors for Logical Processing in Hypergraph Product Codes","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-06-28T09:33:11.546881Z"},"links":{"citing_paper":"/paper/2606.03507"},"observation_digest":"sha256:55b6c1136be18858b7c16a9ab08d9904351312f1faae5c04280577d0e800c05e","observation_id":"1a0ff371-228e-4e51-b78b-641ebad0c7a0","resolution":{"observed_at":"2026-06-28T09:33:11.546881Z","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/physrevx.15.021088","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":null,"venue":"Physical Review X","work_id":"f16305ac-f060-488f-ab43-97056169d8fc","year":2025},"citing_paper":{"arxiv_id":"2606.03507","last_updated":"2026-06-02T11:25:18Z","snapshot_observed_at":"2026-08-06T10:56:13.310448Z","submitted_at":"2026-06-02T11:25:18Z","title":"Full Extractors for Logical Processing in Hypergraph Product Codes","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-06-28T09:33:11.546881Z"},"links":{"citing_paper":"/paper/2606.03507"},"observation_digest":"sha256:f748366be5ecbe49a24d3bedf8b1cddaeaa87b9044ac4141cfdd583ba2f858bb","observation_id":"44f120e5-fbe6-43bb-95ee-da01cfec4eaa","resolution":{"observed_at":"2026-06-28T09:41:51.269642Z","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-08-08T07:38:11.48102+00:00","source":"crossref_status_cache"},{"observed_at":"2026-08-08T07:38:11.48102+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":"10.1103/1g44-jp62","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Swaroop, T","venue":"PRX Quantum","work_id":"10be18e9-3026-41c4-a437-36a1be311b26","year":2026},"citing_paper":{"arxiv_id":"2606.03507","last_updated":"2026-06-02T11:25:18Z","snapshot_observed_at":"2026-08-06T10:56:13.310448Z","submitted_at":"2026-06-02T11:25:18Z","title":"Full Extractors for Logical Processing in Hypergraph Product Codes","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-06-28T09:33:11.546881Z"},"links":{"citing_paper":"/paper/2606.03507"},"observation_digest":"sha256:03c361776454edb4b535aebffc58e6bf4a8a9dcd05c83bcfe614d6c94c857117","observation_id":"11b78953-1d62-48c5-b303-7abf63240c8d","resolution":{"observed_at":"2026-06-28T09:41:51.271215Z","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-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1103/physrevx.6.021043","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Bravyi, G","venue":"Physical Review X","work_id":"ca050c2c-1d23-42e0-9b9b-ae54ce9757f5","year":2016},"citing_paper":{"arxiv_id":"2606.03507","last_updated":"2026-06-02T11:25:18Z","snapshot_observed_at":"2026-08-06T10:56:13.310448Z","submitted_at":"2026-06-02T11:25:18Z","title":"Full Extractors for Logical Processing in Hypergraph Product Codes","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-06-28T09:33:11.546881Z"},"links":{"citing_paper":"/paper/2606.03507"},"observation_digest":"sha256:9bc9e1e238a1a70817413187261448d796f90360d9a28b0793257e2ed596c3c5","observation_id":"dd01ce08-d07b-42da-af02-76d9b3b96963","resolution":{"observed_at":"2026-06-28T09:41:51.266485Z","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-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-28T09:33:11.546881Z","title":"Litinski, A Game of Surface Codes: Large-Scale Quantum Computing with Lattice Surgery, Quantum3, 128 (2019)","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2606.03507","last_updated":"2026-06-02T11:25:18Z","snapshot_observed_at":"2026-08-06T10:56:13.310448Z","submitted_at":"2026-06-02T11:25:18Z","title":"Full Extractors for Logical Processing in Hypergraph Product Codes","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-06-28T09:33:11.546881Z"},"links":{"citing_paper":"/paper/2606.03507"},"observation_digest":"sha256:e6373038e4681b793f17d3b6cf0c6ee854c4858255973f4691faf6d47d67798d","observation_id":"a614c807-e5c0-4b9a-bbfa-1716d7587042","resolution":{"observed_at":"2026-06-28T09:33:11.546881Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2506.03094","last_updated":"2025-06-03T17:25:13Z","snapshot_observed_at":"2026-08-17T11:25:15.302865Z","submitted_at":"2025-06-03T17:25:13Z","title":"Tour de gross: A modular quantum computer based on bivariate bicycle codes","version":1},"cited_work":{"arxiv_id":"2506.03094","doi":"10.48550/arxiv.2506.03094","metadata_source":"pith","pith_arxiv_id":"2506.03094","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Tour de gross: A modular quantum computer based on bivariate bicycle codes","venue":"quant-ph","work_id":"8dc68421-a34c-4895-bb8a-2378446b9e03","year":2025},"citing_paper":{"arxiv_id":"2606.03507","last_updated":"2026-06-02T11:25:18Z","snapshot_observed_at":"2026-08-06T10:56:13.310448Z","submitted_at":"2026-06-02T11:25:18Z","title":"Full Extractors for Logical Processing in Hypergraph Product Codes","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-06-28T09:33:11.546881Z"},"links":{"cited_paper":"/paper/2506.03094","citing_paper":"/paper/2606.03507"},"observation_digest":"sha256:11ef8c2152adcdee4604e4b924cce371d092339b4ef7b1c44ee620490a56ebf4","observation_id":"83316857-38a6-4101-b976-8e37ea8dd9a2","resolution":{"observed_at":"2026-07-02T03:56:34.945428Z","resolver_source":"local_arxiv","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-05-22T18:53:55.730701+00:00","source":"crossref_status_cache"},{"observed_at":"2026-05-22T18:53:55.730701+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2605.21898","last_updated":"2026-06-23T16:13:20Z","snapshot_observed_at":"2026-08-16T14:06:34.834106Z","submitted_at":"2026-05-21T02:12:36Z","title":"Concatenating Algebraic Codes over High-Rate Quantum LDPC Codes","version":2},"cited_work":{"arxiv_id":"2605.21898","doi":null,"metadata_source":"pith","pith_arxiv_id":"2605.21898","snapshot_observed_at":"2026-07-04T01:09:19.032216Z","title":"Concatenating Algebraic Codes over High-Rate Quantum LDPC Codes","venue":"quant-ph","work_id":"c2453b2a-cfa9-4653-8470-cdbcf4950645","year":2026},"citing_paper":{"arxiv_id":"2606.03507","last_updated":"2026-06-02T11:25:18Z","snapshot_observed_at":"2026-08-06T10:56:13.310448Z","submitted_at":"2026-06-02T11:25:18Z","title":"Full Extractors for Logical Processing in Hypergraph Product Codes","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-06-28T09:33:11.546881Z"},"links":{"cited_paper":"/paper/2605.21898","citing_paper":"/paper/2606.03507"},"observation_digest":"sha256:cdcc2507c153a68b062167b71c44a173a714fad027d0f1e085c39234c1ac4c19","observation_id":"c6d0e141-a989-4f00-8b35-db0def27bcb5","resolution":{"observed_at":"2026-07-02T03:56:34.913312Z","resolver_source":"local_arxiv","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-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2602.11457","last_updated":"2026-05-05T14:58:57Z","snapshot_observed_at":"2026-08-12T02:03:48.174751Z","submitted_at":"2026-02-12T00:30:48Z","title":"The Pinnacle Architecture: Reducing the cost of breaking RSA-2048 to 100 000 physical qubits using quantum LDPC codes","version":2},"cited_work":{"arxiv_id":"2602.11457","doi":"10.48550/arxiv.2602.11457","metadata_source":"pith","pith_arxiv_id":"2602.11457","snapshot_observed_at":"2026-08-05T02:49:54.815029Z","title":"The Pinnacle Architecture: Reducing the cost of breaking RSA-2048 to 100 000 physical qubits using quantum LDPC codes","venue":"quant-ph","work_id":"778901d5-6258-466c-ae65-bceb8b26f978","year":2026},"citing_paper":{"arxiv_id":"2606.03507","last_updated":"2026-06-02T11:25:18Z","snapshot_observed_at":"2026-08-06T10:56:13.310448Z","submitted_at":"2026-06-02T11:25:18Z","title":"Full Extractors for Logical Processing in Hypergraph Product Codes","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-06-28T09:33:11.546881Z"},"links":{"cited_paper":"/paper/2602.11457","citing_paper":"/paper/2606.03507"},"observation_digest":"sha256:2cbf965b311e7f9ae081bdb8711e32e1b2b2b92c53128fb7232c7b409eedeedc","observation_id":"f0c6cc41-0d1e-4a4b-a474-dc7562ea2757","resolution":{"observed_at":"2026-07-02T03:56:34.918785Z","resolver_source":"local_arxiv","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-11T23:49:47.572808+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-11T23:49:47.572808+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2603.28627","last_updated":"2026-03-30T16:10:08Z","snapshot_observed_at":"2026-08-09T07:47:35.087503Z","submitted_at":"2026-03-30T16:10:08Z","title":"Shor's algorithm is possible with as few as 10,000 reconfigurable atomic qubits","version":1},"cited_work":{"arxiv_id":"2603.28627","doi":"10.48550/arxiv.2603.28627","metadata_source":"pith","pith_arxiv_id":"2603.28627","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Shor's algorithm is possible with as few as 10,000 reconfigurable atomic qubits","venue":"quant-ph","work_id":"5585b76d-eed0-4cf1-97f4-7cecae56f3e3","year":2026},"citing_paper":{"arxiv_id":"2606.03507","last_updated":"2026-06-02T11:25:18Z","snapshot_observed_at":"2026-08-06T10:56:13.310448Z","submitted_at":"2026-06-02T11:25:18Z","title":"Full Extractors for Logical Processing in Hypergraph Product Codes","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-06-28T09:33:11.546881Z"},"links":{"cited_paper":"/paper/2603.28627","citing_paper":"/paper/2606.03507"},"observation_digest":"sha256:7f45008589aa074323d65b1ca54b7a5032a190eb6c27146efe67cb9cd1a279a4","observation_id":"52db94be-30e6-4400-af10-6e79f2ac5894","resolution":{"observed_at":"2026-07-02T03:56:34.940325Z","resolver_source":"local_arxiv","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-11T23:49:42.40436+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-11T23:49:42.40436+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":"2603.05082","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-02T09:06:49.037582Z","title":"arXiv preprint arXiv:2603.05082 , year=","venue":null,"work_id":"c0adb502-846d-404a-9fa4-1ffac9c56207","year":2026},"citing_paper":{"arxiv_id":"2606.03507","last_updated":"2026-06-02T11:25:18Z","snapshot_observed_at":"2026-08-06T10:56:13.310448Z","submitted_at":"2026-06-02T11:25:18Z","title":"Full Extractors for Logical Processing in Hypergraph Product Codes","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-06-28T09:33:11.546881Z"},"links":{"citing_paper":"/paper/2606.03507"},"observation_digest":"sha256:b231998f6c378c1610b1f52d365ef01fccec5e4be0730c92bbab1003ca5519e5","observation_id":"60f9fd82-87f2-466a-94a1-a9fb5aef85e5","resolution":{"observed_at":"2026-07-02T03:56:34.944953Z","resolver_source":"arxiv_id","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-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2605.21746","last_updated":"2026-05-20T21:17:42Z","snapshot_observed_at":"2026-08-16T21:31:02.407715Z","submitted_at":"2026-05-20T21:17:42Z","title":"GeneCS: Synthesizing Resource-Efficient Code Surgery for Arbitrary Quantum Stabilizer Codes","version":1},"cited_work":{"arxiv_id":"2605.21746","doi":null,"metadata_source":"pith","pith_arxiv_id":"2605.21746","snapshot_observed_at":"2026-07-02T03:56:34.933373Z","title":"GeneCS: Synthesizing Resource-Efficient Code Surgery for Arbitrary Quantum Stabilizer Codes","venue":"quant-ph","work_id":"a7663358-3bc7-4c84-80c0-2fe33fcd6ae0","year":2026},"citing_paper":{"arxiv_id":"2606.03507","last_updated":"2026-06-02T11:25:18Z","snapshot_observed_at":"2026-08-06T10:56:13.310448Z","submitted_at":"2026-06-02T11:25:18Z","title":"Full Extractors for Logical Processing in Hypergraph Product Codes","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-06-28T09:33:11.546881Z"},"links":{"cited_paper":"/paper/2605.21746","citing_paper":"/paper/2606.03507"},"observation_digest":"sha256:b9f8b10bd7586baa7aedf29fdf0a6e402d6fc3f8ecf6087c46e547755024cd3f","observation_id":"a4ca58a8-6226-4d24-a926-c896333d8e49","resolution":{"observed_at":"2026-07-02T03:56:34.934603Z","resolver_source":"local_arxiv","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-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2604.16209","last_updated":"2026-06-26T21:06:12Z","snapshot_observed_at":"2026-08-10T23:23:13.640440Z","submitted_at":"2026-04-17T16:19:55Z","title":"Towards Ultra-High-Rate Quantum Error Correction with Reconfigurable Atom Arrays","version":2},"cited_work":{"arxiv_id":"2604.16209","doi":null,"metadata_source":"pith","pith_arxiv_id":"2604.16209","snapshot_observed_at":"2026-07-04T17:20:00.383817Z","title":"Towards Ultra-High-Rate Quantum Error Correction with Reconfigurable Atom Arrays","venue":"quant-ph","work_id":"b8c5ca7a-c4e4-4d08-84f4-7ac89f14e7e0","year":2026},"citing_paper":{"arxiv_id":"2606.03507","last_updated":"2026-06-02T11:25:18Z","snapshot_observed_at":"2026-08-06T10:56:13.310448Z","submitted_at":"2026-06-02T11:25:18Z","title":"Full Extractors for Logical Processing in Hypergraph Product Codes","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-06-28T09:33:11.546881Z"},"links":{"cited_paper":"/paper/2604.16209","citing_paper":"/paper/2606.03507"},"observation_digest":"sha256:95f2db3e4c61d57071ced32869dd7c8ef52c1485ef01f06c8d61d0ce2fa85763","observation_id":"b28095f8-3beb-40b7-9427-3e69a1fd18db","resolution":{"observed_at":"2026-07-02T03:56:34.935073Z","resolver_source":"local_arxiv","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-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-28T09:33:11.546881Z","title":"fast block","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.03507","last_updated":"2026-06-02T11:25:18Z","snapshot_observed_at":"2026-08-06T10:56:13.310448Z","submitted_at":"2026-06-02T11:25:18Z","title":"Full Extractors for Logical Processing in Hypergraph Product Codes","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-06-28T09:33:11.546881Z"},"links":{"citing_paper":"/paper/2606.03507"},"observation_digest":"sha256:e71df506aad32238482987179d32ea48526fec21ece80126fd6476faf3066806","observation_id":"eac3c01c-80a3-4a5d-a302-a851dc887453","resolution":{"observed_at":"2026-06-28T09:33:11.546881Z","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-28T09:33:11.546881Z","title":"Tillich and G","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2606.03507","last_updated":"2026-06-02T11:25:18Z","snapshot_observed_at":"2026-08-06T10:56:13.310448Z","submitted_at":"2026-06-02T11:25:18Z","title":"Full Extractors for Logical Processing in Hypergraph Product Codes","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-06-28T09:33:11.546881Z"},"links":{"citing_paper":"/paper/2606.03507"},"observation_digest":"sha256:9bb4e5fa1bc00d78132526739c9cc585b15a630effea4db28f87a50c2cf7480d","observation_id":"a275983e-4d73-481c-9bea-a88f48469faf","resolution":{"observed_at":"2026-06-28T09:33:11.546881Z","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-28T09:33:11.546881Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2606.03507","last_updated":"2026-06-02T11:25:18Z","snapshot_observed_at":"2026-08-06T10:56:13.310448Z","submitted_at":"2026-06-02T11:25:18Z","title":"Full Extractors for Logical Processing in Hypergraph Product Codes","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-06-28T09:33:11.546881Z"},"links":{"citing_paper":"/paper/2606.03507"},"observation_digest":"sha256:d96a3c7021e2dd29a535390b2ff4fb35002cd198995c2b77e817dc797edb682b","observation_id":"56266506-53ef-4772-a8bb-82ae89f8892b","resolution":{"observed_at":"2026-06-28T09:33:11.546881Z","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":"2511.09683","doi":"10.48550/arxiv.2511.09683","metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Aydin, N","venue":"ArXiv.org","work_id":"7701f644-487d-4d22-a9c1-d30d8b8b7a94","year":2025},"citing_paper":{"arxiv_id":"2606.03507","last_updated":"2026-06-02T11:25:18Z","snapshot_observed_at":"2026-08-06T10:56:13.310448Z","submitted_at":"2026-06-02T11:25:18Z","title":"Full Extractors for Logical Processing in Hypergraph Product Codes","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-06-28T09:33:11.546881Z"},"links":{"citing_paper":"/paper/2606.03507"},"observation_digest":"sha256:33b56b612e22a3fe3ee4782dc9928a2593690cf952fa07cdfdd9c010b7800fed","observation_id":"c3b5edd1-ce04-48b2-862a-f636342f4c3f","resolution":{"observed_at":"2026-07-02T03:56:34.942516Z","resolver_source":"arxiv_id","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-05-22T18:53:46.078342+00:00","source":"crossref_status_cache"},{"observed_at":"2026-05-22T18:53:46.078342+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-28T09:33:11.546881Z","title":"Kapshikar and S","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2606.03507","last_updated":"2026-06-02T11:25:18Z","snapshot_observed_at":"2026-08-06T10:56:13.310448Z","submitted_at":"2026-06-02T11:25:18Z","title":"Full Extractors for Logical Processing in Hypergraph Product Codes","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-06-28T09:33:11.546881Z"},"links":{"citing_paper":"/paper/2606.03507"},"observation_digest":"sha256:7b5197a63e63efddbd815041c60fd78f31b0bfd31291dbf1328aa554e2a21998","observation_id":"e72df278-8383-4cb9-a5cd-0a8546b65e4e","resolution":{"observed_at":"2026-06-28T09:33:11.546881Z","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-28T09:33:11.546881Z","title":"Perron and V","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.03507","last_updated":"2026-06-02T11:25:18Z","snapshot_observed_at":"2026-08-06T10:56:13.310448Z","submitted_at":"2026-06-02T11:25:18Z","title":"Full Extractors for Logical Processing in Hypergraph Product Codes","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-06-28T09:33:11.546881Z"},"links":{"citing_paper":"/paper/2606.03507"},"observation_digest":"sha256:7fe30f2c32e06427250477ef0c9950a45298e474ba7be5a292b1f2c269a41eec","observation_id":"e20aa7ea-b4b1-4971-a2a1-a75af9ab0894","resolution":{"observed_at":"2026-06-28T09:33:11.546881Z","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-28T09:33:11.546881Z","title":"Perron and F","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.03507","last_updated":"2026-06-02T11:25:18Z","snapshot_observed_at":"2026-08-06T10:56:13.310448Z","submitted_at":"2026-06-02T11:25:18Z","title":"Full Extractors for Logical Processing in Hypergraph Product Codes","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-06-28T09:33:11.546881Z"},"links":{"citing_paper":"/paper/2606.03507"},"observation_digest":"sha256:2a0f8335f7f0a63278492986d8862297f8c5cd1a015becb412f753f7b2b9dda4","observation_id":"1b3eef12-1a07-479a-9d5d-6e5dd03d7625","resolution":{"observed_at":"2026-06-28T09:33:11.546881Z","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-28T09:33:11.546881Z","title":null,"venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2606.03507","last_updated":"2026-06-02T11:25:18Z","snapshot_observed_at":"2026-08-06T10:56:13.310448Z","submitted_at":"2026-06-02T11:25:18Z","title":"Full Extractors for Logical Processing in Hypergraph Product Codes","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-06-28T09:33:11.546881Z"},"links":{"citing_paper":"/paper/2606.03507"},"observation_digest":"sha256:99c60bb94a3debe5beeeba2bc44919c4ee2463993dd9c7c5a0f950cd46f97172","observation_id":"503f9fed-fb45-47a2-be0f-6dd2b2ad8922","resolution":{"observed_at":"2026-06-28T09:33:11.546881Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2506.01779","last_updated":"2025-08-22T12:35:33Z","snapshot_observed_at":"2026-08-14T09:32:22.319151Z","submitted_at":"2025-06-02T15:23:00Z","title":"Improved belief propagation is sufficient for real-time decoding of quantum memory","version":2},"cited_work":{"arxiv_id":"2506.01779","doi":"10.48550/arxiv.2506.01779","metadata_source":"pith","pith_arxiv_id":"2506.01779","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"arXiv preprint arXiv:2506.01779 , year=","venue":"quant-ph","work_id":"cc73d9c9-8462-4167-8216-73a07df5bd56","year":2025},"citing_paper":{"arxiv_id":"2606.03507","last_updated":"2026-06-02T11:25:18Z","snapshot_observed_at":"2026-08-06T10:56:13.310448Z","submitted_at":"2026-06-02T11:25:18Z","title":"Full Extractors for Logical Processing in Hypergraph Product Codes","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-06-28T09:33:11.546881Z"},"links":{"cited_paper":"/paper/2506.01779","citing_paper":"/paper/2606.03507"},"observation_digest":"sha256:7d4071c2e09e8f9a957cbe06119539e18f9e0c7a60a4c1319aa53f96291fd914","observation_id":"ce8321b1-59a7-48a9-a5de-7660327b4bd0","resolution":{"observed_at":"2026-07-02T03:56:34.922611Z","resolver_source":"arxiv_id","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-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1108.5738","last_updated":"2011-08-29T20:00:37Z","snapshot_observed_at":"2026-08-15T04:37:03.405420Z","submitted_at":"2011-08-29T20:00:37Z","title":"Fault-tolerant quantum computing with color codes","version":1},"cited_work":{"arxiv_id":"1108.5738","doi":"10.48550/arxiv.1108.5738","metadata_source":"pith","pith_arxiv_id":"1108.5738","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Fault-tolerant quantum computing with color codes","venue":"quant-ph","work_id":"4b43eb98-1720-4905-be14-d7e13e083ca6","year":2011},"citing_paper":{"arxiv_id":"2606.03507","last_updated":"2026-06-02T11:25:18Z","snapshot_observed_at":"2026-08-06T10:56:13.310448Z","submitted_at":"2026-06-02T11:25:18Z","title":"Full Extractors for Logical Processing in Hypergraph Product Codes","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-06-28T09:33:11.546881Z"},"links":{"cited_paper":"/paper/1108.5738","citing_paper":"/paper/2606.03507"},"observation_digest":"sha256:2f18c73761676253d263a6c267d2a54d9dd54544052fee7eb9ab8b1175d54931","observation_id":"7953ddf8-afed-4745-a554-764ae1e927dd","resolution":{"observed_at":"2026-07-02T03:56:34.932543Z","resolver_source":"local_arxiv","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-05-22T18:53:52.600095+00:00","source":"crossref_status_cache"},{"observed_at":"2026-05-22T18:53:52.600095+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-28T09:33:11.546881Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2606.03507","last_updated":"2026-06-02T11:25:18Z","snapshot_observed_at":"2026-08-06T10:56:13.310448Z","submitted_at":"2026-06-02T11:25:18Z","title":"Full Extractors for Logical Processing in Hypergraph Product Codes","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-06-28T09:33:11.546881Z"},"links":{"citing_paper":"/paper/2606.03507"},"observation_digest":"sha256:fac69d2ea61a3303c78f98bd32b8aa1f307d244fb8153065d4cdc6b1ce31c6f7","observation_id":"c7ac5c34-b7a5-408e-9f23-c0e2ad095de2","resolution":{"observed_at":"2026-06-28T09:33:11.546881Z","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-28T09:33:11.546881Z","title":"Gidney, Stim: a fast stabilizer circuit simulator, Quantum5, 497 (2021)","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2606.03507","last_updated":"2026-06-02T11:25:18Z","snapshot_observed_at":"2026-08-06T10:56:13.310448Z","submitted_at":"2026-06-02T11:25:18Z","title":"Full Extractors for Logical Processing in Hypergraph Product Codes","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-06-28T09:33:11.546881Z"},"links":{"citing_paper":"/paper/2606.03507"},"observation_digest":"sha256:9e0660b0c510b3ad8a45588ebeefddb154a46ffa9e9338119232f129a41a47bf","observation_id":"56c737ec-ce43-48fd-8a94-35c001c0d3fd","resolution":{"observed_at":"2026-06-28T09:33:11.546881Z","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-28T09:33:11.546881Z","title":"Preskill, Beyond NISQ: The Megaquop Machine, ACM Transactions on Quantum Computing6, 1–7 (2025)","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2606.03507","last_updated":"2026-06-02T11:25:18Z","snapshot_observed_at":"2026-08-06T10:56:13.310448Z","submitted_at":"2026-06-02T11:25:18Z","title":"Full Extractors for Logical Processing in Hypergraph Product Codes","version":1},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-06-28T09:33:11.546881Z"},"links":{"citing_paper":"/paper/2606.03507"},"observation_digest":"sha256:70190dc66303fa711f679d9728aa4eeb33cc774b12245baa74d3ea81751aa1f5","observation_id":"74827bd8-04b7-4881-820d-42379ac4e614","resolution":{"observed_at":"2026-06-28T09:33:11.546881Z","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-28T09:33:11.546881Z","title":"Rosenberg, D","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2606.03507","last_updated":"2026-06-02T11:25:18Z","snapshot_observed_at":"2026-08-06T10:56:13.310448Z","submitted_at":"2026-06-02T11:25:18Z","title":"Full Extractors for Logical Processing in Hypergraph Product Codes","version":1},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-06-28T09:33:11.546881Z"},"links":{"citing_paper":"/paper/2606.03507"},"observation_digest":"sha256:ab09d4cb110e36c0531469995bb4aad025490fcfe4006371975afa99b0b5e40b","observation_id":"32ef917d-d418-4422-8e7e-a0450149a629","resolution":{"observed_at":"2026-06-28T09:33:11.546881Z","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-28T09:33:11.546881Z","title":null,"venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2606.03507","last_updated":"2026-06-02T11:25:18Z","snapshot_observed_at":"2026-08-06T10:56:13.310448Z","submitted_at":"2026-06-02T11:25:18Z","title":"Full Extractors for Logical Processing in Hypergraph Product Codes","version":1},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-06-28T09:33:11.546881Z"},"links":{"citing_paper":"/paper/2606.03507"},"observation_digest":"sha256:0c43e1a65883b36a3bba9c659c73aba1ab6c0d4597c2faf3e91dc9c4159eb18b","observation_id":"4fece1eb-de32-44fb-b1c6-4263d71b5f9e","resolution":{"observed_at":"2026-06-28T09:33:11.546881Z","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-28T09:33:11.546881Z","title":"Kosen, H.-X","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2606.03507","last_updated":"2026-06-02T11:25:18Z","snapshot_observed_at":"2026-08-06T10:56:13.310448Z","submitted_at":"2026-06-02T11:25:18Z","title":"Full Extractors for Logical Processing in Hypergraph Product Codes","version":1},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-06-28T09:33:11.546881Z"},"links":{"citing_paper":"/paper/2606.03507"},"observation_digest":"sha256:96a5ef1ba16a5aaf2c7f5c4975d6d4ce259357764b4ce3647d7ff8acf915f379","observation_id":"da65e148-331b-4bf7-87b9-3474c36ee7b2","resolution":{"observed_at":"2026-06-28T09:33:11.546881Z","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-28T09:33:11.546881Z","title":"Marxer, A","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2606.03507","last_updated":"2026-06-02T11:25:18Z","snapshot_observed_at":"2026-08-06T10:56:13.310448Z","submitted_at":"2026-06-02T11:25:18Z","title":"Full Extractors for Logical Processing in Hypergraph Product Codes","version":1},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-06-28T09:33:11.546881Z"},"links":{"citing_paper":"/paper/2606.03507"},"observation_digest":"sha256:3c30f0d11881f2ae8d70fdc973890fa6e06730907e3f6429a5abe6bbae2f28b6","observation_id":"791aeb7e-1074-4b3e-9b8e-75bd935b0db9","resolution":{"observed_at":"2026-06-28T09:33:11.546881Z","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/kfy3-bwgr","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Xiong, J","venue":"Physical Review Applied","work_id":"b8e69bb9-7547-4586-a9d2-0c9b9e10e092","year":2026},"citing_paper":{"arxiv_id":"2606.03507","last_updated":"2026-06-02T11:25:18Z","snapshot_observed_at":"2026-08-06T10:56:13.310448Z","submitted_at":"2026-06-02T11:25:18Z","title":"Full Extractors for Logical Processing in Hypergraph Product Codes","version":1},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-06-28T09:33:11.546881Z"},"links":{"citing_paper":"/paper/2606.03507"},"observation_digest":"sha256:08af52e3ded6d5e84d5f94733eb0db9ef3a659a43ad2fa352d878ca86a406e79","observation_id":"cd151af4-5276-452e-a336-b99b6694b9a6","resolution":{"observed_at":"2026-06-28T09:41:51.264855Z","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-14T08:50:15.675496+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-14T08:50:15.675496+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-28T09:33:11.546881Z","title":null,"venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2606.03507","last_updated":"2026-06-02T11:25:18Z","snapshot_observed_at":"2026-08-06T10:56:13.310448Z","submitted_at":"2026-06-02T11:25:18Z","title":"Full Extractors for Logical Processing in Hypergraph Product Codes","version":1},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-06-28T09:33:11.546881Z"},"links":{"citing_paper":"/paper/2606.03507"},"observation_digest":"sha256:ed1f4e275d05ba463fe42385009b6d8646f37707e1186ebb5a94be7cc257873c","observation_id":"92c8e03b-1235-40a1-b0b9-aa16b125ce9a","resolution":{"observed_at":"2026-06-28T09:33:11.546881Z","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/physrevlett.129.050504","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":null,"venue":"Physical Review Letters","work_id":"f7da62c9-dc76-4a7f-8621-006f28f074d5","year":2022},"citing_paper":{"arxiv_id":"2606.03507","last_updated":"2026-06-02T11:25:18Z","snapshot_observed_at":"2026-08-06T10:56:13.310448Z","submitted_at":"2026-06-02T11:25:18Z","title":"Full Extractors for Logical Processing in Hypergraph Product Codes","version":1},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-06-28T09:33:11.546881Z"},"links":{"citing_paper":"/paper/2606.03507"},"observation_digest":"sha256:c3ad9b9b0db025aa6e76f78f827ead8b0aa7938dd1424c64e059c1ba70f2ed0c","observation_id":"770d47fc-b42e-4d60-99d9-9464d59ee3b5","resolution":{"observed_at":"2026-06-28T09:41:51.268050Z","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-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1038/s41534-026-01243-w","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Mathews, L","venue":"npj Quantum Information","work_id":"e2fc67a9-68df-4355-a52a-a86fe3fa17a2","year":2026},"citing_paper":{"arxiv_id":"2606.03507","last_updated":"2026-06-02T11:25:18Z","snapshot_observed_at":"2026-08-06T10:56:13.310448Z","submitted_at":"2026-06-02T11:25:18Z","title":"Full Extractors for Logical Processing in Hypergraph Product Codes","version":1},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-06-28T09:33:11.546881Z"},"links":{"citing_paper":"/paper/2606.03507"},"observation_digest":"sha256:0f5fde7b20f7ecc7d0996b22886c7088fe06e54f1e4ca2a93c35db3eeb4fac4e","observation_id":"a98f8eca-f1d9-4113-bd04-7d4ae9324e68","resolution":{"observed_at":"2026-06-28T09:41:51.272830Z","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-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-28T09:33:11.546881Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2606.03507","last_updated":"2026-06-02T11:25:18Z","snapshot_observed_at":"2026-08-06T10:56:13.310448Z","submitted_at":"2026-06-02T11:25:18Z","title":"Full Extractors for Logical Processing in Hypergraph Product Codes","version":1},"reference_index":54,"source":"pdf_text","source_observed_at":"2026-06-28T09:33:11.546881Z"},"links":{"citing_paper":"/paper/2606.03507"},"observation_digest":"sha256:68bc5db31ada00c3385c955ff4f06df770959b2bf6fbf36351be9692c4b28012","observation_id":"73857184-6ac1-4f9a-a509-09f23b3fa881","resolution":{"observed_at":"2026-06-28T09:33:11.546881Z","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":"2603.05481","doi":"10.48550/arxiv.2603.05481","metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Strikis, D","venue":"Open MIND","work_id":"54b186b6-453c-491d-b04a-35afbf0a0acf","year":2026},"citing_paper":{"arxiv_id":"2606.03507","last_updated":"2026-06-02T11:25:18Z","snapshot_observed_at":"2026-08-06T10:56:13.310448Z","submitted_at":"2026-06-02T11:25:18Z","title":"Full Extractors for Logical Processing in Hypergraph Product Codes","version":1},"reference_index":55,"source":"pdf_text","source_observed_at":"2026-06-28T09:33:11.546881Z"},"links":{"citing_paper":"/paper/2606.03507"},"observation_digest":"sha256:05ba725faaa8ddc974cc061b7131a6094f44e60116944a1fe123a427217f7ea5","observation_id":"23aa7c32-e647-44c3-80ac-5600ee58dd5e","resolution":{"observed_at":"2026-07-02T03:56:34.942914Z","resolver_source":"arxiv_id","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-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-28T09:33:11.546881Z","title":"Raveendran and B","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2606.03507","last_updated":"2026-06-02T11:25:18Z","snapshot_observed_at":"2026-08-06T10:56:13.310448Z","submitted_at":"2026-06-02T11:25:18Z","title":"Full Extractors for Logical Processing in Hypergraph Product Codes","version":1},"reference_index":56,"source":"pdf_text","source_observed_at":"2026-06-28T09:33:11.546881Z"},"links":{"citing_paper":"/paper/2606.03507"},"observation_digest":"sha256:1d0e12a113c5bcf3f26734a66e7252d3f639a8915ddc9da80292ba4ec368ec07","observation_id":"4ce3705a-0298-45aa-aa47-fc9d405c22bf","resolution":{"observed_at":"2026-06-28T09:33:11.546881Z","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-28T09:33:11.546881Z","title":null,"venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2606.03507","last_updated":"2026-06-02T11:25:18Z","snapshot_observed_at":"2026-08-06T10:56:13.310448Z","submitted_at":"2026-06-02T11:25:18Z","title":"Full Extractors for Logical Processing in Hypergraph Product Codes","version":1},"reference_index":57,"source":"pdf_text","source_observed_at":"2026-06-28T09:33:11.546881Z"},"links":{"citing_paper":"/paper/2606.03507"},"observation_digest":"sha256:1d28cd8d7b7d4a91f85e35252df45bb31244eab994385965c86d2a0494ebbdde","observation_id":"f142b180-6f9d-446f-a160-10d2cf4742d5","resolution":{"observed_at":"2026-06-28T09:33:11.546881Z","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-28T09:33:11.546881Z","title":"Panteleev and G","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2606.03507","last_updated":"2026-06-02T11:25:18Z","snapshot_observed_at":"2026-08-06T10:56:13.310448Z","submitted_at":"2026-06-02T11:25:18Z","title":"Full Extractors for Logical Processing in Hypergraph Product Codes","version":1},"reference_index":58,"source":"pdf_text","source_observed_at":"2026-06-28T09:33:11.546881Z"},"links":{"citing_paper":"/paper/2606.03507"},"observation_digest":"sha256:8eb0089cce7ab4ea9f15b01421a11d763255ee7a6bada0837dc50400a3dd4040","observation_id":"b6fcae28-f9ea-4957-a05c-227a3a0b9f2c","resolution":{"observed_at":"2026-06-28T09:33:11.546881Z","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-28T09:33:11.546881Z","title":"Bravyi, A","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2606.03507","last_updated":"2026-06-02T11:25:18Z","snapshot_observed_at":"2026-08-06T10:56:13.310448Z","submitted_at":"2026-06-02T11:25:18Z","title":"Full Extractors for Logical Processing in Hypergraph Product Codes","version":1},"reference_index":59,"source":"pdf_text","source_observed_at":"2026-06-28T09:33:11.546881Z"},"links":{"citing_paper":"/paper/2606.03507"},"observation_digest":"sha256:3195ecba367f6cbcb622732f89e4aa3491cae3e459a12cdcd1a83aee2a20c6a7","observation_id":"bd293b0a-11ec-42c3-89c8-a3765d4fbc85","resolution":{"observed_at":"2026-06-28T09:33:11.546881Z","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-28T09:33:11.546881Z","title":"Lin and L","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2606.03507","last_updated":"2026-06-02T11:25:18Z","snapshot_observed_at":"2026-08-06T10:56:13.310448Z","submitted_at":"2026-06-02T11:25:18Z","title":"Full Extractors for Logical Processing in Hypergraph Product Codes","version":1},"reference_index":60,"source":"pdf_text","source_observed_at":"2026-06-28T09:33:11.546881Z"},"links":{"citing_paper":"/paper/2606.03507"},"observation_digest":"sha256:163cb7fe7255267dfc7960a10ec6a7551970a72c562787567fabf7710920ca05","observation_id":"b1edaf9d-8486-42a7-b5da-f65e7f32e66c","resolution":{"observed_at":"2026-06-28T09:33:11.546881Z","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-28T09:33:11.546881Z","title":"Panteleev and G","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2606.03507","last_updated":"2026-06-02T11:25:18Z","snapshot_observed_at":"2026-08-06T10:56:13.310448Z","submitted_at":"2026-06-02T11:25:18Z","title":"Full Extractors for Logical Processing in Hypergraph Product Codes","version":1},"reference_index":61,"source":"pdf_text","source_observed_at":"2026-06-28T09:33:11.546881Z"},"links":{"citing_paper":"/paper/2606.03507"},"observation_digest":"sha256:c3d6dc31e18a4dfdbba8475db9e1de787a3e4627de8690b69944580dd588e983","observation_id":"eb7af0d7-3b74-4932-aed7-4aca9a790a8b","resolution":{"observed_at":"2026-06-28T09:33:11.546881Z","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-28T09:33:11.546881Z","title":null,"venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2606.03507","last_updated":"2026-06-02T11:25:18Z","snapshot_observed_at":"2026-08-06T10:56:13.310448Z","submitted_at":"2026-06-02T11:25:18Z","title":"Full Extractors for Logical Processing in Hypergraph Product Codes","version":1},"reference_index":62,"source":"pdf_text","source_observed_at":"2026-06-28T09:33:11.546881Z"},"links":{"citing_paper":"/paper/2606.03507"},"observation_digest":"sha256:bf938f5d2debdc5407e900257a9416359542be5fe1aa0bacd7ec5362a7b82da5","observation_id":"2b8d2fcc-4052-4cda-9938-6ec8cafdcd1d","resolution":{"observed_at":"2026-06-28T09:33:11.546881Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2601.08824","last_updated":"2026-08-10T14:43:05Z","snapshot_observed_at":"2026-08-17T23:08:27.710737Z","submitted_at":"2026-01-13T18:57:43Z","title":"Breaking the Orthogonality Barrier in Quantum LDPC Codes","version":4},"cited_work":{"arxiv_id":"2601.08824","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2601.08824","snapshot_observed_at":"2026-08-11T03:24:36.104850Z","title":"Breaking the orthogonality barrier in quantum LDPC codes","venue":null,"work_id":"61e0b7ad-5449-46d8-bd36-2b1b7f7a669c","year":2026},"citing_paper":{"arxiv_id":"2606.03507","last_updated":"2026-06-02T11:25:18Z","snapshot_observed_at":"2026-08-06T10:56:13.310448Z","submitted_at":"2026-06-02T11:25:18Z","title":"Full Extractors for Logical Processing in Hypergraph Product Codes","version":1},"reference_index":63,"source":"pdf_text","source_observed_at":"2026-06-28T09:33:11.546881Z"},"links":{"cited_paper":"/paper/2601.08824","citing_paper":"/paper/2606.03507"},"observation_digest":"sha256:6e3ae177a2f6920d64bf67d32e42b086086bce1697559b4f4eb114c5ba6e376b","observation_id":"4ff0bd5e-8fec-47fb-884c-24fdfe413232","resolution":{"observed_at":"2026-08-11T03:24:36.104850Z","resolver_source":"arxiv_id","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-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1103/physrevlett.134.070602","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Zhang and Y","venue":"Physical Review Letters","work_id":"7c83d5f3-6582-4a82-8236-89bd8a63f06a","year":2025},"citing_paper":{"arxiv_id":"2606.03507","last_updated":"2026-06-02T11:25:18Z","snapshot_observed_at":"2026-08-06T10:56:13.310448Z","submitted_at":"2026-06-02T11:25:18Z","title":"Full Extractors for Logical Processing in Hypergraph Product Codes","version":1},"reference_index":64,"source":"pdf_text","source_observed_at":"2026-06-28T09:33:11.546881Z"},"links":{"citing_paper":"/paper/2606.03507"},"observation_digest":"sha256:7c079bc0e609b874285e5188980dd0077a6079a54820432103e4d1cbb8a2bcff","observation_id":"72a66a52-ad9e-4763-84c0-0dbeaa7feadf","resolution":{"observed_at":"2026-06-28T09:41:51.276339Z","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-05-22T18:53:56.134244+00:00","source":"crossref_status_cache"},{"observed_at":"2026-05-22T18:53:56.134244+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":"10.1103/gj8x-n5gg","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Cowtan, Z","venue":"PRX Quantum","work_id":"5149efc8-f205-4bb6-9c7b-4b9115804a76","year":2026},"citing_paper":{"arxiv_id":"2606.03507","last_updated":"2026-06-02T11:25:18Z","snapshot_observed_at":"2026-08-06T10:56:13.310448Z","submitted_at":"2026-06-02T11:25:18Z","title":"Full Extractors for Logical Processing in Hypergraph Product Codes","version":1},"reference_index":65,"source":"pdf_text","source_observed_at":"2026-06-28T09:33:11.546881Z"},"links":{"citing_paper":"/paper/2606.03507"},"observation_digest":"sha256:47f0317c29fee80e8429facaa7c54f4bde7d5be8d6fb6826fd88dd8f45f93a0e","observation_id":"070205f9-b0a7-4f8f-a0e5-36209d7dbc05","resolution":{"observed_at":"2026-06-28T09:41:51.263268Z","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-05-22T18:53:48.987588+00:00","source":"crossref_status_cache"},{"observed_at":"2026-05-22T18:53:48.987588+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":"2510.08523","doi":"10.48550/arxiv.2510.08523","metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"High-rate surgery: towards constant-overhead logical operations","venue":"ArXiv.org","work_id":"612f532e-0b06-4bd4-896d-9a0483d55484","year":2025},"citing_paper":{"arxiv_id":"2606.03507","last_updated":"2026-06-02T11:25:18Z","snapshot_observed_at":"2026-08-06T10:56:13.310448Z","submitted_at":"2026-06-02T11:25:18Z","title":"Full Extractors for Logical Processing in Hypergraph Product Codes","version":1},"reference_index":66,"source":"pdf_text","source_observed_at":"2026-06-28T09:33:11.546881Z"},"links":{"citing_paper":"/paper/2606.03507"},"observation_digest":"sha256:8e38b1fbce1c7d8934603fbcddcb73ed327a55c055d9ff481d6a1dc6d906efd1","observation_id":"1e1bfda5-7ff2-4b79-bd07-f59c066e1d5f","resolution":{"observed_at":"2026-07-02T03:56:34.947577Z","resolver_source":"arxiv_id","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-05-22T18:53:56.560268+00:00","source":"crossref_status_cache"},{"observed_at":"2026-05-22T18:53:56.560268+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":"2603.05398","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-04T17:20:00.450986Z","title":"arXiv preprint arXiv:2603.05398 , year=","venue":null,"work_id":"6118f6d3-b4f9-4245-a79f-10c72f06af67","year":2026},"citing_paper":{"arxiv_id":"2606.03507","last_updated":"2026-06-02T11:25:18Z","snapshot_observed_at":"2026-08-06T10:56:13.310448Z","submitted_at":"2026-06-02T11:25:18Z","title":"Full Extractors for Logical Processing in Hypergraph Product Codes","version":1},"reference_index":67,"source":"pdf_text","source_observed_at":"2026-06-28T09:33:11.546881Z"},"links":{"citing_paper":"/paper/2606.03507"},"observation_digest":"sha256:4d3cc29dad4115f3e5e4cbdbc7585bb399ec3a77fec885b4b5bdc6af9cbaa4ca","observation_id":"8e61d6c8-f96d-4d31-9c0a-1fdbaaa49970","resolution":{"observed_at":"2026-07-02T03:56:34.919755Z","resolver_source":"arxiv_id","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-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2510.14895","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-04T17:20:00.456852Z","title":"Williamson, and Theodore J","venue":null,"work_id":"55fd2f70-5d76-46da-bdd1-62ee0875d4dd","year":2025},"citing_paper":{"arxiv_id":"2606.03507","last_updated":"2026-06-02T11:25:18Z","snapshot_observed_at":"2026-08-06T10:56:13.310448Z","submitted_at":"2026-06-02T11:25:18Z","title":"Full Extractors for Logical Processing in Hypergraph Product Codes","version":1},"reference_index":68,"source":"pdf_text","source_observed_at":"2026-06-28T09:33:11.546881Z"},"links":{"citing_paper":"/paper/2606.03507"},"observation_digest":"sha256:2e07fef02e97491129bf05a6427fbf7ee33efec18c873084b4dc04975a64a8c9","observation_id":"df1827fa-2474-4f25-b0d0-7f17ab5d9763","resolution":{"observed_at":"2026-07-02T03:56:34.897094Z","resolver_source":"arxiv_id","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-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2510.04521","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-04T17:20:00.395253Z","title":"arXiv preprint arXiv:2510.04521 , year=","venue":null,"work_id":"1dbcb980-0219-4732-8409-cae440d6be07","year":2025},"citing_paper":{"arxiv_id":"2606.03507","last_updated":"2026-06-02T11:25:18Z","snapshot_observed_at":"2026-08-06T10:56:13.310448Z","submitted_at":"2026-06-02T11:25:18Z","title":"Full Extractors for Logical Processing in Hypergraph Product Codes","version":1},"reference_index":69,"source":"pdf_text","source_observed_at":"2026-06-28T09:33:11.546881Z"},"links":{"citing_paper":"/paper/2606.03507"},"observation_digest":"sha256:2dd1c77ab2b123d3b0c40621f3c2415bef6a9a1b9d84104f65def9cb07a05d8e","observation_id":"3ec8fd84-ee0f-465c-803b-48717adf6e30","resolution":{"observed_at":"2026-07-02T03:56:34.908715Z","resolver_source":"arxiv_id","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-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2603.02157","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-02T13:46:59.145884Z","title":"arXiv preprint arXiv:2603.02157 , year=","venue":null,"work_id":"718e477d-693a-4630-8ebb-a4d473ec6d85","year":2026},"citing_paper":{"arxiv_id":"2606.03507","last_updated":"2026-06-02T11:25:18Z","snapshot_observed_at":"2026-08-06T10:56:13.310448Z","submitted_at":"2026-06-02T11:25:18Z","title":"Full Extractors for Logical Processing in Hypergraph Product Codes","version":1},"reference_index":70,"source":"pdf_text","source_observed_at":"2026-06-28T09:33:11.546881Z"},"links":{"citing_paper":"/paper/2606.03507"},"observation_digest":"sha256:c14bde59c425c361fb22a57b50404ae8969a1f9574baf08ea13cd79734414561","observation_id":"746cfa4a-d4b5-426b-a2da-bea77377cb7b","resolution":{"observed_at":"2026-07-02T03:56:34.937264Z","resolver_source":"arxiv_id","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-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2602.20546","last_updated":"2026-06-02T15:13:30Z","snapshot_observed_at":"2026-08-16T12:08:42.818523Z","submitted_at":"2026-02-24T04:57:42Z","title":"Distilling Magic States in the Bicycle Architecture","version":2},"cited_work":{"arxiv_id":"2602.20546","doi":null,"metadata_source":"pith","pith_arxiv_id":"2602.20546","snapshot_observed_at":"2026-07-10T17:17:25.904661Z","title":"arXiv preprint arXiv:2602.20546 , year=","venue":"quant-ph","work_id":"fbc6b71e-a336-42a6-905e-f667a6bec5d5","year":2026},"citing_paper":{"arxiv_id":"2606.03507","last_updated":"2026-06-02T11:25:18Z","snapshot_observed_at":"2026-08-06T10:56:13.310448Z","submitted_at":"2026-06-02T11:25:18Z","title":"Full Extractors for Logical Processing in Hypergraph Product Codes","version":1},"reference_index":71,"source":"pdf_text","source_observed_at":"2026-06-28T09:33:11.546881Z"},"links":{"cited_paper":"/paper/2602.20546","citing_paper":"/paper/2606.03507"},"observation_digest":"sha256:bc8c5c5d33315226af18d85d55279e360d66ded9de4b6a5514f659718376060e","observation_id":"ad59fb07-40ac-4de5-9148-d1681690c20e","resolution":{"observed_at":"2026-07-02T03:56:34.914106Z","resolver_source":"local_arxiv","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-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2604.20013","last_updated":"2026-04-21T21:43:03Z","snapshot_observed_at":"2026-07-06T23:06:31.110859Z","submitted_at":"2026-04-21T21:43:03Z","title":"Assessing System Capabilities and Bottlenecks of an Early Fault-Tolerant Bicycle Architecture","version":1},"cited_work":{"arxiv_id":"2604.20013","doi":null,"metadata_source":"pith","pith_arxiv_id":"2604.20013","snapshot_observed_at":"2026-07-03T20:18:55.892084Z","title":"Assessing System Capabilities and Bottlenecks of an Early Fault-Tolerant Bicycle Architecture","venue":"quant-ph","work_id":"a7e0b7db-8803-45fa-88b8-8074797e8031","year":2026},"citing_paper":{"arxiv_id":"2606.03507","last_updated":"2026-06-02T11:25:18Z","snapshot_observed_at":"2026-08-06T10:56:13.310448Z","submitted_at":"2026-06-02T11:25:18Z","title":"Full Extractors for Logical Processing in Hypergraph Product Codes","version":1},"reference_index":72,"source":"pdf_text","source_observed_at":"2026-06-28T09:33:11.546881Z"},"links":{"cited_paper":"/paper/2604.20013","citing_paper":"/paper/2606.03507"},"observation_digest":"sha256:0a68b1866fe195ef0dc665f8ff6e53067278eea457331ebea00770fbb1508826","observation_id":"32f93dcb-b615-4d3a-a9ab-b0a6b99de25a","resolution":{"observed_at":"2026-07-02T03:56:34.937820Z","resolver_source":"local_arxiv","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-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2604.25094","last_updated":"2026-04-28T00:58:22Z","snapshot_observed_at":"2026-08-14T16:33:00.178630Z","submitted_at":"2026-04-28T00:58:22Z","title":"INJEQT: Improved Magic-State Injection Protocol for Fault-Tolerant Quantum Extractor Architectures","version":1},"cited_work":{"arxiv_id":"2604.25094","doi":null,"metadata_source":"pith","pith_arxiv_id":"2604.25094","snapshot_observed_at":"2026-07-02T03:56:34.946768Z","title":"INJEQT: Improved Magic-State Injection Protocol for Fault-Tolerant Quantum Extractor Architectures","venue":"quant-ph","work_id":"23f00d02-91b5-4fe6-a060-6cac6b3b8069","year":2026},"citing_paper":{"arxiv_id":"2606.03507","last_updated":"2026-06-02T11:25:18Z","snapshot_observed_at":"2026-08-06T10:56:13.310448Z","submitted_at":"2026-06-02T11:25:18Z","title":"Full Extractors for Logical Processing in Hypergraph Product Codes","version":1},"reference_index":73,"source":"pdf_text","source_observed_at":"2026-06-28T09:33:11.546881Z"},"links":{"cited_paper":"/paper/2604.25094","citing_paper":"/paper/2606.03507"},"observation_digest":"sha256:1035414b981c4f3b552b35b8fa8a5a03c39ac9f13e4158892dd024d42c755412","observation_id":"df60a0ef-1b41-4088-b75b-0e9a4a2cd62f","resolution":{"observed_at":"2026-07-02T03:56:34.948109Z","resolver_source":"local_arxiv","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-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2603.17167","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-02T03:56:34.889598Z","title":"Optimizing Logical Mappings for Quantum Low-Density Parity Check Codes","venue":null,"work_id":"6bf445a9-338e-476e-a5e9-5ed517bf9ae4","year":2026},"citing_paper":{"arxiv_id":"2606.03507","last_updated":"2026-06-02T11:25:18Z","snapshot_observed_at":"2026-08-06T10:56:13.310448Z","submitted_at":"2026-06-02T11:25:18Z","title":"Full Extractors for Logical Processing in Hypergraph Product Codes","version":1},"reference_index":74,"source":"pdf_text","source_observed_at":"2026-06-28T09:33:11.546881Z"},"links":{"citing_paper":"/paper/2606.03507"},"observation_digest":"sha256:f6f849a79a152d5bdba4965e581f1d418ab39e5b1280046cd93e6439a1eb79ed","observation_id":"78bcbfa7-0893-46f3-ba84-86691bd451f6","resolution":{"observed_at":"2026-07-02T03:56:34.891369Z","resolver_source":"arxiv_id","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-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2604.19735","last_updated":"2026-04-21T17:57:43Z","snapshot_observed_at":"2026-07-06T23:06:21.774788Z","submitted_at":"2026-04-21T17:57:43Z","title":"Architecting Early Fault Tolerant Neutral Atoms Systems with Quantum Advantage","version":1},"cited_work":{"arxiv_id":"2604.19735","doi":null,"metadata_source":"pith","pith_arxiv_id":"2604.19735","snapshot_observed_at":"2026-07-04T17:20:00.302000Z","title":"Architecting Early Fault Tolerant Neutral Atoms Systems with Quantum Advantage","venue":"quant-ph","work_id":"21a5074b-77a6-4321-b6e9-0328ce0ef3de","year":2026},"citing_paper":{"arxiv_id":"2606.03507","last_updated":"2026-06-02T11:25:18Z","snapshot_observed_at":"2026-08-06T10:56:13.310448Z","submitted_at":"2026-06-02T11:25:18Z","title":"Full Extractors for Logical Processing in Hypergraph Product Codes","version":1},"reference_index":75,"source":"pdf_text","source_observed_at":"2026-06-28T09:33:11.546881Z"},"links":{"cited_paper":"/paper/2604.19735","citing_paper":"/paper/2606.03507"},"observation_digest":"sha256:9e14dc8c18c3b7e25b6a3d9db614862758e0d171170cdc3ee72fe073875b224f","observation_id":"07bd43f2-cf4e-4ff5-ba39-bef552f501ca","resolution":{"observed_at":"2026-07-02T03:56:34.928645Z","resolver_source":"local_arxiv","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-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2506.01958","last_updated":"2025-05-02T12:25:29Z","snapshot_observed_at":"2026-08-18T20:21:24.379765Z","submitted_at":"2025-05-02T12:25:29Z","title":"SubMIT: A Physics Analysis Facility at MIT","version":1},"cited_work":{"arxiv_id":"2506.01958","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2506.01958","snapshot_observed_at":"2026-07-02T09:06:49.022985Z","title":"Bendavid, M","venue":null,"work_id":"95c0bbf5-4cb8-4c85-9b93-bc2c3d2084f7","year":2025},"citing_paper":{"arxiv_id":"2606.03507","last_updated":"2026-06-02T11:25:18Z","snapshot_observed_at":"2026-08-06T10:56:13.310448Z","submitted_at":"2026-06-02T11:25:18Z","title":"Full Extractors for Logical Processing in Hypergraph Product Codes","version":1},"reference_index":76,"source":"pdf_text","source_observed_at":"2026-06-28T09:33:11.546881Z"},"links":{"cited_paper":"/paper/2506.01958","citing_paper":"/paper/2606.03507"},"observation_digest":"sha256:565cd4f8417747dfb9c0f35082ebbfcef8fd5c90bd42f327894055f01f6a9678","observation_id":"c1e0d554-5df2-40c6-96a0-58d8b6dd71f6","resolution":{"observed_at":"2026-07-02T03:56:34.893852Z","resolver_source":"arxiv_id","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-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-28T09:33:11.546881Z","title":null,"venue":null,"work_id":null,"year":2003},"citing_paper":{"arxiv_id":"2606.03507","last_updated":"2026-06-02T11:25:18Z","snapshot_observed_at":"2026-08-06T10:56:13.310448Z","submitted_at":"2026-06-02T11:25:18Z","title":"Full Extractors for Logical Processing in Hypergraph Product Codes","version":1},"reference_index":77,"source":"pdf_text","source_observed_at":"2026-06-28T09:33:11.546881Z"},"links":{"citing_paper":"/paper/2606.03507"},"observation_digest":"sha256:d48044857dac76e32dc19abbee95dc4a4c44659561de761ca7f08b5156a63632","observation_id":"c3f000d5-6358-4656-beda-3b0ec94b682e","resolution":{"observed_at":"2026-06-28T09:33:11.546881Z","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-28T09:33:11.546881Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2606.03507","last_updated":"2026-06-02T11:25:18Z","snapshot_observed_at":"2026-08-06T10:56:13.310448Z","submitted_at":"2026-06-02T11:25:18Z","title":"Full Extractors for Logical Processing in Hypergraph Product Codes","version":1},"reference_index":78,"source":"pdf_text","source_observed_at":"2026-06-28T09:33:11.546881Z"},"links":{"citing_paper":"/paper/2606.03507"},"observation_digest":"sha256:7e73eef74c94e86de8e924ed3ec7eab60360388667767e6ca2601a17f0f8dd4f","observation_id":"c6307c79-d413-4861-8976-a91957e7e62a","resolution":{"observed_at":"2026-06-28T09:33:11.546881Z","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-28T09:33:11.546881Z","title":null,"venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2606.03507","last_updated":"2026-06-02T11:25:18Z","snapshot_observed_at":"2026-08-06T10:56:13.310448Z","submitted_at":"2026-06-02T11:25:18Z","title":"Full Extractors for Logical Processing in Hypergraph Product Codes","version":1},"reference_index":79,"source":"pdf_text","source_observed_at":"2026-06-28T09:33:11.546881Z"},"links":{"citing_paper":"/paper/2606.03507"},"observation_digest":"sha256:6a9adf0ca078100e549a87278ade14289e9b52d6e401d00ba922246b6b772052","observation_id":"8718707f-d887-4ac1-884f-2171f57307e0","resolution":{"observed_at":"2026-06-28T09:33:11.546881Z","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-28T09:33:11.546881Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.03507","last_updated":"2026-06-02T11:25:18Z","snapshot_observed_at":"2026-08-06T10:56:13.310448Z","submitted_at":"2026-06-02T11:25:18Z","title":"Full Extractors for Logical Processing in Hypergraph Product Codes","version":1},"reference_index":80,"source":"pdf_text","source_observed_at":"2026-06-28T09:33:11.546881Z"},"links":{"citing_paper":"/paper/2606.03507"},"observation_digest":"sha256:6cad1c2cacc8e8deef63d4bc9460344e7648ef95d8e2404c19fd315572d95245","observation_id":"5fb20fdf-efaa-4037-b566-0b237d880c73","resolution":{"observed_at":"2026-06-28T09:33:11.546881Z","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-28T09:33:11.546881Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2606.03507","last_updated":"2026-06-02T11:25:18Z","snapshot_observed_at":"2026-08-06T10:56:13.310448Z","submitted_at":"2026-06-02T11:25:18Z","title":"Full Extractors for Logical Processing in Hypergraph Product Codes","version":1},"reference_index":81,"source":"pdf_text","source_observed_at":"2026-06-28T09:33:11.546881Z"},"links":{"citing_paper":"/paper/2606.03507"},"observation_digest":"sha256:ea38f4a65f3fb577a523b03f444cfbeb244fd777a348d5d112895645062c7c8f","observation_id":"1ba53ffd-b342-49ee-80af-b516174b6570","resolution":{"observed_at":"2026-06-28T09:33:11.546881Z","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-28T09:33:11.546881Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2606.03507","last_updated":"2026-06-02T11:25:18Z","snapshot_observed_at":"2026-08-06T10:56:13.310448Z","submitted_at":"2026-06-02T11:25:18Z","title":"Full Extractors for Logical Processing in Hypergraph Product Codes","version":1},"reference_index":82,"source":"pdf_text","source_observed_at":"2026-06-28T09:33:11.546881Z"},"links":{"citing_paper":"/paper/2606.03507"},"observation_digest":"sha256:1b6938824d74a2b8270ca2f08d079c60e8d728b5eb82e6696fdbaa85c18fbaea","observation_id":"42edff22-dfe7-4112-9cac-e70cc3193a32","resolution":{"observed_at":"2026-06-28T09:33:11.546881Z","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-28T09:33:11.546881Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2606.03507","last_updated":"2026-06-02T11:25:18Z","snapshot_observed_at":"2026-08-06T10:56:13.310448Z","submitted_at":"2026-06-02T11:25:18Z","title":"Full Extractors for Logical Processing in Hypergraph Product Codes","version":1},"reference_index":83,"source":"pdf_text","source_observed_at":"2026-06-28T09:33:11.546881Z"},"links":{"citing_paper":"/paper/2606.03507"},"observation_digest":"sha256:d8620216dd4320f0b88bf6773bfc28dedefed21f5a9159d11760de60f16c9d2f","observation_id":"702d452e-5b90-4d20-91c0-8e53c228c879","resolution":{"observed_at":"2026-06-28T09:33:11.546881Z","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-28T09:33:11.546881Z","title":"If{t i}forms a basis forW •, thent i +Wforms a basis for V /W","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.03507","last_updated":"2026-06-02T11:25:18Z","snapshot_observed_at":"2026-08-06T10:56:13.310448Z","submitted_at":"2026-06-02T11:25:18Z","title":"Full Extractors for Logical Processing in Hypergraph Product Codes","version":1},"reference_index":84,"source":"pdf_text","source_observed_at":"2026-06-28T09:33:11.546881Z"},"links":{"citing_paper":"/paper/2606.03507"},"observation_digest":"sha256:7a1e1b0a9486b3b294857047210990852d1adf2f83ebadc84716cc27b4210e4e","observation_id":"565fc996-c405-4d1c-80ba-098ac60527b3","resolution":{"observed_at":"2026-06-28T09:33:11.546881Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2603.22532","last_updated":"2026-08-14T08:13:21Z","snapshot_observed_at":"2026-08-19T19:09:34.952235Z","submitted_at":"2026-03-23T19:52:23Z","title":"Distance-Finding Algorithms for Quantum Codes and Circuits","version":2},"cited_work":{"arxiv_id":"2603.22532","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2603.22532","snapshot_observed_at":"2026-08-17T02:09:27.147534Z","title":"Distance-finding algorithms for quantum codes and cir- cuits","venue":null,"work_id":"231e931c-9a0d-4191-875d-45385b0e438d","year":2026},"citing_paper":{"arxiv_id":"2606.03507","last_updated":"2026-06-02T11:25:18Z","snapshot_observed_at":"2026-08-06T10:56:13.310448Z","submitted_at":"2026-06-02T11:25:18Z","title":"Full Extractors for Logical Processing in Hypergraph Product Codes","version":1},"reference_index":85,"source":"pdf_text","source_observed_at":"2026-06-28T09:33:11.546881Z"},"links":{"cited_paper":"/paper/2603.22532","citing_paper":"/paper/2606.03507"},"observation_digest":"sha256:c062313f967f3a4176ba783cb6e0336b2cf1923757ca3b63e499ec0e44b95e9f","observation_id":"be7815ff-bdcf-4df5-8dc1-dd029094f45e","resolution":{"observed_at":"2026-08-17T02:09:27.147534Z","resolver_source":"arxiv_id","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-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2409.17595","last_updated":"2024-09-26T07:21:58Z","snapshot_observed_at":"2026-08-13T21:53:07.774758Z","submitted_at":"2024-09-26T07:21:58Z","title":"Magic state cultivation: growing T states as cheap as CNOT gates","version":1},"cited_work":{"arxiv_id":"2409.17595","doi":"10.48550/arxiv.2409.17595","metadata_source":"pith","pith_arxiv_id":"2409.17595","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Magic state cultivation: growing T states as cheap as CNOT gates","venue":"quant-ph","work_id":"4cfb255f-1ed0-4158-9c9b-5c3133e0e6aa","year":2024},"citing_paper":{"arxiv_id":"2606.03507","last_updated":"2026-06-02T11:25:18Z","snapshot_observed_at":"2026-08-06T10:56:13.310448Z","submitted_at":"2026-06-02T11:25:18Z","title":"Full Extractors for Logical Processing in Hypergraph Product Codes","version":1},"reference_index":86,"source":"pdf_text","source_observed_at":"2026-06-28T09:33:11.546881Z"},"links":{"cited_paper":"/paper/2409.17595","citing_paper":"/paper/2606.03507"},"observation_digest":"sha256:b3e37f0f8a10cf84a72e864917848798a759a690df9c3cb90cbde0a2bf03a83a","observation_id":"6798ff39-fb16-4f86-a85d-71d2a266c138","resolution":{"observed_at":"2026-07-02T03:56:34.906255Z","resolver_source":"local_arxiv","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-05-25T18:25:46.744656+00:00","source":"crossref_status_cache"},{"observed_at":"2026-05-25T18:25:46.744656+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-28T09:33:11.546881Z","title":null,"venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2606.03507","last_updated":"2026-06-02T11:25:18Z","snapshot_observed_at":"2026-08-06T10:56:13.310448Z","submitted_at":"2026-06-02T11:25:18Z","title":"Full Extractors for Logical Processing in Hypergraph Product Codes","version":1},"reference_index":87,"source":"pdf_text","source_observed_at":"2026-06-28T09:33:11.546881Z"},"links":{"citing_paper":"/paper/2606.03507"},"observation_digest":"sha256:95ce7363f57bbaabb1dd37110598cf5f6d1215cfdb6f522aba931e6ca41a2e29","observation_id":"535fc6d5-ed2d-41dc-b89b-0cbddf30fdd3","resolution":{"observed_at":"2026-06-28T09:33:11.546881Z","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-28T09:33:11.546881Z","title":"Higgott and C","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2606.03507","last_updated":"2026-06-02T11:25:18Z","snapshot_observed_at":"2026-08-06T10:56:13.310448Z","submitted_at":"2026-06-02T11:25:18Z","title":"Full Extractors for Logical Processing in Hypergraph Product Codes","version":1},"reference_index":88,"source":"pdf_text","source_observed_at":"2026-06-28T09:33:11.546881Z"},"links":{"citing_paper":"/paper/2606.03507"},"observation_digest":"sha256:9fef1def520464f1aa4e165adb34dd2ffd88052090c89b32452edc220950e93b","observation_id":"00e4a46f-5923-4c13-83d9-2d6657d30ad3","resolution":{"observed_at":"2026-06-28T09:33:11.546881Z","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/prxquantum.3.010331","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Universal quantum computing with twist-free and temporally encoded lattice surgery","venue":"PRX Quantum","work_id":"b9278c2e-3a15-4132-8595-ff0eefd7102b","year":2022},"citing_paper":{"arxiv_id":"2606.03507","last_updated":"2026-06-02T11:25:18Z","snapshot_observed_at":"2026-08-06T10:56:13.310448Z","submitted_at":"2026-06-02T11:25:18Z","title":"Full Extractors for Logical Processing in Hypergraph Product Codes","version":1},"reference_index":89,"source":"pdf_text","source_observed_at":"2026-06-28T09:33:11.546881Z"},"links":{"citing_paper":"/paper/2606.03507"},"observation_digest":"sha256:874a64cfca36495b38857740e886ced9ba3dda362a77e4aad77af3348e69d228","observation_id":"dbcb45d1-5339-401b-a26e-585fadc6968a","resolution":{"observed_at":"2026-06-28T09:41:51.261604Z","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-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2606.03507","last_updated":"2026-06-02T11:25:18Z","latest_version":1,"primary_category":"quant-ph","snapshot_observed_at":"2026-08-06T10:56:13.310448Z","submitted_at":"2026-06-02T11:25:18Z","title":"Full Extractors for Logical Processing in Hypergraph Product Codes"},"reference_resolution":{"displayed":89,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":52,"verified_exact":37,"verified_fuzzy":0},"total_outbound_references":89},"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 89 of 89 outbound references and 1 inbound Pith citation observation for arXiv:2606.03507."}