{"as_of":"2026-08-16T13:06:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:ad1878d2499946b911dc0263a60ed77aa66aff49ed5615d2ac70be6c345912d3","coverage":[{"denominator":31,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":31,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-14T15:18:37.838816Z","state":"measured"},{"denominator":31,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":31,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-16T06:30:59.297886+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/1908.01609/citation-record","integrity":"/paper/1908.01609/integrity","json":"/paper/1908.01609/citation-record.json","paper":"/paper/1908.01609"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T15:18:38.799537Z","title":"A fast quantum mechanical algorithm for da tabase search,","venue":null,"work_id":"032a4714-3a2b-456d-8096-5be7d7757fab","year":1996},"citing_paper":{"arxiv_id":"1908.01609","last_updated":"2019-08-05T13:26:26Z","snapshot_observed_at":"2026-08-15T19:14:48.787317Z","submitted_at":"2019-08-05T13:26:26Z","title":"The Role of Multiplicative Complexity in Compiling Low T-count Oracle Circuits","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-14T15:18:37.078281Z"},"links":{"citing_paper":"/paper/1908.01609"},"observation_digest":"sha256:ca03e75d12f1b3907ee00209460f8b730b9c1f2598db607345c87e342c75ee8a","observation_id":"ec70e883-97d0-493c-96e1-bbaeff2f79cc","resolution":{"observed_at":"2026-08-14T15:18:38.803902Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T15:18:38.774598Z","title":"Polynomial-time algorithms for prime facto rization and discrete logarithms on a quantum computer,","venue":null,"work_id":"9b5b46c1-2a55-462d-92ae-55a9c2fea5d5","year":1997},"citing_paper":{"arxiv_id":"1908.01609","last_updated":"2019-08-05T13:26:26Z","snapshot_observed_at":"2026-08-15T19:14:48.787317Z","submitted_at":"2019-08-05T13:26:26Z","title":"The Role of Multiplicative Complexity in Compiling Low T-count Oracle Circuits","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-14T15:18:37.144592Z"},"links":{"citing_paper":"/paper/1908.01609"},"observation_digest":"sha256:42d5a7767798cbbac436e5121a388bdc9677ca9169990a12153fe5f506e0212a","observation_id":"56b502cb-13f9-47a7-97b7-7440e6479e49","resolution":{"observed_at":"2026-08-14T15:18:38.789909Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T15:18:38.701852Z","title":"Quantum algorit hm for linear systems of equations,","venue":null,"work_id":"27a79193-4b5b-4e47-b94f-ae4c6a797f34","year":2009},"citing_paper":{"arxiv_id":"1908.01609","last_updated":"2019-08-05T13:26:26Z","snapshot_observed_at":"2026-08-15T19:14:48.787317Z","submitted_at":"2019-08-05T13:26:26Z","title":"The Role of Multiplicative Complexity in Compiling Low T-count Oracle Circuits","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-14T15:18:37.220456Z"},"links":{"citing_paper":"/paper/1908.01609"},"observation_digest":"sha256:4ca29654472757c131b0ca26abb7d8dbdc681684a6f78fedf642efc7280cc4de","observation_id":"585cf0bd-5f2c-4be4-8b31-51d9a173598e","resolution":{"observed_at":"2026-08-14T15:18:38.714751Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T15:18:38.690885Z","title":"A meet-in- the-middle algorithm for fast synthesis of depth-optimal quantum circ uits,","venue":null,"work_id":"8db954d8-e744-409a-966e-63ce02b98197","year":2013},"citing_paper":{"arxiv_id":"1908.01609","last_updated":"2019-08-05T13:26:26Z","snapshot_observed_at":"2026-08-15T19:14:48.787317Z","submitted_at":"2019-08-05T13:26:26Z","title":"The Role of Multiplicative Complexity in Compiling Low T-count Oracle Circuits","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-14T15:18:37.333230Z"},"links":{"citing_paper":"/paper/1908.01609"},"observation_digest":"sha256:3e387177f4f42efd7f01e098f803721ad1a707302523089eb30da1ac89849e5c","observation_id":"7d77792a-60b8-4477-94fe-70cca4e8c442","resolution":{"observed_at":"2026-08-14T15:18:38.694623Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T15:18:38.677413Z","title":"On the multiplicat ive complexity of boolean functions over the basis (∧,⊕,1),","venue":null,"work_id":"d4e1c3b0-f139-4b1a-a2bf-7f5e70beff1c","year":2000},"citing_paper":{"arxiv_id":"1908.01609","last_updated":"2019-08-05T13:26:26Z","snapshot_observed_at":"2026-08-15T19:14:48.787317Z","submitted_at":"2019-08-05T13:26:26Z","title":"The Role of Multiplicative Complexity in Compiling Low T-count Oracle Circuits","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-14T15:18:37.337778Z"},"links":{"citing_paper":"/paper/1908.01609"},"observation_digest":"sha256:183d33ea80a0063571b06b31cae8cdf709d329ebcb252bd294bc3adc93fdac07","observation_id":"b6dcb4dc-73ec-478d-8092-8fb6c1ef1cda","resolution":{"observed_at":"2026-08-14T15:18:38.683023Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T15:18:38.616923Z","title":"Low-overhead constructions for the fault-to lerant Toffoli gate,","venue":null,"work_id":"22186dd7-4713-43cc-a0bc-1632fe3360a7","year":2013},"citing_paper":{"arxiv_id":"1908.01609","last_updated":"2019-08-05T13:26:26Z","snapshot_observed_at":"2026-08-15T19:14:48.787317Z","submitted_at":"2019-08-05T13:26:26Z","title":"The Role of Multiplicative Complexity in Compiling Low T-count Oracle Circuits","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-14T15:18:37.343400Z"},"links":{"citing_paper":"/paper/1908.01609"},"observation_digest":"sha256:1e9c28b12bea78d771771ce596db7e1bee22535ca591707aba4c142fb264cb79","observation_id":"73e220dc-c723-4da6-9730-feeedeca0387","resolution":{"observed_at":"2026-08-14T15:18:38.655957Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T15:18:38.581930Z","title":"Halving the cost of quantum addition,","venue":null,"work_id":"a80c5942-bf4c-4f8d-b87b-3bcb4582225d","year":2018},"citing_paper":{"arxiv_id":"1908.01609","last_updated":"2019-08-05T13:26:26Z","snapshot_observed_at":"2026-08-15T19:14:48.787317Z","submitted_at":"2019-08-05T13:26:26Z","title":"The Role of Multiplicative Complexity in Compiling Low T-count Oracle Circuits","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-14T15:18:37.347183Z"},"links":{"citing_paper":"/paper/1908.01609"},"observation_digest":"sha256:83720b2d3fa4a2da1507a4fe0e02af9e1cfc5baed011b46b2322205de1e51e84","observation_id":"33e1191d-73ac-44eb-be70-b90c385c2686","resolution":{"observed_at":"2026-08-14T15:18:38.585637Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T15:18:38.570441Z","title":"On the complexity of computing two nonlinear ity measures,","venue":null,"work_id":"80489dba-87c6-4df3-8a9e-1c976f4fb18e","year":2014},"citing_paper":{"arxiv_id":"1908.01609","last_updated":"2019-08-05T13:26:26Z","snapshot_observed_at":"2026-08-15T19:14:48.787317Z","submitted_at":"2019-08-05T13:26:26Z","title":"The Role of Multiplicative Complexity in Compiling Low T-count Oracle Circuits","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-14T15:18:37.350806Z"},"links":{"citing_paper":"/paper/1908.01609"},"observation_digest":"sha256:76b6871dd244a5632535f05f14614421b772ee793281f182167e33fb5a1390ae","observation_id":"f7ebea75-f5c6-4dc9-b33a-80198c1eec3d","resolution":{"observed_at":"2026-08-14T15:18:38.574222Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T15:18:38.559263Z","title":"Tight bounds for the multiplica tive complexity of symmetric functions,","venue":null,"work_id":"47b403e8-8c2d-4e3e-8659-6978b846525e","year":2008},"citing_paper":{"arxiv_id":"1908.01609","last_updated":"2019-08-05T13:26:26Z","snapshot_observed_at":"2026-08-15T19:14:48.787317Z","submitted_at":"2019-08-05T13:26:26Z","title":"The Role of Multiplicative Complexity in Compiling Low T-count Oracle Circuits","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-14T15:18:37.353949Z"},"links":{"citing_paper":"/paper/1908.01609"},"observation_digest":"sha256:da7497acdb173c7a1de17d44b3fb7159294d3029bd4ad58073ea48afe0edae1e","observation_id":"b02d59cd-a126-48ad-a535-eed36cdaaf9f","resolution":{"observed_at":"2026-08-14T15:18:38.563530Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T15:18:38.505281Z","title":"Reduci ng the multiplicative complexity in logic networks for crypto graphy and security applications,","venue":null,"work_id":"1b47be6f-3b29-4714-873d-c11d67ee5da7","year":2019},"citing_paper":{"arxiv_id":"1908.01609","last_updated":"2019-08-05T13:26:26Z","snapshot_observed_at":"2026-08-15T19:14:48.787317Z","submitted_at":"2019-08-05T13:26:26Z","title":"The Role of Multiplicative Complexity in Compiling Low T-count Oracle Circuits","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-14T15:18:37.357294Z"},"links":{"citing_paper":"/paper/1908.01609"},"observation_digest":"sha256:1316104f3fc0e7abeab3abcc1185a3e6b63d25f8e2025e85190419e77155006a","observation_id":"621a72a6-f86e-4071-afa9-77166f0ece1a","resolution":{"observed_at":"2026-08-14T15:18:38.535684Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T15:18:38.492081Z","title":"Logic minimizat ion techniques with applications to cryptology,","venue":null,"work_id":"3d748550-e794-4bfb-af82-cdbd30ffb827","year":2013},"citing_paper":{"arxiv_id":"1908.01609","last_updated":"2019-08-05T13:26:26Z","snapshot_observed_at":"2026-08-15T19:14:48.787317Z","submitted_at":"2019-08-05T13:26:26Z","title":"The Role of Multiplicative Complexity in Compiling Low T-count Oracle Circuits","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-14T15:18:37.360838Z"},"links":{"citing_paper":"/paper/1908.01609"},"observation_digest":"sha256:947f9aa312e1ffc1f6cf958fc7e93c13c53264ae5d3abfebf3ec28341af95a9b","observation_id":"0dcd9a01-e5ee-47d6-9409-a2610caf2f75","resolution":{"observed_at":"2026-08-14T15:18:38.496057Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T15:18:38.480943Z","title":"The multiplicati ve complexity of 6-variable Boolean functions,","venue":null,"work_id":"4de9b177-edd8-4ab6-be37-bd5bb0925d70","year":2019},"citing_paper":{"arxiv_id":"1908.01609","last_updated":"2019-08-05T13:26:26Z","snapshot_observed_at":"2026-08-15T19:14:48.787317Z","submitted_at":"2019-08-05T13:26:26Z","title":"The Role of Multiplicative Complexity in Compiling Low T-count Oracle Circuits","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-14T15:18:37.442904Z"},"links":{"citing_paper":"/paper/1908.01609"},"observation_digest":"sha256:9386502baeda8c494cc4bd11e0c8f6f2f640633b8fd8ae9fd1570d719d608f4a","observation_id":"fad5e915-0196-4ac5-9954-059c44e8ea8f","resolution":{"observed_at":"2026-08-14T15:18:38.485095Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T15:18:38.468056Z","title":"Time/space trade-offs for reversible c omputation,","venue":null,"work_id":"2762713c-4c5b-42b8-abb0-30005368f8b9","year":1989},"citing_paper":{"arxiv_id":"1908.01609","last_updated":"2019-08-05T13:26:26Z","snapshot_observed_at":"2026-08-15T19:14:48.787317Z","submitted_at":"2019-08-05T13:26:26Z","title":"The Role of Multiplicative Complexity in Compiling Low T-count Oracle Circuits","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-14T15:18:37.511455Z"},"links":{"citing_paper":"/paper/1908.01609"},"observation_digest":"sha256:0b485690936254c3a867418213207ba1da5c1ab76c7730b630f33e4d61ae74e5","observation_id":"2929b422-3da0-4c47-8051-87862914c747","resolution":{"observed_at":"2026-08-14T15:18:38.472991Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T15:18:38.408831Z","title":"Hi erarchical reversible logic synthesis using LUTs,","venue":null,"work_id":"b7e31e78-da3f-4729-8d63-c056779fb916","year":2017},"citing_paper":{"arxiv_id":"1908.01609","last_updated":"2019-08-05T13:26:26Z","snapshot_observed_at":"2026-08-15T19:14:48.787317Z","submitted_at":"2019-08-05T13:26:26Z","title":"The Role of Multiplicative Complexity in Compiling Low T-count Oracle Circuits","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-14T15:18:37.514522Z"},"links":{"citing_paper":"/paper/1908.01609"},"observation_digest":"sha256:54d00e6b3d7ad0507bef05a9bc64a0f05774d23212dc907cfd89b217e63cdbcb","observation_id":"7e132045-819e-432b-b43e-e9fac65d7100","resolution":{"observed_at":"2026-08-14T15:18:38.412923Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T15:18:38.397413Z","title":"A best-fit mapping algorithm to facilitate ESOP-decomposi tion in Clifford+ T quantum network synthesis,","venue":null,"work_id":"ae353cd1-ebda-4d4c-ac4c-ea44c661b466","year":2018},"citing_paper":{"arxiv_id":"1908.01609","last_updated":"2019-08-05T13:26:26Z","snapshot_observed_at":"2026-08-15T19:14:48.787317Z","submitted_at":"2019-08-05T13:26:26Z","title":"The Role of Multiplicative Complexity in Compiling Low T-count Oracle Circuits","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-14T15:18:37.518203Z"},"links":{"citing_paper":"/paper/1908.01609"},"observation_digest":"sha256:7acd006f8c4dad0f352a4d309c194eea3d28253dbbca122815955441397a7fa6","observation_id":"b58aaa58-9f15-402f-8f6f-68157503569f","resolution":{"observed_at":"2026-08-14T15:18:38.401829Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T15:18:38.385853Z","title":"Universal quantum computatio n with ideal Clifford gates and noisy ancillas,","venue":null,"work_id":"84b43e69-0895-42f2-b1b3-228e2b333e5e","year":2005},"citing_paper":{"arxiv_id":"1908.01609","last_updated":"2019-08-05T13:26:26Z","snapshot_observed_at":"2026-08-15T19:14:48.787317Z","submitted_at":"2019-08-05T13:26:26Z","title":"The Role of Multiplicative Complexity in Compiling Low T-count Oracle Circuits","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-14T15:18:37.522691Z"},"links":{"citing_paper":"/paper/1908.01609"},"observation_digest":"sha256:ba76541cbbf7d771b6f104b9f3d278de3962b034a0bf773e2defa8174b692f50","observation_id":"0c61e133-d3fd-49f0-a2d6-115e34b412c1","resolution":{"observed_at":"2026-08-14T15:18:38.389952Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T15:18:38.374203Z","title":"Quantum computation wi th realistic magic-state factories,","venue":null,"work_id":"22b19f81-3e10-4640-bf3e-1c5a8c1d7262","year":2017},"citing_paper":{"arxiv_id":"1908.01609","last_updated":"2019-08-05T13:26:26Z","snapshot_observed_at":"2026-08-15T19:14:48.787317Z","submitted_at":"2019-08-05T13:26:26Z","title":"The Role of Multiplicative Complexity in Compiling Low T-count Oracle Circuits","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-14T15:18:37.526086Z"},"links":{"citing_paper":"/paper/1908.01609"},"observation_digest":"sha256:fbae6ff04bb2187a2440bc39527d2f0ddfa92191dbb4d83dd49cd8974536c7b5","observation_id":"f51e3c9a-cb0d-4c12-ba4a-52580afdc29b","resolution":{"observed_at":"2026-08-14T15:18:38.378259Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T15:18:38.269484Z","title":"Reversible pebbling game for quantum memory management,","venue":null,"work_id":"42da4580-008e-4094-85ff-a538c0772d84","year":2019},"citing_paper":{"arxiv_id":"1908.01609","last_updated":"2019-08-05T13:26:26Z","snapshot_observed_at":"2026-08-15T19:14:48.787317Z","submitted_at":"2019-08-05T13:26:26Z","title":"The Role of Multiplicative Complexity in Compiling Low T-count Oracle Circuits","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-14T15:18:37.529963Z"},"links":{"citing_paper":"/paper/1908.01609"},"observation_digest":"sha256:c28a494bfd459ef2812ea7dada430409a72c4b03d39d5a75078f58536308307a","observation_id":"f6a4f3cc-ee4d-45b8-a084-aa552680f9dd","resolution":{"observed_at":"2026-08-14T15:18:38.314783Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T15:18:38.213414Z","title":"Quantum teleportation i s a universal computational primitive,","venue":null,"work_id":"e5b026a1-bc67-4c7b-a802-27d4517a6b2c","year":1999},"citing_paper":{"arxiv_id":"1908.01609","last_updated":"2019-08-05T13:26:26Z","snapshot_observed_at":"2026-08-15T19:14:48.787317Z","submitted_at":"2019-08-05T13:26:26Z","title":"The Role of Multiplicative Complexity in Compiling Low T-count Oracle Circuits","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-14T15:18:37.533548Z"},"links":{"citing_paper":"/paper/1908.01609"},"observation_digest":"sha256:4ae059d9f9a4d4f6813f24d8a62d4a4ca3d8c1b500182b68751d6b6eda1f71f3","observation_id":"2096e549-0d98-4340-bd9c-0bff2d3042b9","resolution":{"observed_at":"2026-08-14T15:18:38.227949Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T15:18:38.200321Z","title":"Application of a resource th eory for magic states to fault-tolerant quantum computing,","venue":null,"work_id":"c7800f2d-8497-4199-a968-1ab5fab4614a","year":2017},"citing_paper":{"arxiv_id":"1908.01609","last_updated":"2019-08-05T13:26:26Z","snapshot_observed_at":"2026-08-15T19:14:48.787317Z","submitted_at":"2019-08-05T13:26:26Z","title":"The Role of Multiplicative Complexity in Compiling Low T-count Oracle Circuits","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-14T15:18:37.537311Z"},"links":{"citing_paper":"/paper/1908.01609"},"observation_digest":"sha256:84921988757cf44431cbaa509a50cf583fb2e961774431fe213bfc4e3ad3a824","observation_id":"94e86044-aaf3-428f-997c-cd07ec1c113b","resolution":{"observed_at":"2026-08-14T15:18:38.204337Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T15:18:38.186946Z","title":"REVS: A tool fo r space-optimized reversible circuit synthesis,","venue":null,"work_id":"f6c8e2b8-ed56-41d4-926a-0701748fdf1b","year":2017},"citing_paper":{"arxiv_id":"1908.01609","last_updated":"2019-08-05T13:26:26Z","snapshot_observed_at":"2026-08-15T19:14:48.787317Z","submitted_at":"2019-08-05T13:26:26Z","title":"The Role of Multiplicative Complexity in Compiling Low T-count Oracle Circuits","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-14T15:18:37.540579Z"},"links":{"citing_paper":"/paper/1908.01609"},"observation_digest":"sha256:cb8310f01e2c1390ee0173d4f6ab52f3743129962c527eb2b931ba644067de9e","observation_id":"e15450f1-b101-4021-9b9c-065fc90ec3dc","resolution":{"observed_at":"2026-08-14T15:18:38.191266Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T15:18:38.175944Z","title":null,"venue":null,"work_id":"f4ea10c4-3a3a-468d-a938-c74643f5d47a","year":2015},"citing_paper":{"arxiv_id":"1908.01609","last_updated":"2019-08-05T13:26:26Z","snapshot_observed_at":"2026-08-15T19:14:48.787317Z","submitted_at":"2019-08-05T13:26:26Z","title":"The Role of Multiplicative Complexity in Compiling Low T-count Oracle Circuits","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-14T15:18:37.543881Z"},"links":{"citing_paper":"/paper/1908.01609"},"observation_digest":"sha256:b52183eeeb20a308333d1707661beddb1988aeb598b7a4e8b574c84c58c1805d","observation_id":"855fb6c2-57e7-47e3-bb17-47fb0c35e8eb","resolution":{"observed_at":"2026-08-14T15:18:38.179582Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T15:18:38.163996Z","title":"DAG-awa re AIG rewriting: a fresh look at combinational logic synthesis,","venue":null,"work_id":"2ba1004e-7ac1-41ad-a40b-e46f981d423a","year":2006},"citing_paper":{"arxiv_id":"1908.01609","last_updated":"2019-08-05T13:26:26Z","snapshot_observed_at":"2026-08-15T19:14:48.787317Z","submitted_at":"2019-08-05T13:26:26Z","title":"The Role of Multiplicative Complexity in Compiling Low T-count Oracle Circuits","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-14T15:18:37.547325Z"},"links":{"citing_paper":"/paper/1908.01609"},"observation_digest":"sha256:1945292e369604a7d7a3281be17b69f1b688f0439871c097caafdbb90d56feb3","observation_id":"ced3172f-8d2e-4786-bbb9-c30392c6fcec","resolution":{"observed_at":"2026-08-14T15:18:38.168191Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T15:18:38.092721Z","title":"ESOP-based toffo li gate cascade generation,","venue":null,"work_id":"ecf673b5-9713-4141-8999-7815a19a80ec","year":2007},"citing_paper":{"arxiv_id":"1908.01609","last_updated":"2019-08-05T13:26:26Z","snapshot_observed_at":"2026-08-15T19:14:48.787317Z","submitted_at":"2019-08-05T13:26:26Z","title":"The Role of Multiplicative Complexity in Compiling Low T-count Oracle Circuits","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-14T15:18:37.550233Z"},"links":{"citing_paper":"/paper/1908.01609"},"observation_digest":"sha256:91065f336e22f83993722c673eae7119d73b1ab1a872f8f19dcd8e3633558ea3","observation_id":"9f8cede8-7030-4c86-987c-50c57504fe93","resolution":{"observed_at":"2026-08-14T15:18:38.146652Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T15:18:38.059319Z","title":"Applying grover’s algorithm to AES: quantum resource esti mates,","venue":null,"work_id":"de8a0599-9493-4654-a344-65fb8d392693","year":2016},"citing_paper":{"arxiv_id":"1908.01609","last_updated":"2019-08-05T13:26:26Z","snapshot_observed_at":"2026-08-15T19:14:48.787317Z","submitted_at":"2019-08-05T13:26:26Z","title":"The Role of Multiplicative Complexity in Compiling Low T-count Oracle Circuits","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-14T15:18:37.553181Z"},"links":{"citing_paper":"/paper/1908.01609"},"observation_digest":"sha256:e64bb3e91ff5b07427e1d68dc68549498fd21846556e25f96e48a0212111c708","observation_id":"4dbe1d93-3869-4476-9624-967cd6290532","resolution":{"observed_at":"2026-08-14T15:18:38.063293Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T15:18:38.045673Z","title":"Q#: Enabling scalable quantum computing and development with a high-lev el DSL,","venue":null,"work_id":"693510db-4dff-43df-b3ff-f8b9603318c8","year":2018},"citing_paper":{"arxiv_id":"1908.01609","last_updated":"2019-08-05T13:26:26Z","snapshot_observed_at":"2026-08-15T19:14:48.787317Z","submitted_at":"2019-08-05T13:26:26Z","title":"The Role of Multiplicative Complexity in Compiling Low T-count Oracle Circuits","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-14T15:18:37.556683Z"},"links":{"citing_paper":"/paper/1908.01609"},"observation_digest":"sha256:43aecdd6a5df45a6dff6d53669663bdf64c1fcc1e1b18f43f2ae9a9e2845b918","observation_id":"0c9de4cd-3447-48c8-84a7-a87fd240eaad","resolution":{"observed_at":"2026-08-14T15:18:38.049996Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T15:18:38.031217Z","title":"Z3: an efficient SMT solver ,","venue":null,"work_id":"58e83a38-08f8-4b8e-8f84-ceacb71ab6a5","year":2008},"citing_paper":{"arxiv_id":"1908.01609","last_updated":"2019-08-05T13:26:26Z","snapshot_observed_at":"2026-08-15T19:14:48.787317Z","submitted_at":"2019-08-05T13:26:26Z","title":"The Role of Multiplicative Complexity in Compiling Low T-count Oracle Circuits","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-14T15:18:37.559552Z"},"links":{"citing_paper":"/paper/1908.01609"},"observation_digest":"sha256:45ac2bf2091c0971f537b21a6e5e26a52404871e5beb0d1d90ba6428982e07a1","observation_id":"5ddeacd5-a006-48f6-9426-c7a5e40b7724","resolution":{"observed_at":"2026-08-14T15:18:38.036480Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T15:18:37.978957Z","title":"Synthesizing shortest linear straight-line programs over GF(2) using SA T,","venue":null,"work_id":"36f0134f-65c8-4aa4-b948-8e2ea57e6c81","year":2010},"citing_paper":{"arxiv_id":"1908.01609","last_updated":"2019-08-05T13:26:26Z","snapshot_observed_at":"2026-08-15T19:14:48.787317Z","submitted_at":"2019-08-05T13:26:26Z","title":"The Role of Multiplicative Complexity in Compiling Low T-count Oracle Circuits","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-14T15:18:37.612879Z"},"links":{"citing_paper":"/paper/1908.01609"},"observation_digest":"sha256:ba0b203180f37480a1f1e1f42313c0adebfa314864c1d2c816b32bd9c5aa5880","observation_id":"be7c4c0e-a3c4-4867-90ee-41038431b4e8","resolution":{"observed_at":"2026-08-14T15:18:38.022281Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T15:18:37.907076Z","title":"Aut omated optimization of large quantum circuits with continuous par ameters,","venue":null,"work_id":"cbca8304-6f9b-4ed0-a846-07db2b84f352","year":2018},"citing_paper":{"arxiv_id":"1908.01609","last_updated":"2019-08-05T13:26:26Z","snapshot_observed_at":"2026-08-15T19:14:48.787317Z","submitted_at":"2019-08-05T13:26:26Z","title":"The Role of Multiplicative Complexity in Compiling Low T-count Oracle Circuits","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-14T15:18:37.702622Z"},"links":{"citing_paper":"/paper/1908.01609"},"observation_digest":"sha256:26d601f1ca6a67effb5999672444dcd04df169407411fe1986e599cbb8f41751","observation_id":"d291b372-9334-4c5e-89db-682a8b36d9e9","resolution":{"observed_at":"2026-08-14T15:18:37.942322Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1712.01859","last_updated":"2018-08-13T15:01:18Z","snapshot_observed_at":"2026-08-14T20:06:36.036911Z","submitted_at":"2017-12-05T19:00:19Z","title":"On the CNOT-complexity of CNOT-PHASE circuits","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1712.01859","snapshot_observed_at":"2026-08-14T15:18:37.814285Z","title":"On the CNOT-complex ity of CNOT-phase circuits,","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"1908.01609","last_updated":"2019-08-05T13:26:26Z","snapshot_observed_at":"2026-08-15T19:14:48.787317Z","submitted_at":"2019-08-05T13:26:26Z","title":"The Role of Multiplicative Complexity in Compiling Low T-count Oracle Circuits","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-14T15:18:37.814285Z"},"links":{"cited_paper":"/paper/1712.01859","citing_paper":"/paper/1908.01609"},"observation_digest":"sha256:7395601b641a19e329841e3b2ad25645028af488be4434aa580ca63358a1bed5","observation_id":"7d55e2ca-639e-473d-b099-651338b97f32","resolution":{"observed_at":"2026-08-14T15:18:37.814285Z","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-14T15:18:37.877485Z","title":"SA T-based {CNOT, T} quantum circuit synthesis,","venue":null,"work_id":"a9c1e46e-9e66-454a-832b-3473132ccb35","year":2018},"citing_paper":{"arxiv_id":"1908.01609","last_updated":"2019-08-05T13:26:26Z","snapshot_observed_at":"2026-08-15T19:14:48.787317Z","submitted_at":"2019-08-05T13:26:26Z","title":"The Role of Multiplicative Complexity in Compiling Low T-count Oracle Circuits","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-14T15:18:37.838816Z"},"links":{"citing_paper":"/paper/1908.01609"},"observation_digest":"sha256:1cd88feba2e9c39d31b47ed6086666e8f0d9924b93566b58080b20dee0ca26d9","observation_id":"941bd76f-f95d-41bd-8264-2f71903f9ad2","resolution":{"observed_at":"2026-08-14T15:18:37.883296Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"1908.01609","last_updated":"2019-08-05T13:26:26Z","latest_version":1,"primary_category":"quant-ph","snapshot_observed_at":"2026-08-15T19:14:48.787317Z","submitted_at":"2019-08-05T13:26:26Z","title":"The Role of Multiplicative Complexity in Compiling Low T-count Oracle Circuits"},"reference_resolution":{"displayed":31,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":2,"verified_exact":0,"verified_fuzzy":29},"total_outbound_references":31},"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-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"thesis":"As of 16 August 2026, this Paper Citation Record lists 31 of 31 outbound references and 0 inbound Pith citation observations for arXiv:1908.01609."}