{"as_of":"2026-08-11T16:10:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:0f08e8899a2a6812950cdbb1a0a3a38b7d169166109f644be1165b751fccde17","coverage":[{"denominator":55,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":55,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-11T01:06:59.299350Z","state":"measured"},{"denominator":56,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":56,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-11T06:34:44.6726+00:00","state":"measured"},{"denominator":1,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-06T12:12:34.098363Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"pith","source_observed_at":"2026-08-06T12:12:34.401975Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2412.19090","last_updated":"2025-01-01T02:54:42Z","snapshot_observed_at":"2026-08-11T04:34:27.386610Z","submitted_at":"2024-12-26T07:04:34Z","title":"Quantum Algorithm for Vector Set Orthogonal Normalization and Matrix QR Decomposition with Polynomial Speedup","version":2},"cited_work":{"arxiv_id":"2412.19090","doi":null,"metadata_source":"pith","pith_arxiv_id":"2412.19090","snapshot_observed_at":"2026-08-06T12:12:34.401975Z","title":"Quantum Algorithm for Vector Set Orthogonal Normalization and Matrix QR Decomposition with Polynomial Speedup","venue":"quant-ph","work_id":"a9ad6c34-02bd-4f4a-8a51-e0965718928c","year":2024},"citing_paper":{"arxiv_id":"2507.22125","last_updated":"2025-07-29T18:00:25Z","snapshot_observed_at":"2026-08-08T10:58:33.478003Z","submitted_at":"2025-07-29T18:00:25Z","title":"Quantum complexity phase transition in fermionic quantum circuits","version":1},"reference_index":63,"source":"pdf_text","source_observed_at":"2026-08-06T12:12:34.098363Z"},"links":{"cited_paper":"/paper/2412.19090","citing_paper":"/paper/2507.22125"},"observation_digest":"sha256:ee6be972606f7e5bb3ab2699c68fb292b5dfd3157f9064768132f710fbd5aa88","observation_id":"2de3f2f8-02ac-4613-8a07-ef27e6e89599","resolution":{"observed_at":"2026-08-06T12:12:34.415479Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2412.19090/citation-record","integrity":"/paper/2412.19090/integrity","json":"/paper/2412.19090/citation-record.json","paper":"/paper/2412.19090"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T01:06:59.797203Z","title":null,"venue":null,"work_id":"f2762063-9c7c-4d99-8b5d-e87688ec8e66","year":null},"citing_paper":{"arxiv_id":"2412.19090","last_updated":"2025-01-01T02:54:42Z","snapshot_observed_at":"2026-08-11T04:34:27.386610Z","submitted_at":"2024-12-26T07:04:34Z","title":"Quantum Algorithm for Vector Set Orthogonal Normalization and Matrix QR Decomposition with Polynomial Speedup","version":2},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-11T01:06:59.149294Z"},"links":{"citing_paper":"/paper/2412.19090"},"observation_digest":"sha256:226b7c16eaa37efb6adbfd2a36f6ec47beaf036e230e66a0b701221b4d2de5cc","observation_id":"962650e1-dc65-4382-86b3-29aca18debf0","resolution":{"observed_at":"2026-08-11T01:06:59.799910Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-11T01:06:59.787359Z","title":"Matrix QR Decomposition Let A ∈ CN ×M be an arbitrary matrix with full rank satisfying N ≥ M","venue":null,"work_id":"00dc8ee9-752e-4e1f-a362-5f3be65b3552","year":null},"citing_paper":{"arxiv_id":"2412.19090","last_updated":"2025-01-01T02:54:42Z","snapshot_observed_at":"2026-08-11T04:34:27.386610Z","submitted_at":"2024-12-26T07:04:34Z","title":"Quantum Algorithm for Vector Set Orthogonal Normalization and Matrix QR Decomposition with Polynomial Speedup","version":2},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-11T01:06:59.153780Z"},"links":{"citing_paper":"/paper/2412.19090"},"observation_digest":"sha256:01460a8f1fa998fda43b13c8ab33510b2f164bd2ddf4b02c8946388f09df12a4","observation_id":"cdced2ea-e7aa-40c2-9b81-8de8222d3c2e","resolution":{"observed_at":"2026-08-11T01:06:59.790979Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-11T01:06:59.779413Z","title":"Problem 2 can be regarded as a generalization of Problem 1","venue":null,"work_id":"d20d931a-a919-46ca-acfd-1b7335590265","year":2000},"citing_paper":{"arxiv_id":"2412.19090","last_updated":"2025-01-01T02:54:42Z","snapshot_observed_at":"2026-08-11T04:34:27.386610Z","submitted_at":"2024-12-26T07:04:34Z","title":"Quantum Algorithm for Vector Set Orthogonal Normalization and Matrix QR Decomposition with Polynomial Speedup","version":2},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-11T01:06:59.157825Z"},"links":{"citing_paper":"/paper/2412.19090"},"observation_digest":"sha256:c16b1c3ba2f890cdf23204867079c1c92ec822e913b67a21d9515ea0a08ff56c","observation_id":"a937b424-a319-4b7e-983c-32baffd0f257","resolution":{"observed_at":"2026-08-11T01:06:59.782223Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-11T01:06:59.769531Z","title":"Then there exists a quantum algorithm for calculating the QR decomposition of matrix A","venue":null,"work_id":"819301c5-1c6c-4eff-8b69-89c2fd87846c","year":null},"citing_paper":{"arxiv_id":"2412.19090","last_updated":"2025-01-01T02:54:42Z","snapshot_observed_at":"2026-08-11T04:34:27.386610Z","submitted_at":"2024-12-26T07:04:34Z","title":"Quantum Algorithm for Vector Set Orthogonal Normalization and Matrix QR Decomposition with Polynomial Speedup","version":2},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-11T01:06:59.161759Z"},"links":{"citing_paper":"/paper/2412.19090"},"observation_digest":"sha256:91a327ceaa32f7ff07b670790498a5e39a5b48821f47c343dfcc69fc3eb85f97","observation_id":"d055d27a-85d0-4690-bcf3-0533be08cd3e","resolution":{"observed_at":"2026-08-11T01:06:59.772738Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-11T01:06:59.760917Z","title":"∥ A ⊗ B ∥2 2 = q λmax (A ⊗ B)† (A ⊗ B) 2 = λmax (A ⊗ B)† (A ⊗ B) = λmax A†A ⊗ B†B = λmax A†A · λmax A†A =∥ A ∥2 2 · ∥B ∥2 2 (B1) Therefore ∥ A ⊗ B ∥2=∥ A ∥2 · ∥B ∥2","venue":null,"work_id":"104f864f-79b0-4941-b2a1-1e7b0745834e","year":null},"citing_paper":{"arxiv_id":"2412.19090","last_updated":"2025-01-01T02:54:42Z","snapshot_observed_at":"2026-08-11T04:34:27.386610Z","submitted_at":"2024-12-26T07:04:34Z","title":"Quantum Algorithm for Vector Set Orthogonal Normalization and Matrix QR Decomposition with Polynomial Speedup","version":2},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-11T01:06:59.165143Z"},"links":{"citing_paper":"/paper/2412.19090"},"observation_digest":"sha256:a03995ef3288c97f22d73f2938b90528f6044591b34eaf7e37a2a0a4d44c8ad0","observation_id":"351daf56-518b-4408-aa0f-2178b2ba7e67","resolution":{"observed_at":"2026-08-11T01:06:59.764136Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-11T01:06:59.749742Z","title":"Suppose the qubit number of the first register is","venue":null,"work_id":"1ebd5a1a-120b-4631-8133-fef22cff2684","year":null},"citing_paper":{"arxiv_id":"2412.19090","last_updated":"2025-01-01T02:54:42Z","snapshot_observed_at":"2026-08-11T04:34:27.386610Z","submitted_at":"2024-12-26T07:04:34Z","title":"Quantum Algorithm for Vector Set Orthogonal Normalization and Matrix QR Decomposition with Polynomial Speedup","version":2},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-11T01:06:59.167769Z"},"links":{"citing_paper":"/paper/2412.19090"},"observation_digest":"sha256:62fe274078a005023f44f339b62bca36e13d7a0fc28594a72d62a236d9f50009","observation_id":"83bea7ea-ee7b-4350-b166-4851f15249d3","resolution":{"observed_at":"2026-08-11T01:06:59.752826Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-11T01:06:59.739351Z","title":"Define ∆ U = ( C − U ) − (C − exp(−iHt))","venue":null,"work_id":"b337d85c-3b5f-4241-9408-20faa4883d58","year":null},"citing_paper":{"arxiv_id":"2412.19090","last_updated":"2025-01-01T02:54:42Z","snapshot_observed_at":"2026-08-11T04:34:27.386610Z","submitted_at":"2024-12-26T07:04:34Z","title":"Quantum Algorithm for Vector Set Orthogonal Normalization and Matrix QR Decomposition with Polynomial Speedup","version":2},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-11T01:06:59.170335Z"},"links":{"citing_paper":"/paper/2412.19090"},"observation_digest":"sha256:e1e1718ab19a5970feddd4b62fa2a060cc0e2c5733b553b3890927e6156f4826","observation_id":"1090d1bb-d720-4a25-b0e3-85800c74aa62","resolution":{"observed_at":"2026-08-11T01:06:59.742582Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-11T01:06:59.729259Z","title":null,"venue":null,"work_id":"0991c83c-62d8-470c-b7bc-3908f50df034","year":null},"citing_paper":{"arxiv_id":"2412.19090","last_updated":"2025-01-01T02:54:42Z","snapshot_observed_at":"2026-08-11T04:34:27.386610Z","submitted_at":"2024-12-26T07:04:34Z","title":"Quantum Algorithm for Vector Set Orthogonal Normalization and Matrix QR Decomposition with Polynomial Speedup","version":2},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-11T01:06:59.172916Z"},"links":{"citing_paper":"/paper/2412.19090"},"observation_digest":"sha256:858f57ee4abc0e58763d1b67878598b6da9f8f61355d2e51489af3974d6d9642","observation_id":"9968d091-82e9-492a-8b91-3fef6093409d","resolution":{"observed_at":"2026-08-11T01:06:59.732739Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-11T01:06:59.717847Z","title":null,"venue":null,"work_id":"b51e45b3-a24f-49d9-9120-b282a6cf017c","year":null},"citing_paper":{"arxiv_id":"2412.19090","last_updated":"2025-01-01T02:54:42Z","snapshot_observed_at":"2026-08-11T04:34:27.386610Z","submitted_at":"2024-12-26T07:04:34Z","title":"Quantum Algorithm for Vector Set Orthogonal Normalization and Matrix QR Decomposition with Polynomial Speedup","version":2},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-11T01:06:59.175833Z"},"links":{"citing_paper":"/paper/2412.19090"},"observation_digest":"sha256:29406860400a3e33033d6aca0e6236228df268490dd721407e95e7f473a06702","observation_id":"5af3a240-0688-44e3-99a3-eeac382da1b2","resolution":{"observed_at":"2026-08-11T01:06:59.721897Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-11T01:06:59.709569Z","title":null,"venue":null,"work_id":"25f0a939-c163-4f6c-badc-6c19f7e59685","year":2012},"citing_paper":{"arxiv_id":"2412.19090","last_updated":"2025-01-01T02:54:42Z","snapshot_observed_at":"2026-08-11T04:34:27.386610Z","submitted_at":"2024-12-26T07:04:34Z","title":"Quantum Algorithm for Vector Set Orthogonal Normalization and Matrix QR Decomposition with Polynomial Speedup","version":2},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-11T01:06:59.178422Z"},"links":{"citing_paper":"/paper/2412.19090"},"observation_digest":"sha256:83620a6500dda6e9e3be27b9ed6d3259fbef15ebb0a940c4c25b132da51a7785","observation_id":"c35d2b3a-5bd6-47f2-9318-da107fb6f506","resolution":{"observed_at":"2026-08-11T01:06:59.712326Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-11T01:06:59.698032Z","title":"169 (Springer Science & Business Media, 2013)","venue":null,"work_id":"b9f383e5-f059-4861-8b94-84526a46fae4","year":2013},"citing_paper":{"arxiv_id":"2412.19090","last_updated":"2025-01-01T02:54:42Z","snapshot_observed_at":"2026-08-11T04:34:27.386610Z","submitted_at":"2024-12-26T07:04:34Z","title":"Quantum Algorithm for Vector Set Orthogonal Normalization and Matrix QR Decomposition with Polynomial Speedup","version":2},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-11T01:06:59.181022Z"},"links":{"citing_paper":"/paper/2412.19090"},"observation_digest":"sha256:3164d9bda92f589e766404fd0b6af8995e3c4f587e02f5525bceef07fc3c9130","observation_id":"3c674da0-1d48-47c4-969d-e7b0aad03931","resolution":{"observed_at":"2026-08-11T01:06:59.701371Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-11T01:06:59.689089Z","title":"Linear least squares solutions by householder transformations,","venue":null,"work_id":"0a35845b-3191-4b46-bcdb-acd70a6e66f8","year":1965},"citing_paper":{"arxiv_id":"2412.19090","last_updated":"2025-01-01T02:54:42Z","snapshot_observed_at":"2026-08-11T04:34:27.386610Z","submitted_at":"2024-12-26T07:04:34Z","title":"Quantum Algorithm for Vector Set Orthogonal Normalization and Matrix QR Decomposition with Polynomial Speedup","version":2},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-11T01:06:59.183804Z"},"links":{"citing_paper":"/paper/2412.19090"},"observation_digest":"sha256:2a87963c011290df0121cc832692ee1b1524521bd57b44a26fabb9009c906638","observation_id":"0897297a-0c88-4b25-929d-8cb4fdf04279","resolution":{"observed_at":"2026-08-11T01:06:59.692206Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-11T01:06:59.679017Z","title":"Gram-Schmidt orthogonalization: 100 years and more,","venue":null,"work_id":"feb6b34d-03ae-4fab-bf58-c7e349a8ec38","year":2013},"citing_paper":{"arxiv_id":"2412.19090","last_updated":"2025-01-01T02:54:42Z","snapshot_observed_at":"2026-08-11T04:34:27.386610Z","submitted_at":"2024-12-26T07:04:34Z","title":"Quantum Algorithm for Vector Set Orthogonal Normalization and Matrix QR Decomposition with Polynomial Speedup","version":2},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-11T01:06:59.187109Z"},"links":{"citing_paper":"/paper/2412.19090"},"observation_digest":"sha256:f230869b493a132a3294347ed7e67d5ee5c719a93febe080ad8e875d18187647","observation_id":"bd958cbf-bc01-496a-b7fa-2e04f9798197","resolution":{"observed_at":"2026-08-11T01:06:59.682760Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-11T01:06:59.670190Z","title":"The QR algorithm,","venue":null,"work_id":"2acc26e1-fe3f-4e6c-b22b-ec1df21ba3fa","year":2000},"citing_paper":{"arxiv_id":"2412.19090","last_updated":"2025-01-01T02:54:42Z","snapshot_observed_at":"2026-08-11T04:34:27.386610Z","submitted_at":"2024-12-26T07:04:34Z","title":"Quantum Algorithm for Vector Set Orthogonal Normalization and Matrix QR Decomposition with Polynomial Speedup","version":2},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-11T01:06:59.190011Z"},"links":{"citing_paper":"/paper/2412.19090"},"observation_digest":"sha256:9c592bca6266e7e87a778622b3cf8d5130e9bc8d8f2c5a8ec204429c3425cdee","observation_id":"6e466660-d186-4746-966a-4229ddb28fcc","resolution":{"observed_at":"2026-08-11T01:06:59.673072Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-11T01:06:59.660650Z","title":"Real-time face recognition using Gram-Schmidt orthogonalization for LDA,","venue":null,"work_id":"0d6105d5-d599-4845-b231-7f48e17ec9c3","year":2004},"citing_paper":{"arxiv_id":"2412.19090","last_updated":"2025-01-01T02:54:42Z","snapshot_observed_at":"2026-08-11T04:34:27.386610Z","submitted_at":"2024-12-26T07:04:34Z","title":"Quantum Algorithm for Vector Set Orthogonal Normalization and Matrix QR Decomposition with Polynomial Speedup","version":2},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-11T01:06:59.192772Z"},"links":{"citing_paper":"/paper/2412.19090"},"observation_digest":"sha256:9a339db4ab4684736e9f1a3910fce96b06ee2ad51033e83f6052d975c8c9bbb0","observation_id":"536d1063-c93e-4f00-b080-22934c06fa4d","resolution":{"observed_at":"2026-08-11T01:06:59.664054Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-11T01:06:59.651250Z","title":"Unsupervised feature selection through Gram–Schmidt orthogonalization—A word co- occurrence perspective,","venue":null,"work_id":"01bc4f6a-7751-43a6-ae73-51dc41a996c1","year":2016},"citing_paper":{"arxiv_id":"2412.19090","last_updated":"2025-01-01T02:54:42Z","snapshot_observed_at":"2026-08-11T04:34:27.386610Z","submitted_at":"2024-12-26T07:04:34Z","title":"Quantum Algorithm for Vector Set Orthogonal Normalization and Matrix QR Decomposition with Polynomial Speedup","version":2},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-11T01:06:59.195747Z"},"links":{"citing_paper":"/paper/2412.19090"},"observation_digest":"sha256:d6c7ceafc8d083032de7a03e988363b2c9c467ba3640e4505b13cc7c9674a55a","observation_id":"cc8185e4-9473-4df7-9994-d887110a1b7c","resolution":{"observed_at":"2026-08-11T01:06:59.654470Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-11T01:06:59.640483Z","title":"A modified learning algorithm for the multilayer neural network with multi-valued neurons based on the complex QR decomposition,","venue":null,"work_id":"574337da-caf7-438c-ba74-fe30a807e1bb","year":2012},"citing_paper":{"arxiv_id":"2412.19090","last_updated":"2025-01-01T02:54:42Z","snapshot_observed_at":"2026-08-11T04:34:27.386610Z","submitted_at":"2024-12-26T07:04:34Z","title":"Quantum Algorithm for Vector Set Orthogonal Normalization and Matrix QR Decomposition with Polynomial Speedup","version":2},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-11T01:06:59.198919Z"},"links":{"citing_paper":"/paper/2412.19090"},"observation_digest":"sha256:af47e0571b4121b8a69773c71ddcbc710a696d640fae0ab4f0c0df72925fe98a","observation_id":"222696d5-95ab-4b3f-9a8c-49d48687fb6d","resolution":{"observed_at":"2026-08-11T01:06:59.643772Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-11T01:06:59.631265Z","title":"Equal-diagonal QR decomposition and its application to precoder design for successive-cancellation detection,","venue":null,"work_id":"d339f882-1369-49e4-a033-171e1662c243","year":2005},"citing_paper":{"arxiv_id":"2412.19090","last_updated":"2025-01-01T02:54:42Z","snapshot_observed_at":"2026-08-11T04:34:27.386610Z","submitted_at":"2024-12-26T07:04:34Z","title":"Quantum Algorithm for Vector Set Orthogonal Normalization and Matrix QR Decomposition with Polynomial Speedup","version":2},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-11T01:06:59.201762Z"},"links":{"citing_paper":"/paper/2412.19090"},"observation_digest":"sha256:dcf0464190221e75c91d16754b73d8e37d8de6b6582a50ddb93bbf39df7c74ee","observation_id":"7814af2a-812d-4ab9-826e-04f3165f025d","resolution":{"observed_at":"2026-08-11T01:06:59.634177Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-11T01:06:59.620422Z","title":"Fast dual- domain reduced-rank algorithm for 3D deblending via randomized QR decomposition,","venue":null,"work_id":"f7593f6c-a4fc-4daf-abd4-be6cc8ed8c28","year":2016},"citing_paper":{"arxiv_id":"2412.19090","last_updated":"2025-01-01T02:54:42Z","snapshot_observed_at":"2026-08-11T04:34:27.386610Z","submitted_at":"2024-12-26T07:04:34Z","title":"Quantum Algorithm for Vector Set Orthogonal Normalization and Matrix QR Decomposition with Polynomial Speedup","version":2},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-11T01:06:59.205060Z"},"links":{"citing_paper":"/paper/2412.19090"},"observation_digest":"sha256:be5e3c2ef6b8b98f3649c66596e944b92e1dbf3183c2234826dfd3a80ba8801f","observation_id":"6e736a09-1007-4d24-9c28-d3c4d1675cac","resolution":{"observed_at":"2026-08-11T01:06:59.623945Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-11T01:06:59.611437Z","title":"On the use of the upper triangular (or QR) decomposition for developing constitutive equations for green-elastic materials,","venue":null,"work_id":"6a834a2e-5530-4dda-b206-d37ab965d79c","year":2012},"citing_paper":{"arxiv_id":"2412.19090","last_updated":"2025-01-01T02:54:42Z","snapshot_observed_at":"2026-08-11T04:34:27.386610Z","submitted_at":"2024-12-26T07:04:34Z","title":"Quantum Algorithm for Vector Set Orthogonal Normalization and Matrix QR Decomposition with Polynomial Speedup","version":2},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-11T01:06:59.207904Z"},"links":{"citing_paper":"/paper/2412.19090"},"observation_digest":"sha256:75b44a196465d4642adcc8f5ced6c22dc41dade5f01507326d7fb81aebec11a8","observation_id":"2a6daff0-6a05-4ba6-845e-43008dc84d49","resolution":{"observed_at":"2026-08-11T01:06:59.614874Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-11T01:06:59.602161Z","title":"Computation using the QR decompo- sition,","venue":null,"work_id":"eb80de8a-77fe-46ca-84f8-7a8cdc180732","year":1993},"citing_paper":{"arxiv_id":"2412.19090","last_updated":"2025-01-01T02:54:42Z","snapshot_observed_at":"2026-08-11T04:34:27.386610Z","submitted_at":"2024-12-26T07:04:34Z","title":"Quantum Algorithm for Vector Set Orthogonal Normalization and Matrix QR Decomposition with Polynomial Speedup","version":2},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-11T01:06:59.211348Z"},"links":{"citing_paper":"/paper/2412.19090"},"observation_digest":"sha256:8f9ee0a1cfe86b0cea4daf6e0864ecedc0ed6d9f7f0402e1c5c12a3dc244f600","observation_id":"41a890dd-7ed1-4f9f-8114-78e42007b9e3","resolution":{"observed_at":"2026-08-11T01:06:59.605887Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-11T01:06:59.593328Z","title":"The loss of orthogonality in the Gram-Schmidt orthogonalization process,","venue":null,"work_id":"ca17acf8-28d3-4071-8994-21236cc98445","year":2005},"citing_paper":{"arxiv_id":"2412.19090","last_updated":"2025-01-01T02:54:42Z","snapshot_observed_at":"2026-08-11T04:34:27.386610Z","submitted_at":"2024-12-26T07:04:34Z","title":"Quantum Algorithm for Vector Set Orthogonal Normalization and Matrix QR Decomposition with Polynomial Speedup","version":2},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-11T01:06:59.214734Z"},"links":{"citing_paper":"/paper/2412.19090"},"observation_digest":"sha256:67c9efcb4a3458b2dcf14c365e64ab8ed16b3c282cac43021f100f280e9f3a78","observation_id":"d0ac9282-fb9e-41fa-8617-c3688f071410","resolution":{"observed_at":"2026-08-11T01:06:59.596923Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-11T01:06:59.584339Z","title":"Rounding error analysis of the classical Gram-Schmidt orthogonalization process,","venue":null,"work_id":"27fa6b3b-8e69-432d-a5dc-b7b1aedce660","year":2005},"citing_paper":{"arxiv_id":"2412.19090","last_updated":"2025-01-01T02:54:42Z","snapshot_observed_at":"2026-08-11T04:34:27.386610Z","submitted_at":"2024-12-26T07:04:34Z","title":"Quantum Algorithm for Vector Set Orthogonal Normalization and Matrix QR Decomposition with Polynomial Speedup","version":2},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-11T01:06:59.217314Z"},"links":{"citing_paper":"/paper/2412.19090"},"observation_digest":"sha256:ef98c4799e18a9821fc75541e52e710f77db9c0afa405d75351799299c323949","observation_id":"1cb516a3-32c3-413c-84ff-02f1d41ac3e4","resolution":{"observed_at":"2026-08-11T01:06:59.588171Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-11T01:06:59.576381Z","title":"Error analysis of QR decompo- sitions by Givens transformations,","venue":null,"work_id":"583e9438-6a99-49f5-b516-686b83fbcb8a","year":1975},"citing_paper":{"arxiv_id":"2412.19090","last_updated":"2025-01-01T02:54:42Z","snapshot_observed_at":"2026-08-11T04:34:27.386610Z","submitted_at":"2024-12-26T07:04:34Z","title":"Quantum Algorithm for Vector Set Orthogonal Normalization and Matrix QR Decomposition with Polynomial Speedup","version":2},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-11T01:06:59.219896Z"},"links":{"citing_paper":"/paper/2412.19090"},"observation_digest":"sha256:7fee5b75c4fd7097703c0054e3e8ccc26a2ba3b82c687563fbe6af2fb19b774b","observation_id":"ea387b69-c098-49ca-bfad-7b645b31ce51","resolution":{"observed_at":"2026-08-11T01:06:59.579790Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-11T01:06:59.568006Z","title":"Quantum mechanical computers,","venue":null,"work_id":"c86c7879-9841-4f14-bacd-90f0b4f10199","year":1985},"citing_paper":{"arxiv_id":"2412.19090","last_updated":"2025-01-01T02:54:42Z","snapshot_observed_at":"2026-08-11T04:34:27.386610Z","submitted_at":"2024-12-26T07:04:34Z","title":"Quantum Algorithm for Vector Set Orthogonal Normalization and Matrix QR Decomposition with Polynomial Speedup","version":2},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-11T01:06:59.222522Z"},"links":{"citing_paper":"/paper/2412.19090"},"observation_digest":"sha256:7387148457af85c387d73cd60bdf0916d6240b9ba03345da4bddbd1ebf7e18e0","observation_id":"1623f368-0bb4-454f-bfd9-03bebddac6c2","resolution":{"observed_at":"2026-08-11T01:06:59.570891Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-11T01:06:59.560358Z","title":null,"venue":null,"work_id":"1ffafe52-405f-4018-9656-7eef7d846aa8","year":2010},"citing_paper":{"arxiv_id":"2412.19090","last_updated":"2025-01-01T02:54:42Z","snapshot_observed_at":"2026-08-11T04:34:27.386610Z","submitted_at":"2024-12-26T07:04:34Z","title":"Quantum Algorithm for Vector Set Orthogonal Normalization and Matrix QR Decomposition with Polynomial Speedup","version":2},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-11T01:06:59.225165Z"},"links":{"citing_paper":"/paper/2412.19090"},"observation_digest":"sha256:55367230432dddd8d971e3d73c9d050639ca9142b7bfd665320de727f883bf07","observation_id":"b6d0207a-af26-4671-8332-34b31bb61093","resolution":{"observed_at":"2026-08-11T01:06:59.562848Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-11T01:06:59.552671Z","title":"Quantum computing in the NISQ era and beyond,","venue":null,"work_id":"622de924-ab40-421d-8dcb-ae636935fbf0","year":2018},"citing_paper":{"arxiv_id":"2412.19090","last_updated":"2025-01-01T02:54:42Z","snapshot_observed_at":"2026-08-11T04:34:27.386610Z","submitted_at":"2024-12-26T07:04:34Z","title":"Quantum Algorithm for Vector Set Orthogonal Normalization and Matrix QR Decomposition with Polynomial Speedup","version":2},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-11T01:06:59.227466Z"},"links":{"citing_paper":"/paper/2412.19090"},"observation_digest":"sha256:7e25bf538e921ad30cdb78530efff09fc34dd577ffd73cc5bd52ee03aeac4629","observation_id":"58aecdaa-e5fc-4053-a03d-201b5fd45794","resolution":{"observed_at":"2026-08-11T01:06:59.555323Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-11T01:06:59.545777Z","title":"Hello quantum world! Google publishes landmark quantum supremacy claim,","venue":null,"work_id":"980a8523-07ff-47f2-a6d3-0f8fbed53a44","year":2019},"citing_paper":{"arxiv_id":"2412.19090","last_updated":"2025-01-01T02:54:42Z","snapshot_observed_at":"2026-08-11T04:34:27.386610Z","submitted_at":"2024-12-26T07:04:34Z","title":"Quantum Algorithm for Vector Set Orthogonal Normalization and Matrix QR Decomposition with Polynomial Speedup","version":2},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-11T01:06:59.229722Z"},"links":{"citing_paper":"/paper/2412.19090"},"observation_digest":"sha256:a471a7d6c8f9e0938e2f1da8c761b119a5471a6d88fa45f56a9da1bf82707d93","observation_id":"436d3208-6352-4c74-b17d-f84716e57fe3","resolution":{"observed_at":"2026-08-11T01:06:59.548655Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-11T01:06:59.536421Z","title":"Quantum computational advantage using photons,","venue":null,"work_id":"7b1bab95-20d1-4547-bce4-c08cb98a761d","year":2020},"citing_paper":{"arxiv_id":"2412.19090","last_updated":"2025-01-01T02:54:42Z","snapshot_observed_at":"2026-08-11T04:34:27.386610Z","submitted_at":"2024-12-26T07:04:34Z","title":"Quantum Algorithm for Vector Set Orthogonal Normalization and Matrix QR Decomposition with Polynomial Speedup","version":2},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-11T01:06:59.231979Z"},"links":{"citing_paper":"/paper/2412.19090"},"observation_digest":"sha256:4b747f1e7a3bb6f738938e91599beb71c0304c21555c3d4b1ef5dcef47b133b3","observation_id":"32dd3933-49aa-4278-8131-cb49b0977f27","resolution":{"observed_at":"2026-08-11T01:06:59.539528Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-11T01:06:59.527538Z","title":"Realization of a scalable shor algorithm,","venue":null,"work_id":"826a1603-a762-4c59-945f-acf541c27e99","year":2016},"citing_paper":{"arxiv_id":"2412.19090","last_updated":"2025-01-01T02:54:42Z","snapshot_observed_at":"2026-08-11T04:34:27.386610Z","submitted_at":"2024-12-26T07:04:34Z","title":"Quantum Algorithm for Vector Set Orthogonal Normalization and Matrix QR Decomposition with Polynomial Speedup","version":2},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-11T01:06:59.234288Z"},"links":{"citing_paper":"/paper/2412.19090"},"observation_digest":"sha256:4ac3b73d9a9f3b46cc77111fc89ca3929d9504584844cb6a069d1907561bed9e","observation_id":"8c7c2002-3eca-4710-a953-bac6385a23b9","resolution":{"observed_at":"2026-08-11T01:06:59.530336Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-11T01:06:59.518034Z","title":"Algorithms for quantum computation: discrete logarithms and factoring,","venue":null,"work_id":"26a869b8-4ae5-4698-9887-4c4879bce35a","year":1994},"citing_paper":{"arxiv_id":"2412.19090","last_updated":"2025-01-01T02:54:42Z","snapshot_observed_at":"2026-08-11T04:34:27.386610Z","submitted_at":"2024-12-26T07:04:34Z","title":"Quantum Algorithm for Vector Set Orthogonal Normalization and Matrix QR Decomposition with Polynomial Speedup","version":2},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-11T01:06:59.236655Z"},"links":{"citing_paper":"/paper/2412.19090"},"observation_digest":"sha256:1c9273dd42950120dc6bef3942b228634d75a0ee1f896da9aa3c993894fd5cb0","observation_id":"d1b3a38c-4ffb-4479-a0ac-04f41e8f2869","resolution":{"observed_at":"2026-08-11T01:06:59.521730Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-11T01:06:59.507248Z","title":null,"venue":null,"work_id":"a8abea5a-768d-43fc-a1f8-5cdf0185c8a7","year":2014},"citing_paper":{"arxiv_id":"2412.19090","last_updated":"2025-01-01T02:54:42Z","snapshot_observed_at":"2026-08-11T04:34:27.386610Z","submitted_at":"2024-12-26T07:04:34Z","title":"Quantum Algorithm for Vector Set Orthogonal Normalization and Matrix QR Decomposition with Polynomial Speedup","version":2},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-11T01:06:59.238872Z"},"links":{"citing_paper":"/paper/2412.19090"},"observation_digest":"sha256:8ddad1b5327ed36de58634b02d2ccc0e7112278feca4e5cf98a150a12c1575b5","observation_id":"2c36a26e-1b79-46f1-9b59-c8cd597b09e3","resolution":{"observed_at":"2026-08-11T01:06:59.511082Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-11T01:06:59.500380Z","title":"Quantum algorithm for linear systems of equations,","venue":null,"work_id":"fe31e216-3321-4585-b574-f519f3fd2c4b","year":2009},"citing_paper":{"arxiv_id":"2412.19090","last_updated":"2025-01-01T02:54:42Z","snapshot_observed_at":"2026-08-11T04:34:27.386610Z","submitted_at":"2024-12-26T07:04:34Z","title":"Quantum Algorithm for Vector Set Orthogonal Normalization and Matrix QR Decomposition with Polynomial Speedup","version":2},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-11T01:06:59.241087Z"},"links":{"citing_paper":"/paper/2412.19090"},"observation_digest":"sha256:18f5636650c5b21d3f3dc1c70f05fd3a50e7e975852d30d36e9954f48446007c","observation_id":"5cb0bc7c-41ce-41de-90f2-d8c0ad677f18","resolution":{"observed_at":"2026-08-11T01:06:59.502952Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-11T01:06:59.493781Z","title":"Quantum algorithm for systems of linear equations with exponentially improved dependence on precision,","venue":null,"work_id":"386e1fa0-cf93-4a35-91c6-35a22a0cd045","year":2017},"citing_paper":{"arxiv_id":"2412.19090","last_updated":"2025-01-01T02:54:42Z","snapshot_observed_at":"2026-08-11T04:34:27.386610Z","submitted_at":"2024-12-26T07:04:34Z","title":"Quantum Algorithm for Vector Set Orthogonal Normalization and Matrix QR Decomposition with Polynomial Speedup","version":2},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-11T01:06:59.243791Z"},"links":{"citing_paper":"/paper/2412.19090"},"observation_digest":"sha256:a0447ed5b1332c17efb3abdb70fe25d373618149095c835d484f39113b31d991","observation_id":"6bac19ef-9fd8-4151-b2ec-72420c78e993","resolution":{"observed_at":"2026-08-11T01:06:59.496459Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-11T01:06:59.487002Z","title":"Quantum support vector machine for big data classification,","venue":null,"work_id":"0ba83dfc-a82a-454d-8311-8d5bf899bcac","year":2014},"citing_paper":{"arxiv_id":"2412.19090","last_updated":"2025-01-01T02:54:42Z","snapshot_observed_at":"2026-08-11T04:34:27.386610Z","submitted_at":"2024-12-26T07:04:34Z","title":"Quantum Algorithm for Vector Set Orthogonal Normalization and Matrix QR Decomposition with Polynomial Speedup","version":2},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-11T01:06:59.246742Z"},"links":{"citing_paper":"/paper/2412.19090"},"observation_digest":"sha256:6e4bc660b4c568bbad43544bcc4b0975ca5ce2437f536c90f3b804ee96e8f63f","observation_id":"47840125-01ae-462e-a2a4-075378bc36f9","resolution":{"observed_at":"2026-08-11T01:06:59.489746Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-11T01:06:59.479317Z","title":"Quantum principal component analysis,","venue":null,"work_id":"c1e1ce7d-05b7-4413-b2e9-6b630aafb14a","year":2014},"citing_paper":{"arxiv_id":"2412.19090","last_updated":"2025-01-01T02:54:42Z","snapshot_observed_at":"2026-08-11T04:34:27.386610Z","submitted_at":"2024-12-26T07:04:34Z","title":"Quantum Algorithm for Vector Set Orthogonal Normalization and Matrix QR Decomposition with Polynomial Speedup","version":2},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-11T01:06:59.249038Z"},"links":{"citing_paper":"/paper/2412.19090"},"observation_digest":"sha256:4c51fcaabfd32b4da0cc5abf32c51f8a73c3c9e63efa1226db6d00183699d394","observation_id":"72c17904-5749-4aaa-84c5-5e57fb717376","resolution":{"observed_at":"2026-08-11T01:06:59.482072Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-11T01:06:59.471390Z","title":"Quantum inference on Bayesian networks,","venue":null,"work_id":"846297d4-8cc1-4280-b496-8be7ee5065ca","year":2014},"citing_paper":{"arxiv_id":"2412.19090","last_updated":"2025-01-01T02:54:42Z","snapshot_observed_at":"2026-08-11T04:34:27.386610Z","submitted_at":"2024-12-26T07:04:34Z","title":"Quantum Algorithm for Vector Set Orthogonal Normalization and Matrix QR Decomposition with Polynomial Speedup","version":2},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-11T01:06:59.251522Z"},"links":{"citing_paper":"/paper/2412.19090"},"observation_digest":"sha256:07980e9fde67f033659661254f6a81538656e25e4a7bee2bab6bab0f6d3fd372","observation_id":"366d95ab-261a-4352-b5c6-d0752e0dd22e","resolution":{"observed_at":"2026-08-11T01:06:59.474241Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-11T01:06:59.463340Z","title":"Quantum boltzmann machine,","venue":null,"work_id":"890c8ee5-3063-425d-9ca6-c26ce6d2bafc","year":2018},"citing_paper":{"arxiv_id":"2412.19090","last_updated":"2025-01-01T02:54:42Z","snapshot_observed_at":"2026-08-11T04:34:27.386610Z","submitted_at":"2024-12-26T07:04:34Z","title":"Quantum Algorithm for Vector Set Orthogonal Normalization and Matrix QR Decomposition with Polynomial Speedup","version":2},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-11T01:06:59.254484Z"},"links":{"citing_paper":"/paper/2412.19090"},"observation_digest":"sha256:722e12051740a69fca4d88c20b51d5bc593fa998de684b37d675aaf7816b5f47","observation_id":"0bb771af-a473-46ed-82fe-db9d9f241e50","resolution":{"observed_at":"2026-08-11T01:06:59.466203Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-11T01:06:59.454897Z","title":"Quantum Gram-Schmidt processes and their application to efficient state readout for quantum algorithms,","venue":null,"work_id":"6ca03d45-dae5-4b48-9185-96c42a2c57bd","year":2021},"citing_paper":{"arxiv_id":"2412.19090","last_updated":"2025-01-01T02:54:42Z","snapshot_observed_at":"2026-08-11T04:34:27.386610Z","submitted_at":"2024-12-26T07:04:34Z","title":"Quantum Algorithm for Vector Set Orthogonal Normalization and Matrix QR Decomposition with Polynomial Speedup","version":2},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-11T01:06:59.258229Z"},"links":{"citing_paper":"/paper/2412.19090"},"observation_digest":"sha256:c8754a9d825ce6d8a91f575e9a3433792a0b9ae1bbd4e3bdd85f0679dbbfa731","observation_id":"608c7f24-ea77-447a-84d5-7592959cb40a","resolution":{"observed_at":"2026-08-11T01:06:59.458434Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-11T01:06:59.446913Z","title":"Quantum random access memory,","venue":null,"work_id":"2972adcc-8998-4c74-b2dc-85e2127bd3e9","year":2008},"citing_paper":{"arxiv_id":"2412.19090","last_updated":"2025-01-01T02:54:42Z","snapshot_observed_at":"2026-08-11T04:34:27.386610Z","submitted_at":"2024-12-26T07:04:34Z","title":"Quantum Algorithm for Vector Set Orthogonal Normalization and Matrix QR Decomposition with Polynomial Speedup","version":2},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-11T01:06:59.261315Z"},"links":{"citing_paper":"/paper/2412.19090"},"observation_digest":"sha256:49104b1bcaa1bfc637fbefcade4953e1b826d7a7a6970602d40f2bb68e62cae1","observation_id":"2b105e69-cfa3-4c16-b39d-6409b5ec2e01","resolution":{"observed_at":"2026-08-11T01:06:59.449844Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-11T01:06:59.437739Z","title":"Quantum QR decomposition in the computational basis,","venue":null,"work_id":"629a4179-aff4-4176-a3ea-d1b9ea4d63f1","year":2020},"citing_paper":{"arxiv_id":"2412.19090","last_updated":"2025-01-01T02:54:42Z","snapshot_observed_at":"2026-08-11T04:34:27.386610Z","submitted_at":"2024-12-26T07:04:34Z","title":"Quantum Algorithm for Vector Set Orthogonal Normalization and Matrix QR Decomposition with Polynomial Speedup","version":2},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-11T01:06:59.263652Z"},"links":{"citing_paper":"/paper/2412.19090"},"observation_digest":"sha256:553962f556be114876748242b40a28bca9a47736b1ccf2b37e4e9ebc225fc919","observation_id":"ccfdfcaf-8fd7-4a95-b916-b1b978df93ca","resolution":{"observed_at":"2026-08-11T01:06:59.440487Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-11T01:06:59.428843Z","title":"Architectures for a quantum random access memory,","venue":null,"work_id":"4f426853-8719-4ebc-9ad8-c7d536efd96f","year":2008},"citing_paper":{"arxiv_id":"2412.19090","last_updated":"2025-01-01T02:54:42Z","snapshot_observed_at":"2026-08-11T04:34:27.386610Z","submitted_at":"2024-12-26T07:04:34Z","title":"Quantum Algorithm for Vector Set Orthogonal Normalization and Matrix QR Decomposition with Polynomial Speedup","version":2},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-11T01:06:59.265996Z"},"links":{"citing_paper":"/paper/2412.19090"},"observation_digest":"sha256:8f7905ce4b688fb776e6763b3d755bb1aa2343d340c41841cb1c0863300af0d8","observation_id":"8ca4d568-ad1b-4d0e-ba6d-635c61495325","resolution":{"observed_at":"2026-08-11T01:06:59.431708Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-11T01:06:59.420607Z","title":"Hamiltonian simulation by qubitization,","venue":null,"work_id":"68e63974-c2df-4f56-bc1a-5e3c05f88def","year":2019},"citing_paper":{"arxiv_id":"2412.19090","last_updated":"2025-01-01T02:54:42Z","snapshot_observed_at":"2026-08-11T04:34:27.386610Z","submitted_at":"2024-12-26T07:04:34Z","title":"Quantum Algorithm for Vector Set Orthogonal Normalization and Matrix QR Decomposition with Polynomial Speedup","version":2},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-11T01:06:59.268306Z"},"links":{"citing_paper":"/paper/2412.19090"},"observation_digest":"sha256:e1eb2573ab9f23b5fd786519b1875aa2e6e7c26a43d54d35957ed74931a5debf","observation_id":"04c18deb-7bf1-4350-8586-9a4674e91e43","resolution":{"observed_at":"2026-08-11T01:06:59.423582Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-11T01:06:59.411507Z","title":"Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer,","venue":null,"work_id":"6beced64-05ef-4d3f-88b2-7e0a6ae605b7","year":1999},"citing_paper":{"arxiv_id":"2412.19090","last_updated":"2025-01-01T02:54:42Z","snapshot_observed_at":"2026-08-11T04:34:27.386610Z","submitted_at":"2024-12-26T07:04:34Z","title":"Quantum Algorithm for Vector Set Orthogonal Normalization and Matrix QR Decomposition with Polynomial Speedup","version":2},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-11T01:06:59.270570Z"},"links":{"citing_paper":"/paper/2412.19090"},"observation_digest":"sha256:e3a37532fac372bf52225573ff652e1616baf9b378c78adabab21e9566597af2","observation_id":"69d7a000-402c-4001-9eea-e6839953934d","resolution":{"observed_at":"2026-08-11T01:06:59.414809Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-11T01:06:59.401177Z","title":"An improved quantum Fourier transform algorithm and applications,","venue":null,"work_id":"26706670-c945-45a1-9998-38511a8293f3","year":2000},"citing_paper":{"arxiv_id":"2412.19090","last_updated":"2025-01-01T02:54:42Z","snapshot_observed_at":"2026-08-11T04:34:27.386610Z","submitted_at":"2024-12-26T07:04:34Z","title":"Quantum Algorithm for Vector Set Orthogonal Normalization and Matrix QR Decomposition with Polynomial Speedup","version":2},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-11T01:06:59.273273Z"},"links":{"citing_paper":"/paper/2412.19090"},"observation_digest":"sha256:3ad1f3d727f77a7208a36fede27c5e3ff8ca1f61d846d9b0893c1a790cd6ebbd","observation_id":"4a951a51-7856-48ef-bf6d-1e9ecec91bfe","resolution":{"observed_at":"2026-08-11T01:06:59.405530Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-11T01:06:59.392165Z","title":"Quantum algorithms for quantum dynamics,","venue":null,"work_id":"2a58b66a-59bc-4713-92b0-bcd041e48d44","year":2023},"citing_paper":{"arxiv_id":"2412.19090","last_updated":"2025-01-01T02:54:42Z","snapshot_observed_at":"2026-08-11T04:34:27.386610Z","submitted_at":"2024-12-26T07:04:34Z","title":"Quantum Algorithm for Vector Set Orthogonal Normalization and Matrix QR Decomposition with Polynomial Speedup","version":2},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-11T01:06:59.275590Z"},"links":{"citing_paper":"/paper/2412.19090"},"observation_digest":"sha256:113b1d3a7b5046052daf4a44269b18766a1e03166c9380d3b61fe5bef493078f","observation_id":"789e119b-358f-46c7-b9d0-7a28e04102ca","resolution":{"observed_at":"2026-08-11T01:06:59.395096Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-11T01:06:59.384251Z","title":"Compiling basic linear algebra subroutines for quantum computers,","venue":null,"work_id":"9486146e-0c74-49ca-932b-236e8d66a4a2","year":2021},"citing_paper":{"arxiv_id":"2412.19090","last_updated":"2025-01-01T02:54:42Z","snapshot_observed_at":"2026-08-11T04:34:27.386610Z","submitted_at":"2024-12-26T07:04:34Z","title":"Quantum Algorithm for Vector Set Orthogonal Normalization and Matrix QR Decomposition with Polynomial Speedup","version":2},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-11T01:06:59.277983Z"},"links":{"citing_paper":"/paper/2412.19090"},"observation_digest":"sha256:913edb31e8ce0d29f661ebe62bf5c6f5839b8ec1a13a7a0ab3ae65cd8ac58239","observation_id":"426e32bd-2fac-454f-bde1-c93a969983e3","resolution":{"observed_at":"2026-08-11T01:06:59.387346Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-11T01:06:59.280271Z","title":"The density-matrix renormalization group,","venue":null,"work_id":null,"year":2005},"citing_paper":{"arxiv_id":"2412.19090","last_updated":"2025-01-01T02:54:42Z","snapshot_observed_at":"2026-08-11T04:34:27.386610Z","submitted_at":"2024-12-26T07:04:34Z","title":"Quantum Algorithm for Vector Set Orthogonal Normalization and Matrix QR Decomposition with Polynomial Speedup","version":2},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-11T01:06:59.280271Z"},"links":{"citing_paper":"/paper/2412.19090"},"observation_digest":"sha256:62b0b632cc5ece97e9e9421a843688f6163f4eefa43efe036446be7d78aad0e0","observation_id":"021bb64f-653d-42f7-8030-5e2906b38707","resolution":{"observed_at":"2026-08-11T01:06:59.280271Z","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-11T01:06:59.370776Z","title":"The density-matrix renormalization group in the age of matrix product states,","venue":null,"work_id":"572eeac2-1c8b-4f40-82bd-32f52710d337","year":2011},"citing_paper":{"arxiv_id":"2412.19090","last_updated":"2025-01-01T02:54:42Z","snapshot_observed_at":"2026-08-11T04:34:27.386610Z","submitted_at":"2024-12-26T07:04:34Z","title":"Quantum Algorithm for Vector Set Orthogonal Normalization and Matrix QR Decomposition with Polynomial Speedup","version":2},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-08-11T01:06:59.282392Z"},"links":{"citing_paper":"/paper/2412.19090"},"observation_digest":"sha256:04813abb0651e796efd5c8f6238e7ab3956128a19fc8edeb84254309af680c04","observation_id":"bc4dc383-fab4-40ff-8653-307e9f7864ae","resolution":{"observed_at":"2026-08-11T01:06:59.374113Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-11T01:06:59.363374Z","title":"Infinite time-evolving block decimation algorithm beyond unitary evolution,","venue":null,"work_id":"50fb1664-f15c-4774-a9ba-1cc3f589d590","year":2008},"citing_paper":{"arxiv_id":"2412.19090","last_updated":"2025-01-01T02:54:42Z","snapshot_observed_at":"2026-08-11T04:34:27.386610Z","submitted_at":"2024-12-26T07:04:34Z","title":"Quantum Algorithm for Vector Set Orthogonal Normalization and Matrix QR Decomposition with Polynomial Speedup","version":2},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-08-11T01:06:59.285608Z"},"links":{"citing_paper":"/paper/2412.19090"},"observation_digest":"sha256:37f12aae313da5cbcc130c38861bafb824835b6f61d0dae268ac4bf08060cb9c","observation_id":"955ffa67-4eef-48b2-a474-3bebdf18d3d9","resolution":{"observed_at":"2026-08-11T01:06:59.366302Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-11T01:06:59.354016Z","title":"A practical introduction to tensor networks: Matrix product states and projected entangled pair states,","venue":null,"work_id":"e268ea17-177b-4c2e-9611-1f77928e3fec","year":2014},"citing_paper":{"arxiv_id":"2412.19090","last_updated":"2025-01-01T02:54:42Z","snapshot_observed_at":"2026-08-11T04:34:27.386610Z","submitted_at":"2024-12-26T07:04:34Z","title":"Quantum Algorithm for Vector Set Orthogonal Normalization and Matrix QR Decomposition with Polynomial Speedup","version":2},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-08-11T01:06:59.288438Z"},"links":{"citing_paper":"/paper/2412.19090"},"observation_digest":"sha256:fc61dff0c52d48978584e787427e1b22320e141937f5706396166c4a2f40dff8","observation_id":"29bf4d2b-3843-4d3a-8f1f-13702bf24185","resolution":{"observed_at":"2026-08-11T01:06:59.358003Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-11T01:06:59.346444Z","title":"739 (Springer, 2007)","venue":null,"work_id":"e1948358-a5cf-42ef-a4bf-ef3643d9c20b","year":2007},"citing_paper":{"arxiv_id":"2412.19090","last_updated":"2025-01-01T02:54:42Z","snapshot_observed_at":"2026-08-11T04:34:27.386610Z","submitted_at":"2024-12-26T07:04:34Z","title":"Quantum Algorithm for Vector Set Orthogonal Normalization and Matrix QR Decomposition with Polynomial Speedup","version":2},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-08-11T01:06:59.290668Z"},"links":{"citing_paper":"/paper/2412.19090"},"observation_digest":"sha256:aa69843e5e22f00823039c118e25bab8d424e316857821b7843430f4732c2044","observation_id":"cde8f149-82f9-4171-9ce9-899947074169","resolution":{"observed_at":"2026-08-11T01:06:59.348975Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-11T01:06:59.338860Z","title":"Quantum amplitude amplification and estimation,","venue":null,"work_id":"6e8e1c6f-89be-4848-b558-06932f02ea42","year":2002},"citing_paper":{"arxiv_id":"2412.19090","last_updated":"2025-01-01T02:54:42Z","snapshot_observed_at":"2026-08-11T04:34:27.386610Z","submitted_at":"2024-12-26T07:04:34Z","title":"Quantum Algorithm for Vector Set Orthogonal Normalization and Matrix QR Decomposition with Polynomial Speedup","version":2},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-08-11T01:06:59.293222Z"},"links":{"citing_paper":"/paper/2412.19090"},"observation_digest":"sha256:fe5f8687f669b2f943bf94a16cba9d71f96d8e1159f7be6657d737914f754164","observation_id":"50683f2a-e1ee-4f89-9285-95b08754b49f","resolution":{"observed_at":"2026-08-11T01:06:59.341714Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-11T01:06:59.328442Z","title":"Low depth algorithms for quantum amplitude estimation,","venue":null,"work_id":"70df5233-adc6-49a6-87fe-68ea145873c0","year":2022},"citing_paper":{"arxiv_id":"2412.19090","last_updated":"2025-01-01T02:54:42Z","snapshot_observed_at":"2026-08-11T04:34:27.386610Z","submitted_at":"2024-12-26T07:04:34Z","title":"Quantum Algorithm for Vector Set Orthogonal Normalization and Matrix QR Decomposition with Polynomial Speedup","version":2},"reference_index":54,"source":"pdf_text","source_observed_at":"2026-08-11T01:06:59.296884Z"},"links":{"citing_paper":"/paper/2412.19090"},"observation_digest":"sha256:835113337e8b87b980c7f5e4eacc3cbc9d7d3171b644696d9d1fe8613b9fdac0","observation_id":"5b66f121-6482-47f2-be71-8a01aadd3e31","resolution":{"observed_at":"2026-08-11T01:06:59.331121Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-11T01:06:59.318049Z","title":"Iterative quantum amplitude estimation,","venue":null,"work_id":"7b8dbf00-7738-4584-a57d-8e1d67c84663","year":2021},"citing_paper":{"arxiv_id":"2412.19090","last_updated":"2025-01-01T02:54:42Z","snapshot_observed_at":"2026-08-11T04:34:27.386610Z","submitted_at":"2024-12-26T07:04:34Z","title":"Quantum Algorithm for Vector Set Orthogonal Normalization and Matrix QR Decomposition with Polynomial Speedup","version":2},"reference_index":55,"source":"pdf_text","source_observed_at":"2026-08-11T01:06:59.299350Z"},"links":{"citing_paper":"/paper/2412.19090"},"observation_digest":"sha256:f9512cd09b7c5b5e22c7a1c1de68ff5217d1d16efc7df1daa8bcc2b71e16b1d5","observation_id":"e1c731e1-ae45-4ca5-8d30-0b7e5084eea0","resolution":{"observed_at":"2026-08-11T01:06:59.322583Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2412.19090","last_updated":"2025-01-01T02:54:42Z","latest_version":2,"primary_category":"quant-ph","snapshot_observed_at":"2026-08-11T04:34:27.386610Z","submitted_at":"2024-12-26T07:04:34Z","title":"Quantum Algorithm for Vector Set Orthogonal Normalization and Matrix QR Decomposition with Polynomial Speedup"},"reference_resolution":{"displayed":55,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":7,"verified_exact":0,"verified_fuzzy":48},"total_outbound_references":55},"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-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"thesis":"As of 11 August 2026, this Paper Citation Record lists 55 of 55 outbound references and 1 inbound Pith citation observation for arXiv:2412.19090."}