{"as_of":"2026-08-09T11:21:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:ca61620781eeabf35660c737a343e04a2f5c7a152b78cfddacb6cb7fa2ea49cd","coverage":[{"denominator":0,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":13,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":13,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-09T06:31:02.800959+00:00","state":"measured"},{"denominator":13,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":13,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-06T15:54:34.664293Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-05-22T13:11:34.971847Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2407.18490","last_updated":"2024-07-26T03:49:59Z","snapshot_observed_at":"2026-08-08T07:57:33.971503Z","submitted_at":"2024-07-26T03:49:59Z","title":"Fast and Parallelizable Logical Computation with Homological Product Codes","version":1},"cited_work":{"arxiv_id":"2407.18490","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2407.18490","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Fast and parallelizable logical computation with homological product codes","venue":null,"work_id":"3e8d304f-551e-46bf-9c5f-87459b97498d","year":2024},"citing_paper":{"arxiv_id":"2411.11822","last_updated":"2025-06-09T18:38:48Z","snapshot_observed_at":"2026-07-30T00:06:09.372286Z","submitted_at":"2024-11-18T18:39:23Z","title":"Fault-tolerant quantum computation with a neutral atom processor","version":3},"reference_index":64,"source":"arxiv_source","source_observed_at":"2026-05-15T22:35:21.945479Z"},"links":{"cited_paper":"/paper/2407.18490","citing_paper":"/paper/2411.11822"},"observation_digest":"sha256:62dd6f29bd0f76aaf0701f7b0362fc70567e489f402cef2f29e2f428c429e5bc","observation_id":"a23bf265-05a7-4c38-95c0-9db763dcc788","resolution":{"observed_at":"2026-05-15T22:35:22.304155Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2407.18490","last_updated":"2024-07-26T03:49:59Z","snapshot_observed_at":"2026-08-08T07:57:33.971503Z","submitted_at":"2024-07-26T03:49:59Z","title":"Fast and Parallelizable Logical Computation with Homological Product Codes","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2407.18490","snapshot_observed_at":"2026-08-06T15:54:34.664293Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2507.15056","last_updated":"2025-07-20T17:35:31Z","snapshot_observed_at":"2026-08-09T06:26:44.387326Z","submitted_at":"2025-07-20T17:35:31Z","title":"Transversal non-Clifford gates on qLDPC codes breaking the $\\sqrt{N}$ distance barrier and quantum-inspired geometry with $\\mathbb{Z}_2$ systolic freedom","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-06T15:54:34.664293Z"},"links":{"cited_paper":"/paper/2407.18490","citing_paper":"/paper/2507.15056"},"observation_digest":"sha256:c1fb15570109fb514c81bc0e9db8f16c05059091cfa903cbf9d2dc9ac7e0a854","observation_id":"1a0a771e-6c9e-4fa5-83d6-35fb4421057d","resolution":{"observed_at":"2026-08-06T15:54:34.664293Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2407.18490","last_updated":"2024-07-26T03:49:59Z","snapshot_observed_at":"2026-08-08T07:57:33.971503Z","submitted_at":"2024-07-26T03:49:59Z","title":"Fast and Parallelizable Logical Computation with Homological Product Codes","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2407.18490","snapshot_observed_at":"2026-08-05T23:50:18.474137Z","title":"Pablo Bonilla Ataides, Mikhail D","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2508.04794","last_updated":"2025-08-06T18:10:37Z","snapshot_observed_at":"2026-08-06T07:25:20.927061Z","submitted_at":"2025-08-06T18:10:37Z","title":"Automorphism gadgets in homological product codes","version":1},"reference_index":92,"source":"arxiv_source","source_observed_at":"2026-08-05T23:50:18.474137Z"},"links":{"cited_paper":"/paper/2407.18490","citing_paper":"/paper/2508.04794"},"observation_digest":"sha256:16be5d76fe360785963dc04cb6031e5e0569f6a6d62da2aff808d8a35872da1f","observation_id":"60f22378-0043-43f8-9e83-b698f5b03e1f","resolution":{"observed_at":"2026-08-05T23:50:18.474137Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2407.18490","last_updated":"2024-07-26T03:49:59Z","snapshot_observed_at":"2026-08-08T07:57:33.971503Z","submitted_at":"2024-07-26T03:49:59Z","title":"Fast and Parallelizable Logical Computation with Homological Product Codes","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2407.18490","snapshot_observed_at":"2026-08-05T23:50:30.221922Z","title":"Pablo Bonilla Ataides, Mikhail D","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2508.04796","last_updated":"2026-07-02T23:06:55Z","snapshot_observed_at":"2026-08-06T12:35:36.047653Z","submitted_at":"2025-08-06T18:14:43Z","title":"Parity-Aware Byte-Pair Encoding: Improving Cross-lingual Fairness in Tokenization","version":3},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-05T23:50:30.221922Z"},"links":{"cited_paper":"/paper/2407.18490","citing_paper":"/paper/2508.04796"},"observation_digest":"sha256:08e119d5cb98c81fec32682b809589ccfeb733555bc0609baa7744bd9aa74ec3","observation_id":"1d4bafd9-6f3d-4e67-9d09-0322337237d4","resolution":{"observed_at":"2026-08-05T23:50:30.221922Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2407.18490","last_updated":"2024-07-26T03:49:59Z","snapshot_observed_at":"2026-08-08T07:57:33.971503Z","submitted_at":"2024-07-26T03:49:59Z","title":"Fast and Parallelizable Logical Computation with Homological Product Codes","version":1},"cited_work":{"arxiv_id":"2407.18490","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2407.18490","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Fast and parallelizable logical computation with homological product codes","venue":null,"work_id":"3e8d304f-551e-46bf-9c5f-87459b97498d","year":2024},"citing_paper":{"arxiv_id":"2510.19928","last_updated":"2026-05-21T06:22:22Z","snapshot_observed_at":"2026-07-06T22:33:48.680749Z","submitted_at":"2025-10-22T18:00:19Z","title":"Mind the gaps: The fraught road to quantum advantage","version":2},"reference_index":92,"source":"pdf_text","source_observed_at":"2026-05-18T01:51:39.522057Z"},"links":{"cited_paper":"/paper/2407.18490","citing_paper":"/paper/2510.19928"},"observation_digest":"sha256:25f0a7ebafc86bff013a7f9cbfff04bcb7d1d66c7839c04fbfdcaaef6446eba1","observation_id":"423aea0d-e367-4a39-9ece-efa4c8d8e2e3","resolution":{"observed_at":"2026-05-18T01:51:39.737263Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2407.18490","last_updated":"2024-07-26T03:49:59Z","snapshot_observed_at":"2026-08-08T07:57:33.971503Z","submitted_at":"2024-07-26T03:49:59Z","title":"Fast and Parallelizable Logical Computation with Homological Product Codes","version":1},"cited_work":{"arxiv_id":"2407.18490","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2407.18490","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Fast and parallelizable logical computation with homological product codes","venue":null,"work_id":"3e8d304f-551e-46bf-9c5f-87459b97498d","year":2024},"citing_paper":{"arxiv_id":"2510.19928","last_updated":"2026-05-21T06:22:22Z","snapshot_observed_at":"2026-07-06T22:33:48.680749Z","submitted_at":"2025-10-22T18:00:19Z","title":"Mind the gaps: The fraught road to quantum advantage","version":3},"reference_index":92,"source":"pdf_text","source_observed_at":"2026-05-22T13:08:57.425184Z"},"links":{"cited_paper":"/paper/2407.18490","citing_paper":"/paper/2510.19928"},"observation_digest":"sha256:d824a1e546cd71568140ff6fe793157831a01419c1c3eb4aa24af43fd0522ff5","observation_id":"49d3a860-1c5c-4841-b09d-9ec954425648","resolution":{"observed_at":"2026-05-22T13:11:34.975230Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2407.18490","last_updated":"2024-07-26T03:49:59Z","snapshot_observed_at":"2026-08-08T07:57:33.971503Z","submitted_at":"2024-07-26T03:49:59Z","title":"Fast and Parallelizable Logical Computation with Homological Product Codes","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2407.18490","snapshot_observed_at":"2026-08-03T08:00:03.768737Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2601.18879","last_updated":"2026-05-24T01:40:16Z","snapshot_observed_at":"2026-08-03T11:12:49.778747Z","submitted_at":"2026-01-26T19:00:03Z","title":"Multivariate Multicycle Codes for Complete Single-Shot Decoding","version":2},"reference_index":59,"source":"pdf_text","source_observed_at":"2026-08-03T08:00:03.768737Z"},"links":{"cited_paper":"/paper/2407.18490","citing_paper":"/paper/2601.18879"},"observation_digest":"sha256:bfb38d69e3cd1fd60a868970838532a78e82bcb02286334ba6016350598536f9","observation_id":"2e444706-428e-4ccb-a814-fb2c6dbd8b80","resolution":{"observed_at":"2026-08-03T08:00:03.768737Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2407.18490","last_updated":"2024-07-26T03:49:59Z","snapshot_observed_at":"2026-08-08T07:57:33.971503Z","submitted_at":"2024-07-26T03:49:59Z","title":"Fast and Parallelizable Logical Computation with Homological Product Codes","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2407.18490","snapshot_observed_at":"2026-08-04T06:19:55.019960Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2601.22489","last_updated":"2026-08-03T13:05:46Z","snapshot_observed_at":"2026-08-08T02:39:12.520609Z","submitted_at":"2026-01-30T02:59:06Z","title":"Native Non-Clifford Gates in Quantum LDPC Codes: Conditions, Synthesis, and Scaling Limits","version":2},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-04T06:19:55.019960Z"},"links":{"cited_paper":"/paper/2407.18490","citing_paper":"/paper/2601.22489"},"observation_digest":"sha256:e8c16a96dfa22c971198a843bddef26cb88669408b70114d7169d7b307af5272","observation_id":"d572f983-6f09-42bf-9edc-d972857ae567","resolution":{"observed_at":"2026-08-04T06:19:55.019960Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2407.18490","last_updated":"2024-07-26T03:49:59Z","snapshot_observed_at":"2026-08-08T07:57:33.971503Z","submitted_at":"2024-07-26T03:49:59Z","title":"Fast and Parallelizable Logical Computation with Homological Product Codes","version":1},"cited_work":{"arxiv_id":"2407.18490","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2407.18490","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Fast and parallelizable logical computation with homological product codes","venue":null,"work_id":"3e8d304f-551e-46bf-9c5f-87459b97498d","year":2024},"citing_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},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-05-16T04:35:01.771387Z"},"links":{"cited_paper":"/paper/2407.18490","citing_paper":"/paper/2603.28627"},"observation_digest":"sha256:173c1d7b2840826a3eca3c145b136f2196de2ec050834bfd0557c1be542ebc07","observation_id":"6a9cc5af-861a-407a-8501-74454062f9a6","resolution":{"observed_at":"2026-05-16T04:35:01.914972Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2407.18490","last_updated":"2024-07-26T03:49:59Z","snapshot_observed_at":"2026-08-08T07:57:33.971503Z","submitted_at":"2024-07-26T03:49:59Z","title":"Fast and Parallelizable Logical Computation with Homological Product Codes","version":1},"cited_work":{"arxiv_id":"2407.18490","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2407.18490","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Fast and parallelizable logical computation with homological product codes","venue":null,"work_id":"3e8d304f-551e-46bf-9c5f-87459b97498d","year":2024},"citing_paper":{"arxiv_id":"2604.05126","last_updated":"2026-04-06T19:40:46Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2026-04-06T19:40:46Z","title":"In-Situ Simultaneous Magic State Injection on Arbitrary CSS qLDPC Codes","version":1},"reference_index":68,"source":"pdf_text","source_observed_at":"2026-05-10T18:57:36.013957Z"},"links":{"cited_paper":"/paper/2407.18490","citing_paper":"/paper/2604.05126"},"observation_digest":"sha256:526b09930a8f157ed9eca2c78f372a6cf1e66abb83a232a473b91a59a912e8cd","observation_id":"cf5d6580-7a84-461d-993a-1c8a9b4ae3d1","resolution":{"observed_at":"2026-05-10T23:40:51.111474Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2407.18490","last_updated":"2024-07-26T03:49:59Z","snapshot_observed_at":"2026-08-08T07:57:33.971503Z","submitted_at":"2024-07-26T03:49:59Z","title":"Fast and Parallelizable Logical Computation with Homological Product Codes","version":1},"cited_work":{"arxiv_id":"2407.18490","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2407.18490","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Fast and parallelizable logical computation with homological product codes","venue":null,"work_id":"3e8d304f-551e-46bf-9c5f-87459b97498d","year":2024},"citing_paper":{"arxiv_id":"2604.24739","last_updated":"2026-04-28T14:34:00Z","snapshot_observed_at":"2026-08-05T21:18:05.310044Z","submitted_at":"2026-04-27T17:44:08Z","title":"CAbLECAR: efficiently scheduling QLDPC codes on a tileable spin qubit chip with shuttling","version":2},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-05-08T04:04:28.994266Z"},"links":{"cited_paper":"/paper/2407.18490","citing_paper":"/paper/2604.24739"},"observation_digest":"sha256:add406d2b46ad999b21ee3af9c7f55bb949b1d56e45ed6d49a0171a9a598a50d","observation_id":"59b36fd9-d5fb-4d31-9623-bcaf91159534","resolution":{"observed_at":"2026-05-11T21:51:28.410722Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2407.18490","last_updated":"2024-07-26T03:49:59Z","snapshot_observed_at":"2026-08-08T07:57:33.971503Z","submitted_at":"2024-07-26T03:49:59Z","title":"Fast and Parallelizable Logical Computation with Homological Product Codes","version":1},"cited_work":{"arxiv_id":"2407.18490","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2407.18490","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Fast and parallelizable logical computation with homological product codes","venue":null,"work_id":"3e8d304f-551e-46bf-9c5f-87459b97498d","year":2024},"citing_paper":{"arxiv_id":"2605.15297","last_updated":"2026-05-14T18:11:04Z","snapshot_observed_at":"2026-07-06T23:26:37.362117Z","submitted_at":"2026-05-14T18:11:04Z","title":"Towards Deploying Optimistic Quantum Fourier Transforms: An Architecture-Algorithm Co-Design Study","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-05-19T16:06:33.998019Z"},"links":{"cited_paper":"/paper/2407.18490","citing_paper":"/paper/2605.15297"},"observation_digest":"sha256:82c53693768c6b53edf165e748ff4ef92d45a58f33a8b844da2e5fee2de0f426","observation_id":"ed26dd1b-0544-4aad-888d-bf6242243e0d","resolution":{"observed_at":"2026-05-19T16:07:40.969513Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2407.18490","last_updated":"2024-07-26T03:49:59Z","snapshot_observed_at":"2026-08-08T07:57:33.971503Z","submitted_at":"2024-07-26T03:49:59Z","title":"Fast and Parallelizable Logical Computation with Homological Product Codes","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2407.18490","snapshot_observed_at":"2026-07-11T07:07:39.359688Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.05386","last_updated":"2026-07-09T17:58:26Z","snapshot_observed_at":"2026-08-08T13:08:36.166528Z","submitted_at":"2026-07-06T17:56:55Z","title":"Logical Spectroscopy: Lifted-Product Codes with Addressable Bases","version":2},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-07-11T07:07:39.359688Z"},"links":{"cited_paper":"/paper/2407.18490","citing_paper":"/paper/2607.05386"},"observation_digest":"sha256:d0efd4baa5dc041e81d6c995a7f752ba097a6cbd070fa280bc801491f700f560","observation_id":"1add3362-5d82-4895-94f0-03d0125f2e7e","resolution":{"observed_at":"2026-07-11T07:07:39.359688Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2407.18490/citation-record","integrity":"/paper/2407.18490/integrity","json":"/paper/2407.18490/citation-record.json","paper":"/paper/2407.18490"},"outbound":[],"paper":{"arxiv_id":"2407.18490","last_updated":"2024-07-26T03:49:59Z","latest_version":1,"primary_category":"quant-ph","snapshot_observed_at":"2026-08-08T07:57:33.971503Z","submitted_at":"2024-07-26T03:49:59Z","title":"Fast and Parallelizable Logical Computation with Homological Product Codes"},"reference_resolution":{"displayed":0,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":0,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":0},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"thesis":"As of 9 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 13 inbound Pith citation observations for arXiv:2407.18490."}