{"as_of":"2026-08-13T14:14:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:20e77babbc94bda1d1ebe217be7dbe5f10c38a8ed2e029783bf5b7a5af7fdf05","coverage":[{"denominator":43,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":43,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-06T20:45:44.944564Z","state":"measured"},{"denominator":43,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":43,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-13T06:32:02.005865+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2608.04627/citation-record","integrity":"/paper/2608.04627/integrity","json":"/paper/2608.04627/citation-record.json","paper":"/paper/2608.04627"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T20:45:41.193616Z","title":"Quantum supremacy using a programmable superconducting processor.Nature, 574(7779):505–510, 2019","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2608.04627","last_updated":"2026-08-05T09:42:03Z","snapshot_observed_at":"2026-08-13T05:51:04.922870Z","submitted_at":"2026-08-05T09:42:03Z","title":"Efficient Depth--Ancilla Tradeoffs for Hamming Weight Computation and Symmetric Boolean Functions","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-06T20:45:41.193616Z"},"links":{"citing_paper":"/paper/2608.04627"},"observation_digest":"sha256:0355bf52bc41dec7e6fa92e8338901d7ab731a8d3fa45723b2736e50d7d75763","observation_id":"cb200dd3-0694-49aa-b941-80424c003c58","resolution":{"observed_at":"2026-08-06T20:45:41.193616Z","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-08-06T20:45:41.263400Z","title":"Measurement-based long-range entangling gates 35 in constant depth.Physical Review Research, 7(2):023120, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2608.04627","last_updated":"2026-08-05T09:42:03Z","snapshot_observed_at":"2026-08-13T05:51:04.922870Z","submitted_at":"2026-08-05T09:42:03Z","title":"Efficient Depth--Ancilla Tradeoffs for Hamming Weight Computation and Symmetric Boolean Functions","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-06T20:45:41.263400Z"},"links":{"citing_paper":"/paper/2608.04627"},"observation_digest":"sha256:c231c0715181eb0c4e8c421e52c32dda71450fecc7edf4d4e7080b8061db1cd0","observation_id":"71f15409-398c-4e02-9a08-f66a97769d57","resolution":{"observed_at":"2026-08-06T20:45:41.263400Z","resolver_source":null,"status":"malformed_identifier"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/978-981-16-6940-8_5","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T00:03:45.533247Z","title":"Efficient quantum implementation of majority-based full adder circuit using clifford+t-group","venue":"Lecture notes in electrical engineering","work_id":"b77f3d3c-e2b2-4fc7-9009-03e51b107266","year":2022},"citing_paper":{"arxiv_id":"2608.04627","last_updated":"2026-08-05T09:42:03Z","snapshot_observed_at":"2026-08-13T05:51:04.922870Z","submitted_at":"2026-08-05T09:42:03Z","title":"Efficient Depth--Ancilla Tradeoffs for Hamming Weight Computation and Symmetric Boolean Functions","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-06T20:45:41.339501Z"},"links":{"citing_paper":"/paper/2608.04627"},"observation_digest":"sha256:5c039db1d679330a77750663f7a4b16e6de9d0a5e1719d4394ab50544b33fb33","observation_id":"fc17f1b3-bd9a-463c-ac5e-a885af24c6a3","resolution":{"observed_at":"2026-08-06T20:45:46.709696Z","resolver_source":"doi","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":"10.1007/bfb0055105","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T00:03:45.533247Z","title":"Quantum counting","venue":"Lecture notes in computer science","work_id":"65af5813-f987-442e-b9e9-84a28ea59b79","year":1998},"citing_paper":{"arxiv_id":"2608.04627","last_updated":"2026-08-05T09:42:03Z","snapshot_observed_at":"2026-08-13T05:51:04.922870Z","submitted_at":"2026-08-05T09:42:03Z","title":"Efficient Depth--Ancilla Tradeoffs for Hamming Weight Computation and Symmetric Boolean Functions","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-06T20:45:41.420334Z"},"links":{"citing_paper":"/paper/2608.04627"},"observation_digest":"sha256:de24bc07145ab067b3b4077785959c48dc69e15a9ff5425789b2d5d515dfa592","observation_id":"ed725c37-ca81-496b-ade4-bfb0b54ff002","resolution":{"observed_at":"2026-08-06T20:45:46.570750Z","resolver_source":"doi","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T20:45:41.495938Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2608.04627","last_updated":"2026-08-05T09:42:03Z","snapshot_observed_at":"2026-08-13T05:51:04.922870Z","submitted_at":"2026-08-05T09:42:03Z","title":"Efficient Depth--Ancilla Tradeoffs for Hamming Weight Computation and Symmetric Boolean Functions","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-06T20:45:41.495938Z"},"links":{"citing_paper":"/paper/2608.04627"},"observation_digest":"sha256:691b810cc55dde0ea1bb9bc28ee2f5b63e70633c8565d3f3674f516d98bde234","observation_id":"3272a742-3603-42b2-9f15-7af1c9e9e8e1","resolution":{"observed_at":"2026-08-06T20:45:41.495938Z","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-08-06T20:45:41.601748Z","title":"Low-quantum cost circuit construc- tions for adder and symmetric boolean functions","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2608.04627","last_updated":"2026-08-05T09:42:03Z","snapshot_observed_at":"2026-08-13T05:51:04.922870Z","submitted_at":"2026-08-05T09:42:03Z","title":"Efficient Depth--Ancilla Tradeoffs for Hamming Weight Computation and Symmetric Boolean Functions","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-06T20:45:41.601748Z"},"links":{"citing_paper":"/paper/2608.04627"},"observation_digest":"sha256:d2c6de1abd720d38dd573ee9b0f9a849fedc556824affbc4c3287caf0e5ec51d","observation_id":"17f479e7-b9d7-49fb-8e68-7970a857b377","resolution":{"observed_at":"2026-08-06T20:45:41.601748Z","resolver_source":null,"status":"malformed_identifier"},"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-08-06T20:45:41.680204Z","title":"Quantum singu- lar value transformation and beyond: exponential improvements for quantum matrix arithmetics","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2608.04627","last_updated":"2026-08-05T09:42:03Z","snapshot_observed_at":"2026-08-13T05:51:04.922870Z","submitted_at":"2026-08-05T09:42:03Z","title":"Efficient Depth--Ancilla Tradeoffs for Hamming Weight Computation and Symmetric Boolean Functions","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-06T20:45:41.680204Z"},"links":{"citing_paper":"/paper/2608.04627"},"observation_digest":"sha256:952e1e2115619343e2e08aa5887d181389d5c4cda27dae228c0622883f18fe78","observation_id":"85904903-29f8-4ae8-8535-3dee45ef96b0","resolution":{"observed_at":"2026-08-06T20:45:41.680204Z","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-08-06T20:45:41.801830Z","title":"Quantum error correction below the surface code threshold.Nature, 638(8052):920–926, February 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2608.04627","last_updated":"2026-08-05T09:42:03Z","snapshot_observed_at":"2026-08-13T05:51:04.922870Z","submitted_at":"2026-08-05T09:42:03Z","title":"Efficient Depth--Ancilla Tradeoffs for Hamming Weight Computation and Symmetric Boolean Functions","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-06T20:45:41.801830Z"},"links":{"citing_paper":"/paper/2608.04627"},"observation_digest":"sha256:e67c15b0e011a712262f6ae2e3d12b5242a7527b96774a7a9dd9b084a8f43b52","observation_id":"6dafe424-ad81-4c5d-b239-888368530441","resolution":{"observed_at":"2026-08-06T20:45:41.801830Z","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-08-06T20:45:41.876925Z","title":"Quantum state preparation with opti- mal T-count","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2608.04627","last_updated":"2026-08-05T09:42:03Z","snapshot_observed_at":"2026-08-13T05:51:04.922870Z","submitted_at":"2026-08-05T09:42:03Z","title":"Efficient Depth--Ancilla Tradeoffs for Hamming Weight Computation and Symmetric Boolean Functions","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-06T20:45:41.876925Z"},"links":{"citing_paper":"/paper/2608.04627"},"observation_digest":"sha256:82f72c2ced01f0311eee1dffce9ff93513514cb6c2832a7758cf6fb309af16f5","observation_id":"b0d6de1d-cb53-4c31-91d1-ad8bdd530254","resolution":{"observed_at":"2026-08-06T20:45:41.876925Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"quant-ph/9808061","last_updated":"1998-08-30T02:25:44Z","snapshot_observed_at":"2026-08-07T06:29:05.804555Z","submitted_at":"1998-08-27T23:48:04Z","title":"Quantum Carry-Save Arithmetic","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"quant-ph/9808061","snapshot_observed_at":"2026-08-06T20:45:41.956310Z","title":"Quantum carry-save arithmetic, 1998","venue":null,"work_id":null,"year":1998},"citing_paper":{"arxiv_id":"2608.04627","last_updated":"2026-08-05T09:42:03Z","snapshot_observed_at":"2026-08-13T05:51:04.922870Z","submitted_at":"2026-08-05T09:42:03Z","title":"Efficient Depth--Ancilla Tradeoffs for Hamming Weight Computation and Symmetric Boolean Functions","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-06T20:45:41.956310Z"},"links":{"cited_paper":"/paper/quant-ph/9808061","citing_paper":"/paper/2608.04627"},"observation_digest":"sha256:f83bd96f64ef041b9f8458146a3908534987037d8e286690eec573212ffbc002","observation_id":"8b379f02-0360-4713-8ffd-b75070acdefc","resolution":{"observed_at":"2026-08-06T20:45:41.956310Z","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-08-06T20:45:42.017935Z","title":null,"venue":null,"work_id":null,"year":1996},"citing_paper":{"arxiv_id":"2608.04627","last_updated":"2026-08-05T09:42:03Z","snapshot_observed_at":"2026-08-13T05:51:04.922870Z","submitted_at":"2026-08-05T09:42:03Z","title":"Efficient Depth--Ancilla Tradeoffs for Hamming Weight Computation and Symmetric Boolean Functions","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-06T20:45:42.017935Z"},"links":{"citing_paper":"/paper/2608.04627"},"observation_digest":"sha256:c2f7d92c059979e51c033479acc481aea081fb33f316c704127e3bfefc35afe0","observation_id":"ccbb5992-bc79-42c6-8f84-672d7c74a0c5","resolution":{"observed_at":"2026-08-06T20:45:42.017935Z","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-08-06T20:45:42.121849Z","title":"Quantum fan-out is powerful.Theory of Computing, 1(5):81–103, 2005","venue":null,"work_id":null,"year":2005},"citing_paper":{"arxiv_id":"2608.04627","last_updated":"2026-08-05T09:42:03Z","snapshot_observed_at":"2026-08-13T05:51:04.922870Z","submitted_at":"2026-08-05T09:42:03Z","title":"Efficient Depth--Ancilla Tradeoffs for Hamming Weight Computation and Symmetric Boolean Functions","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-06T20:45:42.121849Z"},"links":{"citing_paper":"/paper/2608.04627"},"observation_digest":"sha256:5ee37659ffa4322f00056adcecfb7c2c51a5441af229329719f8998cb7bc5b6e","observation_id":"88787811-edbc-4f5b-b13e-d5b95dbc14f3","resolution":{"observed_at":"2026-08-06T20:45:42.121849Z","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-08-06T20:45:42.200301Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2608.04627","last_updated":"2026-08-05T09:42:03Z","snapshot_observed_at":"2026-08-13T05:51:04.922870Z","submitted_at":"2026-08-05T09:42:03Z","title":"Efficient Depth--Ancilla Tradeoffs for Hamming Weight Computation and Symmetric Boolean Functions","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-06T20:45:42.200301Z"},"links":{"citing_paper":"/paper/2608.04627"},"observation_digest":"sha256:aafb4a9d35836fbd0db0331cc549e7a4425f27926c8f023ac96809e10981c032","observation_id":"5a572bfe-b673-4f82-b2d3-c103dd1f6de0","resolution":{"observed_at":"2026-08-06T20:45:42.200301Z","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":"2022.31699","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T20:45:47.545629Z","title":"Mendes, and Andriy Miran- skyy","venue":null,"work_id":"f210861e-f624-42a8-8426-9590867fe762","year":2022},"citing_paper":{"arxiv_id":"2608.04627","last_updated":"2026-08-05T09:42:03Z","snapshot_observed_at":"2026-08-13T05:51:04.922870Z","submitted_at":"2026-08-05T09:42:03Z","title":"Efficient Depth--Ancilla Tradeoffs for Hamming Weight Computation and Symmetric Boolean Functions","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-06T20:45:42.278005Z"},"links":{"citing_paper":"/paper/2608.04627"},"observation_digest":"sha256:73f1e137e7c35e611c9f2f0aa366d0d5435d919c4d906976ee46d1833815cddd","observation_id":"25e9c04f-ba94-43e0-b728-c2ccf152bba5","resolution":{"observed_at":"2026-08-06T20:45:47.629325Z","resolver_source":"raw_fallback","status":"metadata_mismatch"},"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-06T20:45:42.390560Z","title":"Evidence for the utility of quantum computing before fault tolerance.Nature, 618 (7965):500–505, 2023","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2608.04627","last_updated":"2026-08-05T09:42:03Z","snapshot_observed_at":"2026-08-13T05:51:04.922870Z","submitted_at":"2026-08-05T09:42:03Z","title":"Efficient Depth--Ancilla Tradeoffs for Hamming Weight Computation and Symmetric Boolean Functions","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-06T20:45:42.390560Z"},"links":{"citing_paper":"/paper/2608.04627"},"observation_digest":"sha256:e267840dd4fc859b5baef5b58903c7f9bba6d227936d16d3483a01b47034654a","observation_id":"7964f6ad-cd95-4eea-99f0-04f9cf557988","resolution":{"observed_at":"2026-08-06T20:45:42.390560Z","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-08-06T20:45:42.469806Z","title":"Kivlichan, Craig Gidney, Dominic W","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2608.04627","last_updated":"2026-08-05T09:42:03Z","snapshot_observed_at":"2026-08-13T05:51:04.922870Z","submitted_at":"2026-08-05T09:42:03Z","title":"Efficient Depth--Ancilla Tradeoffs for Hamming Weight Computation and Symmetric Boolean Functions","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-06T20:45:42.469806Z"},"links":{"citing_paper":"/paper/2608.04627"},"observation_digest":"sha256:6d4496b6a7d7364fc49a60beeb283a6e53a30ef360ad6186cf4b73632fea1d37","observation_id":"feed4966-7057-4ab7-8806-8e0976056e39","resolution":{"observed_at":"2026-08-06T20:45:42.469806Z","resolver_source":null,"status":"malformed_identifier"},"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-08-06T20:45:42.551201Z","title":"Saeed, and Muharrem Umit Uyar","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2608.04627","last_updated":"2026-08-05T09:42:03Z","snapshot_observed_at":"2026-08-13T05:51:04.922870Z","submitted_at":"2026-08-05T09:42:03Z","title":"Efficient Depth--Ancilla Tradeoffs for Hamming Weight Computation and Symmetric Boolean Functions","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-06T20:45:42.551201Z"},"links":{"citing_paper":"/paper/2608.04627"},"observation_digest":"sha256:3248e79b462befc5b73cd81d14dc981b8e76c610789408a31b4da4e4caeb8fe8","observation_id":"de98603d-c8f6-45eb-9a21-3df3f0a44267","resolution":{"observed_at":"2026-08-06T20:45:42.551201Z","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-06T20:45:48.304316Z","title":"Thomson Leighton, Fillia Makedon, and Ioannis G","venue":null,"work_id":"3cf30479-c40d-41c5-8608-125e2e9890a9","year":null},"citing_paper":{"arxiv_id":"2608.04627","last_updated":"2026-08-05T09:42:03Z","snapshot_observed_at":"2026-08-13T05:51:04.922870Z","submitted_at":"2026-08-05T09:42:03Z","title":"Efficient Depth--Ancilla Tradeoffs for Hamming Weight Computation and Symmetric Boolean Functions","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-06T20:45:42.646050Z"},"links":{"citing_paper":"/paper/2608.04627"},"observation_digest":"sha256:b3649e8cba186f5c2255e4183d9c3d407bc0aa28d333eb5f4c4e0cfa670f64c9","observation_id":"3f88f456-e50d-4b32-9d64-b014306b78b9","resolution":{"observed_at":"2026-08-06T20:45:48.424115Z","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":"10.1007/s11128-021-03361-0","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":"Quantum k-nearest neighbor classifica- tion algorithm based on hamming distance.Quantum Information Processing, 21(1): 18, 2022","venue":"Quantum Information Processing","work_id":"2d547166-4814-4605-84f5-37f67feb6ae9","year":2022},"citing_paper":{"arxiv_id":"2608.04627","last_updated":"2026-08-05T09:42:03Z","snapshot_observed_at":"2026-08-13T05:51:04.922870Z","submitted_at":"2026-08-05T09:42:03Z","title":"Efficient Depth--Ancilla Tradeoffs for Hamming Weight Computation and Symmetric Boolean Functions","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-06T20:45:42.840194Z"},"links":{"citing_paper":"/paper/2608.04627"},"observation_digest":"sha256:e1d08979a255b175e1496421c2f9c444f3c70783f29889259cebe5e2341b8257","observation_id":"b09eef40-0fc2-4e19-bc94-3f4aa33beb1e","resolution":{"observed_at":"2026-08-06T20:45:46.238834Z","resolver_source":"doi","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":"2022.12843","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T20:45:47.327763Z","title":"Quantum k-fold cross-validation for nearest neighbor classification algorithm.Physica A: Statistical Mechanics and its Applications, 611:128435, 2023","venue":null,"work_id":"d4669a0e-f476-41cb-b74b-01f71f702981","year":2023},"citing_paper":{"arxiv_id":"2608.04627","last_updated":"2026-08-05T09:42:03Z","snapshot_observed_at":"2026-08-13T05:51:04.922870Z","submitted_at":"2026-08-05T09:42:03Z","title":"Efficient Depth--Ancilla Tradeoffs for Hamming Weight Computation and Symmetric Boolean Functions","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-06T20:45:42.954593Z"},"links":{"citing_paper":"/paper/2608.04627"},"observation_digest":"sha256:ba51643c2e3ec3fad83f9e09184a88aee42ad7cedb0fa62546047f07e6f22b8e","observation_id":"4c8a2ad9-4abe-4352-a739-87dd1edc87de","resolution":{"observed_at":"2026-08-06T20:45:47.371382Z","resolver_source":"raw_fallback","status":"metadata_mismatch"},"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-06T20:45:43.034572Z","title":"Block encoding with low gate count for second-quantized hamiltonians, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2608.04627","last_updated":"2026-08-05T09:42:03Z","snapshot_observed_at":"2026-08-13T05:51:04.922870Z","submitted_at":"2026-08-05T09:42:03Z","title":"Efficient Depth--Ancilla Tradeoffs for Hamming Weight Computation and Symmetric Boolean Functions","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-06T20:45:43.034572Z"},"links":{"citing_paper":"/paper/2608.04627"},"observation_digest":"sha256:a0af905ae95a6024f83fccd6156ab3816814f00f694235a7b03644b31e52dbe1","observation_id":"d98833f7-7d11-45fa-8df8-712b0729a42e","resolution":{"observed_at":"2026-08-06T20:45:43.034572Z","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-08-06T20:45:43.118646Z","title":"Trading T gates for dirty qubits in state preparation and unitary synthesis.Quantum, 8:1375, June 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2608.04627","last_updated":"2026-08-05T09:42:03Z","snapshot_observed_at":"2026-08-13T05:51:04.922870Z","submitted_at":"2026-08-05T09:42:03Z","title":"Efficient Depth--Ancilla Tradeoffs for Hamming Weight Computation and Symmetric Boolean Functions","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-06T20:45:43.118646Z"},"links":{"citing_paper":"/paper/2608.04627"},"observation_digest":"sha256:653f9efe2a7a005d4c3900cba8735837c803efa5a06c8ac749a67ec62573f3cf","observation_id":"5da7d570-5f0d-4585-b36c-1df52279cd33","resolution":{"observed_at":"2026-08-06T20:45:43.118646Z","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-06T20:45:48.104160Z","title":"Efficient reversible and quantum implementations of symmetric boolean functions.IEE Proceedings-Circuits, Devices and Systems, 153(5):467–472,","venue":null,"work_id":"185ce061-3180-48f9-bc4f-294ae6681de1","year":null},"citing_paper":{"arxiv_id":"2608.04627","last_updated":"2026-08-05T09:42:03Z","snapshot_observed_at":"2026-08-13T05:51:04.922870Z","submitted_at":"2026-08-05T09:42:03Z","title":"Efficient Depth--Ancilla Tradeoffs for Hamming Weight Computation and Symmetric Boolean Functions","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-06T20:45:43.234462Z"},"links":{"citing_paper":"/paper/2608.04627"},"observation_digest":"sha256:1b9e3bc31cba8e42d2d658c12953ffb8fdccfb1a2828704ceb4dbc9d40816e66","observation_id":"5e5bb5d1-26f7-4282-b26e-ea6e12a3e500","resolution":{"observed_at":"2026-08-06T20:45:48.211767Z","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":"10.1038/s41567-021-01271-7","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":"Quantum advantage for computations with limited space.Nature Physics, 17(8):894– 897, 2021","venue":"Nature Physics","work_id":"474bdd01-04db-4061-bb40-c588d54c8249","year":2021},"citing_paper":{"arxiv_id":"2608.04627","last_updated":"2026-08-05T09:42:03Z","snapshot_observed_at":"2026-08-13T05:51:04.922870Z","submitted_at":"2026-08-05T09:42:03Z","title":"Efficient Depth--Ancilla Tradeoffs for Hamming Weight Computation and Symmetric Boolean Functions","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-06T20:45:43.408433Z"},"links":{"citing_paper":"/paper/2608.04627"},"observation_digest":"sha256:de6d914980aa7900aa30ce1dbf4b5aea2e69fd4f251a5e31cf7aeabb6da15d66","observation_id":"75d09c03-e713-41eb-a497-3af826d75dd0","resolution":{"observed_at":"2026-08-06T20:45:45.939182Z","resolver_source":"doi","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":"10.1117/12.541792","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":null,"venue":"Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE","work_id":"3f0cb704-56c0-4517-9834-637c0d2c6e75","year":2004},"citing_paper":{"arxiv_id":"2608.04627","last_updated":"2026-08-05T09:42:03Z","snapshot_observed_at":"2026-08-13T05:51:04.922870Z","submitted_at":"2026-08-05T09:42:03Z","title":"Efficient Depth--Ancilla Tradeoffs for Hamming Weight Computation and Symmetric Boolean Functions","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-06T20:45:43.512710Z"},"links":{"citing_paper":"/paper/2608.04627"},"observation_digest":"sha256:5d4f4efb2b27054b1375a20d252e4adb3f9fc9d850a2202e403c2fe3d317dd0e","observation_id":"3047da71-b693-427f-a74b-35dad6834404","resolution":{"observed_at":"2026-08-06T20:45:45.773907Z","resolver_source":"doi","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":{"arxiv_id":"quant-ph/9903046","last_updated":"1999-03-17T00:43:09Z","snapshot_observed_at":"2026-07-07T07:28:48.915082Z","submitted_at":"1999-03-13T03:59:28Z","title":"Quantum Circuits: Fanout, Parity, and Counting","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"quant-ph/9903046","snapshot_observed_at":"2026-08-06T20:45:43.629154Z","title":"Quantum circuits: Fanout, parity, and counting, 1999","venue":null,"work_id":null,"year":1999},"citing_paper":{"arxiv_id":"2608.04627","last_updated":"2026-08-05T09:42:03Z","snapshot_observed_at":"2026-08-13T05:51:04.922870Z","submitted_at":"2026-08-05T09:42:03Z","title":"Efficient Depth--Ancilla Tradeoffs for Hamming Weight Computation and Symmetric Boolean Functions","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-06T20:45:43.629154Z"},"links":{"cited_paper":"/paper/quant-ph/9903046","citing_paper":"/paper/2608.04627"},"observation_digest":"sha256:e2cc899988359d867a59f3ed4a887ac6ec175f8dc4efdfbbdc0d706c1a3cdb4a","observation_id":"5d02336f-fed7-4c53-ad08-0e5a2f506483","resolution":{"observed_at":"2026-08-06T20:45:43.629154Z","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-08-06T20:45:43.705059Z","title":"Parallel quantum computation and quantum codes.SIAM Journal on Computing, 31(3):799–815, 2001","venue":null,"work_id":null,"year":2001},"citing_paper":{"arxiv_id":"2608.04627","last_updated":"2026-08-05T09:42:03Z","snapshot_observed_at":"2026-08-13T05:51:04.922870Z","submitted_at":"2026-08-05T09:42:03Z","title":"Efficient Depth--Ancilla Tradeoffs for Hamming Weight Computation and Symmetric Boolean Functions","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-06T20:45:43.705059Z"},"links":{"citing_paper":"/paper/2608.04627"},"observation_digest":"sha256:e4502dfec5eb3e42acd79c97c5364a203f89d86f2a66f5a6b6033166acaa76c9","observation_id":"e529263e-71bc-4aa4-99f1-a57b0b7fe796","resolution":{"observed_at":"2026-08-06T20:45:43.705059Z","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.1038/s41534-021-00369-3","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":"A quantum algorithm for string matching.npj Quantum Information, 7(1):37, 2021","venue":"npj Quantum Information","work_id":"2286ea6b-9321-42db-9fdc-fb0137324a57","year":2021},"citing_paper":{"arxiv_id":"2608.04627","last_updated":"2026-08-05T09:42:03Z","snapshot_observed_at":"2026-08-13T05:51:04.922870Z","submitted_at":"2026-08-05T09:42:03Z","title":"Efficient Depth--Ancilla Tradeoffs for Hamming Weight Computation and Symmetric Boolean Functions","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-06T20:45:43.787925Z"},"links":{"citing_paper":"/paper/2608.04627"},"observation_digest":"sha256:d2a544ebc5073006a75476047115de39245ac31e1c6df623db04b47a732497c5","observation_id":"245da76a-2632-49ad-936c-9fc00a0cbcdc","resolution":{"observed_at":"2026-08-06T20:45:45.635528Z","resolver_source":"doi","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":"10.1007/s11227-024-05916-1","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":"Quantum circuits for computing hamming distance requiring fewer t gates.The Jour- nal of Supercomputing, 80(9):12527–12542, 2024","venue":"The Journal of Supercomputing","work_id":"6ea83d93-68be-4df7-8c1e-1b7d4eaca0b8","year":2024},"citing_paper":{"arxiv_id":"2608.04627","last_updated":"2026-08-05T09:42:03Z","snapshot_observed_at":"2026-08-13T05:51:04.922870Z","submitted_at":"2026-08-05T09:42:03Z","title":"Efficient Depth--Ancilla Tradeoffs for Hamming Weight Computation and Symmetric Boolean Functions","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-06T20:45:43.866236Z"},"links":{"citing_paper":"/paper/2608.04627"},"observation_digest":"sha256:241de229fb81bc72b1e5eab25f0992275ce0f21755f005d134291a00c7d672d8","observation_id":"b3a3c6fc-ed6f-4ae4-9ea3-b8e3b50ba26b","resolution":{"observed_at":"2026-08-06T20:45:45.480837Z","resolver_source":"doi","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":"2001.95228","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T20:45:47.098823Z","title":"Regular realization of symmetric functions using reversible logic","venue":null,"work_id":"ee201aaa-2596-4a7e-9bff-1890259cb83a","year":2001},"citing_paper":{"arxiv_id":"2608.04627","last_updated":"2026-08-05T09:42:03Z","snapshot_observed_at":"2026-08-13T05:51:04.922870Z","submitted_at":"2026-08-05T09:42:03Z","title":"Efficient Depth--Ancilla Tradeoffs for Hamming Weight Computation and Symmetric Boolean Functions","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-06T20:45:43.952605Z"},"links":{"citing_paper":"/paper/2608.04627"},"observation_digest":"sha256:cd3777da4b1f6cc4f060b6101726a1c575a0df2a4cbd19e20e3b6098c70df2e5","observation_id":"d01db80a-fc71-4b3e-9647-e7f7b67aece3","resolution":{"observed_at":"2026-08-06T20:45:47.148082Z","resolver_source":"raw_fallback","status":"metadata_mismatch"},"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-06T20:45:47.989260Z","title":"Regularity and symmetry as a base for efficient realization of reversible logic circuits","venue":null,"work_id":"2a8f13d5-ad81-4445-9531-c4278049e51b","year":2001},"citing_paper":{"arxiv_id":"2608.04627","last_updated":"2026-08-05T09:42:03Z","snapshot_observed_at":"2026-08-13T05:51:04.922870Z","submitted_at":"2026-08-05T09:42:03Z","title":"Efficient Depth--Ancilla Tradeoffs for Hamming Weight Computation and Symmetric Boolean Functions","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-06T20:45:44.035155Z"},"links":{"citing_paper":"/paper/2608.04627"},"observation_digest":"sha256:cb672587b8fce3f929e4bdca300b84803c60d064294b64f43286b69294d875ca","observation_id":"7578660d-3e9d-4804-82ed-ed337e4cf3e2","resolution":{"observed_at":"2026-08-06T20:45:48.038051Z","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-06T20:45:47.881720Z","title":"LaBorde, and Mark M","venue":null,"work_id":"4cdcced0-f122-4928-837f-a0a2fb4a4ae9","year":null},"citing_paper":{"arxiv_id":"2608.04627","last_updated":"2026-08-05T09:42:03Z","snapshot_observed_at":"2026-08-13T05:51:04.922870Z","submitted_at":"2026-08-05T09:42:03Z","title":"Efficient Depth--Ancilla Tradeoffs for Hamming Weight Computation and Symmetric Boolean Functions","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-06T20:45:44.114172Z"},"links":{"citing_paper":"/paper/2608.04627"},"observation_digest":"sha256:233014a70da805b3de361c02c40cd738e014e97a2e34aad7428b301d79ea1629","observation_id":"b39ce022-7d78-4492-ada6-b4ac8d4d5de9","resolution":{"observed_at":"2026-08-06T20:45:47.917461Z","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":"10.4230/lipics.tqc.2013.294","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":"Rosenbaum","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","work_id":"81d15b40-9169-4142-8b11-e8f699c4e347","year":2013},"citing_paper":{"arxiv_id":"2608.04627","last_updated":"2026-08-05T09:42:03Z","snapshot_observed_at":"2026-08-13T05:51:04.922870Z","submitted_at":"2026-08-05T09:42:03Z","title":"Efficient Depth--Ancilla Tradeoffs for Hamming Weight Computation and Symmetric Boolean Functions","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-06T20:45:44.342642Z"},"links":{"citing_paper":"/paper/2608.04627"},"observation_digest":"sha256:14f907ae5888c305302a1e9cdfff30c213616b890797dd68fbf07c033f9c4b9c","observation_id":"6e51a9aa-7e4f-49de-ae53-0181447fa8ce","resolution":{"observed_at":"2026-08-06T20:45:45.337592Z","resolver_source":"doi","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T20:45:44.408944Z","title":null,"venue":null,"work_id":null,"year":1994},"citing_paper":{"arxiv_id":"2608.04627","last_updated":"2026-08-05T09:42:03Z","snapshot_observed_at":"2026-08-13T05:51:04.922870Z","submitted_at":"2026-08-05T09:42:03Z","title":"Efficient Depth--Ancilla Tradeoffs for Hamming Weight Computation and Symmetric Boolean Functions","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-06T20:45:44.408944Z"},"links":{"citing_paper":"/paper/2608.04627"},"observation_digest":"sha256:4e974ac757f1eaef1587734081ce9efa932224889f2b699e5bcdeacbe0dbb0fb","observation_id":"d3e0d470-4f39-4b4d-ab43-19389fddb2f4","resolution":{"observed_at":"2026-08-06T20:45:44.408944Z","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-08-06T20:45:44.510711Z","title":"Collapse of the hierarchy of constant-depth exact quantum circuits.Computational Complexity, 25(4):849–881, 2016","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2608.04627","last_updated":"2026-08-05T09:42:03Z","snapshot_observed_at":"2026-08-13T05:51:04.922870Z","submitted_at":"2026-08-05T09:42:03Z","title":"Efficient Depth--Ancilla Tradeoffs for Hamming Weight Computation and Symmetric Boolean Functions","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-06T20:45:44.510711Z"},"links":{"citing_paper":"/paper/2608.04627"},"observation_digest":"sha256:28ce92c5fc759bab902021e40a17f1a4f79ed89264c8b8d94890f67dea3fcf16","observation_id":"e674e477-dff0-400e-a302-3629c277db74","resolution":{"observed_at":"2026-08-06T20:45:44.510711Z","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.1016/j.tcs.2020.11.039","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":"Power of uninitialized qubits in shal- low quantum circuits.Theoretical Computer Science, 851:129–153, 2021","venue":"Theoretical Computer Science","work_id":"6cf9ff2f-838b-41c8-be05-0f0ef849258b","year":2021},"citing_paper":{"arxiv_id":"2608.04627","last_updated":"2026-08-05T09:42:03Z","snapshot_observed_at":"2026-08-13T05:51:04.922870Z","submitted_at":"2026-08-05T09:42:03Z","title":"Efficient Depth--Ancilla Tradeoffs for Hamming Weight Computation and Symmetric Boolean Functions","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-06T20:45:44.605104Z"},"links":{"citing_paper":"/paper/2608.04627"},"observation_digest":"sha256:2f598fd88a182e42469071989d5cc3f2a7e4f4112ce981806466123de3ac879e","observation_id":"70e4be67-cf71-42a7-9de5-58294de7e949","resolution":{"observed_at":"2026-08-06T20:45:45.187075Z","resolver_source":"doi","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T20:45:44.673429Z","title":"Strong quantum computational advantage using a superconducting quantum processor.Phys","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2608.04627","last_updated":"2026-08-05T09:42:03Z","snapshot_observed_at":"2026-08-13T05:51:04.922870Z","submitted_at":"2026-08-05T09:42:03Z","title":"Efficient Depth--Ancilla Tradeoffs for Hamming Weight Computation and Symmetric Boolean Functions","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-06T20:45:44.673429Z"},"links":{"citing_paper":"/paper/2608.04627"},"observation_digest":"sha256:40a8b618f65a23fd69dd0717bbe61ea18683adf0b0e1e67587c6aa5dd7774c30","observation_id":"472a4ebc-afb7-4712-9fc8-a9282bfa2271","resolution":{"observed_at":"2026-08-06T20:45:44.673429Z","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-08-06T20:45:44.771309Z","title":"Quantum circuit synthesis and compilation optimization: Overview and prospects.CoRR, abs/2407.00736, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2608.04627","last_updated":"2026-08-05T09:42:03Z","snapshot_observed_at":"2026-08-13T05:51:04.922870Z","submitted_at":"2026-08-05T09:42:03Z","title":"Efficient Depth--Ancilla Tradeoffs for Hamming Weight Computation and Symmetric Boolean Functions","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-06T20:45:44.771309Z"},"links":{"citing_paper":"/paper/2608.04627"},"observation_digest":"sha256:f542efbca489d628ed67eb7e68d69f8bc530d82562660c8cb026bb7ec880bc44","observation_id":"9b18546d-b2ad-43ff-87d8-9c9a54d6d720","resolution":{"observed_at":"2026-08-06T20:45:44.771309Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2503.16208","last_updated":"2025-03-20T14:55:04Z","snapshot_observed_at":"2026-08-07T16:48:58.318966Z","submitted_at":"2025-03-20T14:55:04Z","title":"Constant-Depth Quantum Circuits for Arbitrary Quantum State Preparation via Measurement and Feedback","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2503.16208","snapshot_observed_at":"2026-08-06T20:45:44.837859Z","title":"Constant-depth quantum circuits for arbitrary quantum state preparation via measurement and feedback, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2608.04627","last_updated":"2026-08-05T09:42:03Z","snapshot_observed_at":"2026-08-13T05:51:04.922870Z","submitted_at":"2026-08-05T09:42:03Z","title":"Efficient Depth--Ancilla Tradeoffs for Hamming Weight Computation and Symmetric Boolean Functions","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-06T20:45:44.837859Z"},"links":{"cited_paper":"/paper/2503.16208","citing_paper":"/paper/2608.04627"},"observation_digest":"sha256:72f411e84253a01d36eaa04ed241d9541aa6f839e46e1104674346e7641e43ce","observation_id":"efa4f0ae-92db-4c45-9998-f2baabe29e0b","resolution":{"observed_at":"2026-08-06T20:45:44.837859Z","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":"2025.35390","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T20:45:46.844205Z","title":null,"venue":null,"work_id":"cc843135-92c7-4156-b4c4-5989ca306743","year":2025},"citing_paper":{"arxiv_id":"2608.04627","last_updated":"2026-08-05T09:42:03Z","snapshot_observed_at":"2026-08-13T05:51:04.922870Z","submitted_at":"2026-08-05T09:42:03Z","title":"Efficient Depth--Ancilla Tradeoffs for Hamming Weight Computation and Symmetric Boolean Functions","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-06T20:45:44.944564Z"},"links":{"citing_paper":"/paper/2608.04627"},"observation_digest":"sha256:e3aca5d8d8253640fb254f8b7b8e8c1e47c40d4e704da86e4a75bbd634536fa8","observation_id":"14e3176c-af0f-49ef-9279-b8be4381fb8d","resolution":{"observed_at":"2026-08-06T20:45:46.884598Z","resolver_source":"raw_fallback","status":"metadata_mismatch"},"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":"10.1007/bf01294128","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T00:03:45.533247Z","title":null,"venue":"Algorithmica","work_id":"fad2fa0e-f862-4b78-8441-65cca3b98afe","year":null},"citing_paper":{"arxiv_id":"2608.04627","last_updated":"2026-08-05T09:42:03Z","snapshot_observed_at":"2026-08-13T05:51:04.922870Z","submitted_at":"2026-08-05T09:42:03Z","title":"Efficient Depth--Ancilla Tradeoffs for Hamming Weight Computation and Symmetric Boolean Functions","version":1},"reference_index":1995,"source":"pdf_text","source_observed_at":"2026-08-06T20:45:42.724842Z"},"links":{"citing_paper":"/paper/2608.04627"},"observation_digest":"sha256:7102c4283c4d99884dad3654c5d49bc23b861cacefb582633fff51cb2706747c","observation_id":"68688208-3540-4039-91b1-96cba3df6926","resolution":{"observed_at":"2026-08-06T20:45:46.377890Z","resolver_source":"doi","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":"10.1049/ip-cds:20045213","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":null,"venue":"IEE Proceedings - Circuits Devices and Systems","work_id":"fc35c363-7a88-48b8-a8d9-b64db782e1ad","year":null},"citing_paper":{"arxiv_id":"2608.04627","last_updated":"2026-08-05T09:42:03Z","snapshot_observed_at":"2026-08-13T05:51:04.922870Z","submitted_at":"2026-08-05T09:42:03Z","title":"Efficient Depth--Ancilla Tradeoffs for Hamming Weight Computation and Symmetric Boolean Functions","version":1},"reference_index":2006,"source":"pdf_text","source_observed_at":"2026-08-06T20:45:43.333751Z"},"links":{"citing_paper":"/paper/2608.04627"},"observation_digest":"sha256:1ac5bd910480b54b8cb72f05ea737e58ceb662957606dabc70dc98ecad033ed3","observation_id":"31f0ea69-e9ab-44ec-a7d9-3a8147d77a30","resolution":{"observed_at":"2026-08-06T20:45:46.104451Z","resolver_source":"doi","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T20:45:44.206259Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.04627","last_updated":"2026-08-05T09:42:03Z","snapshot_observed_at":"2026-08-13T05:51:04.922870Z","submitted_at":"2026-08-05T09:42:03Z","title":"Efficient Depth--Ancilla Tradeoffs for Hamming Weight Computation and Symmetric Boolean Functions","version":1},"reference_index":2024,"source":"pdf_text","source_observed_at":"2026-08-06T20:45:44.206259Z"},"links":{"citing_paper":"/paper/2608.04627"},"observation_digest":"sha256:ed9e0a97e8505bcb5c681152166e497bc4fcf218db1a24d9ca62c943a5a2f97e","observation_id":"5d98fd73-c319-4e6f-9b1d-7e608703e95e","resolution":{"observed_at":"2026-08-06T20:45:44.206259Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2608.04627","last_updated":"2026-08-05T09:42:03Z","latest_version":1,"primary_category":"quant-ph","snapshot_observed_at":"2026-08-13T05:51:04.922870Z","submitted_at":"2026-08-05T09:42:03Z","title":"Efficient Depth--Ancilla Tradeoffs for Hamming Weight Computation and Symmetric Boolean Functions"},"reference_resolution":{"displayed":43,"state_counts":{"malformed_identifier":3,"metadata_mismatch":4,"parse_uncertain":0,"unresolved":21,"verified_exact":11,"verified_fuzzy":4},"total_outbound_references":43},"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 43 of 43 outbound references and 0 inbound Pith citation observations for arXiv:2608.04627."}