{"as_of":"2026-08-16T17:14:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:53389ee9d184616261a0a5be778ff0827fc426f6331cd9fb67b624d48c1c8b80","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-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.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-16T10:52:50.943864Z","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:a797b219a340073cf316f9e17e3312a931b2703ce894436a6f08d1797dbb07fe","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-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-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-16T10:52:50.943864Z","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:c3d2e5c2f62dc214695a5af3134b8a51aea7866f185a817692c871f7fd2ebf55","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-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-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-16T10:52:50.943864Z","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:f3612156094ec128c71e58fc451b4ac2936031844aa4b7630663ca796ab19497","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-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-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-16T10:52:50.943864Z","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:a10ec240225ecc2b36a0d52a72c227d493dd477309eeaf39709fd510e991714a","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-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-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-16T10:52:50.943864Z","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:bf8ecde9fbe932eca33eaaa0378a507baecf3654f4c1c8c6acc6bd069c3c5cbf","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-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-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-16T10:52:50.943864Z","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:9dade883666fdb0da165b8040f43e65eb00464a080cce0fe5f2a7d130796ba40","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-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-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-16T10:52:50.943864Z","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:45081e4578d02acebe4827150e3827108c8b9e5ad6922fb5f89a723decd9d71b","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-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-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-16T10:52:50.943864Z","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:2e66f39c7cf35cbe02bb4e9419b5be834905db17200fe51c459f5c5c5af8be5c","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-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-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-16T10:52:50.943864Z","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:51f0c2eb067dc1e6dabcd6305f7c5f3eada038c098e0b909b6c70fb9c9203f20","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-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-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-16T10:52:50.943864Z","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:7d163e432827c9bf543875b99baec142b6e42dd73779816e7e4a3349403f98cd","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-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-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-16T10:52:50.943864Z","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:6f048b9e7564cc17f8b11e921556d0b1f0cbf84a14336233fd53d65b3acc3366","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-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-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-16T10:52:50.943864Z","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:e839844af06c143cd44ea39fdfe5bd03cb1c8b6c94f803c2f634e20ca96cd1fb","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-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-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-16T10:52:50.943864Z","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:3b7cb2e1b3a121fa0e94e264eb44afeaba03b362dd7003cfc62a7c55bc63d8cf","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-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-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-16T10:52:50.943864Z","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:83aff65cafefafcd9bf88c82148e2c9b31a3101a1b0fb0ba9dd8916dd2ebe2ad","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-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-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-16T10:52:50.943864Z","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:1028e9fb6b068d148a0dc1da7722a8eb277938c24fe93d0cfc54c6f9d3b5bcec","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-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-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-16T10:52:50.943864Z","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:848c8de1440a160dac3926eaa78f178d944eb730732541d1d773ec17d66165e6","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-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-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-16T10:52:50.943864Z","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:e8433416d05cdcc96cd37ee6325492fab2cdfde6084290d25b646f0294fa3a57","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-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-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-16T10:52:50.943864Z","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:071e09556fb699a8a9b394e22d615324b5178d3a72af726825f170c9380f954e","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-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-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-16T10:52:50.943864Z","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:f53cb217cda2e69eeb96c518db44f90419c607ee09a75af8d3ee994e09a515e4","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-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-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-16T10:52:50.943864Z","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:83006e0989a8e0f13a7a85d7c5058a3ab2f18a62e886097eccf443825181a9cb","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-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-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-16T10:52:50.943864Z","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:60a59054401e37cf6c797fcc22401bc1b5f7e2bbff7b25eba9f7cadb8810acc3","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-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-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-16T10:52:50.943864Z","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:cec8d302818ae521801180c4098d75dd9f41d1893a256e370ed3f93146b07f30","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-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-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-16T10:52:50.943864Z","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:647a4aabfcea467399395c2754aa422d452846b63ec0764ccd1212492ec2467a","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-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-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-16T10:52:50.943864Z","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:4383bcdcbae5e1c40a3a18cc5a24c3ab18632f007744fd4f0a39b8a45fc00044","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-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-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-16T10:52:50.943864Z","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:55597ea9f9efbc2525ab20b646b61c3bb34a4eead7c104ebdfcfbf7b162af8e5","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-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-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-16T10:52:50.943864Z","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:a08e3b4f28c2eecd33e792b46f8688aee7a62bf9d203e3eb99f05e891ab56ebe","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-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-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-16T10:52:50.943864Z","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:4e5cba9d7e73e0f23d68730dc508beb18d72d07c30acfc6e67f7ddfa3a5b28df","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-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-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-16T10:52:50.943864Z","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:c9ba1b66b80d5219fff97b0551156b671751e25b023ff2ab3865bd2659a046ba","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-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-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-16T10:52:50.943864Z","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:7b66f6f1d0217e38cb3710c9124c28db5b76e284f300cadd670bbcf0c98fe15f","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-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-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-16T10:52:50.943864Z","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:6518400998cc483189d34bcebe8d007b05bcb628b2136225d4e8fa71794f97e9","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-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-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-16T10:52:50.943864Z","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:cc0b09e5319ebaacfd6415dcf5a93c7fe410f339aee243289d944280b6d3c82e","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-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":"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-16T10:52:50.943864Z","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:632539296027cd74010e6e9f6057c39530a0aa530240fc4495f3507f69a28be4","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-16T10:52:50.943864Z","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:1cdfc76ed56b4174d371bbfd9fe5b60be56e1633a870b3eb6ae7d4f6b2589aa4","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-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-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-16T10:52:50.943864Z","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:2823496a049af502eba223da453109b32dd966c65bf327231d1e37163d283784","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-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-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-16T10:52:50.943864Z","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:90f73054baa5bb69b18b75ef86e17b83b9da66750133617c340465cb55c1e373","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-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-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-16T10:52:50.943864Z","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:33100a7a344fa69b15b545e13f87f45c19860744e92d9836eefa044e8cc11f36","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-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-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-16T10:52:50.943864Z","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:2721695d5f8b1b3173fccd926768cd930ef31b7286d35c66850cf5616952b3c8","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-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-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-16T10:52:50.943864Z","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:2f9915ba28984de870ba42fc9e9b748560b9d604c2a5c1b9958686e241a749dc","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-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-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-16T10:52:50.943864Z","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:4b12c8cb313ae029fbe425e91a1c1bcbde9aa574ab96e1f0249644900b8c2a9a","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-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-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-16T10:52:50.943864Z","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:6876e8ae553e4402726f6c4931d43ae7ceb9714e986501f1ee45f2ac9fad05a6","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-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-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-16T10:52:50.943864Z","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:ff1848493e52d789985a5531df9002e39491cf704c64500ed5b302185e7039ad","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-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-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-16T10:52:50.943864Z","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:d6fd294279b1a22f69cdcbd1bbbef7039a01cc7f391ad3e947476b35136f9936","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-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-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-16T10:52:50.943864Z","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:2ca355aff60305807a8d86fae0c2b4970f12b3fb1353ca7d09edd11943192cc6","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-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-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-16T10:52:50.943864Z","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:e3afcdb664f13487c89375283bb0a76261f0f65191cd7485f8709f5f78e69fe7","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-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-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-16T10:52:50.943864Z","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:326302c1019ab83d0d259e8a6212d520663c99757cdfea90c547a22b4a70b691","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-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-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-16T10:52:50.943864Z","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:d95a3cc8d2ed060869e47879240bccb9f85b0a80cd4405f37ef0798158034454","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-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-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-16T10:52:50.943864Z","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:a44e6c75517917f40a69b6d7ec238afb7eeaadb2790c47bf38a009b3fe8eb441","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-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.07943","last_updated":"2019-08-21T15:47:34Z","latest_version":1,"primary_category":"quant-ph","snapshot_observed_at":"2026-08-16T10:52:50.943864Z","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-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 47 of 47 outbound references and 0 inbound Pith citation observations for arXiv:1908.07943."}