{"as_of":"2026-08-18T20:45:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:ae3051b75618d1e18647f191b2c547528dee55737e1ebfb2c57cf21f3dd4ead5","coverage":[{"denominator":81,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":81,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-16T11:44:10.310057Z","state":"measured"},{"denominator":83,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":83,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-18T06:34:40.430872+00:00","state":"measured"},{"denominator":2,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":2,"source":"paper_references, paper_reference_links","source_observed_at":"2026-05-18T17:57:12.580235Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-05-18T18:01:43.902411Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2504.15343","last_updated":"2025-04-21T18:00:03Z","snapshot_observed_at":"2026-08-16T11:26:34.790545Z","submitted_at":"2025-04-21T18:00:03Z","title":"The Hardness of Learning Quantum Circuits and its Cryptographic Applications","version":1},"cited_work":{"arxiv_id":"2504.15343","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2504.15343","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"The hardness of learning quantum circuits and its cryptographic applications","venue":null,"work_id":"7bc96685-edfc-4ff4-965e-32b5564e1b50","year":2025},"citing_paper":{"arxiv_id":"2509.07573","last_updated":"2026-05-06T08:56:20Z","snapshot_observed_at":"2026-08-13T01:22:00.446100Z","submitted_at":"2025-09-09T10:18:49Z","title":"On the Complexity of Quantum States and Circuits from the Orthogonal and Symplectic Groups","version":2},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-05-18T17:57:12.580235Z"},"links":{"cited_paper":"/paper/2504.15343","citing_paper":"/paper/2509.07573"},"observation_digest":"sha256:c63652372916af43278ab34fb3ae872e58cece95fbdac284783ceb24c393d24a","observation_id":"84998fc0-bc67-414f-958d-1c3a1fb6f247","resolution":{"observed_at":"2026-05-18T18:01:43.905365Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2504.15343","last_updated":"2025-04-21T18:00:03Z","snapshot_observed_at":"2026-08-16T11:26:34.790545Z","submitted_at":"2025-04-21T18:00:03Z","title":"The Hardness of Learning Quantum Circuits and its Cryptographic Applications","version":1},"cited_work":{"arxiv_id":"2504.15343","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2504.15343","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"The hardness of learning quantum circuits and its cryptographic applications","venue":null,"work_id":"7bc96685-edfc-4ff4-965e-32b5564e1b50","year":2025},"citing_paper":{"arxiv_id":"2604.15269","last_updated":"2026-04-16T17:41:16Z","snapshot_observed_at":"2026-08-16T08:33:07.393116Z","submitted_at":"2026-04-16T17:41:16Z","title":"Cloning is as Hard as Learning for Stabilizer States","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-05-10T11:25:59.093028Z"},"links":{"cited_paper":"/paper/2504.15343","citing_paper":"/paper/2604.15269"},"observation_digest":"sha256:5fa7e0dbb721e87918bec5999b290756b1fbf46fed4f64abc4e70692aaf9db0c","observation_id":"a978e8fc-1325-44d7-b636-60daa566ddba","resolution":{"observed_at":"2026-05-10T11:30:19.012978Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2504.15343/citation-record","integrity":"/paper/2504.15343/integrity","json":"/paper/2504.15343/citation-record.json","paper":"/paper/2504.15343"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T11:44:10.068777Z","title":"The computational complexity of linear optics","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2504.15343","last_updated":"2025-04-21T18:00:03Z","snapshot_observed_at":"2026-08-16T11:26:34.790545Z","submitted_at":"2025-04-21T18:00:03Z","title":"The Hardness of Learning Quantum Circuits and its Cryptographic Applications","version":1},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-16T11:44:10.068777Z"},"links":{"citing_paper":"/paper/2504.15343"},"observation_digest":"sha256:b4490c95d858a63bb89669a9ac2f89fd7b1fddfb382c3d464183d2a7c0dafccb","observation_id":"6cbb07d4-cb99-4519-a8c9-4018f2d3dba5","resolution":{"observed_at":"2026-08-16T11:44:10.068777Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2408.13687","last_updated":"2024-08-24T23:08:50Z","snapshot_observed_at":"2026-08-16T13:24:05.007005Z","submitted_at":"2024-08-24T23:08:50Z","title":"Quantum error correction below the surface code threshold","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2408.13687","snapshot_observed_at":"2026-08-16T11:44:10.072292Z","title":"Quantum error correction below the surface code threshold","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2504.15343","last_updated":"2025-04-21T18:00:03Z","snapshot_observed_at":"2026-08-16T11:26:34.790545Z","submitted_at":"2025-04-21T18:00:03Z","title":"The Hardness of Learning Quantum Circuits and its Cryptographic Applications","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-16T11:44:10.072292Z"},"links":{"cited_paper":"/paper/2408.13687","citing_paper":"/paper/2504.15343"},"observation_digest":"sha256:f60bf8b853fcdca2ce792601f731879b9ce64a27725ba03c3e9961a9aee5d3d7","observation_id":"2aec6669-1f36-4b3f-8a43-12d3808c3868","resolution":{"observed_at":"2026-08-16T11:44:10.072292Z","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-16T11:44:11.045922Z","title":"Quantum supremacy using a programmable superconducting processor","venue":null,"work_id":"64552ec8-293e-44af-89c4-5b310c1d5eab","year":2019},"citing_paper":{"arxiv_id":"2504.15343","last_updated":"2025-04-21T18:00:03Z","snapshot_observed_at":"2026-08-16T11:26:34.790545Z","submitted_at":"2025-04-21T18:00:03Z","title":"The Hardness of Learning Quantum Circuits and its Cryptographic Applications","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-16T11:44:10.075899Z"},"links":{"citing_paper":"/paper/2504.15343"},"observation_digest":"sha256:751860da4f6f03c3639d55b5675706c90659264b8407368cb3411871bdefd815","observation_id":"2d7285fe-67cd-48cc-b4a0-548a25211218","resolution":{"observed_at":"2026-08-16T11:44:11.049390Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-16T11:44:11.035062Z","title":"Polynomial simulations of decohered quantum computers","venue":null,"work_id":"f70541ac-07bd-496e-b354-704021ba96cc","year":1996},"citing_paper":{"arxiv_id":"2504.15343","last_updated":"2025-04-21T18:00:03Z","snapshot_observed_at":"2026-08-16T11:26:34.790545Z","submitted_at":"2025-04-21T18:00:03Z","title":"The Hardness of Learning Quantum Circuits and its Cryptographic Applications","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-16T11:44:10.079176Z"},"links":{"citing_paper":"/paper/2504.15343"},"observation_digest":"sha256:29dfead6f1cb3f44d88ce6992f7a4bc0a21e3ad4caf5ef4dcf0b19bdbd49114c","observation_id":"bd1e118b-e58f-4187-ace2-2c31a0d6e4e3","resolution":{"observed_at":"2026-08-16T11:44:11.039133Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-16T11:44:11.024783Z","title":"Complexity-theoretic foundations of quantum supremacy experiments","venue":null,"work_id":"fb521991-0657-4f42-ac4c-39d0087feebf","year":2017},"citing_paper":{"arxiv_id":"2504.15343","last_updated":"2025-04-21T18:00:03Z","snapshot_observed_at":"2026-08-16T11:26:34.790545Z","submitted_at":"2025-04-21T18:00:03Z","title":"The Hardness of Learning Quantum Circuits and its Cryptographic Applications","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-16T11:44:10.082284Z"},"links":{"citing_paper":"/paper/2504.15343"},"observation_digest":"sha256:3580aa6a0937a2a3023e9daa11014e3db829e59b134315710a0da763a956db1c","observation_id":"14f956c8-3bba-46e9-86f0-368ce1f866e8","resolution":{"observed_at":"2026-08-16T11:44:11.028266Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-16T11:44:11.013975Z","title":"A polynomial-time classical algorithm for noisy random circuit sampling","venue":null,"work_id":"21d4f2a5-5436-490f-a9a1-246bb300de6b","year":2023},"citing_paper":{"arxiv_id":"2504.15343","last_updated":"2025-04-21T18:00:03Z","snapshot_observed_at":"2026-08-16T11:26:34.790545Z","submitted_at":"2025-04-21T18:00:03Z","title":"The Hardness of Learning Quantum Circuits and its Cryptographic Applications","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-16T11:44:10.085537Z"},"links":{"citing_paper":"/paper/2504.15343"},"observation_digest":"sha256:24cc6be9bbcd2fa773c48f0bb00d23f8267ab2cb411e457e1839f6322961a27f","observation_id":"09503ecd-13fe-42eb-b93d-e9bef95b35fd","resolution":{"observed_at":"2026-08-16T11:44:11.017518Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-16T11:44:11.004045Z","title":"Grilo, and Aarthi Sundaram","venue":null,"work_id":"2ffa05ad-125c-4973-a59b-914617b1bc42","year":2020},"citing_paper":{"arxiv_id":"2504.15343","last_updated":"2025-04-21T18:00:03Z","snapshot_observed_at":"2026-08-16T11:26:34.790545Z","submitted_at":"2025-04-21T18:00:03Z","title":"The Hardness of Learning Quantum Circuits and its Cryptographic Applications","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-16T11:44:10.088870Z"},"links":{"citing_paper":"/paper/2504.15343"},"observation_digest":"sha256:8fff9461ba7130f1ad1f55519e56ca43a91c7ad39d2be9dd3b7db0e0b0502236","observation_id":"f987994c-15de-46e3-9d77-7649438d75c3","resolution":{"observed_at":"2026-08-16T11:44:11.007521Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-16T11:44:10.993573Z","title":"Certified randomness from quantum supremacy","venue":null,"work_id":"c4e3bd4e-a6f8-448e-9709-502597f57968","year":2023},"citing_paper":{"arxiv_id":"2504.15343","last_updated":"2025-04-21T18:00:03Z","snapshot_observed_at":"2026-08-16T11:26:34.790545Z","submitted_at":"2025-04-21T18:00:03Z","title":"The Hardness of Learning Quantum Circuits and its Cryptographic Applications","version":1},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-16T11:44:10.091902Z"},"links":{"citing_paper":"/paper/2504.15343"},"observation_digest":"sha256:025f6188fccaef74c72a333578597fd5b7ddb9d5f528a8a817023a03381b5468","observation_id":"8b8b5e9e-771a-4fbd-82c8-31ad1a30cca8","resolution":{"observed_at":"2026-08-16T11:44:10.997410Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"quant-ph/0301040","last_updated":"2003-01-09T23:13:49Z","snapshot_observed_at":"2026-08-18T10:04:45.241302Z","submitted_at":"2003-01-09T23:13:49Z","title":"A Simple Proof that Toffoli and Hadamard are Quantum Universal","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"quant-ph/0301040","snapshot_observed_at":"2026-08-16T11:44:10.095034Z","title":"A simple proof that T offoli and H adamard are quantum universal","venue":null,"work_id":null,"year":2003},"citing_paper":{"arxiv_id":"2504.15343","last_updated":"2025-04-21T18:00:03Z","snapshot_observed_at":"2026-08-16T11:26:34.790545Z","submitted_at":"2025-04-21T18:00:03Z","title":"The Hardness of Learning Quantum Circuits and its Cryptographic Applications","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-16T11:44:10.095034Z"},"links":{"cited_paper":"/paper/quant-ph/0301040","citing_paper":"/paper/2504.15343"},"observation_digest":"sha256:a5cbe30bc65d0433d427e121d5e6be7816920f8c7746966d53642df34d671d6e","observation_id":"05d5f018-9eb7-4b23-82c3-87ad6189a449","resolution":{"observed_at":"2026-08-16T11:44:10.095034Z","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-16T11:44:10.983228Z","title":"Cryptography from pseudorandom quantum states","venue":null,"work_id":"c3d1dada-50c8-429a-85d4-b33e0711de52","year":2022},"citing_paper":{"arxiv_id":"2504.15343","last_updated":"2025-04-21T18:00:03Z","snapshot_observed_at":"2026-08-16T11:26:34.790545Z","submitted_at":"2025-04-21T18:00:03Z","title":"The Hardness of Learning Quantum Circuits and its Cryptographic Applications","version":1},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-16T11:44:10.098517Z"},"links":{"citing_paper":"/paper/2504.15343"},"observation_digest":"sha256:d682f256d784e2d7555fb480324edae7e187633188885d7c9913c216001f4f04","observation_id":"e5077513-b63a-42e8-9adb-d6aad5031156","resolution":{"observed_at":"2026-08-16T11:44:10.986720Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-16T11:44:10.971842Z","title":"Bennett, Ethan Bernstein, Gilles Brassard, and Umesh Vazirani","venue":null,"work_id":"7de05a31-bd0a-4bc9-b7d5-9898c5260ba1","year":1997},"citing_paper":{"arxiv_id":"2504.15343","last_updated":"2025-04-21T18:00:03Z","snapshot_observed_at":"2026-08-16T11:26:34.790545Z","submitted_at":"2025-04-21T18:00:03Z","title":"The Hardness of Learning Quantum Circuits and its Cryptographic Applications","version":1},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-16T11:44:10.101359Z"},"links":{"citing_paper":"/paper/2504.15343"},"observation_digest":"sha256:144669fa8826ae91edf24c6dbe87d37ed1ed23fdc3e05ad3db4803b19b643cf6","observation_id":"85c8d7b5-35f9-4b28-8a52-6b121d79578f","resolution":{"observed_at":"2026-08-16T11:44:10.975814Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-16T11:44:10.961865Z","title":"On certified randomness from fourier sampling or random circuit sampling, 2024","venue":null,"work_id":"b149c182-9392-4291-ae8c-65c13c71ec7d","year":2024},"citing_paper":{"arxiv_id":"2504.15343","last_updated":"2025-04-21T18:00:03Z","snapshot_observed_at":"2026-08-16T11:26:34.790545Z","submitted_at":"2025-04-21T18:00:03Z","title":"The Hardness of Learning Quantum Circuits and its Cryptographic Applications","version":1},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-16T11:44:10.104574Z"},"links":{"citing_paper":"/paper/2504.15343"},"observation_digest":"sha256:4dfe0d10f3b5e2fe0225ef076041f31c9634b1ccc59729bc3fc31a1abf7cda4e","observation_id":"ca73ba85-63ac-40c8-91c2-79e308cae7bf","resolution":{"observed_at":"2026-08-16T11:44:10.965134Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"quant-ph/9712023","last_updated":"1997-12-10T20:16:27Z","snapshot_observed_at":"2026-08-12T00:38:47.844415Z","submitted_at":"1997-12-10T20:16:27Z","title":"A brief review on the impossibility of quantum bit commitment","version":1},"cited_work":{"arxiv_id":"quant-ph/9712023","doi":null,"metadata_source":"pith","pith_arxiv_id":"quant-ph/9712023","snapshot_observed_at":"2026-08-16T11:44:10.417537Z","title":"A brief review on the impossibility of quantum bit commitment","venue":"quant-ph","work_id":"c610cc5b-6fa6-46d8-bb95-cb344712b146","year":1997},"citing_paper":{"arxiv_id":"2504.15343","last_updated":"2025-04-21T18:00:03Z","snapshot_observed_at":"2026-08-16T11:26:34.790545Z","submitted_at":"2025-04-21T18:00:03Z","title":"The Hardness of Learning Quantum Circuits and its Cryptographic Applications","version":1},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-16T11:44:10.107445Z"},"links":{"cited_paper":"/paper/quant-ph/9712023","citing_paper":"/paper/2504.15343"},"observation_digest":"sha256:c9a4088611972fd11de4710f93f2b3d9b97b2a0443500dff1af19d65c1f41add","observation_id":"755182f9-fa81-4589-b579-317c57985ebc","resolution":{"observed_at":"2026-08-16T11:44:10.421209Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2410.03358","last_updated":"2025-04-11T15:21:41Z","snapshot_observed_at":"2026-08-16T13:12:37.187873Z","submitted_at":"2024-10-04T12:26:21Z","title":"Oracle Separation Between Quantum Commitments and Quantum One-wayness","version":3},"cited_work":{"arxiv_id":"2410.03358","doi":null,"metadata_source":"pith","pith_arxiv_id":"2410.03358","snapshot_observed_at":"2026-08-16T11:44:10.405031Z","title":"Oracle Separation Between Quantum Commitments and Quantum One-wayness","venue":"quant-ph","work_id":"c1480db7-11f1-462f-ad7c-6be099efc92a","year":2024},"citing_paper":{"arxiv_id":"2504.15343","last_updated":"2025-04-21T18:00:03Z","snapshot_observed_at":"2026-08-16T11:26:34.790545Z","submitted_at":"2025-04-21T18:00:03Z","title":"The Hardness of Learning Quantum Circuits and its Cryptographic Applications","version":1},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-16T11:44:10.110560Z"},"links":{"cited_paper":"/paper/2410.03358","citing_paper":"/paper/2504.15343"},"observation_digest":"sha256:140b899f69b0eb19ecccc1f698aee9c61c569e15cac098484d614de53a4de1fb","observation_id":"a81133cb-fafc-42ee-8812-208faec04539","resolution":{"observed_at":"2026-08-16T11:44:10.408437Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-16T11:44:10.952162Z","title":"On the computational hardness needed for quantum cryptography","venue":null,"work_id":"e09f5ef8-e101-4ba2-8367-93a6f2f5b511","year":2023},"citing_paper":{"arxiv_id":"2504.15343","last_updated":"2025-04-21T18:00:03Z","snapshot_observed_at":"2026-08-16T11:26:34.790545Z","submitted_at":"2025-04-21T18:00:03Z","title":"The Hardness of Learning Quantum Circuits and its Cryptographic Applications","version":1},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-16T11:44:10.113876Z"},"links":{"citing_paper":"/paper/2504.15343"},"observation_digest":"sha256:3b12a48b4cfc6b3d19db7705fef465a7ee8c3e0eb37ba2fd959a9f83e4ac28db","observation_id":"c1410d13-1df4-48f3-afae-758097629a7d","resolution":{"observed_at":"2026-08-16T11:44:10.956031Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-16T11:44:10.116724Z","title":"Logical quantum processor based on reconfigurable atom arrays","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2504.15343","last_updated":"2025-04-21T18:00:03Z","snapshot_observed_at":"2026-08-16T11:26:34.790545Z","submitted_at":"2025-04-21T18:00:03Z","title":"The Hardness of Learning Quantum Circuits and its Cryptographic Applications","version":1},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-16T11:44:10.116724Z"},"links":{"citing_paper":"/paper/2504.15343"},"observation_digest":"sha256:9b39d9b90dcbe002aec90dc1572a725bf7601640e40305b7a50b0ca21d26bba1","observation_id":"1fc66da8-c032-4e9f-8832-16488e8afdc4","resolution":{"observed_at":"2026-08-16T11:44:10.116724Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2306.13073","last_updated":"2025-07-29T13:22:06Z","snapshot_observed_at":"2026-08-16T15:21:51.923249Z","submitted_at":"2023-06-22T17:46:39Z","title":"Unitary Complexity and the Uhlmann Transformation Problem","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2306.13073","snapshot_observed_at":"2026-08-16T11:44:10.119546Z","title":"Unitary complexity and the U hlmann transformation problem","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2504.15343","last_updated":"2025-04-21T18:00:03Z","snapshot_observed_at":"2026-08-16T11:26:34.790545Z","submitted_at":"2025-04-21T18:00:03Z","title":"The Hardness of Learning Quantum Circuits and its Cryptographic Applications","version":1},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-16T11:44:10.119546Z"},"links":{"cited_paper":"/paper/2306.13073","citing_paper":"/paper/2504.15343"},"observation_digest":"sha256:4ea4bf0f58d0d1df1822f2ec8deeced033108962ebdd7a0f4d6c83fa57eebbf9","observation_id":"1dac9c45-57cd-4168-80ec-8227a3616c0c","resolution":{"observed_at":"2026-08-16T11:44:10.119546Z","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-16T11:44:10.934952Z","title":null,"venue":null,"work_id":"0ea5811a-b9a4-4bcf-bdf0-1ef69c81ead2","year":1993},"citing_paper":{"arxiv_id":"2504.15343","last_updated":"2025-04-21T18:00:03Z","snapshot_observed_at":"2026-08-16T11:26:34.790545Z","submitted_at":"2025-04-21T18:00:03Z","title":"The Hardness of Learning Quantum Circuits and its Cryptographic Applications","version":1},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-16T11:44:10.122601Z"},"links":{"citing_paper":"/paper/2504.15343"},"observation_digest":"sha256:8e0772cd189655d10147de3f5e7bd1696f533d2629d3c0f25118eb9531851aad","observation_id":"b14694f5-1ac4-44cc-96b5-856bcd86f9c1","resolution":{"observed_at":"2026-08-16T11:44:10.938736Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-16T11:44:10.924670Z","title":"On the complexity and verification of quantum random circuit sampling","venue":null,"work_id":"901fc287-bca7-4261-acaf-84cbb9244ba6","year":2019},"citing_paper":{"arxiv_id":"2504.15343","last_updated":"2025-04-21T18:00:03Z","snapshot_observed_at":"2026-08-16T11:26:34.790545Z","submitted_at":"2025-04-21T18:00:03Z","title":"The Hardness of Learning Quantum Circuits and its Cryptographic Applications","version":1},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-16T11:44:10.125563Z"},"links":{"citing_paper":"/paper/2504.15343"},"observation_digest":"sha256:90a88545b78385a81787c2ed4ec411a044f241e9f35f1a6bff502de54422a47b","observation_id":"c5428310-9e33-4300-ad7b-c99e0c76d9f2","resolution":{"observed_at":"2026-08-16T11:44:10.928507Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-16T11:44:10.916344Z","title":"Efficient quantum pseudorandomness from hamiltonian phase states, 2024","venue":null,"work_id":"32d895c7-3046-4c29-82a6-75f416923b63","year":2024},"citing_paper":{"arxiv_id":"2504.15343","last_updated":"2025-04-21T18:00:03Z","snapshot_observed_at":"2026-08-16T11:26:34.790545Z","submitted_at":"2025-04-21T18:00:03Z","title":"The Hardness of Learning Quantum Circuits and its Cryptographic Applications","version":1},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-16T11:44:10.128486Z"},"links":{"citing_paper":"/paper/2504.15343"},"observation_digest":"sha256:1b7ff259b32759bb06e9981c06290bb59b9470ea08d89ac51445d256fe2fc582","observation_id":"519bb6a9-ad7b-4041-8ca2-5934970369b2","resolution":{"observed_at":"2026-08-16T11:44:10.919294Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-16T11:44:10.908137Z","title":"A new world in the depths of microcrypt: Separating OWSGs and quantum money from QEFID","venue":null,"work_id":"aea27fc4-a7ed-4734-a9c3-8509f8817d7d","year":2024},"citing_paper":{"arxiv_id":"2504.15343","last_updated":"2025-04-21T18:00:03Z","snapshot_observed_at":"2026-08-16T11:26:34.790545Z","submitted_at":"2025-04-21T18:00:03Z","title":"The Hardness of Learning Quantum Circuits and its Cryptographic Applications","version":1},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-16T11:44:10.131454Z"},"links":{"citing_paper":"/paper/2504.15343"},"observation_digest":"sha256:ba612bb73d777897ed52a4b609f6b17d92443b0899f31cbf06d961d9e6a8387e","observation_id":"f4441cb0-e963-414b-aa1e-62f2c248d3dc","resolution":{"observed_at":"2026-08-16T11:44:10.911039Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-16T11:44:10.899802Z","title":"An efficient quantum parallel repetition theorem and applications","venue":null,"work_id":"178f23d6-e54b-4ea8-9ebe-1a8810d0123f","year":2024},"citing_paper":{"arxiv_id":"2504.15343","last_updated":"2025-04-21T18:00:03Z","snapshot_observed_at":"2026-08-16T11:26:34.790545Z","submitted_at":"2025-04-21T18:00:03Z","title":"The Hardness of Learning Quantum Circuits and its Cryptographic Applications","version":1},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-16T11:44:10.134570Z"},"links":{"citing_paper":"/paper/2504.15343"},"observation_digest":"sha256:2fb247ceebf540350e50517ca9324cfbdb770c40b6572b594033d9c9b25e3392","observation_id":"d376366f-9a07-46ae-a65d-108bd3afe268","resolution":{"observed_at":"2026-08-16T11:44:10.902740Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-16T11:44:10.891797Z","title":"A Cryptographic Perspective on the Verifiability of Quantum Advantage","venue":null,"work_id":"4dc9a178-d33a-40cb-a83d-2c36163e51dd","year":2023},"citing_paper":{"arxiv_id":"2504.15343","last_updated":"2025-04-21T18:00:03Z","snapshot_observed_at":"2026-08-16T11:26:34.790545Z","submitted_at":"2025-04-21T18:00:03Z","title":"The Hardness of Learning Quantum Circuits and its Cryptographic Applications","version":1},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-16T11:44:10.137567Z"},"links":{"citing_paper":"/paper/2504.15343"},"observation_digest":"sha256:2c1e338e089e941d463bd8b8c85b9e4a32ec83f0e08131c883c2c05bcff60982","observation_id":"2c8dd312-c8d7-40ce-9b0f-7cb4ad86bb5b","resolution":{"observed_at":"2026-08-16T11:44:10.894796Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-16T11:44:10.883382Z","title":"Cavalar, Eli Goldin, Matthew Gray, and Peter Hall","venue":null,"work_id":"29c1b5cd-c5d7-4480-9a7b-240e83d109c8","year":2024},"citing_paper":{"arxiv_id":"2504.15343","last_updated":"2025-04-21T18:00:03Z","snapshot_observed_at":"2026-08-16T11:26:34.790545Z","submitted_at":"2025-04-21T18:00:03Z","title":"The Hardness of Learning Quantum Circuits and its Cryptographic Applications","version":1},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-16T11:44:10.140635Z"},"links":{"citing_paper":"/paper/2504.15343"},"observation_digest":"sha256:0f4f3221a4c56600f9a09298d47fbe2eebd1601f559f7d18333ce29a473b2a81","observation_id":"4932a44f-bcc8-4773-a317-87d5b43a94d4","resolution":{"observed_at":"2026-08-16T11:44:10.886570Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-16T11:44:10.875580Z","title":"Learning algorithms from natural proofs","venue":null,"work_id":"9ed9dc85-ff71-426c-9a2c-4e6830a49739","year":2016},"citing_paper":{"arxiv_id":"2504.15343","last_updated":"2025-04-21T18:00:03Z","snapshot_observed_at":"2026-08-16T11:26:34.790545Z","submitted_at":"2025-04-21T18:00:03Z","title":"The Hardness of Learning Quantum Circuits and its Cryptographic Applications","version":1},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-16T11:44:10.143565Z"},"links":{"citing_paper":"/paper/2504.15343"},"observation_digest":"sha256:46094cb92dc83e262e7402b3b4ba993822ac328946931d7fa9b5c4528b220354","observation_id":"ad39bbc1-bc72-4531-bda9-0230837548e6","resolution":{"observed_at":"2026-08-16T11:44:10.878561Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-16T11:44:10.867767Z","title":"Quantum State Learning Implies Circuit Lower Bounds","venue":null,"work_id":"805f2d72-a4da-4ad6-82d4-7cd4daba26eb","year":2024},"citing_paper":{"arxiv_id":"2504.15343","last_updated":"2025-04-21T18:00:03Z","snapshot_observed_at":"2026-08-16T11:26:34.790545Z","submitted_at":"2025-04-21T18:00:03Z","title":"The Hardness of Learning Quantum Circuits and its Cryptographic Applications","version":1},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-08-16T11:44:10.146505Z"},"links":{"citing_paper":"/paper/2504.15343"},"observation_digest":"sha256:acaa852827dfd5657115a347be1b2967b8b4846e51116141483bd3098d8e2607","observation_id":"bf0cd1e0-a21f-4af6-875e-85b512f01e11","resolution":{"observed_at":"2026-08-16T11:44:10.870599Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-16T11:44:10.859721Z","title":"Random quantum circuits transform local noise into global white noise","venue":null,"work_id":"1c6bfea7-f1b1-4832-8cd7-8b081b5536a8","year":2024},"citing_paper":{"arxiv_id":"2504.15343","last_updated":"2025-04-21T18:00:03Z","snapshot_observed_at":"2026-08-16T11:26:34.790545Z","submitted_at":"2025-04-21T18:00:03Z","title":"The Hardness of Learning Quantum Circuits and its Cryptographic Applications","version":1},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-08-16T11:44:10.149427Z"},"links":{"citing_paper":"/paper/2504.15343"},"observation_digest":"sha256:20656239caf234bacad957c936f942694b7bd274106dfbff5aca7306ba53a990","observation_id":"15d1e96f-b2dd-450e-86d6-d506bcf0e6df","resolution":{"observed_at":"2026-08-16T11:44:10.862627Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-16T11:44:10.852077Z","title":"From average case complexity to improper learning complexity, 2014","venue":null,"work_id":"814ec09d-0a36-4875-8424-7ff889a0ac25","year":2014},"citing_paper":{"arxiv_id":"2504.15343","last_updated":"2025-04-21T18:00:03Z","snapshot_observed_at":"2026-08-16T11:26:34.790545Z","submitted_at":"2025-04-21T18:00:03Z","title":"The Hardness of Learning Quantum Circuits and its Cryptographic Applications","version":1},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-08-16T11:44:10.152520Z"},"links":{"citing_paper":"/paper/2504.15343"},"observation_digest":"sha256:d5614b4c001f41cd877646a069f8b9b25fec5500c764e0746c4e72f8ac7e4eea","observation_id":"dd284522-8d23-45da-902f-0f3eea4b4339","resolution":{"observed_at":"2026-08-16T11:44:10.854913Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-16T11:44:10.844192Z","title":"Gorshkov, Bill Fefferman, and Michael J","venue":null,"work_id":"6ed18c52-0cdd-4553-866a-17f46aec1014","year":2022},"citing_paper":{"arxiv_id":"2504.15343","last_updated":"2025-04-21T18:00:03Z","snapshot_observed_at":"2026-08-16T11:26:34.790545Z","submitted_at":"2025-04-21T18:00:03Z","title":"The Hardness of Learning Quantum Circuits and its Cryptographic Applications","version":1},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-08-16T11:44:10.155404Z"},"links":{"citing_paper":"/paper/2504.15343"},"observation_digest":"sha256:cdfab98e5ac69c023abbc86bfebcb9e65e1c94eb35eb6fa7bb45c686f9bb0466","observation_id":"8fd7c3bd-9a44-4336-943d-98231cda886a","resolution":{"observed_at":"2026-08-16T11:44:10.847166Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-16T11:44:10.835839Z","title":"Effect of nonunital noise on random-circuit sampling","venue":null,"work_id":"1810b986-d5b6-42cb-b395-de6f426710ef","year":2024},"citing_paper":{"arxiv_id":"2504.15343","last_updated":"2025-04-21T18:00:03Z","snapshot_observed_at":"2026-08-16T11:26:34.790545Z","submitted_at":"2025-04-21T18:00:03Z","title":"The Hardness of Learning Quantum Circuits and its Cryptographic Applications","version":1},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-08-16T11:44:10.158342Z"},"links":{"citing_paper":"/paper/2504.15343"},"observation_digest":"sha256:d378dd80a48c4bd9ca4e94c391d27c83b8cd222473080411a49eb41fe1a782ea","observation_id":"66472207-4e7b-400f-a847-64586c0155af","resolution":{"observed_at":"2026-08-16T11:44:10.838762Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-16T11:44:10.827738Z","title":"Anti-concentration for the unitary haar measure and applications to random quantum circuits, 2024","venue":null,"work_id":"709ce83d-fa65-491e-af17-42e8d653abbb","year":2024},"citing_paper":{"arxiv_id":"2504.15343","last_updated":"2025-04-21T18:00:03Z","snapshot_observed_at":"2026-08-16T11:26:34.790545Z","submitted_at":"2025-04-21T18:00:03Z","title":"The Hardness of Learning Quantum Circuits and its Cryptographic Applications","version":1},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-08-16T11:44:10.161036Z"},"links":{"citing_paper":"/paper/2504.15343"},"observation_digest":"sha256:1dc738335b6564b02b3e18b476bd32d41b563e7a9cac17f2f249b41547206ef7","observation_id":"70545272-16b6-4e4c-ae99-7dc012389d0c","resolution":{"observed_at":"2026-08-16T11:44:10.830616Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-16T11:44:10.819415Z","title":"Module- L attice-based K ey- E ncapsulation M echanism S tandard","venue":null,"work_id":"a3377890-c43a-4e4a-802d-4af3dc5f46cc","year":2023},"citing_paper":{"arxiv_id":"2504.15343","last_updated":"2025-04-21T18:00:03Z","snapshot_observed_at":"2026-08-16T11:26:34.790545Z","submitted_at":"2025-04-21T18:00:03Z","title":"The Hardness of Learning Quantum Circuits and its Cryptographic Applications","version":1},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-08-16T11:44:10.163869Z"},"links":{"citing_paper":"/paper/2504.15343"},"observation_digest":"sha256:d54b025d99b9458b4713767cde3521ab1474bd124f3c43d668e93c907914c2d1","observation_id":"9b897b4a-b60a-438a-a698-d7fb504ee224","resolution":{"observed_at":"2026-08-16T11:44:10.822636Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-16T11:44:10.811276Z","title":"Foundations of C ryptography: V olume 2, B asic A pplications , volume 2","venue":null,"work_id":"51cbe129-9fe2-4ef5-9311-8aea5021233f","year":2001},"citing_paper":{"arxiv_id":"2504.15343","last_updated":"2025-04-21T18:00:03Z","snapshot_observed_at":"2026-08-16T11:26:34.790545Z","submitted_at":"2025-04-21T18:00:03Z","title":"The Hardness of Learning Quantum Circuits and its Cryptographic Applications","version":1},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-08-16T11:44:10.166690Z"},"links":{"citing_paper":"/paper/2504.15343"},"observation_digest":"sha256:07c3d1bed87e6b47984c5a7b16d6991d4313dc10880466574d6217df606d86ea","observation_id":"7fe2251d-33b8-49f9-87c3-7a1ed395b3ea","resolution":{"observed_at":"2026-08-16T11:44:10.814286Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2410.04373","last_updated":"2024-10-06T06:25:36Z","snapshot_observed_at":"2026-08-16T13:12:13.839984Z","submitted_at":"2024-10-06T06:25:36Z","title":"Computational Complexity of Learning Efficiently Generatable Pure States","version":1},"cited_work":{"arxiv_id":"2410.04373","doi":null,"metadata_source":"pith","pith_arxiv_id":"2410.04373","snapshot_observed_at":"2026-08-16T11:44:10.384117Z","title":"Computational Complexity of Learning Efficiently Generatable Pure States","venue":"quant-ph","work_id":"1ae21a33-6a86-4b86-a988-44baeacab3fa","year":2024},"citing_paper":{"arxiv_id":"2504.15343","last_updated":"2025-04-21T18:00:03Z","snapshot_observed_at":"2026-08-16T11:26:34.790545Z","submitted_at":"2025-04-21T18:00:03Z","title":"The Hardness of Learning Quantum Circuits and its Cryptographic Applications","version":1},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-08-16T11:44:10.169668Z"},"links":{"cited_paper":"/paper/2410.04373","citing_paper":"/paper/2504.15343"},"observation_digest":"sha256:d50ad632e5934eb0d4c0ceabdd1cf229f6bf153237e5bf55cf92d7ebf3ec5940","observation_id":"bcb73a07-0e3a-4d4b-b12f-6f90b4f5c915","resolution":{"observed_at":"2026-08-16T11:44:10.387795Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-16T11:44:10.803247Z","title":"A pseudorandom generator from any one-way function","venue":null,"work_id":"23b4884f-ecb8-40ad-8113-2800acac1cad","year":1999},"citing_paper":{"arxiv_id":"2504.15343","last_updated":"2025-04-21T18:00:03Z","snapshot_observed_at":"2026-08-16T11:26:34.790545Z","submitted_at":"2025-04-21T18:00:03Z","title":"The Hardness of Learning Quantum Circuits and its Cryptographic Applications","version":1},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-08-16T11:44:10.172741Z"},"links":{"citing_paper":"/paper/2504.15343"},"observation_digest":"sha256:eb11891d5ac73f4b9f0dab83ca6df66ebfba6c90a5969150dc855f13f9ffb978","observation_id":"651bd2c2-224e-459c-b3f6-5c6c7ed45478","resolution":{"observed_at":"2026-08-16T11:44:10.806176Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-16T11:44:10.794496Z","title":"Predicting many properties of a quantum system from very few measurements","venue":null,"work_id":"c6d24ed8-05de-4134-aed8-ca017fbfeacb","year":2020},"citing_paper":{"arxiv_id":"2504.15343","last_updated":"2025-04-21T18:00:03Z","snapshot_observed_at":"2026-08-16T11:26:34.790545Z","submitted_at":"2025-04-21T18:00:03Z","title":"The Hardness of Learning Quantum Circuits and its Cryptographic Applications","version":1},"reference_index":36,"source":"arxiv_source","source_observed_at":"2026-08-16T11:44:10.176542Z"},"links":{"citing_paper":"/paper/2504.15343"},"observation_digest":"sha256:070b22d57804dd1cd446b82c7d058b9d2f120ae23209982784d948a0acfc4544","observation_id":"f992f828-b1f8-44ba-ae14-cbdbec209b63","resolution":{"observed_at":"2026-08-16T11:44:10.797716Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-16T11:44:10.785768Z","title":null,"venue":null,"work_id":"c2054a1c-26cf-446c-a2b8-bde4478bbb68","year":2023},"citing_paper":{"arxiv_id":"2504.15343","last_updated":"2025-04-21T18:00:03Z","snapshot_observed_at":"2026-08-16T11:26:34.790545Z","submitted_at":"2025-04-21T18:00:03Z","title":"The Hardness of Learning Quantum Circuits and its Cryptographic Applications","version":1},"reference_index":37,"source":"arxiv_source","source_observed_at":"2026-08-16T11:44:10.179745Z"},"links":{"citing_paper":"/paper/2504.15343"},"observation_digest":"sha256:fa43ece1b945e3b2c78af1b60226f66b27b8fabf37000c1b95098c9efa5b83f3","observation_id":"4a227025-adec-4fd8-8824-331d39155503","resolution":{"observed_at":"2026-08-16T11:44:10.789171Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-16T11:44:10.777270Z","title":"Quantum cryptography and meta-complexity, 2024","venue":null,"work_id":"85547dad-1500-40bf-89ee-05890e6252f5","year":2024},"citing_paper":{"arxiv_id":"2504.15343","last_updated":"2025-04-21T18:00:03Z","snapshot_observed_at":"2026-08-16T11:26:34.790545Z","submitted_at":"2025-04-21T18:00:03Z","title":"The Hardness of Learning Quantum Circuits and its Cryptographic Applications","version":1},"reference_index":38,"source":"arxiv_source","source_observed_at":"2026-08-16T11:44:10.183030Z"},"links":{"citing_paper":"/paper/2504.15343"},"observation_digest":"sha256:fdec7fe1f2bc2e622510fb58350789ec476f09763e38f8db8a84b6427114d1b9","observation_id":"03eaecf9-3286-4d17-ae21-fd7d472e92a0","resolution":{"observed_at":"2026-08-16T11:44:10.780371Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-16T11:44:10.768736Z","title":"From the hardness of detecting superpositions to cryptography: Q uantum public key encryption and commitments","venue":null,"work_id":"0aaf6520-edb0-49cf-b8ce-b4a322b54599","year":2023},"citing_paper":{"arxiv_id":"2504.15343","last_updated":"2025-04-21T18:00:03Z","snapshot_observed_at":"2026-08-16T11:26:34.790545Z","submitted_at":"2025-04-21T18:00:03Z","title":"The Hardness of Learning Quantum Circuits and its Cryptographic Applications","version":1},"reference_index":39,"source":"arxiv_source","source_observed_at":"2026-08-16T11:44:10.186073Z"},"links":{"citing_paper":"/paper/2504.15343"},"observation_digest":"sha256:e5c5bd8221f6e04a3e46a70831e3c5317fe2ed062f19dba5584a47353af6d03d","observation_id":"4872f16c-56e2-4e9b-bda5-4ecf7df52738","resolution":{"observed_at":"2026-08-16T11:44:10.771813Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-16T11:44:10.760502Z","title":"Certifying almost all quantum states with few single-qubit measurements, 2024","venue":null,"work_id":"c7156400-4f3e-42eb-a9c6-01e91aba1fff","year":2024},"citing_paper":{"arxiv_id":"2504.15343","last_updated":"2025-04-21T18:00:03Z","snapshot_observed_at":"2026-08-16T11:26:34.790545Z","submitted_at":"2025-04-21T18:00:03Z","title":"The Hardness of Learning Quantum Circuits and its Cryptographic Applications","version":1},"reference_index":40,"source":"arxiv_source","source_observed_at":"2026-08-16T11:44:10.188795Z"},"links":{"citing_paper":"/paper/2504.15343"},"observation_digest":"sha256:349dc29cb7cf31c7d50eda2730c928fc98f96c197bb2ae91332200db784597ca","observation_id":"af44e9b2-aee7-4c84-b194-4d98278f2a21","resolution":{"observed_at":"2026-08-16T11:44:10.763524Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-16T11:44:10.751602Z","title":"Constructive P roofs of C oncentration B ounds","venue":null,"work_id":"2d76a655-ebff-46e8-a877-8feb3babd22d","year":2010},"citing_paper":{"arxiv_id":"2504.15343","last_updated":"2025-04-21T18:00:03Z","snapshot_observed_at":"2026-08-16T11:26:34.790545Z","submitted_at":"2025-04-21T18:00:03Z","title":"The Hardness of Learning Quantum Circuits and its Cryptographic Applications","version":1},"reference_index":41,"source":"arxiv_source","source_observed_at":"2026-08-16T11:44:10.191680Z"},"links":{"citing_paper":"/paper/2504.15343"},"observation_digest":"sha256:3b7ae6adac6a4f04323376361d2bc2f17e5be569ca9ae439e0e490b22e7590be","observation_id":"03acc4ee-4df1-4c89-bf85-92c286f81922","resolution":{"observed_at":"2026-08-16T11:44:10.755000Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-16T11:44:10.743144Z","title":"Impagliazzo and L.A","venue":null,"work_id":"123f950c-d9ea-4a74-bb37-3a70b699410d","year":1990},"citing_paper":{"arxiv_id":"2504.15343","last_updated":"2025-04-21T18:00:03Z","snapshot_observed_at":"2026-08-16T11:26:34.790545Z","submitted_at":"2025-04-21T18:00:03Z","title":"The Hardness of Learning Quantum Circuits and its Cryptographic Applications","version":1},"reference_index":42,"source":"arxiv_source","source_observed_at":"2026-08-16T11:44:10.194482Z"},"links":{"citing_paper":"/paper/2504.15343"},"observation_digest":"sha256:11ab63d87101c54ed711d09f54de53a59d62fc61320af5a3618162a8c518686a","observation_id":"6d4bfd19-b54d-4441-b15d-520b06199e1a","resolution":{"observed_at":"2026-08-16T11:44:10.745979Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-16T11:44:10.734212Z","title":"A personal view of average-case complexity","venue":null,"work_id":"31af2b89-5e05-4d32-8c6a-7b58d66f7691","year":1995},"citing_paper":{"arxiv_id":"2504.15343","last_updated":"2025-04-21T18:00:03Z","snapshot_observed_at":"2026-08-16T11:26:34.790545Z","submitted_at":"2025-04-21T18:00:03Z","title":"The Hardness of Learning Quantum Circuits and its Cryptographic Applications","version":1},"reference_index":43,"source":"arxiv_source","source_observed_at":"2026-08-16T11:44:10.197359Z"},"links":{"citing_paper":"/paper/2504.15343"},"observation_digest":"sha256:5d5839829ba3ee644b67dfce865960b50b3b2e6e7273b2f1bc29c80152a65936","observation_id":"f36486a7-f065-44d8-8f69-36665b082aff","resolution":{"observed_at":"2026-08-16T11:44:10.737369Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-16T11:44:10.725745Z","title":"Pseudorandom quantum states","venue":null,"work_id":"d4ae20b1-9dac-4065-8399-5bed42b33cf5","year":2018},"citing_paper":{"arxiv_id":"2504.15343","last_updated":"2025-04-21T18:00:03Z","snapshot_observed_at":"2026-08-16T11:26:34.790545Z","submitted_at":"2025-04-21T18:00:03Z","title":"The Hardness of Learning Quantum Circuits and its Cryptographic Applications","version":1},"reference_index":44,"source":"arxiv_source","source_observed_at":"2026-08-16T11:44:10.200400Z"},"links":{"citing_paper":"/paper/2504.15343"},"observation_digest":"sha256:ff7cbe833b8947c737aa1522ac928ee380d1d95132e6fbd553c9b9ead616b8f5","observation_id":"12f26d28-be72-45c5-bce0-93b18753593e","resolution":{"observed_at":"2026-08-16T11:44:10.728731Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-16T11:44:10.717535Z","title":"Kim, and Daniel Ranard","venue":null,"work_id":"593c7b62-08b5-4bca-9ba7-37d059ead2cf","year":2024},"citing_paper":{"arxiv_id":"2504.15343","last_updated":"2025-04-21T18:00:03Z","snapshot_observed_at":"2026-08-16T11:26:34.790545Z","submitted_at":"2025-04-21T18:00:03Z","title":"The Hardness of Learning Quantum Circuits and its Cryptographic Applications","version":1},"reference_index":45,"source":"arxiv_source","source_observed_at":"2026-08-16T11:44:10.203179Z"},"links":{"citing_paper":"/paper/2504.15343"},"observation_digest":"sha256:1910e6c3d29ecf1ed75a033a02371d1b3529f48ee72d85af79626cd4ee3d9165","observation_id":"2f9f192d-a798-46dd-992b-e4f8cda5e2e8","resolution":{"observed_at":"2026-08-16T11:44:10.720521Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-16T11:44:10.709278Z","title":"Quantum cryptography in algorithmica","venue":null,"work_id":"3d80eff9-84fd-43f2-a4f4-ebf7f02fd828","year":2023},"citing_paper":{"arxiv_id":"2504.15343","last_updated":"2025-04-21T18:00:03Z","snapshot_observed_at":"2026-08-16T11:26:34.790545Z","submitted_at":"2025-04-21T18:00:03Z","title":"The Hardness of Learning Quantum Circuits and its Cryptographic Applications","version":1},"reference_index":46,"source":"arxiv_source","source_observed_at":"2026-08-16T11:44:10.206175Z"},"links":{"citing_paper":"/paper/2504.15343"},"observation_digest":"sha256:fd52b5742cb5822c717c152e12b4a77c9088e5d6126675fd6d1dac28ef36fca7","observation_id":"188f0082-d728-4117-ba5c-64722377e8f0","resolution":{"observed_at":"2026-08-16T11:44:10.712319Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-16T11:44:10.209136Z","title":"Quantum-computable one-way functions without one-way functions, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2504.15343","last_updated":"2025-04-21T18:00:03Z","snapshot_observed_at":"2026-08-16T11:26:34.790545Z","submitted_at":"2025-04-21T18:00:03Z","title":"The Hardness of Learning Quantum Circuits and its Cryptographic Applications","version":1},"reference_index":47,"source":"arxiv_source","source_observed_at":"2026-08-16T11:44:10.209136Z"},"links":{"citing_paper":"/paper/2504.15343"},"observation_digest":"sha256:1458317feb41f316ba0620fed3c36324c41945488292aaaad27d49f3a8c695c5","observation_id":"b7f34032-fa16-4cd3-801c-0535ed028b03","resolution":{"observed_at":"2026-08-16T11:44:10.209136Z","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-16T11:44:10.696571Z","title":"Quantum pseudorandomness and classical complexity","venue":null,"work_id":"b1f8a202-fe48-4733-aa74-1fbeb8aa791d","year":2021},"citing_paper":{"arxiv_id":"2504.15343","last_updated":"2025-04-21T18:00:03Z","snapshot_observed_at":"2026-08-16T11:26:34.790545Z","submitted_at":"2025-04-21T18:00:03Z","title":"The Hardness of Learning Quantum Circuits and its Cryptographic Applications","version":1},"reference_index":48,"source":"arxiv_source","source_observed_at":"2026-08-16T11:44:10.212398Z"},"links":{"citing_paper":"/paper/2504.15343"},"observation_digest":"sha256:9d34b52c06a7649d219f7034d6d05e300d96711f51de8717e387b54bc963dfd0","observation_id":"f918be88-535e-4888-984e-e1bd8bfea7d5","resolution":{"observed_at":"2026-08-16T11:44:10.699474Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-16T11:44:10.687977Z","title":"Klivans and Alexander A","venue":null,"work_id":"0779f1c5-8dc9-45dc-aad4-48dddada591d","year":2006},"citing_paper":{"arxiv_id":"2504.15343","last_updated":"2025-04-21T18:00:03Z","snapshot_observed_at":"2026-08-16T11:26:34.790545Z","submitted_at":"2025-04-21T18:00:03Z","title":"The Hardness of Learning Quantum Circuits and its Cryptographic Applications","version":1},"reference_index":49,"source":"arxiv_source","source_observed_at":"2026-08-16T11:44:10.215387Z"},"links":{"citing_paper":"/paper/2504.15343"},"observation_digest":"sha256:15b4654c8c76478e8052265c6d96258cf6967e8d85d3e5709d7752f44161fbd8","observation_id":"c3f796a9-214c-4812-bbf5-d4307ff38329","resolution":{"observed_at":"2026-08-16T11:44:10.691162Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-16T11:44:10.679624Z","title":"Commitments from quantum one-wayness","venue":null,"work_id":"ff0eb75b-f406-4ab2-a898-8077a849f839","year":2024},"citing_paper":{"arxiv_id":"2504.15343","last_updated":"2025-04-21T18:00:03Z","snapshot_observed_at":"2026-08-16T11:26:34.790545Z","submitted_at":"2025-04-21T18:00:03Z","title":"The Hardness of Learning Quantum Circuits and its Cryptographic Applications","version":1},"reference_index":50,"source":"arxiv_source","source_observed_at":"2026-08-16T11:44:10.218189Z"},"links":{"citing_paper":"/paper/2504.15343"},"observation_digest":"sha256:7d09115a51f2786a412f5e5f94dd07652d5c34632d3def4f32cfae52a73d5e5a","observation_id":"eb7ac024-0782-4635-a8b1-b9600f72c451","resolution":{"observed_at":"2026-08-16T11:44:10.682733Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2409.15248","last_updated":"2024-10-10T17:49:09Z","snapshot_observed_at":"2026-08-16T13:16:09.770694Z","submitted_at":"2024-09-23T17:45:33Z","title":"Founding Quantum Cryptography on Quantum Advantage, or, Towards Cryptography from $\\mathsf{\\#P}$-Hardness","version":2},"cited_work":{"arxiv_id":"2409.15248","doi":null,"metadata_source":"pith","pith_arxiv_id":"2409.15248","snapshot_observed_at":"2026-08-16T11:44:10.370845Z","title":"Founding Quantum Cryptography on Quantum Advantage, or, Towards Cryptography from $\\mathsf{\\#P}$-Hardness","venue":"quant-ph","work_id":"1761eb04-dc6d-4114-a9e8-37e0ff02a38a","year":2024},"citing_paper":{"arxiv_id":"2504.15343","last_updated":"2025-04-21T18:00:03Z","snapshot_observed_at":"2026-08-16T11:26:34.790545Z","submitted_at":"2025-04-21T18:00:03Z","title":"The Hardness of Learning Quantum Circuits and its Cryptographic Applications","version":1},"reference_index":51,"source":"arxiv_source","source_observed_at":"2026-08-16T11:44:10.221007Z"},"links":{"cited_paper":"/paper/2409.15248","citing_paper":"/paper/2504.15343"},"observation_digest":"sha256:2823088f343d8af8414318eb2fa17e36405315959d2fdca440d0a44efe31f473","observation_id":"3dc18fb4-0dc1-4028-8e3d-9485ca7a9efe","resolution":{"observed_at":"2026-08-16T11:44:10.374454Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-16T11:44:10.224356Z","title":"Cryptographic limitations on learning boolean formulae and finite automata","venue":null,"work_id":null,"year":1994},"citing_paper":{"arxiv_id":"2504.15343","last_updated":"2025-04-21T18:00:03Z","snapshot_observed_at":"2026-08-16T11:26:34.790545Z","submitted_at":"2025-04-21T18:00:03Z","title":"The Hardness of Learning Quantum Circuits and its Cryptographic Applications","version":1},"reference_index":52,"source":"arxiv_source","source_observed_at":"2026-08-16T11:44:10.224356Z"},"links":{"citing_paper":"/paper/2504.15343"},"observation_digest":"sha256:09a9a2d6b2e200dd7b1a1ac133588b5996d9b689cdac119b70fc6ad3853a4bd0","observation_id":"22a232c1-662c-4d20-8f92-7cbb0d347e01","resolution":{"observed_at":"2026-08-16T11:44:10.224356Z","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-16T11:44:10.227228Z","title":"Parallelization, amplification, and exponential time simulation of quantum interactive proof systems","venue":null,"work_id":null,"year":2000},"citing_paper":{"arxiv_id":"2504.15343","last_updated":"2025-04-21T18:00:03Z","snapshot_observed_at":"2026-08-16T11:26:34.790545Z","submitted_at":"2025-04-21T18:00:03Z","title":"The Hardness of Learning Quantum Circuits and its Cryptographic Applications","version":1},"reference_index":53,"source":"arxiv_source","source_observed_at":"2026-08-16T11:44:10.227228Z"},"links":{"citing_paper":"/paper/2504.15343"},"observation_digest":"sha256:b07ea8e5ec5df0947dd91746110ad3d3c0ae66933dea62a2342ae4db5473c375","observation_id":"44cd6ee6-4de9-4393-ac6a-0d0a0892543a","resolution":{"observed_at":"2026-08-16T11:44:10.227228Z","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-16T11:44:10.662051Z","title":"Constructing digital signatures from a one-way function","venue":null,"work_id":"18ee86e2-01e9-48b6-8053-4ceeae6139ab","year":1979},"citing_paper":{"arxiv_id":"2504.15343","last_updated":"2025-04-21T18:00:03Z","snapshot_observed_at":"2026-08-16T11:26:34.790545Z","submitted_at":"2025-04-21T18:00:03Z","title":"The Hardness of Learning Quantum Circuits and its Cryptographic Applications","version":1},"reference_index":54,"source":"arxiv_source","source_observed_at":"2026-08-16T11:44:10.230070Z"},"links":{"citing_paper":"/paper/2504.15343"},"observation_digest":"sha256:b18c864a67d1d2c73975393e94111991279d59d8afe415bd91efdc6384ab6b24","observation_id":"bd33c642-ef03-4dd9-a7e6-7a73906fe83d","resolution":{"observed_at":"2026-08-16T11:44:10.665001Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2410.23618","last_updated":"2024-10-31T04:12:49Z","snapshot_observed_at":"2026-08-16T19:39:29.712917Z","submitted_at":"2024-10-31T04:12:49Z","title":"Learning quantum states prepared by shallow circuits in polynomial time","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2410.23618","snapshot_observed_at":"2026-08-16T11:44:10.232990Z","title":"Learning quantum states prepared by shallow circuits in polynomial time","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2504.15343","last_updated":"2025-04-21T18:00:03Z","snapshot_observed_at":"2026-08-16T11:26:34.790545Z","submitted_at":"2025-04-21T18:00:03Z","title":"The Hardness of Learning Quantum Circuits and its Cryptographic Applications","version":1},"reference_index":55,"source":"arxiv_source","source_observed_at":"2026-08-16T11:44:10.232990Z"},"links":{"cited_paper":"/paper/2410.23618","citing_paper":"/paper/2504.15343"},"observation_digest":"sha256:10ef6d15868130ae84273880947496e7d4798425028bc5fe63dd0a4832c1de0b","observation_id":"78dbf0ed-f90e-4ee6-a6b4-c0b9f4b818c8","resolution":{"observed_at":"2026-08-16T11:44:10.232990Z","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-16T11:44:10.653468Z","title":"Constant depth circuits, F ourier transform, and learnability","venue":null,"work_id":"fa18df04-76dc-4053-8aa8-a9cc8822f0f3","year":1993},"citing_paper":{"arxiv_id":"2504.15343","last_updated":"2025-04-21T18:00:03Z","snapshot_observed_at":"2026-08-16T11:26:34.790545Z","submitted_at":"2025-04-21T18:00:03Z","title":"The Hardness of Learning Quantum Circuits and its Cryptographic Applications","version":1},"reference_index":56,"source":"arxiv_source","source_observed_at":"2026-08-16T11:44:10.236198Z"},"links":{"citing_paper":"/paper/2504.15343"},"observation_digest":"sha256:a7d04ef9597bfeb8644efa0cb23b285787b5bb427f15ffb62ded15dd40d9d2b8","observation_id":"2675bf73-420e-4a45-82cb-e6e68e63b3d3","resolution":{"observed_at":"2026-08-16T11:44:10.656696Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-16T11:44:10.645447Z","title":"A one-query lower bound for unitary synthesis and breaking quantum cryptography","venue":null,"work_id":"9651e182-d8a0-4e92-9bc3-331e961fa0d6","year":2024},"citing_paper":{"arxiv_id":"2504.15343","last_updated":"2025-04-21T18:00:03Z","snapshot_observed_at":"2026-08-16T11:26:34.790545Z","submitted_at":"2025-04-21T18:00:03Z","title":"The Hardness of Learning Quantum Circuits and its Cryptographic Applications","version":1},"reference_index":57,"source":"arxiv_source","source_observed_at":"2026-08-16T11:44:10.239199Z"},"links":{"citing_paper":"/paper/2504.15343"},"observation_digest":"sha256:eafeb211eb3cf0709244b6d0754dc87ec08e88f6ac1a1909024064277b8cc1d3","observation_id":"c4407a4a-5f30-41a8-9c25-675af0b5b695","resolution":{"observed_at":"2026-08-16T11:44:10.648408Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-16T11:44:10.637515Z","title":"On ideal lattices and learning with errors over rings","venue":null,"work_id":"b8da30c0-b332-43bd-b71b-6280f692689f","year":2010},"citing_paper":{"arxiv_id":"2504.15343","last_updated":"2025-04-21T18:00:03Z","snapshot_observed_at":"2026-08-16T11:26:34.790545Z","submitted_at":"2025-04-21T18:00:03Z","title":"The Hardness of Learning Quantum Circuits and its Cryptographic Applications","version":1},"reference_index":58,"source":"arxiv_source","source_observed_at":"2026-08-16T11:44:10.242117Z"},"links":{"citing_paper":"/paper/2504.15343"},"observation_digest":"sha256:caf18332a6f16d9db6b5254f5464fd4bda55ad3d978e2c7778a255c7a68013ab","observation_id":"71e781ab-6575-44e7-9031-f6b86ddbf777","resolution":{"observed_at":"2026-08-16T11:44:10.640588Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-16T11:44:10.628527Z","title":"Noise-induced shallow circuits and absence of barren plateaus, 2024","venue":null,"work_id":"ac6b5228-d70f-4fc6-b0cc-9bd9af040ca7","year":2024},"citing_paper":{"arxiv_id":"2504.15343","last_updated":"2025-04-21T18:00:03Z","snapshot_observed_at":"2026-08-16T11:26:34.790545Z","submitted_at":"2025-04-21T18:00:03Z","title":"The Hardness of Learning Quantum Circuits and its Cryptographic Applications","version":1},"reference_index":59,"source":"arxiv_source","source_observed_at":"2026-08-16T11:44:10.245065Z"},"links":{"citing_paper":"/paper/2504.15343"},"observation_digest":"sha256:48e5124c72051bd80554ef14b610779b0a7892d5a691bcdbbc703d3f4215220f","observation_id":"6245ea4a-2402-42c2-8f02-500debf6aff1","resolution":{"observed_at":"2026-08-16T11:44:10.631879Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-16T11:44:10.619770Z","title":"Cryptographic characterization of quantum advantage, 2024","venue":null,"work_id":"321fc7ae-b4d9-44f7-af89-f7f198e18531","year":2024},"citing_paper":{"arxiv_id":"2504.15343","last_updated":"2025-04-21T18:00:03Z","snapshot_observed_at":"2026-08-16T11:26:34.790545Z","submitted_at":"2025-04-21T18:00:03Z","title":"The Hardness of Learning Quantum Circuits and its Cryptographic Applications","version":1},"reference_index":60,"source":"arxiv_source","source_observed_at":"2026-08-16T11:44:10.248052Z"},"links":{"citing_paper":"/paper/2504.15343"},"observation_digest":"sha256:f2aa6d2f1487380121e4167132c081c26c1341c778d6f0d3a998aea2a6e16df5","observation_id":"f645e229-29de-4f7d-a727-d4242833241e","resolution":{"observed_at":"2026-08-16T11:44:10.622961Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-16T11:44:10.611119Z","title":"Morvan, B","venue":null,"work_id":"a1292c62-863c-4209-9236-30797dc73b26","year":2023},"citing_paper":{"arxiv_id":"2504.15343","last_updated":"2025-04-21T18:00:03Z","snapshot_observed_at":"2026-08-16T11:26:34.790545Z","submitted_at":"2025-04-21T18:00:03Z","title":"The Hardness of Learning Quantum Circuits and its Cryptographic Applications","version":1},"reference_index":61,"source":"arxiv_source","source_observed_at":"2026-08-16T11:44:10.250851Z"},"links":{"citing_paper":"/paper/2504.15343"},"observation_digest":"sha256:b7e0065bb09675e5deeb2b9ee54afcf403f4f826bbddf298cbec5c0b58bbe323","observation_id":"fa5f8263-87ab-44c7-aa3b-0ae4b64301f9","resolution":{"observed_at":"2026-08-16T11:44:10.613991Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2210.03394","last_updated":"2024-05-08T02:31:38Z","snapshot_observed_at":"2026-08-16T16:26:11.611200Z","submitted_at":"2022-10-07T08:21:21Z","title":"One-Wayness in Quantum Cryptography","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2210.03394","snapshot_observed_at":"2026-08-16T11:44:10.253593Z","title":"One-wayness in quantum cryptography","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2504.15343","last_updated":"2025-04-21T18:00:03Z","snapshot_observed_at":"2026-08-16T11:26:34.790545Z","submitted_at":"2025-04-21T18:00:03Z","title":"The Hardness of Learning Quantum Circuits and its Cryptographic Applications","version":1},"reference_index":62,"source":"arxiv_source","source_observed_at":"2026-08-16T11:44:10.253593Z"},"links":{"cited_paper":"/paper/2210.03394","citing_paper":"/paper/2504.15343"},"observation_digest":"sha256:0a23eff63b240cfd40cc9ec81e0062366557e6a01319fda82adc72c5d01fa0c1","observation_id":"3c894382-4058-4da3-99e6-2bc6f5c0ea9f","resolution":{"observed_at":"2026-08-16T11:44:10.253593Z","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-16T11:44:10.602458Z","title":"Quantum commitments and signatures without one-way functions","venue":null,"work_id":"0aa5b70a-73be-4539-93ba-d08fb0ee3147","year":2022},"citing_paper":{"arxiv_id":"2504.15343","last_updated":"2025-04-21T18:00:03Z","snapshot_observed_at":"2026-08-16T11:26:34.790545Z","submitted_at":"2025-04-21T18:00:03Z","title":"The Hardness of Learning Quantum Circuits and its Cryptographic Applications","version":1},"reference_index":63,"source":"arxiv_source","source_observed_at":"2026-08-16T11:44:10.256728Z"},"links":{"citing_paper":"/paper/2504.15343"},"observation_digest":"sha256:30c06ae68e727627103854f063e8b77a4a797a5db8267ea6bd9b35de577bbec1","observation_id":"dcde096e-8afb-4755-b8eb-b3a3118906a9","resolution":{"observed_at":"2026-08-16T11:44:10.605603Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-16T11:44:10.594405Z","title":"FIPS 204 : M odule- L attice- B ased D igital S ignature S tandard, 2024","venue":null,"work_id":"3b31229d-b7bb-48db-9f0b-3d5128b34cc1","year":2024},"citing_paper":{"arxiv_id":"2504.15343","last_updated":"2025-04-21T18:00:03Z","snapshot_observed_at":"2026-08-16T11:26:34.790545Z","submitted_at":"2025-04-21T18:00:03Z","title":"The Hardness of Learning Quantum Circuits and its Cryptographic Applications","version":1},"reference_index":64,"source":"arxiv_source","source_observed_at":"2026-08-16T11:44:10.259399Z"},"links":{"citing_paper":"/paper/2504.15343"},"observation_digest":"sha256:335d6f9db0529c55b621cbcce4ce2b711d533620740d1246fb760ad0dff8ea77","observation_id":"25507b54-3ff8-4d30-89ac-9a1c86d9449e","resolution":{"observed_at":"2026-08-16T11:44:10.597415Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-16T11:44:10.586662Z","title":"Hardness vs randomness","venue":null,"work_id":"30a8dc41-d83c-4da8-a84f-20bd68fcb3f5","year":1994},"citing_paper":{"arxiv_id":"2504.15343","last_updated":"2025-04-21T18:00:03Z","snapshot_observed_at":"2026-08-16T11:26:34.790545Z","submitted_at":"2025-04-21T18:00:03Z","title":"The Hardness of Learning Quantum Circuits and its Cryptographic Applications","version":1},"reference_index":65,"source":"arxiv_source","source_observed_at":"2026-08-16T11:44:10.262339Z"},"links":{"citing_paper":"/paper/2504.15343"},"observation_digest":"sha256:7057ec323fabac53e7794217d76cf2579d12b5d5511068c08517931fe1066a8c","observation_id":"b3cde67f-92a1-4145-b13b-108317619c3d","resolution":{"observed_at":"2026-08-16T11:44:10.589453Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-16T11:44:10.577196Z","title":"A computational separation between quantum no-cloning and no-telegraphing","venue":null,"work_id":"77f8fe0a-56ae-4388-a855-75828e042302","year":2024},"citing_paper":{"arxiv_id":"2504.15343","last_updated":"2025-04-21T18:00:03Z","snapshot_observed_at":"2026-08-16T11:26:34.790545Z","submitted_at":"2025-04-21T18:00:03Z","title":"The Hardness of Learning Quantum Circuits and its Cryptographic Applications","version":1},"reference_index":66,"source":"arxiv_source","source_observed_at":"2026-08-16T11:44:10.265212Z"},"links":{"citing_paper":"/paper/2504.15343"},"observation_digest":"sha256:53b77ee966e688f2fe58d4946f5645bda18cba129bb7c9feb5b26d58d201d1a8","observation_id":"76cc251c-deec-41a2-b63f-c3eedbce4699","resolution":{"observed_at":"2026-08-16T11:44:10.580407Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-16T11:44:10.568476Z","title":"On classical simulation algorithms for noisy boson sampling, 2023","venue":null,"work_id":"b5df98f8-d4f4-4675-81db-bfbd5793cdac","year":2023},"citing_paper":{"arxiv_id":"2504.15343","last_updated":"2025-04-21T18:00:03Z","snapshot_observed_at":"2026-08-16T11:26:34.790545Z","submitted_at":"2025-04-21T18:00:03Z","title":"The Hardness of Learning Quantum Circuits and its Cryptographic Applications","version":1},"reference_index":67,"source":"arxiv_source","source_observed_at":"2026-08-16T11:44:10.267978Z"},"links":{"citing_paper":"/paper/2504.15343"},"observation_digest":"sha256:418c89de189481671d515129fc29007a8e885f2cf7180b7359e83426e4a9a9a3","observation_id":"e0d99246-d9cf-434a-bc56-a7e2ba03f7bd","resolution":{"observed_at":"2026-08-16T11:44:10.571749Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-16T11:44:10.558707Z","title":"Oliveira and Rahul Santhanam","venue":null,"work_id":"9f383e50-4ee5-462b-aafc-79d924a00d13","year":2016},"citing_paper":{"arxiv_id":"2504.15343","last_updated":"2025-04-21T18:00:03Z","snapshot_observed_at":"2026-08-16T11:26:34.790545Z","submitted_at":"2025-04-21T18:00:03Z","title":"The Hardness of Learning Quantum Circuits and its Cryptographic Applications","version":1},"reference_index":68,"source":"arxiv_source","source_observed_at":"2026-08-16T11:44:10.271016Z"},"links":{"citing_paper":"/paper/2504.15343"},"observation_digest":"sha256:50bfdccf53ec1b587898fe121761ee4df7845e8fd40d91bfb4b280ce6cbdc092","observation_id":"240a8424-ab15-410b-9beb-4e5c1a023cd7","resolution":{"observed_at":"2026-08-16T11:44:10.562727Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-16T11:44:10.548474Z","title":"The learning stabilizers with noise problem, 2024","venue":null,"work_id":"4aa878e6-c733-4817-8695-8c05d9d8d14a","year":2024},"citing_paper":{"arxiv_id":"2504.15343","last_updated":"2025-04-21T18:00:03Z","snapshot_observed_at":"2026-08-16T11:26:34.790545Z","submitted_at":"2025-04-21T18:00:03Z","title":"The Hardness of Learning Quantum Circuits and its Cryptographic Applications","version":1},"reference_index":69,"source":"arxiv_source","source_observed_at":"2026-08-16T11:44:10.273851Z"},"links":{"citing_paper":"/paper/2504.15343"},"observation_digest":"sha256:76b96ab70b777de97bbe3c894e1da25680cc5800d0493284e188d411d622a184","observation_id":"a9df4df5-0f3d-43f9-99f3-1fb290fc11bd","resolution":{"observed_at":"2026-08-16T11:44:10.551937Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2409.16516","last_updated":"2025-04-11T23:18:12Z","snapshot_observed_at":"2026-08-16T13:15:41.114486Z","submitted_at":"2024-09-25T00:09:42Z","title":"Hard Quantum Extrapolations in Quantum Cryptography","version":3},"cited_work":{"arxiv_id":"2409.16516","doi":null,"metadata_source":"pith","pith_arxiv_id":"2409.16516","snapshot_observed_at":"2026-08-16T11:44:10.338519Z","title":"Hard Quantum Extrapolations in Quantum Cryptography","venue":"quant-ph","work_id":"c108193a-e8bf-46d9-b326-f6330ca8c660","year":2024},"citing_paper":{"arxiv_id":"2504.15343","last_updated":"2025-04-21T18:00:03Z","snapshot_observed_at":"2026-08-16T11:26:34.790545Z","submitted_at":"2025-04-21T18:00:03Z","title":"The Hardness of Learning Quantum Circuits and its Cryptographic Applications","version":1},"reference_index":70,"source":"arxiv_source","source_observed_at":"2026-08-16T11:44:10.277028Z"},"links":{"cited_paper":"/paper/2409.16516","citing_paper":"/paper/2504.15343"},"observation_digest":"sha256:6819d7c055618afb599edcd136408b500f36dcd6fd5d54dbcc89ec41a53e72ba","observation_id":"fa63e681-ca93-488d-9fbc-198009f6b292","resolution":{"observed_at":"2026-08-16T11:44:10.344040Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-16T11:44:10.538595Z","title":"Ryan-Anderson, C","venue":null,"work_id":"aa26f8f9-e48d-4e68-8599-be3f9867227f","year":2023},"citing_paper":{"arxiv_id":"2504.15343","last_updated":"2025-04-21T18:00:03Z","snapshot_observed_at":"2026-08-16T11:26:34.790545Z","submitted_at":"2025-04-21T18:00:03Z","title":"The Hardness of Learning Quantum Circuits and its Cryptographic Applications","version":1},"reference_index":71,"source":"arxiv_source","source_observed_at":"2026-08-16T11:44:10.280055Z"},"links":{"citing_paper":"/paper/2504.15343"},"observation_digest":"sha256:5541c3aa0ef4c6895a79631b00ca83a14ac4b41cb74aab85861e4f75d9d4dbfe","observation_id":"fbb84817-ea8c-41ca-8a6e-a692f10dacec","resolution":{"observed_at":"2026-08-16T11:44:10.542099Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-16T11:44:10.528530Z","title":"On lattices, learning with errors, random linear codes, and cryptography, 2024","venue":null,"work_id":"45b16ff7-ce55-44ef-a2ef-aa02203f8215","year":2024},"citing_paper":{"arxiv_id":"2504.15343","last_updated":"2025-04-21T18:00:03Z","snapshot_observed_at":"2026-08-16T11:26:34.790545Z","submitted_at":"2025-04-21T18:00:03Z","title":"The Hardness of Learning Quantum Circuits and its Cryptographic Applications","version":1},"reference_index":72,"source":"arxiv_source","source_observed_at":"2026-08-16T11:44:10.282953Z"},"links":{"citing_paper":"/paper/2504.15343"},"observation_digest":"sha256:6d62bdfaf0bc6924ef2b4a608bc8c195e1ace3405bd2f007c12c9e2eba5cf21d","observation_id":"fb4c2d0a-00ed-4e7d-9f7a-a6b17407b9af","resolution":{"observed_at":"2026-08-16T11:44:10.532015Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-16T11:44:10.517903Z","title":"Quantum computation with programmable neutral-atom arrays","venue":null,"work_id":"26693ef9-6b9f-46c9-9484-ac526cf46a50","year":2023},"citing_paper":{"arxiv_id":"2504.15343","last_updated":"2025-04-21T18:00:03Z","snapshot_observed_at":"2026-08-16T11:26:34.790545Z","submitted_at":"2025-04-21T18:00:03Z","title":"The Hardness of Learning Quantum Circuits and its Cryptographic Applications","version":1},"reference_index":73,"source":"arxiv_source","source_observed_at":"2026-08-16T11:44:10.285749Z"},"links":{"citing_paper":"/paper/2504.15343"},"observation_digest":"sha256:df32744726482112c9de243a162de427f67ff2e66a4cc324f86e1470149108b5","observation_id":"226759dd-1e9f-4a61-909c-85b49ccbcbb1","resolution":{"observed_at":"2026-08-16T11:44:10.521373Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-16T11:44:10.507629Z","title":null,"venue":null,"work_id":"aba06b33-bb30-46a0-84b4-7cd9a628f449","year":1976},"citing_paper":{"arxiv_id":"2504.15343","last_updated":"2025-04-21T18:00:03Z","snapshot_observed_at":"2026-08-16T11:26:34.790545Z","submitted_at":"2025-04-21T18:00:03Z","title":"The Hardness of Learning Quantum Circuits and its Cryptographic Applications","version":1},"reference_index":74,"source":"arxiv_source","source_observed_at":"2026-08-16T11:44:10.288600Z"},"links":{"citing_paper":"/paper/2504.15343"},"observation_digest":"sha256:30512b521bb685646806dd7ddeb41b2a8ed6cba2fe863a43075bd970d9f9b6f2","observation_id":"0709971a-4d30-4231-a783-797cb65bd43b","resolution":{"observed_at":"2026-08-16T11:44:10.511427Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-16T11:44:10.496777Z","title":"Quantum advantage with gaussian boson sampling in photonic quantum computers","venue":null,"work_id":"deca903b-f82c-4b3f-9419-89aa378a8f7b","year":2022},"citing_paper":{"arxiv_id":"2504.15343","last_updated":"2025-04-21T18:00:03Z","snapshot_observed_at":"2026-08-16T11:26:34.790545Z","submitted_at":"2025-04-21T18:00:03Z","title":"The Hardness of Learning Quantum Circuits and its Cryptographic Applications","version":1},"reference_index":75,"source":"arxiv_source","source_observed_at":"2026-08-16T11:44:10.291674Z"},"links":{"citing_paper":"/paper/2504.15343"},"observation_digest":"sha256:6192d5ebb6fee36faf10667d27d6804285ca31341767e872aeee88e106c1b5f3","observation_id":"f837b7b6-c006-421a-a9e7-343a771289ce","resolution":{"observed_at":"2026-08-16T11:44:10.500379Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-16T11:44:10.487121Z","title":"Optimal cloning of pure states","venue":null,"work_id":"fbb98fcc-b247-4d7a-92f3-8138e593e93b","year":1998},"citing_paper":{"arxiv_id":"2504.15343","last_updated":"2025-04-21T18:00:03Z","snapshot_observed_at":"2026-08-16T11:26:34.790545Z","submitted_at":"2025-04-21T18:00:03Z","title":"The Hardness of Learning Quantum Circuits and its Cryptographic Applications","version":1},"reference_index":76,"source":"arxiv_source","source_observed_at":"2026-08-16T11:44:10.295294Z"},"links":{"citing_paper":"/paper/2504.15343"},"observation_digest":"sha256:e208a9f511e5b3cca2e12c9160ad1b08d059edf07fbdd113d30ee7c5e1c7e3b2","observation_id":"94e7cb49-49f3-42e9-8cce-e5800c7cb472","resolution":{"observed_at":"2026-08-16T11:44:10.490305Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-16T11:44:10.477524Z","title":"General properties of quantum bit commitments","venue":null,"work_id":"05ba6c18-ea65-4419-b0a5-c898c75031f6","year":2022},"citing_paper":{"arxiv_id":"2504.15343","last_updated":"2025-04-21T18:00:03Z","snapshot_observed_at":"2026-08-16T11:26:34.790545Z","submitted_at":"2025-04-21T18:00:03Z","title":"The Hardness of Learning Quantum Circuits and its Cryptographic Applications","version":1},"reference_index":77,"source":"arxiv_source","source_observed_at":"2026-08-16T11:44:10.298173Z"},"links":{"citing_paper":"/paper/2504.15343"},"observation_digest":"sha256:b89c2651130feef7e6d052225f8b287b055d7668a2d61347151800c9f711e350","observation_id":"707b887f-e721-4034-9215-7c213dfdb72b","resolution":{"observed_at":"2026-08-16T11:44:10.480840Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-16T11:44:10.468061Z","title":"Quantum computational advantage via 62-qubit superconducting processor","venue":null,"work_id":"081aec1a-acd7-41dd-baa2-f730c04121a8","year":2021},"citing_paper":{"arxiv_id":"2504.15343","last_updated":"2025-04-21T18:00:03Z","snapshot_observed_at":"2026-08-16T11:26:34.790545Z","submitted_at":"2025-04-21T18:00:03Z","title":"The Hardness of Learning Quantum Circuits and its Cryptographic Applications","version":1},"reference_index":78,"source":"arxiv_source","source_observed_at":"2026-08-16T11:44:10.301298Z"},"links":{"citing_paper":"/paper/2504.15343"},"observation_digest":"sha256:bd2809d574afaa4d88154cf72c1dae539285d7992ce3bc7af44bcb5834c91460","observation_id":"877e81f2-8ca2-4bd8-8edc-c0fda0d3ebe5","resolution":{"observed_at":"2026-08-16T11:44:10.471653Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-16T11:44:10.458876Z","title":"Phase-programmable gaussian boson sampling using stimulated squeezed light","venue":null,"work_id":"805ca97a-ce4f-4377-bf87-a5b68068659b","year":2021},"citing_paper":{"arxiv_id":"2504.15343","last_updated":"2025-04-21T18:00:03Z","snapshot_observed_at":"2026-08-16T11:26:34.790545Z","submitted_at":"2025-04-21T18:00:03Z","title":"The Hardness of Learning Quantum Circuits and its Cryptographic Applications","version":1},"reference_index":79,"source":"arxiv_source","source_observed_at":"2026-08-16T11:44:10.304216Z"},"links":{"citing_paper":"/paper/2504.15343"},"observation_digest":"sha256:c3254bc4eae3c920d0a9e27fddacd0173a9e1e0d37432af824ea0e6a396c25e7","observation_id":"031b8cad-79b4-4f4b-a263-98d8133f2490","resolution":{"observed_at":"2026-08-16T11:44:10.462097Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-16T11:44:10.307187Z","title":"Learning quantum states and unitaries of bounded gate complexity","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2504.15343","last_updated":"2025-04-21T18:00:03Z","snapshot_observed_at":"2026-08-16T11:26:34.790545Z","submitted_at":"2025-04-21T18:00:03Z","title":"The Hardness of Learning Quantum Circuits and its Cryptographic Applications","version":1},"reference_index":80,"source":"arxiv_source","source_observed_at":"2026-08-16T11:44:10.307187Z"},"links":{"citing_paper":"/paper/2504.15343"},"observation_digest":"sha256:6081481d02b4230a5e9c07fc2b3e58978e5229f18b13bba9edd9cd2b04ea7d3a","observation_id":"c99c011a-db62-4a65-93b1-096ef84d7636","resolution":{"observed_at":"2026-08-16T11:44:10.307187Z","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-16T11:44:10.444370Z","title":"Quantum computational advantage using photons","venue":null,"work_id":"15ebe4d1-ecdb-43c8-b8fa-1cc41214dd0e","year":2020},"citing_paper":{"arxiv_id":"2504.15343","last_updated":"2025-04-21T18:00:03Z","snapshot_observed_at":"2026-08-16T11:26:34.790545Z","submitted_at":"2025-04-21T18:00:03Z","title":"The Hardness of Learning Quantum Circuits and its Cryptographic Applications","version":1},"reference_index":81,"source":"arxiv_source","source_observed_at":"2026-08-16T11:44:10.310057Z"},"links":{"citing_paper":"/paper/2504.15343"},"observation_digest":"sha256:9feee2bdf0fd5624291d89a2b6466c1bc1bc93c00669bc59d88c1993d689231e","observation_id":"bc003b44-23b8-4060-a76d-80d295b2abfa","resolution":{"observed_at":"2026-08-16T11:44:10.447533Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2504.15343","last_updated":"2025-04-21T18:00:03Z","latest_version":1,"primary_category":"quant-ph","snapshot_observed_at":"2026-08-16T11:26:34.790545Z","submitted_at":"2025-04-21T18:00:03Z","title":"The Hardness of Learning Quantum Circuits and its Cryptographic Applications"},"reference_resolution":{"displayed":81,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":14,"verified_exact":5,"verified_fuzzy":62},"total_outbound_references":81},"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-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"thesis":"As of 18 August 2026, this Paper Citation Record lists 81 of 81 outbound references and 2 inbound Pith citation observations for arXiv:2504.15343."}