{"as_of":"2026-08-15T10:55:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:6b4c65c702b24387a9ff57833d699f2f1c7bb97c1a67a74738c97e816fc712c7","coverage":[{"denominator":47,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":47,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-14T11:58:37.431851Z","state":"measured"},{"denominator":47,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":47,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-15T06:32:42.880941+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.07943/citation-record","integrity":"/paper/1908.07943/integrity","json":"/paper/1908.07943/citation-record.json","paper":"/paper/1908.07943"},"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-14T11:58:40.251334Z","title":"Cisco forecasts that 77 EB data traffic will be generated per month by 2022 [1]","venue":null,"work_id":"d4d6bba4-7532-42c6-ae58-ac9c43efa353","year":2022},"citing_paper":{"arxiv_id":"1908.07943","last_updated":"2019-08-21T15:47:34Z","snapshot_observed_at":"2026-08-14T11:51:12.967276Z","submitted_at":"2019-08-21T15:47:34Z","title":"An Optimized Quantum Maximum or Minimum Searching Algorithm and its Circuits","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-14T11:58:36.627239Z"},"links":{"citing_paper":"/paper/1908.07943"},"observation_digest":"sha256:ddc2cdd951f7079e5d5f5a4210f3c3fe62d8d85c9da1b8b776506db0a298a1cb","observation_id":"c172299d-3252-4fc6-a0e5-6ed7059c53e8","resolution":{"observed_at":"2026-08-14T11:58:40.257530Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-14T11:58:40.075972Z","title":"The problem is to find the maximum or minimum from 𝐷","venue":null,"work_id":"357fc9f8-f6cf-4459-8e74-d9f95e58f80d","year":null},"citing_paper":{"arxiv_id":"1908.07943","last_updated":"2019-08-21T15:47:34Z","snapshot_observed_at":"2026-08-14T11:51:12.967276Z","submitted_at":"2019-08-21T15:47:34Z","title":"An Optimized Quantum Maximum or Minimum Searching Algorithm and its Circuits","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-14T11:58:36.633842Z"},"links":{"citing_paper":"/paper/1908.07943"},"observation_digest":"sha256:59d51ae171d5b3e23aeee6e02e104d7929b6ad2e62316a74f7fe4784635b25e8","observation_id":"3f8eef9d-893b-409c-ad82-8ab838829cfb","resolution":{"observed_at":"2026-08-14T11:58:40.206503Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-14T11:58:40.059118Z","title":"Especially, when 𝑁 = 2𝑛, the initial state is a uniform superposition state, the 𝑊 operator becomes 𝐻⨂𝑛, where 𝐻 is the Walsh-Hadamard transformation; 𝑛 is the number of qubits","venue":null,"work_id":"6de8630c-6c44-4343-80a0-af50cd018ee4","year":null},"citing_paper":{"arxiv_id":"1908.07943","last_updated":"2019-08-21T15:47:34Z","snapshot_observed_at":"2026-08-14T11:51:12.967276Z","submitted_at":"2019-08-21T15:47:34Z","title":"An Optimized Quantum Maximum or Minimum Searching Algorithm and its Circuits","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-14T11:58:36.639578Z"},"links":{"citing_paper":"/paper/1908.07943"},"observation_digest":"sha256:784c2f95a744935902661ba63156a6ad38a798c7e4d60bac2f45a9de4654ff26","observation_id":"eb12a4c2-6377-4df1-9e16-d80c291932a9","resolution":{"observed_at":"2026-08-14T11:58:40.065166Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-14T11:58:39.885290Z","title":null,"venue":null,"work_id":"1a01f2b3-f3eb-4826-8192-d3106078ca3c","year":null},"citing_paper":{"arxiv_id":"1908.07943","last_updated":"2019-08-21T15:47:34Z","snapshot_observed_at":"2026-08-14T11:51:12.967276Z","submitted_at":"2019-08-21T15:47:34Z","title":"An Optimized Quantum Maximum or Minimum Searching Algorithm and its Circuits","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-14T11:58:36.645646Z"},"links":{"citing_paper":"/paper/1908.07943"},"observation_digest":"sha256:872ae7390fd7cab3c270fc5d8c84d293fb42a0d74b77509d2b6ab9b4fa99668e","observation_id":"7ddade9b-db9b-4fe0-8ccb-bd5add787cce","resolution":{"observed_at":"2026-08-14T11:58:39.947648Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-14T11:58:39.867827Z","title":"Specifical ly, we propose two methods to reduce the failure rate and compare the complexity of DHA and our algorithm","venue":null,"work_id":"001c1a95-0028-4ef6-804f-e618bcd3fcac","year":null},"citing_paper":{"arxiv_id":"1908.07943","last_updated":"2019-08-21T15:47:34Z","snapshot_observed_at":"2026-08-14T11:51:12.967276Z","submitted_at":"2019-08-21T15:47:34Z","title":"An Optimized Quantum Maximum or Minimum Searching Algorithm and its Circuits","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-14T11:58:36.720133Z"},"links":{"citing_paper":"/paper/1908.07943"},"observation_digest":"sha256:39ec0f79ee5b0c6f2e1034fb508646ffd8020eb283e9b5283b2c3a00dd04ded6","observation_id":"539236e8-2159-43cf-ae7e-383bfe2cfaa5","resolution":{"observed_at":"2026-08-14T11:58:39.874178Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-14T11:58:39.850556Z","title":null,"venue":null,"work_id":"cf6b0c5a-46d0-46c9-a972-c0bcc5078829","year":null},"citing_paper":{"arxiv_id":"1908.07943","last_updated":"2019-08-21T15:47:34Z","snapshot_observed_at":"2026-08-14T11:51:12.967276Z","submitted_at":"2019-08-21T15:47:34Z","title":"An Optimized Quantum Maximum or Minimum Searching Algorithm and its Circuits","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-14T11:58:36.745777Z"},"links":{"citing_paper":"/paper/1908.07943"},"observation_digest":"sha256:540405dfd2b1fdee3d3c64fe33e26bcaa9cb627b928cf6a7b08fb1feafb326a8","observation_id":"2041abbc-0302-4834-9b29-9bf4afc9505a","resolution":{"observed_at":"2026-08-14T11:58:39.855863Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-14T11:58:39.817542Z","title":null,"venue":null,"work_id":"b99fc3f7-4e0c-4bce-9d0b-0d1f1ebb110e","year":null},"citing_paper":{"arxiv_id":"1908.07943","last_updated":"2019-08-21T15:47:34Z","snapshot_observed_at":"2026-08-14T11:51:12.967276Z","submitted_at":"2019-08-21T15:47:34Z","title":"An Optimized Quantum Maximum or Minimum Searching Algorithm and its Circuits","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-14T11:58:36.751200Z"},"links":{"citing_paper":"/paper/1908.07943"},"observation_digest":"sha256:249a46b7fd339e99c2569736ee8db3dd5ce42a5e8d6c1a97b26510ed3a69e7d5","observation_id":"a49ea5e5-621f-4de5-8259-c44e180d9240","resolution":{"observed_at":"2026-08-14T11:58:39.838423Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-14T11:58:39.800906Z","title":"If we want to obtain the exact value of 𝛽, 𝐽, 𝜙, we must know 𝑀 𝑁","venue":null,"work_id":"1e6d9359-5a8e-431a-bf53-bb1fdbea0159","year":null},"citing_paper":{"arxiv_id":"1908.07943","last_updated":"2019-08-21T15:47:34Z","snapshot_observed_at":"2026-08-14T11:51:12.967276Z","submitted_at":"2019-08-21T15:47:34Z","title":"An Optimized Quantum Maximum or Minimum Searching Algorithm and its Circuits","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-14T11:58:36.757757Z"},"links":{"citing_paper":"/paper/1908.07943"},"observation_digest":"sha256:9dd6994f892b022203bdca4db3df4a0794d8fc142289255a95751eadc090fc86","observation_id":"0486e986-fcc6-48ba-87ca-a7c43d3c5c27","resolution":{"observed_at":"2026-08-14T11:58:39.806727Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-14T11:58:39.685773Z","title":"We can obtain 𝑑1, less than or equal to 𝑑0","venue":null,"work_id":"6f7ab3fe-29fa-4e58-abf6-09c72a8611e8","year":null},"citing_paper":{"arxiv_id":"1908.07943","last_updated":"2019-08-21T15:47:34Z","snapshot_observed_at":"2026-08-14T11:51:12.967276Z","submitted_at":"2019-08-21T15:47:34Z","title":"An Optimized Quantum Maximum or Minimum Searching Algorithm and its Circuits","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-14T11:58:36.762738Z"},"links":{"citing_paper":"/paper/1908.07943"},"observation_digest":"sha256:2c678aec7b3048c9da76b727743925f242224cfee9d0568bd7e736786b289c5e","observation_id":"f468a67d-a1ed-4216-950a-08a27a9e633e","resolution":{"observed_at":"2026-08-14T11:58:39.738109Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-14T11:58:39.670533Z","title":"Based on Grover -Long algorithm, we proposed QUMMSA, which is an improved version of DHA","venue":null,"work_id":"f52558ce-64ad-41ef-98ce-20221f120098","year":null},"citing_paper":{"arxiv_id":"1908.07943","last_updated":"2019-08-21T15:47:34Z","snapshot_observed_at":"2026-08-14T11:51:12.967276Z","submitted_at":"2019-08-21T15:47:34Z","title":"An Optimized Quantum Maximum or Minimum Searching Algorithm and its Circuits","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-14T11:58:36.770875Z"},"links":{"citing_paper":"/paper/1908.07943"},"observation_digest":"sha256:bbe173070e77eb20dbfe93b247e7f7b5111df87d36cb92227c67f463b14ca9b9","observation_id":"0ac541ef-5d4b-49dc-b934-b6f2a5692dde","resolution":{"observed_at":"2026-08-14T11:58:39.675605Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-14T11:58:39.475304Z","title":null,"venue":null,"work_id":"36fb928a-1a35-46d9-bcc8-1bdb6b399186","year":2016},"citing_paper":{"arxiv_id":"1908.07943","last_updated":"2019-08-21T15:47:34Z","snapshot_observed_at":"2026-08-14T11:51:12.967276Z","submitted_at":"2019-08-21T15:47:34Z","title":"An Optimized Quantum Maximum or Minimum Searching Algorithm and its Circuits","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-14T11:58:36.775690Z"},"links":{"citing_paper":"/paper/1908.07943"},"observation_digest":"sha256:92a3d154317d149a5165a7f87f7f5b4db958692468326621909192369e801aa2","observation_id":"682bb71a-a4d3-47cc-9972-3eaecd2537f4","resolution":{"observed_at":"2026-08-14T11:58:39.602368Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-14T11:58:39.397396Z","title":"Quantum algorithm design: Techniques and applications","venue":null,"work_id":"c3559e1d-96e3-4dbb-abf5-e9a000336752","year":2019},"citing_paper":{"arxiv_id":"1908.07943","last_updated":"2019-08-21T15:47:34Z","snapshot_observed_at":"2026-08-14T11:51:12.967276Z","submitted_at":"2019-08-21T15:47:34Z","title":"An Optimized Quantum Maximum or Minimum Searching Algorithm and its Circuits","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-14T11:58:36.864790Z"},"links":{"citing_paper":"/paper/1908.07943"},"observation_digest":"sha256:2c7296df3876fde36562c1a1c34316a6c9ea6e5b181261c55b6a088027ba99df","observation_id":"fd3e4ee5-9522-4e4b-a0a9-f6509413e386","resolution":{"observed_at":"2026-08-14T11:58:39.402420Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-14T11:58:39.381084Z","title":"Quantum theory, the Church –Turing principle and the universal quantum computer[J]","venue":null,"work_id":"5d0b40bc-a68c-4457-9a2b-c8f44bb744b6","year":1985},"citing_paper":{"arxiv_id":"1908.07943","last_updated":"2019-08-21T15:47:34Z","snapshot_observed_at":"2026-08-14T11:51:12.967276Z","submitted_at":"2019-08-21T15:47:34Z","title":"An Optimized Quantum Maximum or Minimum Searching Algorithm and its Circuits","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-14T11:58:36.890275Z"},"links":{"citing_paper":"/paper/1908.07943"},"observation_digest":"sha256:11736f61cd701c3def90597728989e9bdc72938d685f900e13955efd37a19895","observation_id":"78eed9c1-57eb-4d4c-9d33-a56413c09d88","resolution":{"observed_at":"2026-08-14T11:58:39.386753Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-14T11:58:39.303874Z","title":"Rapid solution of problems by quantum computation[J]","venue":null,"work_id":"2dc7547f-799c-4451-bb38-f6332ae3a18b","year":1907},"citing_paper":{"arxiv_id":"1908.07943","last_updated":"2019-08-21T15:47:34Z","snapshot_observed_at":"2026-08-14T11:51:12.967276Z","submitted_at":"2019-08-21T15:47:34Z","title":"An Optimized Quantum Maximum or Minimum Searching Algorithm and its Circuits","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-14T11:58:36.895115Z"},"links":{"citing_paper":"/paper/1908.07943"},"observation_digest":"sha256:67c72ff56a31bb7ebf06583c2be89059253d8cedbf3fa090d667aa202a0ef525","observation_id":"d58eda12-b158-40af-8d1c-af31d795a592","resolution":{"observed_at":"2026-08-14T11:58:39.338969Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-14T11:58:39.287418Z","title":"Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer[J]","venue":null,"work_id":"3f73d5b4-5566-4981-ba30-894dc0caeddb","year":1999},"citing_paper":{"arxiv_id":"1908.07943","last_updated":"2019-08-21T15:47:34Z","snapshot_observed_at":"2026-08-14T11:51:12.967276Z","submitted_at":"2019-08-21T15:47:34Z","title":"An Optimized Quantum Maximum or Minimum Searching Algorithm and its Circuits","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-14T11:58:36.899889Z"},"links":{"citing_paper":"/paper/1908.07943"},"observation_digest":"sha256:88dcc4dd8d061e9c09e1db233d30827ae56f277a84fcb8dd83fde24a609b49c4","observation_id":"85898b09-c314-4210-a477-f5f8ace20c5e","resolution":{"observed_at":"2026-08-14T11:58:39.293036Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-14T11:58:39.271274Z","title":"A fast quantum mechanical algorithm for database search[C]// Proc","venue":null,"work_id":"5f121b7e-756f-46d3-aef8-65de400f43a0","year":1996},"citing_paper":{"arxiv_id":"1908.07943","last_updated":"2019-08-21T15:47:34Z","snapshot_observed_at":"2026-08-14T11:51:12.967276Z","submitted_at":"2019-08-21T15:47:34Z","title":"An Optimized Quantum Maximum or Minimum Searching Algorithm and its Circuits","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-14T11:58:36.905567Z"},"links":{"citing_paper":"/paper/1908.07943"},"observation_digest":"sha256:7ec1a4850b39f9a89bb69784644501de0043d58de6dac8fbc1af84ff88faccec","observation_id":"252cd439-daaf-4b48-b968-0b8a2d93e532","resolution":{"observed_at":"2026-08-14T11:58:39.276842Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-14T11:58:39.120957Z","title":"Quantum mechanics helps in searching for a needle in a haystack[J]","venue":null,"work_id":"53a60b14-aa7c-40ba-8004-faacb454ac44","year":1997},"citing_paper":{"arxiv_id":"1908.07943","last_updated":"2019-08-21T15:47:34Z","snapshot_observed_at":"2026-08-14T11:51:12.967276Z","submitted_at":"2019-08-21T15:47:34Z","title":"An Optimized Quantum Maximum or Minimum Searching Algorithm and its Circuits","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-14T11:58:36.910847Z"},"links":{"citing_paper":"/paper/1908.07943"},"observation_digest":"sha256:35e60c167c453e36242af0482700ec21c03012eafa4247c8570226f7eecffc8d","observation_id":"be7bc6f2-9dfe-4c08-b493-77318f62cd97","resolution":{"observed_at":"2026-08-14T11:58:39.225599Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-14T11:58:39.041015Z","title":"Quantum computers can search rapidly by using almost any transformation[J]","venue":null,"work_id":"fdae8fb9-8416-4a4d-a592-f802dd9fb07e","year":1998},"citing_paper":{"arxiv_id":"1908.07943","last_updated":"2019-08-21T15:47:34Z","snapshot_observed_at":"2026-08-14T11:51:12.967276Z","submitted_at":"2019-08-21T15:47:34Z","title":"An Optimized Quantum Maximum or Minimum Searching Algorithm and its Circuits","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-14T11:58:36.924095Z"},"links":{"citing_paper":"/paper/1908.07943"},"observation_digest":"sha256:374d5318f66bfce1dc4c8614d11ccfe1ce44cbbd66ee9cbb21148716b1b5f82b","observation_id":"410fa7cb-964f-4c11-bb0f-14025d1ff408","resolution":{"observed_at":"2026-08-14T11:58:39.059158Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-14T11:58:39.025066Z","title":"Exactness of the original Grover search algorithm[J]","venue":null,"work_id":"daf0ab74-7a24-44e6-8522-3ab4b5b3def9","year":2010},"citing_paper":{"arxiv_id":"1908.07943","last_updated":"2019-08-21T15:47:34Z","snapshot_observed_at":"2026-08-14T11:51:12.967276Z","submitted_at":"2019-08-21T15:47:34Z","title":"An Optimized Quantum Maximum or Minimum Searching Algorithm and its Circuits","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-14T11:58:36.961401Z"},"links":{"citing_paper":"/paper/1908.07943"},"observation_digest":"sha256:81158cd810cc45805334c7e7980de42090d5363f8bd1505dea29ff73577ecb16","observation_id":"47982439-e33a-4a9c-a7aa-cffe8cdb124a","resolution":{"observed_at":"2026-08-14T11:58:39.029868Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-14T11:58:38.968612Z","title":"Grover’s quantum search algorithm for an arbitrary initial amplitude distribution[J]","venue":null,"work_id":"c19b1a3a-ddf2-4455-b6c8-f41e411a92be","year":1999},"citing_paper":{"arxiv_id":"1908.07943","last_updated":"2019-08-21T15:47:34Z","snapshot_observed_at":"2026-08-14T11:51:12.967276Z","submitted_at":"2019-08-21T15:47:34Z","title":"An Optimized Quantum Maximum or Minimum Searching Algorithm and its Circuits","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-14T11:58:36.973284Z"},"links":{"citing_paper":"/paper/1908.07943"},"observation_digest":"sha256:ada90152a79eb5b82162347de5a733ee8c5db7f36ca7e010611cb650a37de915","observation_id":"44bd6f1a-3a50-439d-96e7-d570b043f160","resolution":{"observed_at":"2026-08-14T11:58:39.013837Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-14T11:58:38.929175Z","title":"Analysis of generalized Grover quantum search algorithms using recursion equations[J]","venue":null,"work_id":"da382553-5891-4ba3-9609-6e3d95c59386","year":2000},"citing_paper":{"arxiv_id":"1908.07943","last_updated":"2019-08-21T15:47:34Z","snapshot_observed_at":"2026-08-14T11:51:12.967276Z","submitted_at":"2019-08-21T15:47:34Z","title":"An Optimized Quantum Maximum or Minimum Searching Algorithm and its Circuits","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-14T11:58:36.978587Z"},"links":{"citing_paper":"/paper/1908.07943"},"observation_digest":"sha256:c2bbb0202632245289c6b2a2a04b4986389a7fabe29e2cbebca1d63fb2660f42","observation_id":"21e39402-f9ce-4bf1-823d-4f50199e4018","resolution":{"observed_at":"2026-08-14T11:58:38.934895Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-14T11:58:38.743672Z","title":"Arbitrary phases in quantum amplitude amplification[J]","venue":null,"work_id":"19a360cd-a4ac-43f4-af77-41746b5e4042","year":2000},"citing_paper":{"arxiv_id":"1908.07943","last_updated":"2019-08-21T15:47:34Z","snapshot_observed_at":"2026-08-14T11:51:12.967276Z","submitted_at":"2019-08-21T15:47:34Z","title":"An Optimized Quantum Maximum or Minimum Searching Algorithm and its Circuits","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-14T11:58:36.983583Z"},"links":{"citing_paper":"/paper/1908.07943"},"observation_digest":"sha256:10b7e519ebab89ce154487be70834509769303aba3b1d944019db908f1d1e367","observation_id":"378976f8-7123-4444-b4b8-b13da914cda2","resolution":{"observed_at":"2026-08-14T11:58:38.878349Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-14T11:58:38.728157Z","title":"Fixed-point quantum search[J]","venue":null,"work_id":"56ff23b6-4ab8-4537-9af6-54a6572a1d65","year":2005},"citing_paper":{"arxiv_id":"1908.07943","last_updated":"2019-08-21T15:47:34Z","snapshot_observed_at":"2026-08-14T11:51:12.967276Z","submitted_at":"2019-08-21T15:47:34Z","title":"An Optimized Quantum Maximum or Minimum Searching Algorithm and its Circuits","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-14T11:58:36.988633Z"},"links":{"citing_paper":"/paper/1908.07943"},"observation_digest":"sha256:22b41f469655fc4cdb4ce687d59841cf5db06230c2c7299e3a9d95375f166938","observation_id":"8fb088af-0d64-4aee-8e37-e5cebe7c05c5","resolution":{"observed_at":"2026-08-14T11:58:38.733002Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-14T11:58:38.712670Z","title":"Phase matching in quantum searching[J]","venue":null,"work_id":"a995d57f-754f-45f2-9e99-33ad7391dc93","year":1999},"citing_paper":{"arxiv_id":"1908.07943","last_updated":"2019-08-21T15:47:34Z","snapshot_observed_at":"2026-08-14T11:51:12.967276Z","submitted_at":"2019-08-21T15:47:34Z","title":"An Optimized Quantum Maximum or Minimum Searching Algorithm and its Circuits","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-14T11:58:37.051884Z"},"links":{"citing_paper":"/paper/1908.07943"},"observation_digest":"sha256:8f5a501f5936214452e366c8ebfb4441dc77fe7b0057a4af79faa836b1b972cf","observation_id":"1861fdc3-5c4d-47e8-9153-a6caea212c96","resolution":{"observed_at":"2026-08-14T11:58:38.717729Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-14T11:58:38.632398Z","title":"Phase matching condition for quantum search with a generalized initial state[J]","venue":null,"work_id":"ea0895e9-d062-4c0b-9ded-5a243c410427","year":2002},"citing_paper":{"arxiv_id":"1908.07943","last_updated":"2019-08-21T15:47:34Z","snapshot_observed_at":"2026-08-14T11:51:12.967276Z","submitted_at":"2019-08-21T15:47:34Z","title":"An Optimized Quantum Maximum or Minimum Searching Algorithm and its Circuits","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-14T11:58:37.073342Z"},"links":{"citing_paper":"/paper/1908.07943"},"observation_digest":"sha256:fa8ed6b6ffa9526a2f9a585b36f2481eb2e7327b01961b68c306953fa15f4d35","observation_id":"8ebcb8e6-a55c-4f2b-aa97-579ebad4779c","resolution":{"observed_at":"2026-08-14T11:58:38.701367Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-14T11:58:38.578273Z","title":"Grover algorithm with zero theoretical failure rate","venue":null,"work_id":"d55f968d-b4f3-470a-a1bc-88681fa46fbd","year":2001},"citing_paper":{"arxiv_id":"1908.07943","last_updated":"2019-08-21T15:47:34Z","snapshot_observed_at":"2026-08-14T11:51:12.967276Z","submitted_at":"2019-08-21T15:47:34Z","title":"An Optimized Quantum Maximum or Minimum Searching Algorithm and its Circuits","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-14T11:58:37.078335Z"},"links":{"citing_paper":"/paper/1908.07943"},"observation_digest":"sha256:3dead75263e2ae1789227967f2597e7955a1f81ded67a5229e3655720dfb356d","observation_id":"1ac581b5-4a35-444c-91a5-50448ccab52b","resolution":{"observed_at":"2026-08-14T11:58:38.583739Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-14T11:58:38.523609Z","title":"Tight bounds on quantum searching[J]","venue":null,"work_id":"cb278703-4300-4fa8-8100-02e42f5c49de","year":1998},"citing_paper":{"arxiv_id":"1908.07943","last_updated":"2019-08-21T15:47:34Z","snapshot_observed_at":"2026-08-14T11:51:12.967276Z","submitted_at":"2019-08-21T15:47:34Z","title":"An Optimized Quantum Maximum or Minimum Searching Algorithm and its Circuits","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-14T11:58:37.083995Z"},"links":{"citing_paper":"/paper/1908.07943"},"observation_digest":"sha256:7cb8469aa21496215d39e6c8c704f3f2f6ba2812b5a1c475f665baead3bdc718","observation_id":"9b62ed34-a626-4403-901d-eb5c43362309","resolution":{"observed_at":"2026-08-14T11:58:38.566348Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-14T11:58:38.456956Z","title":"Quantum counting[C]//International Colloquium on Automata, Languages, and Programming","venue":null,"work_id":"7179ce46-3c2e-4b07-8981-1d8a9d437664","year":1998},"citing_paper":{"arxiv_id":"1908.07943","last_updated":"2019-08-21T15:47:34Z","snapshot_observed_at":"2026-08-14T11:51:12.967276Z","submitted_at":"2019-08-21T15:47:34Z","title":"An Optimized Quantum Maximum or Minimum Searching Algorithm and its Circuits","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-14T11:58:37.107034Z"},"links":{"citing_paper":"/paper/1908.07943"},"observation_digest":"sha256:3e9cc9c4d844dd55ec870245eb71f550c72f4894a368cd9143ac3e9adc12412d","observation_id":"37b2d9e5-0088-4c60-869a-87373eebf623","resolution":{"observed_at":"2026-08-14T11:58:38.462031Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-14T11:58:38.441165Z","title":"Quantum amplitude amplification and estimation[J]","venue":null,"work_id":"bf5cf2d3-d650-4e4f-ba1a-61f2aa86a10a","year":2002},"citing_paper":{"arxiv_id":"1908.07943","last_updated":"2019-08-21T15:47:34Z","snapshot_observed_at":"2026-08-14T11:51:12.967276Z","submitted_at":"2019-08-21T15:47:34Z","title":"An Optimized Quantum Maximum or Minimum Searching Algorithm and its Circuits","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-14T11:58:37.151648Z"},"links":{"citing_paper":"/paper/1908.07943"},"observation_digest":"sha256:e3e036be81e074cf256548cd8447001c8a34534926c731fd7da2a9719dfce651","observation_id":"f25d6373-0ce2-4ec8-a018-c984cb566a28","resolution":{"observed_at":"2026-08-14T11:58:38.446293Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-14T11:58:38.413440Z","title":"Quantum search with certainty based on modified Grover algorithms: optimum choice of parameters[J]","venue":null,"work_id":"ce3221e9-2a33-4708-908d-ce004404921c","year":2013},"citing_paper":{"arxiv_id":"1908.07943","last_updated":"2019-08-21T15:47:34Z","snapshot_observed_at":"2026-08-14T11:51:12.967276Z","submitted_at":"2019-08-21T15:47:34Z","title":"An Optimized Quantum Maximum or Minimum Searching Algorithm and its Circuits","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-14T11:58:37.175458Z"},"links":{"citing_paper":"/paper/1908.07943"},"observation_digest":"sha256:0e00d07c7a44832784c86683f2df8caea6f31c9d677674c1cf28e09023703d89","observation_id":"69040293-27c6-4aa7-90fa-6f466e8954ba","resolution":{"observed_at":"2026-08-14T11:58:38.429703Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-14T11:58:38.320654Z","title":"Highlighting the mechanism of the quantum speedup by time -symmetric and relational quantum mechanics[J]","venue":null,"work_id":"d78c03fa-90bf-40c5-8ebf-e1dde061cd7e","year":2016},"citing_paper":{"arxiv_id":"1908.07943","last_updated":"2019-08-21T15:47:34Z","snapshot_observed_at":"2026-08-14T11:51:12.967276Z","submitted_at":"2019-08-21T15:47:34Z","title":"An Optimized Quantum Maximum or Minimum Searching Algorithm and its Circuits","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-14T11:58:37.181118Z"},"links":{"citing_paper":"/paper/1908.07943"},"observation_digest":"sha256:73336519bfaccdad00951bb8b5fed7e091147b1058fcdabf8c6bcd01cef22676","observation_id":"67bafdc1-9adc-4fe8-bb0b-fac3477bc4b3","resolution":{"observed_at":"2026-08-14T11:58:38.326052Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"quant-ph/9607014","last_updated":"1999-01-07T16:50:45Z","snapshot_observed_at":"2026-08-12T22:54:40.402900Z","submitted_at":"1996-07-18T19:12:42Z","title":"A Quantum Algorithm for Finding the Minimum","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"quant-ph/9607014","snapshot_observed_at":"2026-08-14T11:58:37.186377Z","title":"A quantum algorithm for finding the minimum[J]","venue":null,"work_id":null,"year":1996},"citing_paper":{"arxiv_id":"1908.07943","last_updated":"2019-08-21T15:47:34Z","snapshot_observed_at":"2026-08-14T11:51:12.967276Z","submitted_at":"2019-08-21T15:47:34Z","title":"An Optimized Quantum Maximum or Minimum Searching Algorithm and its Circuits","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-14T11:58:37.186377Z"},"links":{"cited_paper":"/paper/quant-ph/9607014","citing_paper":"/paper/1908.07943"},"observation_digest":"sha256:234160e423f62f25df1e7e237ece7db19f81cf62bde02930e1696e1afa5e02ee","observation_id":"7a205b30-6fd1-4673-b126-5903169d621c","resolution":{"observed_at":"2026-08-14T11:58:37.186377Z","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-14T11:58:38.218912Z","title":"A new quantum algorithm for solving the minimum searching problem[J]","venue":null,"work_id":"e377a9b5-4643-4270-9d80-775c8ef1a528","year":2008},"citing_paper":{"arxiv_id":"1908.07943","last_updated":"2019-08-21T15:47:34Z","snapshot_observed_at":"2026-08-14T11:51:12.967276Z","submitted_at":"2019-08-21T15:47:34Z","title":"An Optimized Quantum Maximum or Minimum Searching Algorithm and its Circuits","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-14T11:58:37.192427Z"},"links":{"citing_paper":"/paper/1908.07943"},"observation_digest":"sha256:0d8ba9e5325804a83d0b6976ce5fd7172fbc8ee6821fc581c778b4fd51de2b34","observation_id":"5173bd86-c13e-4277-84e2-4eb06b4aa7b3","resolution":{"observed_at":"2026-08-14T11:58:38.309538Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-14T11:58:38.137902Z","title":"Experimental implementation of fa st quantum searching[J]","venue":null,"work_id":"f6d43c48-3149-48da-8dfd-86817840de53","year":1998},"citing_paper":{"arxiv_id":"1908.07943","last_updated":"2019-08-21T15:47:34Z","snapshot_observed_at":"2026-08-14T11:51:12.967276Z","submitted_at":"2019-08-21T15:47:34Z","title":"An Optimized Quantum Maximum or Minimum Searching Algorithm and its Circuits","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-14T11:58:37.222081Z"},"links":{"citing_paper":"/paper/1908.07943"},"observation_digest":"sha256:723636c388c36535509bf8ae7d47c4f5955827d66c86510577159c3b2d99dd1f","observation_id":"caae6fdb-8c52-41fc-9bb2-7ff03651e551","resolution":{"observed_at":"2026-08-14T11:58:38.163714Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-14T11:58:38.121525Z","title":"Implementation of a three -quantum-bit search algorithm[J]","venue":null,"work_id":"49ab37b5-46ef-4dec-8f80-e2f9b6a449ac","year":2000},"citing_paper":{"arxiv_id":"1908.07943","last_updated":"2019-08-21T15:47:34Z","snapshot_observed_at":"2026-08-14T11:51:12.967276Z","submitted_at":"2019-08-21T15:47:34Z","title":"An Optimized Quantum Maximum or Minimum Searching Algorithm and its Circuits","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-14T11:58:37.273506Z"},"links":{"citing_paper":"/paper/1908.07943"},"observation_digest":"sha256:3e886c98d45ebf78c7fc586d3a05c90fe0494bc24dbb1f88ffc42c47c5736b75","observation_id":"38ec467f-1ce6-4e87-a2d0-1aba6be932a1","resolution":{"observed_at":"2026-08-14T11:58:38.126949Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-14T11:58:38.023058Z","title":"Implementation of a three -quantum-bit search algorithm[J]","venue":null,"work_id":"f77e78ce-6f8a-4aa9-98bf-7ca09df3f95e","year":2000},"citing_paper":{"arxiv_id":"1908.07943","last_updated":"2019-08-21T15:47:34Z","snapshot_observed_at":"2026-08-14T11:51:12.967276Z","submitted_at":"2019-08-21T15:47:34Z","title":"An Optimized Quantum Maximum or Minimum Searching Algorithm and its Circuits","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-14T11:58:37.278954Z"},"links":{"citing_paper":"/paper/1908.07943"},"observation_digest":"sha256:bbfc2beb6cc79dc2500ff97ab7d152d93c9b8362026b9f63af96df7c09f26553","observation_id":"9d550352-1bc4-4066-be0f-a0f3173d1dbf","resolution":{"observed_at":"2026-08-14T11:58:38.061585Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-14T11:58:38.006561Z","title":"Demonstration of two -qubit algorithms with a superconducting quantum processor[J]","venue":null,"work_id":"87bdc642-e59d-4ef8-879d-1d387c0a0f7a","year":2009},"citing_paper":{"arxiv_id":"1908.07943","last_updated":"2019-08-21T15:47:34Z","snapshot_observed_at":"2026-08-14T11:51:12.967276Z","submitted_at":"2019-08-21T15:47:34Z","title":"An Optimized Quantum Maximum or Minimum Searching Algorithm and its Circuits","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-14T11:58:37.283406Z"},"links":{"citing_paper":"/paper/1908.07943"},"observation_digest":"sha256:3c2284d8cf84132bd76fff9d7983d57b576239c59b9f4b9cb857c79aa23b3a61","observation_id":"e4835549-4b71-44f1-a4d1-2c644b275495","resolution":{"observed_at":"2026-08-14T11:58:38.012081Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-14T11:58:37.898447Z","title":"Implementation of Grover ’s quantum search algorithm in a scalable system[J]","venue":null,"work_id":"eda2935d-6e87-46c6-819f-9e27a51fabd4","year":2005},"citing_paper":{"arxiv_id":"1908.07943","last_updated":"2019-08-21T15:47:34Z","snapshot_observed_at":"2026-08-14T11:51:12.967276Z","submitted_at":"2019-08-21T15:47:34Z","title":"An Optimized Quantum Maximum or Minimum Searching Algorithm and its Circuits","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-14T11:58:37.288340Z"},"links":{"citing_paper":"/paper/1908.07943"},"observation_digest":"sha256:b91744691b87e34f90fc143f8618d623b83bba5606987f35678e3264ad07c4f8","observation_id":"16744555-6f97-4a5c-b6ea-1cd44478b41e","resolution":{"observed_at":"2026-08-14T11:58:37.966128Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-14T11:58:37.882026Z","title":"Demon stration of a small programmable quantum computer with atomic qubits[J]","venue":null,"work_id":"7b37b599-0b1a-4cb4-8851-0e03d4c7baed","year":2016},"citing_paper":{"arxiv_id":"1908.07943","last_updated":"2019-08-21T15:47:34Z","snapshot_observed_at":"2026-08-14T11:51:12.967276Z","submitted_at":"2019-08-21T15:47:34Z","title":"An Optimized Quantum Maximum or Minimum Searching Algorithm and its Circuits","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-14T11:58:37.293185Z"},"links":{"citing_paper":"/paper/1908.07943"},"observation_digest":"sha256:611a07f8133375ee79bfe16ac0121f865b066343d9749d13c8592ecbab6d0baf","observation_id":"94bd0378-b24d-4645-ab54-b0476e537685","resolution":{"observed_at":"2026-08-14T11:58:37.887037Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-14T11:58:37.865392Z","title":"Complete 3-qubit Grover search on a programmable quantum computer[J]","venue":null,"work_id":"4d344722-79f0-4694-8005-00f1ac77dd4c","year":2017},"citing_paper":{"arxiv_id":"1908.07943","last_updated":"2019-08-21T15:47:34Z","snapshot_observed_at":"2026-08-14T11:51:12.967276Z","submitted_at":"2019-08-21T15:47:34Z","title":"An Optimized Quantum Maximum or Minimum Searching Algorithm and its Circuits","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-14T11:58:37.297417Z"},"links":{"citing_paper":"/paper/1908.07943"},"observation_digest":"sha256:f581090c9c44f0f06ebbe48d9c5b8ce622863f02e7b76c85966f7f0b762f2ec3","observation_id":"0cfbee70-1613-4fae-ae94-14d9f6f0eeef","resolution":{"observed_at":"2026-08-14T11:58:37.870339Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-14T11:58:37.794040Z","title":"Experimental one-way quantum computing[J]","venue":null,"work_id":"0238a883-b384-4048-9714-3463abc63072","year":2005},"citing_paper":{"arxiv_id":"1908.07943","last_updated":"2019-08-21T15:47:34Z","snapshot_observed_at":"2026-08-14T11:51:12.967276Z","submitted_at":"2019-08-21T15:47:34Z","title":"An Optimized Quantum Maximum or Minimum Searching Algorithm and its Circuits","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-14T11:58:37.302966Z"},"links":{"citing_paper":"/paper/1908.07943"},"observation_digest":"sha256:dcdfe168cf5d640961ebe97a7b32c4ce7e3d52eec835bf93b6280bd4c07dfe4d","observation_id":"dd9f3934-0cf4-4179-88e0-aa05d4a97307","resolution":{"observed_at":"2026-08-14T11:58:37.828784Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-14T11:58:37.777051Z","title":"Demonstration of blind quantum computing[J]","venue":null,"work_id":"1cb0ab59-8591-4860-8907-928f3318c7c4","year":2012},"citing_paper":{"arxiv_id":"1908.07943","last_updated":"2019-08-21T15:47:34Z","snapshot_observed_at":"2026-08-14T11:51:12.967276Z","submitted_at":"2019-08-21T15:47:34Z","title":"An Optimized Quantum Maximum or Minimum Searching Algorithm and its Circuits","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-14T11:58:37.360547Z"},"links":{"citing_paper":"/paper/1908.07943"},"observation_digest":"sha256:9e20e7a885fb6ea10d4b89f91b7aa23dfa054c0a2fdd8bdcffb9363284394841","observation_id":"7193d916-82ce-4a72-a90f-d2c2eea56887","resolution":{"observed_at":"2026-08-14T11:58:37.782789Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-14T11:58:37.760138Z","title":"Elementary gates for quantum computation[J]","venue":null,"work_id":"c508943c-88c6-43d5-b5f6-de6d645efe89","year":1995},"citing_paper":{"arxiv_id":"1908.07943","last_updated":"2019-08-21T15:47:34Z","snapshot_observed_at":"2026-08-14T11:51:12.967276Z","submitted_at":"2019-08-21T15:47:34Z","title":"An Optimized Quantum Maximum or Minimum Searching Algorithm and its Circuits","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-14T11:58:37.411778Z"},"links":{"citing_paper":"/paper/1908.07943"},"observation_digest":"sha256:ee2f50ded6950f6402f6f37f4ae73a473b3a000f40b01ac830f00f551d055902","observation_id":"d4df1773-2f35-4ef6-91c4-b9812b573adb","resolution":{"observed_at":"2026-08-14T11:58:37.765201Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-14T11:58:37.695588Z","title":"Fully microwave -tunable universal gates in superconducting qubits with linear couplings and fixed transition frequencies[J]","venue":null,"work_id":"65918628-ed18-4ac5-9da7-5b64f93604de","year":2010},"citing_paper":{"arxiv_id":"1908.07943","last_updated":"2019-08-21T15:47:34Z","snapshot_observed_at":"2026-08-14T11:51:12.967276Z","submitted_at":"2019-08-21T15:47:34Z","title":"An Optimized Quantum Maximum or Minimum Searching Algorithm and its Circuits","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-14T11:58:37.416956Z"},"links":{"citing_paper":"/paper/1908.07943"},"observation_digest":"sha256:a5f2d23d3caa2b7674f0ef1be5cf2a9434f75ccfff3acadbb82930fced07ad54","observation_id":"9086ceab-0115-4e71-9bdb-26e2c6e21532","resolution":{"observed_at":"2026-08-14T11:58:37.700723Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-14T11:58:37.680414Z","title":"Supervised learning with quantum -enhanced feature spaces[J]","venue":null,"work_id":"3151be24-106a-4641-ac5d-c52c7ff0a4bd","year":2019},"citing_paper":{"arxiv_id":"1908.07943","last_updated":"2019-08-21T15:47:34Z","snapshot_observed_at":"2026-08-14T11:51:12.967276Z","submitted_at":"2019-08-21T15:47:34Z","title":"An Optimized Quantum Maximum or Minimum Searching Algorithm and its Circuits","version":1},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-14T11:58:37.422059Z"},"links":{"citing_paper":"/paper/1908.07943"},"observation_digest":"sha256:9a2cee609c996965dd98d769bfcfb8536de6803a01148cfb43c77b00ef8890db","observation_id":"b67cfcb0-98d9-4781-abbb-3b119c3ff346","resolution":{"observed_at":"2026-08-14T11:58:37.685227Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-14T11:58:37.657379Z","title":"Quantum Computation and Quantum Information: 10th Anniversary[J]","venue":null,"work_id":"31ca613b-99b0-41c4-9d94-bb24fda1a9d6","year":2011},"citing_paper":{"arxiv_id":"1908.07943","last_updated":"2019-08-21T15:47:34Z","snapshot_observed_at":"2026-08-14T11:51:12.967276Z","submitted_at":"2019-08-21T15:47:34Z","title":"An Optimized Quantum Maximum or Minimum Searching Algorithm and its Circuits","version":1},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-14T11:58:37.426857Z"},"links":{"citing_paper":"/paper/1908.07943"},"observation_digest":"sha256:3e048f8d2e6f860c97e37a8d0393d216f3d257204be3de3b0dfb61bab1f61bc2","observation_id":"93aacf02-bfe1-4724-bddd-96f71553022e","resolution":{"observed_at":"2026-08-14T11:58:37.669627Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-14T11:58:37.480745Z","title":"Mathematical statistics with applications[M]","venue":null,"work_id":"0194c592-cb10-4000-8edc-5547620339ef","year":2014},"citing_paper":{"arxiv_id":"1908.07943","last_updated":"2019-08-21T15:47:34Z","snapshot_observed_at":"2026-08-14T11:51:12.967276Z","submitted_at":"2019-08-21T15:47:34Z","title":"An Optimized Quantum Maximum or Minimum Searching Algorithm and its Circuits","version":1},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-14T11:58:37.431851Z"},"links":{"citing_paper":"/paper/1908.07943"},"observation_digest":"sha256:cc2c4d5318abb3114810369a592dce76570f4f0f0f4e636eaf04d903b017f4ad","observation_id":"06f41ca7-a40c-4af6-873f-21de79e5df2f","resolution":{"observed_at":"2026-08-14T11:58:37.534265Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"1908.07943","last_updated":"2019-08-21T15:47:34Z","latest_version":1,"primary_category":"quant-ph","snapshot_observed_at":"2026-08-14T11:51:12.967276Z","submitted_at":"2019-08-21T15:47:34Z","title":"An Optimized Quantum Maximum or Minimum Searching Algorithm and its Circuits"},"reference_resolution":{"displayed":47,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":5,"verified_exact":0,"verified_fuzzy":42},"total_outbound_references":47},"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-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"thesis":"As of 15 August 2026, this Paper Citation Record lists 47 of 47 outbound references and 0 inbound Pith citation observations for arXiv:1908.07943."}