{"as_of":"2026-08-13T11:57:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:8c769efc758a1d1a6a11c955ea05d396097c28048c188b07bb1bfa8808861be2","coverage":[{"denominator":20,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":20,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-10T10:48:18.789944Z","state":"measured"},{"denominator":22,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":22,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-13T06:32:02.005865+00:00","state":"measured"},{"denominator":2,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":2,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-09T15:28:21.297298Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"pith","source_observed_at":"2026-08-06T21:27:49.180732Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2501.16802","last_updated":"2025-08-01T13:45:21Z","snapshot_observed_at":"2026-08-10T17:07:30.245069Z","submitted_at":"2025-01-28T09:05:49Z","title":"Ancilla-free Quantum Adder with Sublinear Depth","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2501.16802","snapshot_observed_at":"2026-08-09T15:28:21.297298Z","title":"and Vandaele, V","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2502.01433","last_updated":"2025-02-11T15:37:27Z","snapshot_observed_at":"2026-08-09T21:41:34.297330Z","submitted_at":"2025-02-03T15:16:11Z","title":"On Exact Space-Depth Trade-Offs in Multi-Controlled Toffoli Decomposition","version":3},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-09T15:28:21.297298Z"},"links":{"cited_paper":"/paper/2501.16802","citing_paper":"/paper/2502.01433"},"observation_digest":"sha256:fca24a7c900b7622ce40b4b0b774d1151addba7a95ad85ff937ee80d96203686","observation_id":"bb9df713-a76f-4a6b-b3fb-d426aed488ce","resolution":{"observed_at":"2026-08-09T15:28:21.297298Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2501.16802","last_updated":"2025-08-01T13:45:21Z","snapshot_observed_at":"2026-08-10T17:07:30.245069Z","submitted_at":"2025-01-28T09:05:49Z","title":"Ancilla-free Quantum Adder with Sublinear Depth","version":2},"cited_work":{"arxiv_id":"2501.16802","doi":null,"metadata_source":"pith","pith_arxiv_id":"2501.16802","snapshot_observed_at":"2026-08-06T21:27:49.180732Z","title":"Ancilla-free Quantum Adder with Sublinear Depth","venue":"quant-ph","work_id":"3d27d13a-8b13-4790-acdd-ad152e86d0a2","year":2025},"citing_paper":{"arxiv_id":"2507.00400","last_updated":"2025-08-11T18:46:43Z","snapshot_observed_at":"2026-08-13T04:41:26.916409Z","submitted_at":"2025-07-01T03:30:39Z","title":"Logarithmic Depth Decomposition of Approximate Multi-Controlled Single-Qubit Gates Without Ancilla Qubits","version":2},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-06T21:27:49.103839Z"},"links":{"cited_paper":"/paper/2501.16802","citing_paper":"/paper/2507.00400"},"observation_digest":"sha256:8910bb705d0f81f113202a7bfeb13a2613c832c10a222f05f864fbcc0617af2a","observation_id":"90ee071b-7749-44f3-a9cd-1deb129d480b","resolution":{"observed_at":"2026-08-06T21:27:49.187188Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2501.16802/citation-record","integrity":"/paper/2501.16802/integrity","json":"/paper/2501.16802/citation-record.json","paper":"/paper/2501.16802"},"outbound":[{"citation":{"cited_paper":{"arxiv_id":"2402.05053","last_updated":"2024-02-07T17:53:21Z","snapshot_observed_at":"2026-08-13T04:24:03.514749Z","submitted_at":"2024-02-07T17:53:21Z","title":"Quantum circuit for multi-qubit Toffoli gate with optimal resource","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.05053","snapshot_observed_at":"2026-08-10T10:48:18.741663Z","title":"Quantum circuit for multi-qubit toffoli gate with optimal resource","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2501.16802","last_updated":"2025-08-01T13:45:21Z","snapshot_observed_at":"2026-08-10T17:07:30.245069Z","submitted_at":"2025-01-28T09:05:49Z","title":"Ancilla-free Quantum Adder with Sublinear Depth","version":2},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-10T10:48:18.741663Z"},"links":{"cited_paper":"/paper/2402.05053","citing_paper":"/paper/2501.16802"},"observation_digest":"sha256:4b04e4461d8e316929b4b4ea3b5b2e7e017baa6b5c01bd2761d7531a0cb3ca82","observation_id":"14fa0b11-39b9-41bf-92e3-f5898c97103f","resolution":{"observed_at":"2026-08-10T10:48:18.741663Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2407.17966","last_updated":"2025-05-20T02:51:14Z","snapshot_observed_at":"2026-08-12T23:14:57.280900Z","submitted_at":"2024-07-25T11:38:04Z","title":"Rise of conditionally clean ancillae for efficient quantum circuit constructions","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2407.17966","snapshot_observed_at":"2026-08-10T10:48:18.745529Z","title":"Rise of conditionally clean ancillae for optimizing quantum circuits","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2501.16802","last_updated":"2025-08-01T13:45:21Z","snapshot_observed_at":"2026-08-10T17:07:30.245069Z","submitted_at":"2025-01-28T09:05:49Z","title":"Ancilla-free Quantum Adder with Sublinear Depth","version":2},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-10T10:48:18.745529Z"},"links":{"cited_paper":"/paper/2407.17966","citing_paper":"/paper/2501.16802"},"observation_digest":"sha256:8600eff2014e44002363e79c4267980cbcd0450c91bb15f98a7accc7fbb8cddb","observation_id":"53c79a20-7b82-4b2d-889c-53638d35f3f0","resolution":{"observed_at":"2026-08-10T10:48:18.745529Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T10:48:19.066456Z","title":"Polynomial-time algorithms for prime factorization and discrete loga- rithms on a quantum computer","venue":null,"work_id":"675cd0f9-ad3f-4ffe-8300-526893bb6900","year":1997},"citing_paper":{"arxiv_id":"2501.16802","last_updated":"2025-08-01T13:45:21Z","snapshot_observed_at":"2026-08-10T17:07:30.245069Z","submitted_at":"2025-01-28T09:05:49Z","title":"Ancilla-free Quantum Adder with Sublinear Depth","version":2},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-10T10:48:18.748490Z"},"links":{"citing_paper":"/paper/2501.16802"},"observation_digest":"sha256:20a512a7dc8c064a1779c68020914947585886d41d0e322d7f86d3c587d8243f","observation_id":"d9ae9f24-e58b-4345-abbc-d22a90cfe116","resolution":{"observed_at":"2026-08-10T10:48:19.068844Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T10:48:18.751099Z","title":"Quantum networks for elementary arithmetic operations","venue":null,"work_id":null,"year":1996},"citing_paper":{"arxiv_id":"2501.16802","last_updated":"2025-08-01T13:45:21Z","snapshot_observed_at":"2026-08-10T17:07:30.245069Z","submitted_at":"2025-01-28T09:05:49Z","title":"Ancilla-free Quantum Adder with Sublinear Depth","version":2},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-10T10:48:18.751099Z"},"links":{"citing_paper":"/paper/2501.16802"},"observation_digest":"sha256:6362667337fdf6aa4cea64708c74123d064ceab1f26aa9dc5372043d2de4cf83","observation_id":"4a277c3e-407e-4a20-9149-5c80a218d514","resolution":{"observed_at":"2026-08-10T10:48:18.751099Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T10:48:19.055826Z","title":"A quantum circuit for Shor’s factoring algorithm using 2n+2 qubits","venue":null,"work_id":"6746afb7-df71-4106-97e6-4053be8446f1","year":2006},"citing_paper":{"arxiv_id":"2501.16802","last_updated":"2025-08-01T13:45:21Z","snapshot_observed_at":"2026-08-10T17:07:30.245069Z","submitted_at":"2025-01-28T09:05:49Z","title":"Ancilla-free Quantum Adder with Sublinear Depth","version":2},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-10T10:48:18.753604Z"},"links":{"citing_paper":"/paper/2501.16802"},"observation_digest":"sha256:04f7facbbd03753545fda32005d749d279341266e96453ae8495db05b8d23d65","observation_id":"07297d13-4837-440f-9edc-020a418e8cc5","resolution":{"observed_at":"2026-08-10T10:48:19.058631Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1706.07884","last_updated":"2018-01-19T05:53:27Z","snapshot_observed_at":"2026-08-04T15:13:01.649286Z","submitted_at":"2017-06-23T23:36:09Z","title":"Factoring with n+2 clean qubits and n-1 dirty qubits","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1706.07884","snapshot_observed_at":"2026-08-10T10:48:18.756069Z","title":"Factoring with n+2 clean qubits and n-1 dirty qubits","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2501.16802","last_updated":"2025-08-01T13:45:21Z","snapshot_observed_at":"2026-08-10T17:07:30.245069Z","submitted_at":"2025-01-28T09:05:49Z","title":"Ancilla-free Quantum Adder with Sublinear Depth","version":2},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-10T10:48:18.756069Z"},"links":{"cited_paper":"/paper/1706.07884","citing_paper":"/paper/2501.16802"},"observation_digest":"sha256:2d413223c31a942b586e72706f78793d06c735971b059826adeec3a2ac0f1037","observation_id":"e1f2abdf-9049-46ae-93f9-7d4f0b422fe2","resolution":{"observed_at":"2026-08-10T10:48:18.756069Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"quant-ph/0406151","last_updated":"2004-06-21T20:54:57Z","snapshot_observed_at":"2026-08-08T05:46:40.814658Z","submitted_at":"2004-06-21T20:54:57Z","title":"A Subexponential Time Algorithm for the Dihedral Hidden Subgroup Problem with Polynomial Space","version":1},"cited_work":{"arxiv_id":"quant-ph/0406151","doi":null,"metadata_source":"pith","pith_arxiv_id":"quant-ph/0406151","snapshot_observed_at":"2026-08-10T10:48:18.954446Z","title":"A Subexponential Time Algorithm for the Dihedral Hidden Subgroup Problem with Polynomial Space","venue":"quant-ph","work_id":"eb4c688a-5925-4b32-aa2d-92c2a522c7e8","year":2004},"citing_paper":{"arxiv_id":"2501.16802","last_updated":"2025-08-01T13:45:21Z","snapshot_observed_at":"2026-08-10T17:07:30.245069Z","submitted_at":"2025-01-28T09:05:49Z","title":"Ancilla-free Quantum Adder with Sublinear Depth","version":2},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-10T10:48:18.759004Z"},"links":{"cited_paper":"/paper/quant-ph/0406151","citing_paper":"/paper/2501.16802"},"observation_digest":"sha256:fd9256fb00f418c219c58a090876cb136947b760d1c1bdf35310de7884a7550e","observation_id":"5439971c-8827-4454-a210-6024ce718689","resolution":{"observed_at":"2026-08-10T10:48:18.957099Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T10:48:19.048471Z","title":"Faster quantum chemistry simulation on fault-tolerant quantum computers","venue":null,"work_id":"73f4246c-9140-4d05-ac38-8a31bc3c731b","year":2012},"citing_paper":{"arxiv_id":"2501.16802","last_updated":"2025-08-01T13:45:21Z","snapshot_observed_at":"2026-08-10T17:07:30.245069Z","submitted_at":"2025-01-28T09:05:49Z","title":"Ancilla-free Quantum Adder with Sublinear Depth","version":2},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-10T10:48:18.761224Z"},"links":{"citing_paper":"/paper/2501.16802"},"observation_digest":"sha256:59fd7cb7096268299650865bd3b9c3c006057639153283f865d6e5e9c9d7ecc8","observation_id":"c802cd94-3d7b-440f-8e03-291289f9949e","resolution":{"observed_at":"2026-08-10T10:48:19.051328Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T10:48:19.041377Z","title":"A quantum deep convolutionalneuralnetworkforimagerecognition","venue":null,"work_id":"68428ddc-cc93-4d5f-a773-6e1d88e17d34","year":2020},"citing_paper":{"arxiv_id":"2501.16802","last_updated":"2025-08-01T13:45:21Z","snapshot_observed_at":"2026-08-10T17:07:30.245069Z","submitted_at":"2025-01-28T09:05:49Z","title":"Ancilla-free Quantum Adder with Sublinear Depth","version":2},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-10T10:48:18.763230Z"},"links":{"citing_paper":"/paper/2501.16802"},"observation_digest":"sha256:5db2076baa64bd2f23cf011f3f135a4a9b3ca8bad79af7f1d72a990d93580ee8","observation_id":"39c7ae31-aa6c-4b82-a853-a07837f4fedc","resolution":{"observed_at":"2026-08-10T10:48:19.044102Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T10:48:18.765281Z","title":"Addition on a quantum computer","venue":null,"work_id":null,"year":2000},"citing_paper":{"arxiv_id":"2501.16802","last_updated":"2025-08-01T13:45:21Z","snapshot_observed_at":"2026-08-10T17:07:30.245069Z","submitted_at":"2025-01-28T09:05:49Z","title":"Ancilla-free Quantum Adder with Sublinear Depth","version":2},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-10T10:48:18.765281Z"},"links":{"citing_paper":"/paper/2501.16802"},"observation_digest":"sha256:10ea461220757109d80931ba69afa21f7b1c2746a1e507a0f1a4d226d6d9ee33","observation_id":"631d3546-f017-4d38-b2da-26a262b21c19","resolution":{"observed_at":"2026-08-10T10:48:18.765281Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T10:48:19.033471Z","title":"Factoring using 2n + 2 qubits with toffoli based modular multiplication","venue":null,"work_id":"10e7c4bb-0a54-407a-b9a5-997ccdb5e389","year":2017},"citing_paper":{"arxiv_id":"2501.16802","last_updated":"2025-08-01T13:45:21Z","snapshot_observed_at":"2026-08-10T17:07:30.245069Z","submitted_at":"2025-01-28T09:05:49Z","title":"Ancilla-free Quantum Adder with Sublinear Depth","version":2},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-10T10:48:18.767375Z"},"links":{"citing_paper":"/paper/2501.16802"},"observation_digest":"sha256:5018b88099f50ac2c667749be45a402c541f7eca84d8d78d6ed8c5b3cc67dc8e","observation_id":"269f9a25-665b-4578-8238-6af0ace7d65f","resolution":{"observed_at":"2026-08-10T10:48:19.036167Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T10:48:19.026762Z","title":"A logarithmic-depth quantum carry-lookahead adder","venue":null,"work_id":"405662b1-1660-42a7-b38d-4d68a4a90593","year":2006},"citing_paper":{"arxiv_id":"2501.16802","last_updated":"2025-08-01T13:45:21Z","snapshot_observed_at":"2026-08-10T17:07:30.245069Z","submitted_at":"2025-01-28T09:05:49Z","title":"Ancilla-free Quantum Adder with Sublinear Depth","version":2},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-10T10:48:18.769461Z"},"links":{"citing_paper":"/paper/2501.16802"},"observation_digest":"sha256:196c3775138b096168787733ebf6fbe38977ea89785e6e78cfba95339146573e","observation_id":"58c9766c-cd77-48ef-be9b-7c1b73f5e510","resolution":{"observed_at":"2026-08-10T10:48:19.029104Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T10:48:19.020093Z","title":"A fast quantum circuit for addition with few qubits","venue":null,"work_id":"b539dccd-ce44-45e5-8d2a-9c9242ee1105","year":2008},"citing_paper":{"arxiv_id":"2501.16802","last_updated":"2025-08-01T13:45:21Z","snapshot_observed_at":"2026-08-10T17:07:30.245069Z","submitted_at":"2025-01-28T09:05:49Z","title":"Ancilla-free Quantum Adder with Sublinear Depth","version":2},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-10T10:48:18.771819Z"},"links":{"citing_paper":"/paper/2501.16802"},"observation_digest":"sha256:886d1487ac43439d184617ead49f64724657c1a830347145ca7bca6db23d0e07","observation_id":"8b800352-b55a-47a3-83a1-57782ca70951","resolution":{"observed_at":"2026-08-10T10:48:19.022563Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T10:48:19.012722Z","title":"Quantum addition circuits and unbounded fan-out","venue":null,"work_id":"325a6aef-7134-4a90-85dc-9a37c72e99e4","year":2010},"citing_paper":{"arxiv_id":"2501.16802","last_updated":"2025-08-01T13:45:21Z","snapshot_observed_at":"2026-08-10T17:07:30.245069Z","submitted_at":"2025-01-28T09:05:49Z","title":"Ancilla-free Quantum Adder with Sublinear Depth","version":2},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-10T10:48:18.774246Z"},"links":{"citing_paper":"/paper/2501.16802"},"observation_digest":"sha256:5b5f5be52c5e49121c6ab18d99b02d7babc2b8f5225740f1179b3bcf4d798cf8","observation_id":"84f237bb-3864-4900-b16f-0fe27bf09f62","resolution":{"observed_at":"2026-08-10T10:48:19.015058Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"quant-ph/0410184","last_updated":"2004-10-22T16:52:30Z","snapshot_observed_at":"2026-07-07T07:17:31.844819Z","submitted_at":"2004-10-22T16:52:30Z","title":"A new quantum ripple-carry addition circuit","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"quant-ph/0410184","snapshot_observed_at":"2026-08-10T10:48:18.776463Z","title":"A new quantum ripple-carry addition circuit","venue":null,"work_id":null,"year":2004},"citing_paper":{"arxiv_id":"2501.16802","last_updated":"2025-08-01T13:45:21Z","snapshot_observed_at":"2026-08-10T17:07:30.245069Z","submitted_at":"2025-01-28T09:05:49Z","title":"Ancilla-free Quantum Adder with Sublinear Depth","version":2},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-10T10:48:18.776463Z"},"links":{"cited_paper":"/paper/quant-ph/0410184","citing_paper":"/paper/2501.16802"},"observation_digest":"sha256:0f20bef59d49c44ebf20995109e753225a56c03129a55af8f7449a921931da28","observation_id":"8dfe9046-fea8-43d7-93fa-314631a4d30b","resolution":{"observed_at":"2026-08-10T10:48:18.776463Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T10:48:19.003104Z","title":"Quantum lower bounds for fanout","venue":null,"work_id":"cc93e447-6bc6-4294-ae70-6872e550e99d","year":2006},"citing_paper":{"arxiv_id":"2501.16802","last_updated":"2025-08-01T13:45:21Z","snapshot_observed_at":"2026-08-10T17:07:30.245069Z","submitted_at":"2025-01-28T09:05:49Z","title":"Ancilla-free Quantum Adder with Sublinear Depth","version":2},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-10T10:48:18.779484Z"},"links":{"citing_paper":"/paper/2501.16802"},"observation_digest":"sha256:60c30d7577db9d815cf67441dc512fdb0dda350f77b787b66e3b33841c67da8c","observation_id":"48b8e027-37f3-4519-a0fb-c0995b5075c4","resolution":{"observed_at":"2026-08-10T10:48:19.006310Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T10:48:18.996364Z","title":"Parallelizing quantum circuits","venue":null,"work_id":"c3c5415f-7e23-4320-92ab-0460dda0bdbe","year":2009},"citing_paper":{"arxiv_id":"2501.16802","last_updated":"2025-08-01T13:45:21Z","snapshot_observed_at":"2026-08-10T17:07:30.245069Z","submitted_at":"2025-01-28T09:05:49Z","title":"Ancilla-free Quantum Adder with Sublinear Depth","version":2},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-10T10:48:18.781792Z"},"links":{"citing_paper":"/paper/2501.16802"},"observation_digest":"sha256:90cad8067b4bd09a0266a361ffbe98119a781bd9359c6254f2eae132abeae2a3","observation_id":"2005cbdf-50d4-4295-9ceb-497dbfd0277d","resolution":{"observed_at":"2026-08-10T10:48:18.998687Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2501.16136","last_updated":"2025-01-27T15:26:11Z","snapshot_observed_at":"2026-08-10T13:40:19.618658Z","submitted_at":"2025-01-27T15:26:11Z","title":"Quantum binary field multiplication with subquadratic Toffoli gate count and low space-time cost","version":1},"cited_work":{"arxiv_id":"2501.16136","doi":null,"metadata_source":"pith","pith_arxiv_id":"2501.16136","snapshot_observed_at":"2026-08-10T10:48:18.810877Z","title":"Quantum binary field multiplication with subquadratic Toffoli gate count and low space-time cost","venue":"quant-ph","work_id":"aec309a9-8f50-4e91-9a4b-3dd8cd70541e","year":2025},"citing_paper":{"arxiv_id":"2501.16802","last_updated":"2025-08-01T13:45:21Z","snapshot_observed_at":"2026-08-10T17:07:30.245069Z","submitted_at":"2025-01-28T09:05:49Z","title":"Ancilla-free Quantum Adder with Sublinear Depth","version":2},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-10T10:48:18.784493Z"},"links":{"cited_paper":"/paper/2501.16136","citing_paper":"/paper/2501.16802"},"observation_digest":"sha256:a925606baeb5a08ecdb94002080f9c833dc93fed31f7a4b5fa94548c6e72c59f","observation_id":"9863f696-13cf-4b1b-aa34-e37629b08de9","resolution":{"observed_at":"2026-08-10T10:48:18.815345Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T10:48:18.989749Z","title":"Constructing large controlled nots","venue":null,"work_id":"e414b7c0-7e01-46ca-88b4-5e84e946b251","year":2015},"citing_paper":{"arxiv_id":"2501.16802","last_updated":"2025-08-01T13:45:21Z","snapshot_observed_at":"2026-08-10T17:07:30.245069Z","submitted_at":"2025-01-28T09:05:49Z","title":"Ancilla-free Quantum Adder with Sublinear Depth","version":2},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-10T10:48:18.787304Z"},"links":{"citing_paper":"/paper/2501.16802"},"observation_digest":"sha256:4529baa194601fc37b0cf8786957c03030268bf6c97f6b11cf838685dd6baf19","observation_id":"a6a7cb62-16bb-4300-ba3b-2534a002165c","resolution":{"observed_at":"2026-08-10T10:48:18.992070Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T10:48:18.982284Z","title":"Constructing large increment gates","venue":null,"work_id":"dd715038-386c-4712-b655-267060e76ca3","year":2015},"citing_paper":{"arxiv_id":"2501.16802","last_updated":"2025-08-01T13:45:21Z","snapshot_observed_at":"2026-08-10T17:07:30.245069Z","submitted_at":"2025-01-28T09:05:49Z","title":"Ancilla-free Quantum Adder with Sublinear Depth","version":2},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-10T10:48:18.789944Z"},"links":{"citing_paper":"/paper/2501.16802"},"observation_digest":"sha256:2f583cd5003cf9bca470ace225267da6ff1c092c8e78dc54f146002f5af9c98d","observation_id":"e3548bda-a335-44b1-837c-003ea249d669","resolution":{"observed_at":"2026-08-10T10:48:18.984663Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2501.16802","last_updated":"2025-08-01T13:45:21Z","latest_version":2,"primary_category":"quant-ph","snapshot_observed_at":"2026-08-10T17:07:30.245069Z","submitted_at":"2025-01-28T09:05:49Z","title":"Ancilla-free Quantum Adder with Sublinear Depth"},"reference_resolution":{"displayed":20,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":6,"verified_exact":2,"verified_fuzzy":12},"total_outbound_references":20},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"thesis":"As of 13 August 2026, this Paper Citation Record lists 20 of 20 outbound references and 2 inbound Pith citation observations for arXiv:2501.16802."}