{"as_of":"2026-08-13T01:52:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:e375ccedee4c967876c12f91abd89cc9b8c558ddb463530f94e214818c53c7d7","coverage":[{"denominator":71,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":71,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-11T23:04:06.148530Z","state":"measured"},{"denominator":71,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":71,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-12T06:34:41.77262+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2608.09134/citation-record","integrity":"/paper/2608.09134/integrity","json":"/paper/2608.09134/citation-record.json","paper":"/paper/2608.09134"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T23:04:05.802680Z","title":"A Nielsen and I","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2608.09134","last_updated":"2026-08-10T05:26:52Z","snapshot_observed_at":"2026-08-13T01:16:43.819427Z","submitted_at":"2026-08-10T05:26:52Z","title":"Quantum Hashing Circuit Optimization for Arbitrary Qubit Connectivity Graphs Based on 1-Covering Path","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-11T23:04:05.802680Z"},"links":{"citing_paper":"/paper/2608.09134"},"observation_digest":"sha256:d35091c12ed7e32429a24c637731ddbad70d9beb8eb6be8e12db880b75f682d2","observation_id":"d0d6d9d4-1a48-4deb-b84e-bded2c7224e6","resolution":{"observed_at":"2026-08-11T23:04:05.802680Z","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-11T23:04:07.162060Z","title":"Ambainis","venue":null,"work_id":"78debb42-b382-4023-87be-ce948da311e8","year":2018},"citing_paper":{"arxiv_id":"2608.09134","last_updated":"2026-08-10T05:26:52Z","snapshot_observed_at":"2026-08-13T01:16:43.819427Z","submitted_at":"2026-08-10T05:26:52Z","title":"Quantum Hashing Circuit Optimization for Arbitrary Qubit Connectivity Graphs Based on 1-Covering Path","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-11T23:04:05.809185Z"},"links":{"citing_paper":"/paper/2608.09134"},"observation_digest":"sha256:52fab470be2c76294aa11146518779a73197dc8c4b3ef18edbbf1f196467f267","observation_id":"37c4cc25-d28c-4c74-af34-4bb1ead63f85","resolution":{"observed_at":"2026-08-11T23:04:07.167949Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T23:04:05.814277Z","title":"Ablayev, M","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2608.09134","last_updated":"2026-08-10T05:26:52Z","snapshot_observed_at":"2026-08-13T01:16:43.819427Z","submitted_at":"2026-08-10T05:26:52Z","title":"Quantum Hashing Circuit Optimization for Arbitrary Qubit Connectivity Graphs Based on 1-Covering Path","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-11T23:04:05.814277Z"},"links":{"citing_paper":"/paper/2608.09134"},"observation_digest":"sha256:25aca8fc9405c84626b89332f84b78fc4ccc76be843787156256472e556286e8","observation_id":"f27f339e-dc3a-422f-aff3-09fac3508f5c","resolution":{"observed_at":"2026-08-11T23:04:05.814277Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T23:04:05.819190Z","title":"Ablayev, K","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2608.09134","last_updated":"2026-08-10T05:26:52Z","snapshot_observed_at":"2026-08-13T01:16:43.819427Z","submitted_at":"2026-08-10T05:26:52Z","title":"Quantum Hashing Circuit Optimization for Arbitrary Qubit Connectivity Graphs Based on 1-Covering Path","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-11T23:04:05.819190Z"},"links":{"citing_paper":"/paper/2608.09134"},"observation_digest":"sha256:6ffa4ef4577c5e5db84479892c2574ecf2866437da0340f85705ff344525361f","observation_id":"b3017a0d-0217-48cc-b878-aa6fe825642b","resolution":{"observed_at":"2026-08-11T23:04:05.819190Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T23:04:05.824451Z","title":"Ablayev and A","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2608.09134","last_updated":"2026-08-10T05:26:52Z","snapshot_observed_at":"2026-08-13T01:16:43.819427Z","submitted_at":"2026-08-10T05:26:52Z","title":"Quantum Hashing Circuit Optimization for Arbitrary Qubit Connectivity Graphs Based on 1-Covering Path","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-11T23:04:05.824451Z"},"links":{"citing_paper":"/paper/2608.09134"},"observation_digest":"sha256:cb32f5ce3d997b9424692b3ba8cc9768c8261d0e6a0b761586a99c27f0975fd6","observation_id":"f9e22a9a-7a81-450e-a08d-2e02c034f37f","resolution":{"observed_at":"2026-08-11T23:04:05.824451Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T23:04:05.829761Z","title":"Quantum hashing algorithm implementation.arXiv preprint,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.09134","last_updated":"2026-08-10T05:26:52Z","snapshot_observed_at":"2026-08-13T01:16:43.819427Z","submitted_at":"2026-08-10T05:26:52Z","title":"Quantum Hashing Circuit Optimization for Arbitrary Qubit Connectivity Graphs Based on 1-Covering Path","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-11T23:04:05.829761Z"},"links":{"citing_paper":"/paper/2608.09134"},"observation_digest":"sha256:b8c466b9c1f367901f3b69b71989476ffbef095e945ccddfd2b4c2a575b5254a","observation_id":"a4952389-d0ad-4cdd-b13e-10cc5df99156","resolution":{"observed_at":"2026-08-11T23:04:05.829761Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T23:04:05.834634Z","title":"Fast probabilistic algorithms","venue":null,"work_id":null,"year":1979},"citing_paper":{"arxiv_id":"2608.09134","last_updated":"2026-08-10T05:26:52Z","snapshot_observed_at":"2026-08-13T01:16:43.819427Z","submitted_at":"2026-08-10T05:26:52Z","title":"Quantum Hashing Circuit Optimization for Arbitrary Qubit Connectivity Graphs Based on 1-Covering Path","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-11T23:04:05.834634Z"},"links":{"citing_paper":"/paper/2608.09134"},"observation_digest":"sha256:56146ef2188f8d372d2f699b8920b0275d7e630267943d0162377d733fd14443","observation_id":"60f45b6a-d50c-4f00-b8ad-db59c9d0775b","resolution":{"observed_at":"2026-08-11T23:04:05.834634Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T23:04:05.839980Z","title":"Ambainis and R","venue":null,"work_id":null,"year":1998},"citing_paper":{"arxiv_id":"2608.09134","last_updated":"2026-08-10T05:26:52Z","snapshot_observed_at":"2026-08-13T01:16:43.819427Z","submitted_at":"2026-08-10T05:26:52Z","title":"Quantum Hashing Circuit Optimization for Arbitrary Qubit Connectivity Graphs Based on 1-Covering Path","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-11T23:04:05.839980Z"},"links":{"citing_paper":"/paper/2608.09134"},"observation_digest":"sha256:9ec11867a694457a325698b1a83ee4ef7fed85f97facfeed81768daea40729c6","observation_id":"aa53b07a-4c24-451f-aa86-22951667541f","resolution":{"observed_at":"2026-08-11T23:04:05.839980Z","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-11T23:04:07.072858Z","title":"Improved constructions of quantum automata","venue":null,"work_id":"6e5d5bdd-9331-4599-b289-61a859f953a7","year":2008},"citing_paper":{"arxiv_id":"2608.09134","last_updated":"2026-08-10T05:26:52Z","snapshot_observed_at":"2026-08-13T01:16:43.819427Z","submitted_at":"2026-08-10T05:26:52Z","title":"Quantum Hashing Circuit Optimization for Arbitrary Qubit Connectivity Graphs Based on 1-Covering Path","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-11T23:04:05.845718Z"},"links":{"citing_paper":"/paper/2608.09134"},"observation_digest":"sha256:eb3162c0e3b0c117ba5cd80507c973399455984c5f3d4795db63d90f295896bd","observation_id":"95d069fe-1cbf-4c94-bb97-4ad77267235a","resolution":{"observed_at":"2026-08-11T23:04:07.078660Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T23:04:05.850890Z","title":"Ambainis and N","venue":null,"work_id":null,"year":1916},"citing_paper":{"arxiv_id":"2608.09134","last_updated":"2026-08-10T05:26:52Z","snapshot_observed_at":"2026-08-13T01:16:43.819427Z","submitted_at":"2026-08-10T05:26:52Z","title":"Quantum Hashing Circuit Optimization for Arbitrary Qubit Connectivity Graphs Based on 1-Covering Path","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-11T23:04:05.850890Z"},"links":{"citing_paper":"/paper/2608.09134"},"observation_digest":"sha256:093daee36f13aec525e3c7c799084c882893053c86e510942636c8b2116a8b5e","observation_id":"b2602f75-7a13-4727-ba8b-6cf44be2b543","resolution":{"observed_at":"2026-08-11T23:04:05.850890Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T23:04:05.856547Z","title":"Quantum fingerprinting.Physical Review Letters, 87(16):167902, 2001","venue":null,"work_id":null,"year":2001},"citing_paper":{"arxiv_id":"2608.09134","last_updated":"2026-08-10T05:26:52Z","snapshot_observed_at":"2026-08-13T01:16:43.819427Z","submitted_at":"2026-08-10T05:26:52Z","title":"Quantum Hashing Circuit Optimization for Arbitrary Qubit Connectivity Graphs Based on 1-Covering Path","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-11T23:04:05.856547Z"},"links":{"citing_paper":"/paper/2608.09134"},"observation_digest":"sha256:298ff72cb4a8e480a00a29e6e27d65050d1b5047e125e00ce212a797ad8e0111","observation_id":"120ede59-8513-49f1-9a08-6dbcadb4cb49","resolution":{"observed_at":"2026-08-11T23:04:05.856547Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T23:04:05.861296Z","title":"Ablayev, A","venue":null,"work_id":null,"year":2005},"citing_paper":{"arxiv_id":"2608.09134","last_updated":"2026-08-10T05:26:52Z","snapshot_observed_at":"2026-08-13T01:16:43.819427Z","submitted_at":"2026-08-10T05:26:52Z","title":"Quantum Hashing Circuit Optimization for Arbitrary Qubit Connectivity Graphs Based on 1-Covering Path","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-11T23:04:05.861296Z"},"links":{"citing_paper":"/paper/2608.09134"},"observation_digest":"sha256:85a51482d72570dc8a0683d9657b4b3397ee3879ee2b783472c490700942181f","observation_id":"786c06ce-6603-455c-bbe7-caf647dc57de","resolution":{"observed_at":"2026-08-11T23:04:05.861296Z","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-11T23:04:07.019562Z","title":"Ablayev and A","venue":null,"work_id":"e24ea028-097e-4ba9-a747-80b597fcea37","year":null},"citing_paper":{"arxiv_id":"2608.09134","last_updated":"2026-08-10T05:26:52Z","snapshot_observed_at":"2026-08-13T01:16:43.819427Z","submitted_at":"2026-08-10T05:26:52Z","title":"Quantum Hashing Circuit Optimization for Arbitrary Qubit Connectivity Graphs Based on 1-Covering Path","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-11T23:04:05.866578Z"},"links":{"citing_paper":"/paper/2608.09134"},"observation_digest":"sha256:6d3ba4c6ae563c06ba43c2228caeb38e3a2c6fd766830c078c4a12d28a97f8ec","observation_id":"cabc263e-b6a0-43c2-89cc-d8b64f794d5c","resolution":{"observed_at":"2026-08-11T23:04:07.024676Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-11T23:04:07.003196Z","title":"Ablayev and A","venue":null,"work_id":"f36df955-1ea0-4c77-95ef-fd6b318d9f09","year":2009},"citing_paper":{"arxiv_id":"2608.09134","last_updated":"2026-08-10T05:26:52Z","snapshot_observed_at":"2026-08-13T01:16:43.819427Z","submitted_at":"2026-08-10T05:26:52Z","title":"Quantum Hashing Circuit Optimization for Arbitrary Qubit Connectivity Graphs Based on 1-Covering Path","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-11T23:04:05.871614Z"},"links":{"citing_paper":"/paper/2608.09134"},"observation_digest":"sha256:b544583bdaa02e3e49a3d3cc047368c44b3d1a7c78f084a84ea9821d47be44ae","observation_id":"729caba7-6204-491d-8911-d3621d1466b2","resolution":{"observed_at":"2026-08-11T23:04:07.008359Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-11T23:04:06.986248Z","title":"Cryptographic quantum hashing.Laser Physics Letters, 11(2):025202, 2013","venue":null,"work_id":"ccedc427-2e5b-40cb-8f67-44be50e40283","year":2013},"citing_paper":{"arxiv_id":"2608.09134","last_updated":"2026-08-10T05:26:52Z","snapshot_observed_at":"2026-08-13T01:16:43.819427Z","submitted_at":"2026-08-10T05:26:52Z","title":"Quantum Hashing Circuit Optimization for Arbitrary Qubit Connectivity Graphs Based on 1-Covering Path","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-11T23:04:05.875900Z"},"links":{"citing_paper":"/paper/2608.09134"},"observation_digest":"sha256:24ddf8bab74436610a2e44ddf227e1b106160759a3eee3991fcf2b24be22eebd","observation_id":"a5466e12-9f45-48ea-9893-e821868d0466","resolution":{"observed_at":"2026-08-11T23:04:06.992007Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-11T23:04:06.966802Z","title":"Quan- tum fingerprinting and quantum hashing","venue":null,"work_id":"4876f968-d965-4305-b813-71043043ee39","year":2016},"citing_paper":{"arxiv_id":"2608.09134","last_updated":"2026-08-10T05:26:52Z","snapshot_observed_at":"2026-08-13T01:16:43.819427Z","submitted_at":"2026-08-10T05:26:52Z","title":"Quantum Hashing Circuit Optimization for Arbitrary Qubit Connectivity Graphs Based on 1-Covering Path","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-11T23:04:05.880506Z"},"links":{"citing_paper":"/paper/2608.09134"},"observation_digest":"sha256:eee2d5c58193139102c3d447b646fbb7c92d93f95b75d52cd7e49d1078b0a3d0","observation_id":"0c828e93-2a37-4dcd-b42e-624f594f3ada","resolution":{"observed_at":"2026-08-11T23:04:06.972230Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T23:04:05.884977Z","title":"Exponential separation of quantum and classical online space complexity.Theory of Computing Systems, 45(2):188–202, 2009","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2608.09134","last_updated":"2026-08-10T05:26:52Z","snapshot_observed_at":"2026-08-13T01:16:43.819427Z","submitted_at":"2026-08-10T05:26:52Z","title":"Quantum Hashing Circuit Optimization for Arbitrary Qubit Connectivity Graphs Based on 1-Covering Path","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-11T23:04:05.884977Z"},"links":{"citing_paper":"/paper/2608.09134"},"observation_digest":"sha256:9f55bc86f395847f90efe675fa9fb48a42e634753f4f0f963a492e7d92746bdf","observation_id":"ed1769c4-2ca3-4803-b4bd-b5da2a9a3d35","resolution":{"observed_at":"2026-08-11T23:04:05.884977Z","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-11T23:04:06.938252Z","title":"Exponential separation of quantum and classical online space complexity","venue":null,"work_id":"1b69a0be-9ecf-4e54-af9b-a84040277523","year":2006},"citing_paper":{"arxiv_id":"2608.09134","last_updated":"2026-08-10T05:26:52Z","snapshot_observed_at":"2026-08-13T01:16:43.819427Z","submitted_at":"2026-08-10T05:26:52Z","title":"Quantum Hashing Circuit Optimization for Arbitrary Qubit Connectivity Graphs Based on 1-Covering Path","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-11T23:04:05.889137Z"},"links":{"citing_paper":"/paper/2608.09134"},"observation_digest":"sha256:1e95d8d46e9bd8840f32de2d1e3df421659b1c35b48a33471f01207e21e920bc","observation_id":"b4bc1760-f68c-4eca-95a5-2df1fa9c574c","resolution":{"observed_at":"2026-08-11T23:04:06.943694Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T23:04:05.893879Z","title":"Ablayev, M","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2608.09134","last_updated":"2026-08-10T05:26:52Z","snapshot_observed_at":"2026-08-13T01:16:43.819427Z","submitted_at":"2026-08-10T05:26:52Z","title":"Quantum Hashing Circuit Optimization for Arbitrary Qubit Connectivity Graphs Based on 1-Covering Path","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-11T23:04:05.893879Z"},"links":{"citing_paper":"/paper/2608.09134"},"observation_digest":"sha256:a25a81f7f495a9e7120b99af95dbde61f212dc4e6a0a8dead94eb7f0d16ddc30","observation_id":"410f7b7c-e702-4582-9950-a1a43c34c9f8","resolution":{"observed_at":"2026-08-11T23:04:05.893879Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T23:04:05.898584Z","title":"Hybrid classical–quantum text search based on hashing.Mathematics, 12(12):1858, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2608.09134","last_updated":"2026-08-10T05:26:52Z","snapshot_observed_at":"2026-08-13T01:16:43.819427Z","submitted_at":"2026-08-10T05:26:52Z","title":"Quantum Hashing Circuit Optimization for Arbitrary Qubit Connectivity Graphs Based on 1-Covering Path","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-11T23:04:05.898584Z"},"links":{"citing_paper":"/paper/2608.09134"},"observation_digest":"sha256:48835eb14db05d1563c92e08f86e672e3ff9514b35dfe37204035045c9d77d0e","observation_id":"494abf16-74c1-4ab6-81a4-4cb7ddd3b031","resolution":{"observed_at":"2026-08-11T23:04:05.898584Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T23:04:05.903542Z","title":"Khadiev and A","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2608.09134","last_updated":"2026-08-10T05:26:52Z","snapshot_observed_at":"2026-08-13T01:16:43.819427Z","submitted_at":"2026-08-10T05:26:52Z","title":"Quantum Hashing Circuit Optimization for Arbitrary Qubit Connectivity Graphs Based on 1-Covering Path","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-11T23:04:05.903542Z"},"links":{"citing_paper":"/paper/2608.09134"},"observation_digest":"sha256:1d9d88d8433372eb775580358ac793a5de7bed4a1db9ae0ba6481cebda83a7eb","observation_id":"5f8ec369-fc8e-42cf-acec-753e14d930ad","resolution":{"observed_at":"2026-08-11T23:04:05.903542Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T23:04:05.908292Z","title":"Quantum and classical log-bounded automata for the online disjointness problem.Mathematics, 10(1), 2022","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2608.09134","last_updated":"2026-08-10T05:26:52Z","snapshot_observed_at":"2026-08-13T01:16:43.819427Z","submitted_at":"2026-08-10T05:26:52Z","title":"Quantum Hashing Circuit Optimization for Arbitrary Qubit Connectivity Graphs Based on 1-Covering Path","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-11T23:04:05.908292Z"},"links":{"citing_paper":"/paper/2608.09134"},"observation_digest":"sha256:02aab98a9c548be9506d9f6ea7706c7fc24f93e232b7a8b8fc7a54bd954d73d7","observation_id":"21a8d680-af9c-454e-a2c4-7c65723a09a1","resolution":{"observed_at":"2026-08-11T23:04:05.908292Z","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-11T23:04:06.880054Z","title":"Khadiev and A","venue":null,"work_id":"59c05b70-58e2-4dc2-8b50-5142f8d2ac38","year":2017},"citing_paper":{"arxiv_id":"2608.09134","last_updated":"2026-08-10T05:26:52Z","snapshot_observed_at":"2026-08-13T01:16:43.819427Z","submitted_at":"2026-08-10T05:26:52Z","title":"Quantum Hashing Circuit Optimization for Arbitrary Qubit Connectivity Graphs Based on 1-Covering Path","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-11T23:04:05.912782Z"},"links":{"citing_paper":"/paper/2608.09134"},"observation_digest":"sha256:e870aaf2b589e462e62c90bfde0364fb37aab134a4fb8fb13a13d712e3d1cba5","observation_id":"0d33f47f-0284-45c0-881c-cb91f88f473a","resolution":{"observed_at":"2026-08-11T23:04:06.885968Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T23:04:05.917739Z","title":"Exponential separation be- tween quantum and classical ordered binary decision diagrams, reordering method and hierarchies.Natural Computing, 22(4):723–736, 2023","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2608.09134","last_updated":"2026-08-10T05:26:52Z","snapshot_observed_at":"2026-08-13T01:16:43.819427Z","submitted_at":"2026-08-10T05:26:52Z","title":"Quantum Hashing Circuit Optimization for Arbitrary Qubit Connectivity Graphs Based on 1-Covering Path","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-11T23:04:05.917739Z"},"links":{"citing_paper":"/paper/2608.09134"},"observation_digest":"sha256:440bd6501ffca6278b3bb1d90d448baecfb2bad8a6c024f67d5525a3cd6dff7a","observation_id":"3524de4c-deba-4777-bb12-d35b0cd451c8","resolution":{"observed_at":"2026-08-11T23:04:05.917739Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T23:04:05.922594Z","title":"Ablayev, A","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2608.09134","last_updated":"2026-08-10T05:26:52Z","snapshot_observed_at":"2026-08-13T01:16:43.819427Z","submitted_at":"2026-08-10T05:26:52Z","title":"Quantum Hashing Circuit Optimization for Arbitrary Qubit Connectivity Graphs Based on 1-Covering Path","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-11T23:04:05.922594Z"},"links":{"citing_paper":"/paper/2608.09134"},"observation_digest":"sha256:435632ca1411cb3f02fb5d3220cc606f35f52c40f0c9ad4e1ce3f42ee7bcc589","observation_id":"27d19bb1-d521-479d-b4b5-043d3dd34836","resolution":{"observed_at":"2026-08-11T23:04:05.922594Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T23:04:05.927240Z","title":"A model of quantum communication device for quantum hashing","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2608.09134","last_updated":"2026-08-10T05:26:52Z","snapshot_observed_at":"2026-08-13T01:16:43.819427Z","submitted_at":"2026-08-10T05:26:52Z","title":"Quantum Hashing Circuit Optimization for Arbitrary Qubit Connectivity Graphs Based on 1-Covering Path","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-11T23:04:05.927240Z"},"links":{"citing_paper":"/paper/2608.09134"},"observation_digest":"sha256:abd056dcca91928816921f9b3c5eee908b91861f7b6cd67b7ddcdb7a480d4e6b","observation_id":"f5ed6720-4a89-4084-9516-0de777192cff","resolution":{"observed_at":"2026-08-11T23:04:05.927240Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T23:04:05.932147Z","title":"Ambainis and A","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2608.09134","last_updated":"2026-08-10T05:26:52Z","snapshot_observed_at":"2026-08-13T01:16:43.819427Z","submitted_at":"2026-08-10T05:26:52Z","title":"Quantum Hashing Circuit Optimization for Arbitrary Qubit Connectivity Graphs Based on 1-Covering Path","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-11T23:04:05.932147Z"},"links":{"citing_paper":"/paper/2608.09134"},"observation_digest":"sha256:8ac7687bc88a8bc0b35d01395c76c9b393030c2e38d4b6d519739f8af3d369b2","observation_id":"13bb81e3-8d21-49db-a824-b422b5ea4b00","resolution":{"observed_at":"2026-08-11T23:04:05.932147Z","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-11T23:04:06.817889Z","title":"Automata and quantum computing","venue":null,"work_id":"35a41cef-66df-4dd0-9e98-8a0569dcde63","year":2021},"citing_paper":{"arxiv_id":"2608.09134","last_updated":"2026-08-10T05:26:52Z","snapshot_observed_at":"2026-08-13T01:16:43.819427Z","submitted_at":"2026-08-10T05:26:52Z","title":"Quantum Hashing Circuit Optimization for Arbitrary Qubit Connectivity Graphs Based on 1-Covering Path","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-11T23:04:05.936998Z"},"links":{"citing_paper":"/paper/2608.09134"},"observation_digest":"sha256:a32df554a69fa982bc5553b0921a76705a33bd3f763e602927141c31edde173c","observation_id":"28669cf0-c789-4d51-9aed-b35d7c265933","resolution":{"observed_at":"2026-08-11T23:04:06.822845Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-11T23:04:06.801006Z","title":"Deterministic construction of qfas based on the quantum fingerprinting technique.Lobachevskii Journal of Mathematics, 44(2):713–723, 2023","venue":null,"work_id":"d274a386-b1b6-42fb-aec1-a6e626fe850f","year":2023},"citing_paper":{"arxiv_id":"2608.09134","last_updated":"2026-08-10T05:26:52Z","snapshot_observed_at":"2026-08-13T01:16:43.819427Z","submitted_at":"2026-08-10T05:26:52Z","title":"Quantum Hashing Circuit Optimization for Arbitrary Qubit Connectivity Graphs Based on 1-Covering Path","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-11T23:04:05.941868Z"},"links":{"citing_paper":"/paper/2608.09134"},"observation_digest":"sha256:a79e8a6b6232d22794294abe5bd4638a064faa68ab23cde60ec34da2ec8c3a41","observation_id":"95c8e4a4-9ac7-4221-9579-ae0c8e7b9594","resolution":{"observed_at":"2026-08-11T23:04:06.806226Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T23:04:05.946499Z","title":"Gainutdinova and A","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2608.09134","last_updated":"2026-08-10T05:26:52Z","snapshot_observed_at":"2026-08-13T01:16:43.819427Z","submitted_at":"2026-08-10T05:26:52Z","title":"Quantum Hashing Circuit Optimization for Arbitrary Qubit Connectivity Graphs Based on 1-Covering Path","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-11T23:04:05.946499Z"},"links":{"citing_paper":"/paper/2608.09134"},"observation_digest":"sha256:ab533002820e2d71561c905b5999e5cd49307a4d3b481d291197bf5165d69dd5","observation_id":"6879af42-a547-4335-b819-924802a07cff","resolution":{"observed_at":"2026-08-11T23:04:05.946499Z","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-11T23:04:06.768787Z","title":"Languagesrecognizedbynondeterministic quantum finite automata.Quantum Information and Computation, 10(9&10):747– 770, 2010","venue":null,"work_id":"40c0fb66-4b0c-48d7-9a84-7e274389528e","year":2010},"citing_paper":{"arxiv_id":"2608.09134","last_updated":"2026-08-10T05:26:52Z","snapshot_observed_at":"2026-08-13T01:16:43.819427Z","submitted_at":"2026-08-10T05:26:52Z","title":"Quantum Hashing Circuit Optimization for Arbitrary Qubit Connectivity Graphs Based on 1-Covering Path","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-11T23:04:05.951831Z"},"links":{"citing_paper":"/paper/2608.09134"},"observation_digest":"sha256:27b74fbbe88b840726c1ec181ecab8b49748b0bc752e2f658d76563e85250ae3","observation_id":"dff91330-7395-45de-b8d2-29ab10f00916","resolution":{"observed_at":"2026-08-11T23:04:06.774263Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-11T23:04:06.752321Z","title":"Gainutdinova and A","venue":null,"work_id":"c30b76c0-dcb0-48be-8f34-68796b59d64a","year":2018},"citing_paper":{"arxiv_id":"2608.09134","last_updated":"2026-08-10T05:26:52Z","snapshot_observed_at":"2026-08-13T01:16:43.819427Z","submitted_at":"2026-08-10T05:26:52Z","title":"Quantum Hashing Circuit Optimization for Arbitrary Qubit Connectivity Graphs Based on 1-Covering Path","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-11T23:04:05.956438Z"},"links":{"citing_paper":"/paper/2608.09134"},"observation_digest":"sha256:a9c922cb48f0e13fd2e2958005a1e248aa2e275521ddd3c628f1a44c34c01cdd","observation_id":"65186796-24d6-42f8-bc85-a07f382dcd27","resolution":{"observed_at":"2026-08-11T23:04:06.757679Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-11T23:04:06.737156Z","title":"Gainutdinova and A","venue":null,"work_id":"be78ea88-e3cb-42de-9e2c-5d59c252a48d","year":2015},"citing_paper":{"arxiv_id":"2608.09134","last_updated":"2026-08-10T05:26:52Z","snapshot_observed_at":"2026-08-13T01:16:43.819427Z","submitted_at":"2026-08-10T05:26:52Z","title":"Quantum Hashing Circuit Optimization for Arbitrary Qubit Connectivity Graphs Based on 1-Covering Path","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-11T23:04:05.961382Z"},"links":{"citing_paper":"/paper/2608.09134"},"observation_digest":"sha256:357ea175cd8af8aa6f83ef58cb2705e6bc65de6e1cc99e150c0d729c2221ed78","observation_id":"62d545c2-a20e-4236-ae1e-91497f56dcfe","resolution":{"observed_at":"2026-08-11T23:04:06.741559Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T23:04:05.966900Z","title":"Ziiatdinov, F","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2608.09134","last_updated":"2026-08-10T05:26:52Z","snapshot_observed_at":"2026-08-13T01:16:43.819427Z","submitted_at":"2026-08-10T05:26:52Z","title":"Quantum Hashing Circuit Optimization for Arbitrary Qubit Connectivity Graphs Based on 1-Covering Path","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-11T23:04:05.966900Z"},"links":{"citing_paper":"/paper/2608.09134"},"observation_digest":"sha256:972285b3110a43e3d8798defcce3516a6bb83b58864387a539277c0cc8c52391","observation_id":"2186d957-0db7-45e6-afce-293b4be0bc2c","resolution":{"observed_at":"2026-08-11T23:04:05.966900Z","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-11T23:04:06.710809Z","title":"Beyond classical: The role of data encoding in quantum regression on air quality prediction","venue":null,"work_id":"23a21807-3c11-4e5c-8a81-388ccd23a99a","year":2025},"citing_paper":{"arxiv_id":"2608.09134","last_updated":"2026-08-10T05:26:52Z","snapshot_observed_at":"2026-08-13T01:16:43.819427Z","submitted_at":"2026-08-10T05:26:52Z","title":"Quantum Hashing Circuit Optimization for Arbitrary Qubit Connectivity Graphs Based on 1-Covering Path","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-11T23:04:05.971873Z"},"links":{"citing_paper":"/paper/2608.09134"},"observation_digest":"sha256:e18ce22a609e6e3ead90980ff04a2effca9442b046a26f22037aca3a78004eba","observation_id":"1628841f-c475-4428-9cbb-d947c7a68dad","resolution":{"observed_at":"2026-08-11T23:04:06.715921Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T23:04:05.976596Z","title":"Multiqudit quantum hashing and its implementation based on orbital angular momentum encoding.Laser Physics Letters, 19(12):125205, 2022","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2608.09134","last_updated":"2026-08-10T05:26:52Z","snapshot_observed_at":"2026-08-13T01:16:43.819427Z","submitted_at":"2026-08-10T05:26:52Z","title":"Quantum Hashing Circuit Optimization for Arbitrary Qubit Connectivity Graphs Based on 1-Covering Path","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-11T23:04:05.976596Z"},"links":{"citing_paper":"/paper/2608.09134"},"observation_digest":"sha256:bcdf0b5a68e26a153e40979ec5e50ebf93316902112757328448bc4db51cdd2e","observation_id":"8c262c1f-a716-4eab-932e-c9e3b66a020f","resolution":{"observed_at":"2026-08-11T23:04:05.976596Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T23:04:05.982834Z","title":"Quan- tum hashing via single-photon states with orbital angular momentum.Physical Review A, 104(5):052606, 2021","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2608.09134","last_updated":"2026-08-10T05:26:52Z","snapshot_observed_at":"2026-08-13T01:16:43.819427Z","submitted_at":"2026-08-10T05:26:52Z","title":"Quantum Hashing Circuit Optimization for Arbitrary Qubit Connectivity Graphs Based on 1-Covering Path","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-11T23:04:05.982834Z"},"links":{"citing_paper":"/paper/2608.09134"},"observation_digest":"sha256:31b31ab602f31f59ef2db6aca7b2acb1eb98c94e8f80bfb4f8bcba62168cd248","observation_id":"5c7b5d44-82a5-4e62-913a-88b3053608a4","resolution":{"observed_at":"2026-08-11T23:04:05.982834Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T23:04:05.987789Z","title":"ZD Plachta, M","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2608.09134","last_updated":"2026-08-10T05:26:52Z","snapshot_observed_at":"2026-08-13T01:16:43.819427Z","submitted_at":"2026-08-10T05:26:52Z","title":"Quantum Hashing Circuit Optimization for Arbitrary Qubit Connectivity Graphs Based on 1-Covering Path","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-11T23:04:05.987789Z"},"links":{"citing_paper":"/paper/2608.09134"},"observation_digest":"sha256:459b3e57cfee8beac60aa2731e6fe32d67bc38468fe0c6d065d1ad8b4c27c3ef","observation_id":"9270d87d-9130-4e19-9797-bda6aa5f432b","resolution":{"observed_at":"2026-08-11T23:04:05.987789Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T23:04:05.992417Z","title":"Experimen- tal demonstration advantage of photonic finite automata","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2608.09134","last_updated":"2026-08-10T05:26:52Z","snapshot_observed_at":"2026-08-13T01:16:43.819427Z","submitted_at":"2026-08-10T05:26:52Z","title":"Quantum Hashing Circuit Optimization for Arbitrary Qubit Connectivity Graphs Based on 1-Covering Path","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-11T23:04:05.992417Z"},"links":{"citing_paper":"/paper/2608.09134"},"observation_digest":"sha256:5526d152d699953ebad21bc924c2a8f4407ffc83e608aa91bbe6d20a351df6c6","observation_id":"b748f2d2-2849-43fe-9f3e-bdc5d9d0ddb2","resolution":{"observed_at":"2026-08-11T23:04:05.992417Z","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-11T23:04:06.645923Z","title":"Decompositions of general quantum gates","venue":null,"work_id":"2f435a9d-4e1c-4ce9-bb86-a9b560a370e4","year":2006},"citing_paper":{"arxiv_id":"2608.09134","last_updated":"2026-08-10T05:26:52Z","snapshot_observed_at":"2026-08-13T01:16:43.819427Z","submitted_at":"2026-08-10T05:26:52Z","title":"Quantum Hashing Circuit Optimization for Arbitrary Qubit Connectivity Graphs Based on 1-Covering Path","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-11T23:04:05.997181Z"},"links":{"citing_paper":"/paper/2608.09134"},"observation_digest":"sha256:07f22fc4d848dfe31b89d2e11825e81c8835c0e54e19a83f11b5405b87d0e683","observation_id":"4bf45d7b-a1ca-4a11-9a4c-526bab4738e6","resolution":{"observed_at":"2026-08-11T23:04:06.651133Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T23:04:06.002070Z","title":"Quantum circuits with uniformly controlled one-qubit gates.Physical Review A—Atomic, Molecular, and Optical Physics, 71(5):052330, 2005","venue":null,"work_id":null,"year":2005},"citing_paper":{"arxiv_id":"2608.09134","last_updated":"2026-08-10T05:26:52Z","snapshot_observed_at":"2026-08-13T01:16:43.819427Z","submitted_at":"2026-08-10T05:26:52Z","title":"Quantum Hashing Circuit Optimization for Arbitrary Qubit Connectivity Graphs Based on 1-Covering Path","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-11T23:04:06.002070Z"},"links":{"citing_paper":"/paper/2608.09134"},"observation_digest":"sha256:519dd755b101212ca90e2908969f63ba64aca8fb3b25039f3d92292108c865a0","observation_id":"e6a220c3-0cbf-459f-9141-99f192275ba8","resolution":{"observed_at":"2026-08-11T23:04:06.002070Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T23:04:06.007056Z","title":"Efficient implementation of ampli- tude form of quantum hashing using state-of-the-art quantum processors.Russian Microelectronics, 52(Suppl 1):S390–S394, 2023","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2608.09134","last_updated":"2026-08-10T05:26:52Z","snapshot_observed_at":"2026-08-13T01:16:43.819427Z","submitted_at":"2026-08-10T05:26:52Z","title":"Quantum Hashing Circuit Optimization for Arbitrary Qubit Connectivity Graphs Based on 1-Covering Path","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-11T23:04:06.007056Z"},"links":{"citing_paper":"/paper/2608.09134"},"observation_digest":"sha256:c4424b6dffef3f1d2faeaf7348db3bc71c67bfc8c79c13b45fedabfaea8a9b14","observation_id":"716558ec-a943-4bf7-9d09-10ba4e5a737d","resolution":{"observed_at":"2026-08-11T23:04:06.007056Z","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-11T23:04:06.607561Z","title":"Quantum random forest model prediction circuit gate complexity.Russian Microelectronics, 54(8):1442–1448, 2025","venue":null,"work_id":"0b0d445c-16d6-4ce2-82d4-4db44eb03f88","year":2025},"citing_paper":{"arxiv_id":"2608.09134","last_updated":"2026-08-10T05:26:52Z","snapshot_observed_at":"2026-08-13T01:16:43.819427Z","submitted_at":"2026-08-10T05:26:52Z","title":"Quantum Hashing Circuit Optimization for Arbitrary Qubit Connectivity Graphs Based on 1-Covering Path","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-11T23:04:06.011918Z"},"links":{"citing_paper":"/paper/2608.09134"},"observation_digest":"sha256:84539266d41603e987b57eb32235df0be242966b29d0b7c5b4c01f5d86349ac9","observation_id":"2605b9db-9d46-453c-8aaa-fd484c23c825","resolution":{"observed_at":"2026-08-11T23:04:06.612930Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-11T23:04:06.590610Z","title":"Safina, K","venue":null,"work_id":"dcf01aeb-8d7e-4006-b2d6-5b0beed47e1b","year":2023},"citing_paper":{"arxiv_id":"2608.09134","last_updated":"2026-08-10T05:26:52Z","snapshot_observed_at":"2026-08-13T01:16:43.819427Z","submitted_at":"2026-08-10T05:26:52Z","title":"Quantum Hashing Circuit Optimization for Arbitrary Qubit Connectivity Graphs Based on 1-Covering Path","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-11T23:04:06.016379Z"},"links":{"citing_paper":"/paper/2608.09134"},"observation_digest":"sha256:62bc1a05736098efec91306ad6ffe1a092579143f9859bc853b3f59eae0bfb9c","observation_id":"255484d7-3181-4430-b842-a145ac7b8a55","resolution":{"observed_at":"2026-08-11T23:04:06.595831Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T23:04:06.021312Z","title":"Kvantu algoritmu realiz¯ acija fizisk¯ a kvantu dator¯ a","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2608.09134","last_updated":"2026-08-10T05:26:52Z","snapshot_observed_at":"2026-08-13T01:16:43.819427Z","submitted_at":"2026-08-10T05:26:52Z","title":"Quantum Hashing Circuit Optimization for Arbitrary Qubit Connectivity Graphs Based on 1-Covering Path","version":1},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-11T23:04:06.021312Z"},"links":{"citing_paper":"/paper/2608.09134"},"observation_digest":"sha256:b62eff9c8325ccd9f62974ea652d1001a1288903103b1aed1aeaf260629ac029","observation_id":"49b664e4-3a8c-4870-8e98-af550dd27313","resolution":{"observed_at":"2026-08-11T23:04:06.021312Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T23:04:06.025844Z","title":"Ziiatdinov and A","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2608.09134","last_updated":"2026-08-10T05:26:52Z","snapshot_observed_at":"2026-08-13T01:16:43.819427Z","submitted_at":"2026-08-10T05:26:52Z","title":"Quantum Hashing Circuit Optimization for Arbitrary Qubit Connectivity Graphs Based on 1-Covering Path","version":1},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-11T23:04:06.025844Z"},"links":{"citing_paper":"/paper/2608.09134"},"observation_digest":"sha256:5ebb3d78eddf3a91567c44914bfd4a645963a0249ded079b1676387967101002","observation_id":"0ccf944a-8e99-4a9d-a56c-9a98948df850","resolution":{"observed_at":"2026-08-11T23:04:06.025844Z","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-11T23:04:06.547536Z","title":"Ziiatdinov, A","venue":null,"work_id":"8c28e505-8725-4099-86a0-7e3bb04ab00b","year":2025},"citing_paper":{"arxiv_id":"2608.09134","last_updated":"2026-08-10T05:26:52Z","snapshot_observed_at":"2026-08-13T01:16:43.819427Z","submitted_at":"2026-08-10T05:26:52Z","title":"Quantum Hashing Circuit Optimization for Arbitrary Qubit Connectivity Graphs Based on 1-Covering Path","version":1},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-11T23:04:06.030407Z"},"links":{"citing_paper":"/paper/2608.09134"},"observation_digest":"sha256:c943549c92aa1102b831f5512a0b83f087b527dfa72860b18718ea166ec9bed8","observation_id":"a0985e3b-ad76-4551-a007-f205da32ee9a","resolution":{"observed_at":"2026-08-11T23:04:06.553040Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T23:04:06.034894Z","title":"Khadieva, O Salehi, and A","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2608.09134","last_updated":"2026-08-10T05:26:52Z","snapshot_observed_at":"2026-08-13T01:16:43.819427Z","submitted_at":"2026-08-10T05:26:52Z","title":"Quantum Hashing Circuit Optimization for Arbitrary Qubit Connectivity Graphs Based on 1-Covering Path","version":1},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-11T23:04:06.034894Z"},"links":{"citing_paper":"/paper/2608.09134"},"observation_digest":"sha256:4fdd9658ffc1dd5d3b7b3fdb673ff5a67527e9f88640b964e3e5415b239424b0","observation_id":"9f5c88db-19f8-459d-b7fd-c21ffbb74c32","resolution":{"observed_at":"2026-08-11T23:04:06.034894Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T23:04:06.039696Z","title":"Khadiev, A","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2608.09134","last_updated":"2026-08-10T05:26:52Z","snapshot_observed_at":"2026-08-13T01:16:43.819427Z","submitted_at":"2026-08-10T05:26:52Z","title":"Quantum Hashing Circuit Optimization for Arbitrary Qubit Connectivity Graphs Based on 1-Covering Path","version":1},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-08-11T23:04:06.039696Z"},"links":{"citing_paper":"/paper/2608.09134"},"observation_digest":"sha256:142059c0d757ee50eb5b14f4515657fdb13d60dfa90e003613b4107f6a58893e","observation_id":"a4db36f4-4eaa-4af1-bec8-498d92e9aa6b","resolution":{"observed_at":"2026-08-11T23:04:06.039696Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T23:04:06.044123Z","title":"Constant-depth algorithm for quantum hashing.Russian Microelec- tronics, 52(Suppl 1):S399–S402, 2023","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2608.09134","last_updated":"2026-08-10T05:26:52Z","snapshot_observed_at":"2026-08-13T01:16:43.819427Z","submitted_at":"2026-08-10T05:26:52Z","title":"Quantum Hashing Circuit Optimization for Arbitrary Qubit Connectivity Graphs Based on 1-Covering Path","version":1},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-08-11T23:04:06.044123Z"},"links":{"citing_paper":"/paper/2608.09134"},"observation_digest":"sha256:135715109cab829f1f6982f75df5cc19856051c35c7d93b655624b548308bdbb","observation_id":"c329aabc-5a9a-41e6-b6e6-1efb66a15d76","resolution":{"observed_at":"2026-08-11T23:04:06.044123Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T23:04:06.048811Z","title":"Shallow circuit imple- mentation for the phase form of quantum hashing and local-sensitive hashing on ibmq noisy emulators.Russian Microelectronics, 53(8):1449–1457, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2608.09134","last_updated":"2026-08-10T05:26:52Z","snapshot_observed_at":"2026-08-13T01:16:43.819427Z","submitted_at":"2026-08-10T05:26:52Z","title":"Quantum Hashing Circuit Optimization for Arbitrary Qubit Connectivity Graphs Based on 1-Covering Path","version":1},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-08-11T23:04:06.048811Z"},"links":{"citing_paper":"/paper/2608.09134"},"observation_digest":"sha256:f82f5da4d514f2f21ef407d368aef43d822397319cebf66bb9703091639cad59","observation_id":"c202e873-4fe1-4e0e-a299-8e85b2125408","resolution":{"observed_at":"2026-08-11T23:04:06.048811Z","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-11T23:04:06.489575Z","title":"Quantum error correction below the surface code threshold.Nature, 638:27, 2025","venue":null,"work_id":"31f6c68e-df30-4c86-8eaf-0e114861c9a5","year":2025},"citing_paper":{"arxiv_id":"2608.09134","last_updated":"2026-08-10T05:26:52Z","snapshot_observed_at":"2026-08-13T01:16:43.819427Z","submitted_at":"2026-08-10T05:26:52Z","title":"Quantum Hashing Circuit Optimization for Arbitrary Qubit Connectivity Graphs Based on 1-Covering Path","version":1},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-08-11T23:04:06.053456Z"},"links":{"citing_paper":"/paper/2608.09134"},"observation_digest":"sha256:e21d3d7c2ff25a4f3b01ff4ca85e48a3b5d04064452b0fcd64471966525c922a","observation_id":"b9c167b6-b9d4-4bff-9788-72a54b26a8dc","resolution":{"observed_at":"2026-08-11T23:04:06.494915Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-11T23:04:06.472493Z","title":"Establishing a new benchmark in quantum computational advantage with 105-qubit zuchongzhi 3.0 processor","venue":null,"work_id":"20ecf0d2-6128-40b9-9bcc-8a5a6a2f98e1","year":2025},"citing_paper":{"arxiv_id":"2608.09134","last_updated":"2026-08-10T05:26:52Z","snapshot_observed_at":"2026-08-13T01:16:43.819427Z","submitted_at":"2026-08-10T05:26:52Z","title":"Quantum Hashing Circuit Optimization for Arbitrary Qubit Connectivity Graphs Based on 1-Covering Path","version":1},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-08-11T23:04:06.057971Z"},"links":{"citing_paper":"/paper/2608.09134"},"observation_digest":"sha256:0e17b8d9b893e25ed21da34b6eb1132928afcfb02d0f57c9328eeb0aa44c0cba","observation_id":"1ad01bcb-d548-4e1d-b753-4bb2d7207a34","resolution":{"observed_at":"2026-08-11T23:04:06.478119Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-11T23:04:06.454821Z","title":"Quantum computing, 1987","venue":null,"work_id":"3104e1bb-ff9f-4a48-a645-09f1b3b2c9bd","year":1987},"citing_paper":{"arxiv_id":"2608.09134","last_updated":"2026-08-10T05:26:52Z","snapshot_observed_at":"2026-08-13T01:16:43.819427Z","submitted_at":"2026-08-10T05:26:52Z","title":"Quantum Hashing Circuit Optimization for Arbitrary Qubit Connectivity Graphs Based on 1-Covering Path","version":1},"reference_index":54,"source":"pdf_text","source_observed_at":"2026-08-11T23:04:06.062740Z"},"links":{"citing_paper":"/paper/2608.09134"},"observation_digest":"sha256:25aba8bd082ac11d48d2909e43451b554b9ee67a50c9339e17bb888a4006fe23","observation_id":"a77b9e3f-f999-4e41-88d6-e712781b2e76","resolution":{"observed_at":"2026-08-11T23:04:06.460005Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T23:04:06.067194Z","title":"Efficient algorithms for solving the shortest covering path problem.Transportation Science, 28(4):317–327, 1994","venue":null,"work_id":null,"year":1994},"citing_paper":{"arxiv_id":"2608.09134","last_updated":"2026-08-10T05:26:52Z","snapshot_observed_at":"2026-08-13T01:16:43.819427Z","submitted_at":"2026-08-10T05:26:52Z","title":"Quantum Hashing Circuit Optimization for Arbitrary Qubit Connectivity Graphs Based on 1-Covering Path","version":1},"reference_index":55,"source":"pdf_text","source_observed_at":"2026-08-11T23:04:06.067194Z"},"links":{"citing_paper":"/paper/2608.09134"},"observation_digest":"sha256:4ac11a6cb9acacb44ba83e2cbc8937cd6b5411759a2a56683bd9704f4fc3235d","observation_id":"efcebc70-7faf-4b42-bd6d-a5c78aaa99f8","resolution":{"observed_at":"2026-08-11T23:04:06.067194Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T23:04:06.071694Z","title":"McGraw-Hill, 2001","venue":null,"work_id":null,"year":2001},"citing_paper":{"arxiv_id":"2608.09134","last_updated":"2026-08-10T05:26:52Z","snapshot_observed_at":"2026-08-13T01:16:43.819427Z","submitted_at":"2026-08-10T05:26:52Z","title":"Quantum Hashing Circuit Optimization for Arbitrary Qubit Connectivity Graphs Based on 1-Covering Path","version":1},"reference_index":56,"source":"pdf_text","source_observed_at":"2026-08-11T23:04:06.071694Z"},"links":{"citing_paper":"/paper/2608.09134"},"observation_digest":"sha256:764b8b027ab2ffc2493766f9969406f3780be73ab1b59da9c875ea061fc06d9c","observation_id":"05046a91-d15e-4067-9783-9253f046803b","resolution":{"observed_at":"2026-08-11T23:04:06.071694Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2212.14205","last_updated":"2022-12-29T07:46:21Z","snapshot_observed_at":"2026-08-10T09:36:33.136419Z","submitted_at":"2022-12-29T07:46:21Z","title":"Lecture Notes on Quantum Algorithms","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2212.14205","snapshot_observed_at":"2026-08-11T23:04:06.075980Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2608.09134","last_updated":"2026-08-10T05:26:52Z","snapshot_observed_at":"2026-08-13T01:16:43.819427Z","submitted_at":"2026-08-10T05:26:52Z","title":"Quantum Hashing Circuit Optimization for Arbitrary Qubit Connectivity Graphs Based on 1-Covering Path","version":1},"reference_index":57,"source":"pdf_text","source_observed_at":"2026-08-11T23:04:06.075980Z"},"links":{"cited_paper":"/paper/2212.14205","citing_paper":"/paper/2608.09134"},"observation_digest":"sha256:64fed43d80513ec6e255b2fdaeddfc8e1356d35025bda01680b52e80e655d3a4","observation_id":"d7cda9db-c4be-4f41-8d71-7167a955f0d7","resolution":{"observed_at":"2026-08-11T23:04:06.075980Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T23:04:06.081016Z","title":"Ablayev, A","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2608.09134","last_updated":"2026-08-10T05:26:52Z","snapshot_observed_at":"2026-08-13T01:16:43.819427Z","submitted_at":"2026-08-10T05:26:52Z","title":"Quantum Hashing Circuit Optimization for Arbitrary Qubit Connectivity Graphs Based on 1-Covering Path","version":1},"reference_index":58,"source":"pdf_text","source_observed_at":"2026-08-11T23:04:06.081016Z"},"links":{"citing_paper":"/paper/2608.09134"},"observation_digest":"sha256:0d8fe0ea809de670161fa66c8857dc53e1a1c3729be55f4656f59f25397a4670","observation_id":"03ec0750-42ed-4294-83bb-99485df2ad02","resolution":{"observed_at":"2026-08-11T23:04:06.081016Z","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-11T23:04:06.405993Z","title":"Classical and quantum parallelism in the quantum fingerprinting method","venue":null,"work_id":"67b721db-9e86-493c-b891-3ecd022e78e8","year":2011},"citing_paper":{"arxiv_id":"2608.09134","last_updated":"2026-08-10T05:26:52Z","snapshot_observed_at":"2026-08-13T01:16:43.819427Z","submitted_at":"2026-08-10T05:26:52Z","title":"Quantum Hashing Circuit Optimization for Arbitrary Qubit Connectivity Graphs Based on 1-Covering Path","version":1},"reference_index":59,"source":"pdf_text","source_observed_at":"2026-08-11T23:04:06.085741Z"},"links":{"citing_paper":"/paper/2608.09134"},"observation_digest":"sha256:c6b23f141cd038c7f33b9cd5e32740f941314c776906a002e7b82c2752f9c2e9","observation_id":"8d8d05af-3414-4ae7-bf38-f93a0440d6c9","resolution":{"observed_at":"2026-08-11T23:04:06.411259Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-11T23:04:06.390287Z","title":"M Ablayev and A","venue":null,"work_id":"f539a20d-cb12-47f7-85a2-1d29ddb348cc","year":2013},"citing_paper":{"arxiv_id":"2608.09134","last_updated":"2026-08-10T05:26:52Z","snapshot_observed_at":"2026-08-13T01:16:43.819427Z","submitted_at":"2026-08-10T05:26:52Z","title":"Quantum Hashing Circuit Optimization for Arbitrary Qubit Connectivity Graphs Based on 1-Covering Path","version":1},"reference_index":60,"source":"pdf_text","source_observed_at":"2026-08-11T23:04:06.090846Z"},"links":{"citing_paper":"/paper/2608.09134"},"observation_digest":"sha256:6394fccb936d16e129084c75f8cd8a865ea8e25061f424691407fd5e6ccb3a4b","observation_id":"cf689b82-9096-4a29-a66a-456942d91a8e","resolution":{"observed_at":"2026-08-11T23:04:06.395176Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-11T23:04:06.371686Z","title":"Ant colonies for the travelling sales- man problem.Biosystems, 43(2):73–81, 1997","venue":null,"work_id":"4bc535fd-43d2-4c04-ad4c-25b5ab2bb5e8","year":1997},"citing_paper":{"arxiv_id":"2608.09134","last_updated":"2026-08-10T05:26:52Z","snapshot_observed_at":"2026-08-13T01:16:43.819427Z","submitted_at":"2026-08-10T05:26:52Z","title":"Quantum Hashing Circuit Optimization for Arbitrary Qubit Connectivity Graphs Based on 1-Covering Path","version":1},"reference_index":61,"source":"pdf_text","source_observed_at":"2026-08-11T23:04:06.096615Z"},"links":{"citing_paper":"/paper/2608.09134"},"observation_digest":"sha256:fd80893015cddef9b94973080d4ee7119568ed8a0447b55554ae7f032473523c","observation_id":"757ead0b-7ea9-40e1-b9d7-3d98b6ee42c5","resolution":{"observed_at":"2026-08-11T23:04:06.378517Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-11T23:04:06.352932Z","title":"The traveling salesman problem: a case study.Local search in combinatorial optimization, pages 215–310, 1997","venue":null,"work_id":"9deda45f-5b99-4742-9276-677dfb23ae68","year":1997},"citing_paper":{"arxiv_id":"2608.09134","last_updated":"2026-08-10T05:26:52Z","snapshot_observed_at":"2026-08-13T01:16:43.819427Z","submitted_at":"2026-08-10T05:26:52Z","title":"Quantum Hashing Circuit Optimization for Arbitrary Qubit Connectivity Graphs Based on 1-Covering Path","version":1},"reference_index":62,"source":"pdf_text","source_observed_at":"2026-08-11T23:04:06.101433Z"},"links":{"citing_paper":"/paper/2608.09134"},"observation_digest":"sha256:6dff545a46ced56789376e695965d0bf95936674910590e3308739a6bbc92755","observation_id":"e418bf2d-15b5-40bf-8151-5f7b80fb120b","resolution":{"observed_at":"2026-08-11T23:04:06.358799Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-11T23:04:06.337266Z","title":"Approximation algorithms for connected domi- nating sets.Algorithmica, 20:374–387, 1998","venue":null,"work_id":"589b11a6-8133-4f0b-aa8e-214d35798aea","year":1998},"citing_paper":{"arxiv_id":"2608.09134","last_updated":"2026-08-10T05:26:52Z","snapshot_observed_at":"2026-08-13T01:16:43.819427Z","submitted_at":"2026-08-10T05:26:52Z","title":"Quantum Hashing Circuit Optimization for Arbitrary Qubit Connectivity Graphs Based on 1-Covering Path","version":1},"reference_index":63,"source":"pdf_text","source_observed_at":"2026-08-11T23:04:06.106124Z"},"links":{"citing_paper":"/paper/2608.09134"},"observation_digest":"sha256:c6efb8db15742ec47df6b405e5cd4f4a9a626a06bc312e875d02f0b331fc403f","observation_id":"7c275864-b04e-424d-9c99-7143238226d2","resolution":{"observed_at":"2026-08-11T23:04:06.342060Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-11T23:04:06.322413Z","title":"Christofides","venue":null,"work_id":"01db1060-bfde-4061-a19e-fa2edfe21116","year":2022},"citing_paper":{"arxiv_id":"2608.09134","last_updated":"2026-08-10T05:26:52Z","snapshot_observed_at":"2026-08-13T01:16:43.819427Z","submitted_at":"2026-08-10T05:26:52Z","title":"Quantum Hashing Circuit Optimization for Arbitrary Qubit Connectivity Graphs Based on 1-Covering Path","version":1},"reference_index":64,"source":"pdf_text","source_observed_at":"2026-08-11T23:04:06.110869Z"},"links":{"citing_paper":"/paper/2608.09134"},"observation_digest":"sha256:9a39d9e9ff4f181c910a98d4ea124b86893df094609792094ccf3054c66c8dc9","observation_id":"cb1d0e84-9114-48ac-8763-5f0120a272a6","resolution":{"observed_at":"2026-08-11T23:04:06.326972Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-11T23:04:06.307217Z","title":"On some extremal walks in graphs (in russian).Upravlyaemye sistemy, (17):76–79, 1978","venue":null,"work_id":"648eb1ab-0cc9-4e05-92c0-e2459707d7bc","year":1978},"citing_paper":{"arxiv_id":"2608.09134","last_updated":"2026-08-10T05:26:52Z","snapshot_observed_at":"2026-08-13T01:16:43.819427Z","submitted_at":"2026-08-10T05:26:52Z","title":"Quantum Hashing Circuit Optimization for Arbitrary Qubit Connectivity Graphs Based on 1-Covering Path","version":1},"reference_index":65,"source":"pdf_text","source_observed_at":"2026-08-11T23:04:06.116234Z"},"links":{"citing_paper":"/paper/2608.09134"},"observation_digest":"sha256:10c4d9f3923e3c75fb5c7bd3174d6157ec103ca7172ff1abfa4ea44fb8b6b6c4","observation_id":"899bbf97-954b-41d0-9ab0-b245d1d00ef4","resolution":{"observed_at":"2026-08-11T23:04:06.311649Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-11T23:04:06.292228Z","title":"good” in the following sense. A set of parametersK={k 1, . . . , kt}is called “good","venue":null,"work_id":"9d1cb638-f032-4e89-b74a-f4eaf62517b0","year":2020},"citing_paper":{"arxiv_id":"2608.09134","last_updated":"2026-08-10T05:26:52Z","snapshot_observed_at":"2026-08-13T01:16:43.819427Z","submitted_at":"2026-08-10T05:26:52Z","title":"Quantum Hashing Circuit Optimization for Arbitrary Qubit Connectivity Graphs Based on 1-Covering Path","version":1},"reference_index":66,"source":"pdf_text","source_observed_at":"2026-08-11T23:04:06.121124Z"},"links":{"citing_paper":"/paper/2608.09134"},"observation_digest":"sha256:a661d6228b5613467e4417b8bd91e6b4b62787a3142935c6d6501df006430108","observation_id":"b435b971-6120-4d75-86dc-f6d9c8609eda","resolution":{"observed_at":"2026-08-11T23:04:06.297163Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T23:04:06.126125Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.09134","last_updated":"2026-08-10T05:26:52Z","snapshot_observed_at":"2026-08-13T01:16:43.819427Z","submitted_at":"2026-08-10T05:26:52Z","title":"Quantum Hashing Circuit Optimization for Arbitrary Qubit Connectivity Graphs Based on 1-Covering Path","version":1},"reference_index":67,"source":"pdf_text","source_observed_at":"2026-08-11T23:04:06.126125Z"},"links":{"citing_paper":"/paper/2608.09134"},"observation_digest":"sha256:318c9c8e0ac1a974cbbbe3490a445ff2c896b7ac50f2eeb42a503084e6690306","observation_id":"3f19cddd-d88a-4a5e-a6ea-aecb0a31cbd3","resolution":{"observed_at":"2026-08-11T23:04:06.126125Z","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-11T23:04:06.262424Z","title":"collects","venue":null,"work_id":"a38310e7-1d80-4a36-b051-4a4eb2872e15","year":null},"citing_paper":{"arxiv_id":"2608.09134","last_updated":"2026-08-10T05:26:52Z","snapshot_observed_at":"2026-08-13T01:16:43.819427Z","submitted_at":"2026-08-10T05:26:52Z","title":"Quantum Hashing Circuit Optimization for Arbitrary Qubit Connectivity Graphs Based on 1-Covering Path","version":1},"reference_index":68,"source":"pdf_text","source_observed_at":"2026-08-11T23:04:06.131800Z"},"links":{"citing_paper":"/paper/2608.09134"},"observation_digest":"sha256:d8f4d9655d7347671ef3a9832204942f30f1885a7d3cdecf6107d59a12f577a6","observation_id":"99b4c44e-6077-49e7-b4f8-d7934baad135","resolution":{"observed_at":"2026-08-11T23:04:06.268286Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-11T23:04:06.243486Z","title":"Then we ac- cept the input if the outcome is the all-zero state","venue":null,"work_id":"fc784b23-2d83-458b-9f63-9c33d556f952","year":null},"citing_paper":{"arxiv_id":"2608.09134","last_updated":"2026-08-10T05:26:52Z","snapshot_observed_at":"2026-08-13T01:16:43.819427Z","submitted_at":"2026-08-10T05:26:52Z","title":"Quantum Hashing Circuit Optimization for Arbitrary Qubit Connectivity Graphs Based on 1-Covering Path","version":1},"reference_index":69,"source":"pdf_text","source_observed_at":"2026-08-11T23:04:06.137390Z"},"links":{"citing_paper":"/paper/2608.09134"},"observation_digest":"sha256:41b004d2be01af3e8ca16fb0280bfc2558a66d8efa018a8486c8fe4bb4d8fbff","observation_id":"8ae193bf-90db-40a8-b2ea-85e512a73ddf","resolution":{"observed_at":"2026-08-11T23:04:06.248803Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-11T23:04:06.226895Z","title":null,"venue":null,"work_id":"b7b7fd20-e517-4e38-8923-825da06f605d","year":null},"citing_paper":{"arxiv_id":"2608.09134","last_updated":"2026-08-10T05:26:52Z","snapshot_observed_at":"2026-08-13T01:16:43.819427Z","submitted_at":"2026-08-10T05:26:52Z","title":"Quantum Hashing Circuit Optimization for Arbitrary Qubit Connectivity Graphs Based on 1-Covering Path","version":1},"reference_index":70,"source":"pdf_text","source_observed_at":"2026-08-11T23:04:06.142737Z"},"links":{"citing_paper":"/paper/2608.09134"},"observation_digest":"sha256:2da202f3d98ab36b7010fdd61fe76c5ec1440cc1ab0ee6284b558984abde8485","observation_id":"5c6b512b-9ad1-4968-bfb5-87cdf9115ba1","resolution":{"observed_at":"2026-08-11T23:04:06.231993Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-11T23:04:06.207415Z","title":"The angleξ r corresponds to the qubitqr associated with the vertexv","venue":null,"work_id":"e2b3f396-80eb-4bab-8aa1-cd3c5e5f0a5d","year":null},"citing_paper":{"arxiv_id":"2608.09134","last_updated":"2026-08-10T05:26:52Z","snapshot_observed_at":"2026-08-13T01:16:43.819427Z","submitted_at":"2026-08-10T05:26:52Z","title":"Quantum Hashing Circuit Optimization for Arbitrary Qubit Connectivity Graphs Based on 1-Covering Path","version":1},"reference_index":71,"source":"pdf_text","source_observed_at":"2026-08-11T23:04:06.148530Z"},"links":{"citing_paper":"/paper/2608.09134"},"observation_digest":"sha256:6cbe9f1f07b53bd81386240914e7551547d29aff625a3c1bceecdf3c8f54d7a0","observation_id":"0784d2ea-a2d1-49d2-a19e-e82bf435a52d","resolution":{"observed_at":"2026-08-11T23:04:06.214910Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2608.09134","last_updated":"2026-08-10T05:26:52Z","latest_version":1,"primary_category":"quant-ph","snapshot_observed_at":"2026-08-13T01:16:43.819427Z","submitted_at":"2026-08-10T05:26:52Z","title":"Quantum Hashing Circuit Optimization for Arbitrary Qubit Connectivity Graphs Based on 1-Covering Path"},"reference_resolution":{"displayed":71,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":39,"verified_exact":0,"verified_fuzzy":32},"total_outbound_references":71},"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-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"thesis":"As of 13 August 2026, this Paper Citation Record lists 71 of 71 outbound references and 0 inbound Pith citation observations for arXiv:2608.09134."}