{"as_of":"2026-08-12T18:42:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:4f234f29517abc8c09df13a025a73f2774f5cd950b355e3e95b53f25dcd721ca","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-12T06:34:41.77262+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-12T04:28:05.752902Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-07-04T01:09:19.004171Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2407.03973","last_updated":"2024-07-04T14:49:35Z","snapshot_observed_at":"2026-07-06T18:41:35.995594Z","submitted_at":"2024-07-04T14:49:35Z","title":"Logical Operators and Fold-Transversal Gates of Bivariate Bicycle Codes","version":1},"cited_work":{"arxiv_id":"2407.03973","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2407.03973","snapshot_observed_at":"2026-07-04T01:09:19.004171Z","title":"arXiv preprint arXiv:2407.03973 (2024)","venue":null,"work_id":"10935e8b-f65d-4dac-a0dc-7c675f6cc09b","year":2024},"citing_paper":{"arxiv_id":"2410.11942","last_updated":"2026-05-11T04:48:38Z","snapshot_observed_at":"2026-07-06T19:34:05.643989Z","submitted_at":"2024-10-15T18:00:00Z","title":"Operator algebra and algorithmic construction of boundaries and defects in (2+1)D topological Pauli stabilizer codes","version":5},"reference_index":115,"source":"pdf_text","source_observed_at":"2026-05-23T18:41:14.926900Z"},"links":{"cited_paper":"/paper/2407.03973","citing_paper":"/paper/2410.11942"},"observation_digest":"sha256:8a65c23762702f388bf1118067e39066e9f9d4eeb6cb2b69fbac3dec7aeeebd9","observation_id":"130fcf92-3c4e-4f78-a347-b21a1e7e1e06","resolution":{"observed_at":"2026-05-23T18:43:19.022807Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2407.03973","last_updated":"2024-07-04T14:49:35Z","snapshot_observed_at":"2026-07-06T18:41:35.995594Z","submitted_at":"2024-07-04T14:49:35Z","title":"Logical Operators and Fold-Transversal Gates of Bivariate Bicycle Codes","version":1},"cited_work":{"arxiv_id":"2407.03973","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2407.03973","snapshot_observed_at":"2026-07-04T01:09:19.004171Z","title":"arXiv preprint arXiv:2407.03973 (2024)","venue":null,"work_id":"10935e8b-f65d-4dac-a0dc-7c675f6cc09b","year":2024},"citing_paper":{"arxiv_id":"2410.16250","last_updated":"2025-12-27T21:52:26Z","snapshot_observed_at":"2026-08-02T07:46:23.650899Z","submitted_at":"2024-10-21T17:53:17Z","title":"Cups and Gates I: Cohomology invariants and logical quantum operations","version":2},"reference_index":70,"source":"pdf_text","source_observed_at":"2026-05-23T18:30:24.895557Z"},"links":{"cited_paper":"/paper/2407.03973","citing_paper":"/paper/2410.16250"},"observation_digest":"sha256:9a0f26f7286ef2d394f9c4f199d63537ba79d369ae88f9c1a1b8176fac1d7a5c","observation_id":"d747cf19-fadd-4bda-a76d-c05dcbb052e5","resolution":{"observed_at":"2026-05-23T18:33:19.769026Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2407.03973","last_updated":"2024-07-04T14:49:35Z","snapshot_observed_at":"2026-07-06T18:41:35.995594Z","submitted_at":"2024-07-04T14:49:35Z","title":"Logical Operators and Fold-Transversal Gates of Bivariate Bicycle Codes","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2407.03973","snapshot_observed_at":"2026-08-12T04:28:05.752902Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2412.01391","last_updated":"2024-12-02T11:24:46Z","snapshot_observed_at":"2026-08-12T04:22:29.409168Z","submitted_at":"2024-12-02T11:24:46Z","title":"Transversal Logical Clifford gates on rotated surface codes with reconfigurable neutral atom arrays","version":1},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-12T04:28:05.752902Z"},"links":{"cited_paper":"/paper/2407.03973","citing_paper":"/paper/2412.01391"},"observation_digest":"sha256:5e8839282e1c1a745450f4d4b62b148297f120ec683cf7c33639a37185f3d7cd","observation_id":"68019cce-2190-4bd0-8de0-b277a08be9bc","resolution":{"observed_at":"2026-08-12T04:28:05.752902Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2407.03973","last_updated":"2024-07-04T14:49:35Z","snapshot_observed_at":"2026-07-06T18:41:35.995594Z","submitted_at":"2024-07-04T14:49:35Z","title":"Logical Operators and Fold-Transversal Gates of Bivariate Bicycle Codes","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2407.03973","snapshot_observed_at":"2026-08-09T14:26:19.400174Z","title":"Logical Operators and Fold-Transversal Gates of Bivariate Bicycle Codes","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2502.01864","last_updated":"2025-07-07T18:47:26Z","snapshot_observed_at":"2026-08-12T09:22:31.759256Z","submitted_at":"2025-02-03T22:24:34Z","title":"Quantum Codes with Addressable and Transversal Non-Clifford Gates","version":3},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-08-09T14:26:19.400174Z"},"links":{"cited_paper":"/paper/2407.03973","citing_paper":"/paper/2502.01864"},"observation_digest":"sha256:7a029f1a83f1967fd94892b4ecd86521295e2b3500c6ac3a4018cd13a992455c","observation_id":"f985872f-4164-4cac-a02e-a914e158d01a","resolution":{"observed_at":"2026-08-09T14:26:19.400174Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2407.03973","last_updated":"2024-07-04T14:49:35Z","snapshot_observed_at":"2026-07-06T18:41:35.995594Z","submitted_at":"2024-07-04T14:49:35Z","title":"Logical Operators and Fold-Transversal Gates of Bivariate Bicycle Codes","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2407.03973","snapshot_observed_at":"2026-08-04T15:51:50.409493Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2509.18294","last_updated":"2026-05-29T17:17:12Z","snapshot_observed_at":"2026-08-04T15:50:28.664459Z","submitted_at":"2025-09-22T18:23:28Z","title":"Transversal architecture for megaquop-scale quantum simulation with neutral atoms","version":2},"reference_index":57,"source":"pdf_text","source_observed_at":"2026-08-04T15:51:50.409493Z"},"links":{"cited_paper":"/paper/2407.03973","citing_paper":"/paper/2509.18294"},"observation_digest":"sha256:83db25a018b43c923f0b8c63a594a8d8065976a32defcc3e130cefea3abf556a","observation_id":"5081b7de-a7fe-4363-828d-1149aa80d77e","resolution":{"observed_at":"2026-08-04T15:51:50.409493Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2407.03973","last_updated":"2024-07-04T14:49:35Z","snapshot_observed_at":"2026-07-06T18:41:35.995594Z","submitted_at":"2024-07-04T14:49:35Z","title":"Logical Operators and Fold-Transversal Gates of Bivariate Bicycle Codes","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2407.03973","snapshot_observed_at":"2026-08-03T08:00:03.618081Z","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":31,"source":"pdf_text","source_observed_at":"2026-08-03T08:00:03.618081Z"},"links":{"cited_paper":"/paper/2407.03973","citing_paper":"/paper/2601.18879"},"observation_digest":"sha256:8cd235df3d07251dbc085ce62306ff3ee8d3e967992c1debc36c66fb89c2f29e","observation_id":"988ebd76-c5f6-4711-b6ab-ac831e6419ce","resolution":{"observed_at":"2026-08-03T08:00:03.618081Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2407.03973","last_updated":"2024-07-04T14:49:35Z","snapshot_observed_at":"2026-07-06T18:41:35.995594Z","submitted_at":"2024-07-04T14:49:35Z","title":"Logical Operators and Fold-Transversal Gates of Bivariate Bicycle Codes","version":1},"cited_work":{"arxiv_id":"2407.03973","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2407.03973","snapshot_observed_at":"2026-07-04T01:09:19.004171Z","title":"arXiv preprint arXiv:2407.03973 (2024)","venue":null,"work_id":"10935e8b-f65d-4dac-a0dc-7c675f6cc09b","year":2024},"citing_paper":{"arxiv_id":"2604.19481","last_updated":"2026-04-21T14:02:12Z","snapshot_observed_at":"2026-08-02T05:59:04.891529Z","submitted_at":"2026-04-21T14:02:12Z","title":"Fault-Tolerant Quantum Computing with Trapped Ions: The Walking Cat Architecture","version":1},"reference_index":171,"source":"pdf_text","source_observed_at":"2026-05-10T02:15:19.433368Z"},"links":{"cited_paper":"/paper/2407.03973","citing_paper":"/paper/2604.19481"},"observation_digest":"sha256:04cd05780f6b12fe2916a5d1f8344f5d63603276a67cd9c16fddd15bd5f3574e","observation_id":"2a94e46a-02a8-41c5-a87d-9f06d58a2a06","resolution":{"observed_at":"2026-05-11T13:11:04.978934Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2407.03973","last_updated":"2024-07-04T14:49:35Z","snapshot_observed_at":"2026-07-06T18:41:35.995594Z","submitted_at":"2024-07-04T14:49:35Z","title":"Logical Operators and Fold-Transversal Gates of Bivariate Bicycle Codes","version":1},"cited_work":{"arxiv_id":"2407.03973","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2407.03973","snapshot_observed_at":"2026-07-04T01:09:19.004171Z","title":"arXiv preprint arXiv:2407.03973 (2024)","venue":null,"work_id":"10935e8b-f65d-4dac-a0dc-7c675f6cc09b","year":2024},"citing_paper":{"arxiv_id":"2606.05044","last_updated":"2026-06-03T16:05:40Z","snapshot_observed_at":"2026-07-06T23:45:02.342193Z","submitted_at":"2026-06-03T16:05:40Z","title":"Generalized Bicycle Codes as Cyclic Submodules and their Automorphism Structure","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-06-28T05:41:01.009335Z"},"links":{"cited_paper":"/paper/2407.03973","citing_paper":"/paper/2606.05044"},"observation_digest":"sha256:e0b2cd1c2ab716c6c209696dcec52e93ba2e96bf88bbc676bacf773161b5b413","observation_id":"2598ed66-cfbb-4279-91cd-c5ada7d5875b","resolution":{"observed_at":"2026-07-02T09:06:49.036469Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2407.03973","last_updated":"2024-07-04T14:49:35Z","snapshot_observed_at":"2026-07-06T18:41:35.995594Z","submitted_at":"2024-07-04T14:49:35Z","title":"Logical Operators and Fold-Transversal Gates of Bivariate Bicycle Codes","version":1},"cited_work":{"arxiv_id":"2407.03973","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2407.03973","snapshot_observed_at":"2026-07-04T01:09:19.004171Z","title":"arXiv preprint arXiv:2407.03973 (2024)","venue":null,"work_id":"10935e8b-f65d-4dac-a0dc-7c675f6cc09b","year":2024},"citing_paper":{"arxiv_id":"2606.08771","last_updated":"2026-06-07T18:24:32Z","snapshot_observed_at":"2026-08-06T09:02:52.510978Z","submitted_at":"2026-06-07T18:24:32Z","title":"Algebra of Bivariate-Bicycle Surface Codes","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-06-27T18:17:06.305544Z"},"links":{"cited_paper":"/paper/2407.03973","citing_paper":"/paper/2606.08771"},"observation_digest":"sha256:4859ee81e2800df56d3a232fbf80b080ecaad671bf879fd8cfd2776d3fe589b1","observation_id":"c11125e5-2807-40b5-b51e-9f626e99b88e","resolution":{"observed_at":"2026-07-02T23:17:28.366924Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2407.03973","last_updated":"2024-07-04T14:49:35Z","snapshot_observed_at":"2026-07-06T18:41:35.995594Z","submitted_at":"2024-07-04T14:49:35Z","title":"Logical Operators and Fold-Transversal Gates of Bivariate Bicycle Codes","version":1},"cited_work":{"arxiv_id":"2407.03973","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2407.03973","snapshot_observed_at":"2026-07-04T01:09:19.004171Z","title":"arXiv preprint arXiv:2407.03973 (2024)","venue":null,"work_id":"10935e8b-f65d-4dac-a0dc-7c675f6cc09b","year":2024},"citing_paper":{"arxiv_id":"2606.19482","last_updated":"2026-06-17T18:14:23Z","snapshot_observed_at":"2026-08-12T18:37:23.261410Z","submitted_at":"2026-06-17T18:14:23Z","title":"Nearest-neighbour gates are all you need: High-rate quantum low-density parity-check codes on a planar grid","version":1},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-06-26T20:39:48.535777Z"},"links":{"cited_paper":"/paper/2407.03973","citing_paper":"/paper/2606.19482"},"observation_digest":"sha256:d82161c9dbb3c99a10ac57cb50691f4a1604c397f759f7b99a21f1e07cae9d37","observation_id":"667a7864-8e91-444e-97f5-10d1aa551337","resolution":{"observed_at":"2026-07-04T01:09:19.005996Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2407.03973","last_updated":"2024-07-04T14:49:35Z","snapshot_observed_at":"2026-07-06T18:41:35.995594Z","submitted_at":"2024-07-04T14:49:35Z","title":"Logical Operators and Fold-Transversal Gates of Bivariate Bicycle Codes","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2407.03973","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":62,"source":"pdf_text","source_observed_at":"2026-07-11T07:07:39.359688Z"},"links":{"cited_paper":"/paper/2407.03973","citing_paper":"/paper/2607.05386"},"observation_digest":"sha256:3e8718e538926bb0d79c841ef66920e3915bb13178f29e7e0807c87ae4e24424","observation_id":"27f22dbb-44d6-443b-a533-6ee8d9a18abd","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"}},{"citation":{"cited_paper":{"arxiv_id":"2407.03973","last_updated":"2024-07-04T14:49:35Z","snapshot_observed_at":"2026-07-06T18:41:35.995594Z","submitted_at":"2024-07-04T14:49:35Z","title":"Logical Operators and Fold-Transversal Gates of Bivariate Bicycle Codes","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2407.03973","snapshot_observed_at":"2026-07-31T02:25:48.789334Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.28605","last_updated":"2026-07-30T17:55:34Z","snapshot_observed_at":"2026-08-07T03:20:21.577604Z","submitted_at":"2026-07-30T17:55:34Z","title":"Logical computation with canonical lifted product codes","version":1},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-07-31T02:25:48.789334Z"},"links":{"cited_paper":"/paper/2407.03973","citing_paper":"/paper/2607.28605"},"observation_digest":"sha256:bf46b4329cac8b84efa8af082ace994c8c7cecf3a948d3ee773018c894914240","observation_id":"1cb69169-e03f-43d0-abd9-5ebb61c08ee5","resolution":{"observed_at":"2026-07-31T02:25:48.789334Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2407.03973","last_updated":"2024-07-04T14:49:35Z","snapshot_observed_at":"2026-07-06T18:41:35.995594Z","submitted_at":"2024-07-04T14:49:35Z","title":"Logical Operators and Fold-Transversal Gates of Bivariate Bicycle Codes","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2407.03973","snapshot_observed_at":"2026-08-11T23:22:37.622835Z","title":"Logical operators and fold-transversal gates of bivariate bicycle codes,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2608.09115","last_updated":"2026-08-10T04:45:08Z","snapshot_observed_at":"2026-08-12T18:16:59.526386Z","submitted_at":"2026-08-10T04:45:08Z","title":"Quantum Bicycle LDPC Codes with High $kd^2/n$ from Divisor-Driven Search","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-11T23:22:37.622835Z"},"links":{"cited_paper":"/paper/2407.03973","citing_paper":"/paper/2608.09115"},"observation_digest":"sha256:8f86bb00447d0fe17df6267fcd91c018514ae8e128e9bd79959956a7752d2e86","observation_id":"a351a300-d52c-4e50-b70c-fa9d921b40e1","resolution":{"observed_at":"2026-08-11T23:22:37.622835Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2407.03973/citation-record","integrity":"/paper/2407.03973/integrity","json":"/paper/2407.03973/citation-record.json","paper":"/paper/2407.03973"},"outbound":[],"paper":{"arxiv_id":"2407.03973","last_updated":"2024-07-04T14:49:35Z","latest_version":1,"primary_category":"quant-ph","snapshot_observed_at":"2026-07-06T18:41:35.995594Z","submitted_at":"2024-07-04T14:49:35Z","title":"Logical Operators and Fold-Transversal Gates of Bivariate Bicycle Codes"},"reference_resolution":{"displayed":0,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":0,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":0},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"thesis":"As of 12 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 13 inbound Pith citation observations for arXiv:2407.03973."}