{"as_of":"2026-08-19T03:36:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:f22403dcc4804783476aff967da00c4cd0e2dae1c202ae9bf6883140f7b8de20","coverage":[{"denominator":43,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":43,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-06T20:11:36.176763Z","state":"measured"},{"denominator":44,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":44,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-18T06:34:40.430872+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-07-13T01:18:30.124893Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2507.03714","last_updated":"2025-07-26T05:21:16Z","snapshot_observed_at":"2026-08-13T02:07:38.729270Z","submitted_at":"2025-07-04T17:05:07Z","title":"Efficient Quantum Access Model for Sparse Structured Matrices using Linear Combination of Things","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2507.03714","snapshot_observed_at":"2026-07-13T01:18:30.124893Z","title":"Efficient quantum access model for sparse structured matrices using linear combination of things","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.08976","last_updated":"2026-07-09T22:44:18Z","snapshot_observed_at":"2026-08-17T03:27:10.011156Z","submitted_at":"2026-07-09T22:44:18Z","title":"A Scalable Approach to Solve the Carleman Linearized Burgers' Equation on a Quantum Computer","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-07-13T01:18:30.124893Z"},"links":{"cited_paper":"/paper/2507.03714","citing_paper":"/paper/2607.08976"},"observation_digest":"sha256:357f1b496c8e9dd93b51a20a6ed60a7159e16947adbe804aa89f0e0b8d7fd91b","observation_id":"d6e471d7-39a4-452b-a25c-fc83ca4c8e39","resolution":{"observed_at":"2026-07-13T01:18:30.124893Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2507.03714/citation-record","integrity":"/paper/2507.03714/integrity","json":"/paper/2507.03714/citation-record.json","paper":"/paper/2507.03714"},"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-06T20:11:36.584521Z","title":null,"venue":null,"work_id":"493dfdc7-0580-4b63-99e4-e5aedc843bd9","year":null},"citing_paper":{"arxiv_id":"2507.03714","last_updated":"2025-07-26T05:21:16Z","snapshot_observed_at":"2026-08-13T02:07:38.729270Z","submitted_at":"2025-07-04T17:05:07Z","title":"Efficient Quantum Access Model for Sparse Structured Matrices using Linear Combination of Things","version":2},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-06T20:11:36.088244Z"},"links":{"citing_paper":"/paper/2507.03714"},"observation_digest":"sha256:4e3991fcd35ec0736cb5a55c3a78add54a585f242a496dc29ddc34a5cdc2b074","observation_id":"438710b2-362b-4747-a133-46ecbfe93186","resolution":{"observed_at":"2026-08-06T20:11:36.586950Z","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-06T20:11:36.578485Z","title":null,"venue":null,"work_id":"123babc0-9953-416d-a513-ea9ddbb2e000","year":null},"citing_paper":{"arxiv_id":"2507.03714","last_updated":"2025-07-26T05:21:16Z","snapshot_observed_at":"2026-08-13T02:07:38.729270Z","submitted_at":"2025-07-04T17:05:07Z","title":"Efficient Quantum Access Model for Sparse Structured Matrices using Linear Combination of Things","version":2},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-06T20:11:36.091039Z"},"links":{"citing_paper":"/paper/2507.03714"},"observation_digest":"sha256:764677a8c046dd7efb1e10878c3182b07d70f2fa844999693ad31b87cf1d356f","observation_id":"47aa4308-07c4-488a-b894-9777f7ff1c01","resolution":{"observed_at":"2026-08-06T20:11:36.580630Z","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-06T20:11:36.513717Z","title":"Thus, we get a total of 1+2(k−1)+1+1 = 2 k+1 C nX gates completing the proof","venue":null,"work_id":"086cde69-ea05-4272-84fe-84e3e7c69820","year":null},"citing_paper":{"arxiv_id":"2507.03714","last_updated":"2025-07-26T05:21:16Z","snapshot_observed_at":"2026-08-13T02:07:38.729270Z","submitted_at":"2025-07-04T17:05:07Z","title":"Efficient Quantum Access Model for Sparse Structured Matrices using Linear Combination of Things","version":2},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-06T20:11:36.113859Z"},"links":{"citing_paper":"/paper/2507.03714"},"observation_digest":"sha256:1fbbfa378883f3a9af3354920a043b9a0f3f589f41785e2da773903f021e7d3a","observation_id":"a2c348ba-5f8d-49b3-93f5-f850217e22c7","resolution":{"observed_at":"2026-08-06T20:11:36.515954Z","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-06T20:11:36.572516Z","title":"In this case, k = 1 as the second term in the tensor product is I","venue":null,"work_id":"f291fe1c-c533-4ec1-98ee-3cf1a4098b9e","year":null},"citing_paper":{"arxiv_id":"2507.03714","last_updated":"2025-07-26T05:21:16Z","snapshot_observed_at":"2026-08-13T02:07:38.729270Z","submitted_at":"2025-07-04T17:05:07Z","title":"Efficient Quantum Access Model for Sparse Structured Matrices using Linear Combination of Things","version":2},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-06T20:11:36.093362Z"},"links":{"citing_paper":"/paper/2507.03714"},"observation_digest":"sha256:3f06610e0d22523e2a46bab8eafdddcb608f85a3c0e1f5763ed0110b3c741ecb","observation_id":"c6ff61f4-cf1c-482e-bb2d-fc564bf26a39","resolution":{"observed_at":"2026-08-06T20:11:36.574702Z","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-06T20:11:36.566591Z","title":"a0 X q0 X q1 I q2 I FIG","venue":null,"work_id":"2d533e40-3081-4858-bce7-867633881675","year":null},"citing_paper":{"arxiv_id":"2507.03714","last_updated":"2025-07-26T05:21:16Z","snapshot_observed_at":"2026-08-13T02:07:38.729270Z","submitted_at":"2025-07-04T17:05:07Z","title":"Efficient Quantum Access Model for Sparse Structured Matrices using Linear Combination of Things","version":2},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-06T20:11:36.095674Z"},"links":{"citing_paper":"/paper/2507.03714"},"observation_digest":"sha256:333b447a2c6a91a9b643ca711ba95c227ddd06b03dc1b534215cf64fb5db42cc","observation_id":"ff0690f1-cfa2-4e55-8579-db0ba6d58e7c","resolution":{"observed_at":"2026-08-06T20:11:36.568575Z","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-06T20:11:36.560039Z","title":"Note that most significant bit corresponds to the ancilla qubit","venue":null,"work_id":"9066da64-361c-4f5b-8ed1-fd585e153e7d","year":null},"citing_paper":{"arxiv_id":"2507.03714","last_updated":"2025-07-26T05:21:16Z","snapshot_observed_at":"2026-08-13T02:07:38.729270Z","submitted_at":"2025-07-04T17:05:07Z","title":"Efficient Quantum Access Model for Sparse Structured Matrices using Linear Combination of Things","version":2},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-06T20:11:36.098250Z"},"links":{"citing_paper":"/paper/2507.03714"},"observation_digest":"sha256:b31ef1035efc97e2610197085012e7cc0ef17b551c8b748e96f49fae9d7df1fc","observation_id":"9b7f4a08-8cf9-4b80-a23c-b2596843df81","resolution":{"observed_at":"2026-08-06T20:11:36.562709Z","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-06T20:11:36.553780Z","title":"The second permutation (r2 ↔ r′","venue":null,"work_id":"2b1f2e37-c3f7-40a5-a383-2e73a4c39c23","year":null},"citing_paper":{"arxiv_id":"2507.03714","last_updated":"2025-07-26T05:21:16Z","snapshot_observed_at":"2026-08-13T02:07:38.729270Z","submitted_at":"2025-07-04T17:05:07Z","title":"Efficient Quantum Access Model for Sparse Structured Matrices using Linear Combination of Things","version":2},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-06T20:11:36.100465Z"},"links":{"citing_paper":"/paper/2507.03714"},"observation_digest":"sha256:783939b656c960dde8767de2ebb2add24423c077f92196931c3496983637d378","observation_id":"a1e61f23-8758-4402-a629-0bf4f72bbb0e","resolution":{"observed_at":"2026-08-06T20:11:36.555977Z","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-06T20:11:36.547131Z","title":"The target is always on the ancillaa0","venue":null,"work_id":"7ab3d7dc-99fa-431d-9ca1-8c2b029e5ac4","year":null},"citing_paper":{"arxiv_id":"2507.03714","last_updated":"2025-07-26T05:21:16Z","snapshot_observed_at":"2026-08-13T02:07:38.729270Z","submitted_at":"2025-07-04T17:05:07Z","title":"Efficient Quantum Access Model for Sparse Structured Matrices using Linear Combination of Things","version":2},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-06T20:11:36.102920Z"},"links":{"citing_paper":"/paper/2507.03714"},"observation_digest":"sha256:5e2caa50f3635fbb3710a8dfa6e2b1f036ebe3d701b588878ee836139b9656cb","observation_id":"3f0e048a-1f6c-4844-bb69-ff00782e66b1","resolution":{"observed_at":"2026-08-06T20:11:36.549597Z","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-06T20:11:36.540524Z","title":"Finally using the procotols defined in Lem 6, 7 and following the same analysis in the proof of Thm","venue":null,"work_id":"4b15c454-8873-4cb6-81ae-b8443170d644","year":null},"citing_paper":{"arxiv_id":"2507.03714","last_updated":"2025-07-26T05:21:16Z","snapshot_observed_at":"2026-08-13T02:07:38.729270Z","submitted_at":"2025-07-04T17:05:07Z","title":"Efficient Quantum Access Model for Sparse Structured Matrices using Linear Combination of Things","version":2},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-06T20:11:36.105327Z"},"links":{"citing_paper":"/paper/2507.03714"},"observation_digest":"sha256:30032bc2e832ddc6e4aba81528154c3b298aca4e04ada26f26b7e92ce65a96f3","observation_id":"94799164-d576-4957-8b20-616e8f355dbe","resolution":{"observed_at":"2026-08-06T20:11:36.542879Z","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-06T20:11:36.527014Z","title":"This can be done using a single C nX gate by Lemma 1 as they differ by one bit","venue":null,"work_id":"e38bc94a-1c43-4684-bf18-9eceacbd6ca7","year":null},"citing_paper":{"arxiv_id":"2507.03714","last_updated":"2025-07-26T05:21:16Z","snapshot_observed_at":"2026-08-13T02:07:38.729270Z","submitted_at":"2025-07-04T17:05:07Z","title":"Efficient Quantum Access Model for Sparse Structured Matrices using Linear Combination of Things","version":2},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-06T20:11:36.109696Z"},"links":{"citing_paper":"/paper/2507.03714"},"observation_digest":"sha256:c8be52bf5650cd8749167f4badd85c93c6afaec486956996b31d26e45c6498a2","observation_id":"8f44d0ef-0b68-4d4e-ab75-0e537c9b78ff","resolution":{"observed_at":"2026-08-06T20:11:36.529284Z","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-06T20:11:36.520162Z","title":"These rows differ by k bits and require 2( k − 1)+1 C nX gates by induction hypothesis","venue":null,"work_id":"89e6e814-8ee7-47f5-a877-dc9477d34226","year":null},"citing_paper":{"arxiv_id":"2507.03714","last_updated":"2025-07-26T05:21:16Z","snapshot_observed_at":"2026-08-13T02:07:38.729270Z","submitted_at":"2025-07-04T17:05:07Z","title":"Efficient Quantum Access Model for Sparse Structured Matrices using Linear Combination of Things","version":2},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-06T20:11:36.111717Z"},"links":{"citing_paper":"/paper/2507.03714"},"observation_digest":"sha256:8dc396d9c36e77febcb68bd6b2a1a5eb60b760dd347d767d5b6d10498fbede41","observation_id":"9b297c4d-c795-4116-9476-21bc652523f4","resolution":{"observed_at":"2026-08-06T20:11:36.522469Z","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-06T20:11:36.442886Z","title":"Ef- ficient variational quantum linear solver for structured sparse matrices","venue":null,"work_id":"f3e9a60e-132a-4527-899b-579dcde8be06","year":2024},"citing_paper":{"arxiv_id":"2507.03714","last_updated":"2025-07-26T05:21:16Z","snapshot_observed_at":"2026-08-13T02:07:38.729270Z","submitted_at":"2025-07-04T17:05:07Z","title":"Efficient Quantum Access Model for Sparse Structured Matrices using Linear Combination of Things","version":2},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-06T20:11:36.138329Z"},"links":{"citing_paper":"/paper/2507.03714"},"observation_digest":"sha256:c000c114c835618a76f024f0762641c5bc9b1b95f67f6c72b8bdb5490a76db47","observation_id":"6c2f1421-2a64-4dcd-b3fd-8c8002e26238","resolution":{"observed_at":"2026-08-06T20:11:36.445146Z","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-06T20:11:36.507073Z","title":"The variational quan- tum eigensolver: a review of methods and best practices","venue":null,"work_id":"2327bfc7-c5d3-4f46-b389-b063160baeeb","year":2022},"citing_paper":{"arxiv_id":"2507.03714","last_updated":"2025-07-26T05:21:16Z","snapshot_observed_at":"2026-08-13T02:07:38.729270Z","submitted_at":"2025-07-04T17:05:07Z","title":"Efficient Quantum Access Model for Sparse Structured Matrices using Linear Combination of Things","version":2},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-06T20:11:36.115636Z"},"links":{"citing_paper":"/paper/2507.03714"},"observation_digest":"sha256:bb515a63a4060cfede66e6fc8a403137f544fbca41ae21132423c6affa27dfb9","observation_id":"851085ef-dfdf-4840-8bd6-4cd91bd73e1a","resolution":{"observed_at":"2026-08-06T20:11:36.509590Z","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-06T20:11:36.117665Z","title":"Variational quantum linear solver","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2507.03714","last_updated":"2025-07-26T05:21:16Z","snapshot_observed_at":"2026-08-13T02:07:38.729270Z","submitted_at":"2025-07-04T17:05:07Z","title":"Efficient Quantum Access Model for Sparse Structured Matrices using Linear Combination of Things","version":2},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-06T20:11:36.117665Z"},"links":{"citing_paper":"/paper/2507.03714"},"observation_digest":"sha256:12c1a6c5cedfb825baf47dc301d6c5c165710497749f5a644ec5264e2a16e86d","observation_id":"c144596c-5025-4aec-8a23-040ef0f5d801","resolution":{"observed_at":"2026-08-06T20:11:36.117665Z","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-06T20:11:36.496730Z","title":"Qubitization of arbitrary basis quantum chem- istry leveraging sparsity and low rank factor- ization","venue":null,"work_id":"3f769402-e134-4ed4-bbfc-2103bea5a2da","year":2019},"citing_paper":{"arxiv_id":"2507.03714","last_updated":"2025-07-26T05:21:16Z","snapshot_observed_at":"2026-08-13T02:07:38.729270Z","submitted_at":"2025-07-04T17:05:07Z","title":"Efficient Quantum Access Model for Sparse Structured Matrices using Linear Combination of Things","version":2},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-06T20:11:36.119660Z"},"links":{"citing_paper":"/paper/2507.03714"},"observation_digest":"sha256:b02205e09fca5070eddb16fdc2ef37af858e150a99516caa1873a0d6de4b0e96","observation_id":"59699c7e-c270-4656-bf7a-455cd4492605","resolution":{"observed_at":"2026-08-06T20:11:36.499056Z","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-06T20:11:36.490796Z","title":"Hamil- tonian simulation by qubitization","venue":null,"work_id":"68674fe1-d7c0-47b5-83ac-9f6e07f5c77d","year":2019},"citing_paper":{"arxiv_id":"2507.03714","last_updated":"2025-07-26T05:21:16Z","snapshot_observed_at":"2026-08-13T02:07:38.729270Z","submitted_at":"2025-07-04T17:05:07Z","title":"Efficient Quantum Access Model for Sparse Structured Matrices using Linear Combination of Things","version":2},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-06T20:11:36.121729Z"},"links":{"citing_paper":"/paper/2507.03714"},"observation_digest":"sha256:d67cb167d411cf929e2829a54459c88f44363e045332c7cee9356fa74ff87e41","observation_id":"93e1ca36-48f0-4065-8e13-31a4b37307f8","resolution":{"observed_at":"2026-08-06T20:11:36.492988Z","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-06T20:11:36.484406Z","title":"Quan- tum signal processing","venue":null,"work_id":"ef9a6321-9678-4576-906a-e350965110f4","year":2002},"citing_paper":{"arxiv_id":"2507.03714","last_updated":"2025-07-26T05:21:16Z","snapshot_observed_at":"2026-08-13T02:07:38.729270Z","submitted_at":"2025-07-04T17:05:07Z","title":"Efficient Quantum Access Model for Sparse Structured Matrices using Linear Combination of Things","version":2},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-06T20:11:36.123678Z"},"links":{"citing_paper":"/paper/2507.03714"},"observation_digest":"sha256:a34b6b938d714592f5ecf5c2eb5494cdc8f6c0f8811160757372338fdbccf231","observation_id":"1c0d66d0-fd63-4b30-b8d9-ba11ffdfa753","resolution":{"observed_at":"2026-08-06T20:11:36.486910Z","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-06T20:11:36.478366Z","title":"Quantum singular value transformation and beyond: exponential im- provements for quantum matrix arithmetics","venue":null,"work_id":"62a95db6-8200-46f2-bf5c-95369500781b","year":2019},"citing_paper":{"arxiv_id":"2507.03714","last_updated":"2025-07-26T05:21:16Z","snapshot_observed_at":"2026-08-13T02:07:38.729270Z","submitted_at":"2025-07-04T17:05:07Z","title":"Efficient Quantum Access Model for Sparse Structured Matrices using Linear Combination of Things","version":2},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-06T20:11:36.125690Z"},"links":{"citing_paper":"/paper/2507.03714"},"observation_digest":"sha256:aa641a4980b6e3615eb4b4373271be60a74d593be21dfc768f2138f115bf47a0","observation_id":"df6614d4-80b0-424a-8a46-63a7ecb39fa6","resolution":{"observed_at":"2026-08-06T20:11:36.480583Z","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-06T20:11:36.472692Z","title":"The theory of variational hybrid quantum-classical algo- rithms","venue":null,"work_id":"23b29727-cc9b-4cac-a204-912b36418316","year":2016},"citing_paper":{"arxiv_id":"2507.03714","last_updated":"2025-07-26T05:21:16Z","snapshot_observed_at":"2026-08-13T02:07:38.729270Z","submitted_at":"2025-07-04T17:05:07Z","title":"Efficient Quantum Access Model for Sparse Structured Matrices using Linear Combination of Things","version":2},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-06T20:11:36.127893Z"},"links":{"citing_paper":"/paper/2507.03714"},"observation_digest":"sha256:78e651dcb2a4b09b3966e26459b1c3f4b615c7ea2887c32d8f993ea49ef734a4","observation_id":"869d633d-083b-4750-9eab-e444819d7ddf","resolution":{"observed_at":"2026-08-06T20:11:36.474807Z","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-06T20:11:36.533565Z","title":"easy” to implement, i.e., simple unitaries with low- depth circuits, can be added to the Sigma ba- sis. This flexibility makes our approach truly a linear combination on “things","venue":null,"work_id":"85c09902-fda3-48d4-aa99-263d0b36dd59","year":null},"citing_paper":{"arxiv_id":"2507.03714","last_updated":"2025-07-26T05:21:16Z","snapshot_observed_at":"2026-08-13T02:07:38.729270Z","submitted_at":"2025-07-04T17:05:07Z","title":"Efficient Quantum Access Model for Sparse Structured Matrices using Linear Combination of Things","version":2},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-06T20:11:36.107656Z"},"links":{"citing_paper":"/paper/2507.03714"},"observation_digest":"sha256:356a52207de13bedb953933c26193533b485aced809503eec5a4effc9d4b04aa","observation_id":"1765015d-c931-4a33-b12a-0c76cdfd4e69","resolution":{"observed_at":"2026-08-06T20:11:36.536293Z","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-06T20:11:36.466785Z","title":"Application of fermionic marginal constraints to hybrid quantum algorithms","venue":null,"work_id":"ce06f856-3e0d-4200-97b7-ecf545448e00","year":2018},"citing_paper":{"arxiv_id":"2507.03714","last_updated":"2025-07-26T05:21:16Z","snapshot_observed_at":"2026-08-13T02:07:38.729270Z","submitted_at":"2025-07-04T17:05:07Z","title":"Efficient Quantum Access Model for Sparse Structured Matrices using Linear Combination of Things","version":2},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-06T20:11:36.129942Z"},"links":{"citing_paper":"/paper/2507.03714"},"observation_digest":"sha256:d57721bab518565fcdd778d132f2fa073c09b8a09123c9de362a2098d0738509","observation_id":"2e50b3f2-6bae-4d1f-8a76-f174119c469c","resolution":{"observed_at":"2026-08-06T20:11:36.468898Z","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-06T20:11:36.460767Z","title":"Predicting many properties of a quan- tum system from very few measurements","venue":null,"work_id":"7bbc25ed-96e6-4df5-9ea5-2493421fce0f","year":2020},"citing_paper":{"arxiv_id":"2507.03714","last_updated":"2025-07-26T05:21:16Z","snapshot_observed_at":"2026-08-13T02:07:38.729270Z","submitted_at":"2025-07-04T17:05:07Z","title":"Efficient Quantum Access Model for Sparse Structured Matrices using Linear Combination of Things","version":2},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-06T20:11:36.131900Z"},"links":{"citing_paper":"/paper/2507.03714"},"observation_digest":"sha256:e03eb4107b5c112b8b63e5c96bb95b7e38a8fc6e62eed4cf1a31d468465abac4","observation_id":"0b116337-d878-4036-a161-6dde0dc39a54","resolution":{"observed_at":"2026-08-06T20:11:36.463127Z","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-06T20:11:36.454618Z","title":"Precise mea- surement of quantum observables with neural- network estimators","venue":null,"work_id":"9d4679e9-0d0c-42ed-a6f0-c286b9ff204e","year":2020},"citing_paper":{"arxiv_id":"2507.03714","last_updated":"2025-07-26T05:21:16Z","snapshot_observed_at":"2026-08-13T02:07:38.729270Z","submitted_at":"2025-07-04T17:05:07Z","title":"Efficient Quantum Access Model for Sparse Structured Matrices using Linear Combination of Things","version":2},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-06T20:11:36.134316Z"},"links":{"citing_paper":"/paper/2507.03714"},"observation_digest":"sha256:4f4885ed372228179902e2babf55ab97a904fdd9ef92786a6a41827992e57e66","observation_id":"bf30b98f-cb95-4cc1-94ef-ea7ca4515cb1","resolution":{"observed_at":"2026-08-06T20:11:36.457021Z","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-06T20:11:36.448783Z","title":"Variational quantum algorithm 22 for the poisson equation","venue":null,"work_id":"72db230f-c024-4b36-be6a-f4b746956076","year":2021},"citing_paper":{"arxiv_id":"2507.03714","last_updated":"2025-07-26T05:21:16Z","snapshot_observed_at":"2026-08-13T02:07:38.729270Z","submitted_at":"2025-07-04T17:05:07Z","title":"Efficient Quantum Access Model for Sparse Structured Matrices using Linear Combination of Things","version":2},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-06T20:11:36.136488Z"},"links":{"citing_paper":"/paper/2507.03714"},"observation_digest":"sha256:d619447afc801c0eb8d0d52fe875737ba69b978603a23ed88df4fadf6536ca0f","observation_id":"1b5dfeee-3d3d-4a65-a8c6-21ec7c9078f1","resolution":{"observed_at":"2026-08-06T20:11:36.450981Z","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-06T20:11:36.436942Z","title":"Quan- tum computation and quantum information","venue":null,"work_id":"fa405a60-8a31-4837-b64b-121720c9a8dc","year":2010},"citing_paper":{"arxiv_id":"2507.03714","last_updated":"2025-07-26T05:21:16Z","snapshot_observed_at":"2026-08-13T02:07:38.729270Z","submitted_at":"2025-07-04T17:05:07Z","title":"Efficient Quantum Access Model for Sparse Structured Matrices using Linear Combination of Things","version":2},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-06T20:11:36.140652Z"},"links":{"citing_paper":"/paper/2507.03714"},"observation_digest":"sha256:d176d8f6fb2e81241498646bcdeaeaabe0f7b398abf5b97675f351503933576b","observation_id":"a14b5e01-884d-4f9f-b8fe-44f0e317d5e0","resolution":{"observed_at":"2026-08-06T20:11:36.439229Z","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-06T20:11:36.431187Z","title":"Tensorized pauli decomposi- tion algorithm","venue":null,"work_id":"2021bcd8-36d1-4bcf-b769-8b4b2d2a411d","year":2024},"citing_paper":{"arxiv_id":"2507.03714","last_updated":"2025-07-26T05:21:16Z","snapshot_observed_at":"2026-08-13T02:07:38.729270Z","submitted_at":"2025-07-04T17:05:07Z","title":"Efficient Quantum Access Model for Sparse Structured Matrices using Linear Combination of Things","version":2},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-06T20:11:36.142535Z"},"links":{"citing_paper":"/paper/2507.03714"},"observation_digest":"sha256:0f478e4d7d5358f4ca94d79dab2e904db3a438a141511ea50308897e014dab0f","observation_id":"4ecf5d0b-c3a7-4c6c-89fd-6692c3fb48de","resolution":{"observed_at":"2026-08-06T20:11:36.433251Z","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-06T20:11:36.425294Z","title":"Efficient quan- tum algorithm for dissipative nonlinear differ- ential equations","venue":null,"work_id":"567ded63-52f7-4cca-b81e-e329ff0c8e08","year":2021},"citing_paper":{"arxiv_id":"2507.03714","last_updated":"2025-07-26T05:21:16Z","snapshot_observed_at":"2026-08-13T02:07:38.729270Z","submitted_at":"2025-07-04T17:05:07Z","title":"Efficient Quantum Access Model for Sparse Structured Matrices using Linear Combination of Things","version":2},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-06T20:11:36.144657Z"},"links":{"citing_paper":"/paper/2507.03714"},"observation_digest":"sha256:84567f801289abd282af50662ae6063cf3077189f080bd5e63080b0f2631e0af","observation_id":"b30bcd9f-c1c7-4208-810a-0e6378430ca9","resolution":{"observed_at":"2026-08-06T20:11:36.427560Z","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-06T20:11:36.419093Z","title":"Po- tential quantum advantage for simulation of fluid dynamics","venue":null,"work_id":"ddd74b31-0bb7-418f-9d27-ebf4f7a12e4a","year":2025},"citing_paper":{"arxiv_id":"2507.03714","last_updated":"2025-07-26T05:21:16Z","snapshot_observed_at":"2026-08-13T02:07:38.729270Z","submitted_at":"2025-07-04T17:05:07Z","title":"Efficient Quantum Access Model for Sparse Structured Matrices using Linear Combination of Things","version":2},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-06T20:11:36.146872Z"},"links":{"citing_paper":"/paper/2507.03714"},"observation_digest":"sha256:937ee0c03fa6707c924319d10e72f636a680f68363007ea9a637f149da53c945","observation_id":"2b5d878e-9a13-4db8-8ffe-94306a8f79b7","resolution":{"observed_at":"2026-08-06T20:11:36.421418Z","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-06T20:11:36.413455Z","title":"Variational quantum solutions to the advection–diffusion equation for applications in fluid dynamics","venue":null,"work_id":"e720ff12-c0c4-46ac-a623-bdf34624f402","year":2022},"citing_paper":{"arxiv_id":"2507.03714","last_updated":"2025-07-26T05:21:16Z","snapshot_observed_at":"2026-08-13T02:07:38.729270Z","submitted_at":"2025-07-04T17:05:07Z","title":"Efficient Quantum Access Model for Sparse Structured Matrices using Linear Combination of Things","version":2},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-06T20:11:36.148784Z"},"links":{"citing_paper":"/paper/2507.03714"},"observation_digest":"sha256:280e91c07a93b8ca834f61ed65f0bcf37ea6b67e0833c992b61aff0c3579b0f2","observation_id":"8ceec6b2-4ad4-48c3-bcf9-8d4ff888a852","resolution":{"observed_at":"2026-08-06T20:11:36.415610Z","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-06T20:11:36.407580Z","title":"An efficient quantum algorithm for simulating polynomial dynamical systems","venue":null,"work_id":"8c44c4e6-10c4-4ee1-9f31-f40bacfdedfa","year":2024},"citing_paper":{"arxiv_id":"2507.03714","last_updated":"2025-07-26T05:21:16Z","snapshot_observed_at":"2026-08-13T02:07:38.729270Z","submitted_at":"2025-07-04T17:05:07Z","title":"Efficient Quantum Access Model for Sparse Structured Matrices using Linear Combination of Things","version":2},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-06T20:11:36.150703Z"},"links":{"citing_paper":"/paper/2507.03714"},"observation_digest":"sha256:8fc0f734821d08c1e3a5c03d78e1572e67ead6d998cf4ef97ebe23617f6e98e4","observation_id":"b159cacb-edc4-46dc-b841-c8935e6ee365","resolution":{"observed_at":"2026-08-06T20:11:36.409917Z","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-06T20:11:36.401725Z","title":"Variational quantum framework for nonlinear pde constrained optimization us- ing carleman linearization","venue":null,"work_id":"a9090f8f-13f7-47c4-8b5d-3289336b66e0","year":2025},"citing_paper":{"arxiv_id":"2507.03714","last_updated":"2025-07-26T05:21:16Z","snapshot_observed_at":"2026-08-13T02:07:38.729270Z","submitted_at":"2025-07-04T17:05:07Z","title":"Efficient Quantum Access Model for Sparse Structured Matrices using Linear Combination of Things","version":2},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-06T20:11:36.152530Z"},"links":{"citing_paper":"/paper/2507.03714"},"observation_digest":"sha256:2effd4dfa273e3956c4d1ba6028bc5c4fd110374a579d367187ddcc47fc2ec9e","observation_id":"f822874f-d245-4e2f-b4bb-6e546491045b","resolution":{"observed_at":"2026-08-06T20:11:36.403903Z","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":"2505.00285","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T20:11:36.333209Z","title":"An efficient decomposition of the carleman linearized burgers’ equation","venue":null,"work_id":"27429543-88f5-4087-b0c3-9864c5de46c8","year":2025},"citing_paper":{"arxiv_id":"2507.03714","last_updated":"2025-07-26T05:21:16Z","snapshot_observed_at":"2026-08-13T02:07:38.729270Z","submitted_at":"2025-07-04T17:05:07Z","title":"Efficient Quantum Access Model for Sparse Structured Matrices using Linear Combination of Things","version":2},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-06T20:11:36.154822Z"},"links":{"citing_paper":"/paper/2507.03714"},"observation_digest":"sha256:e9e6ded600f8b42aed76d68dae41a0b0c76327f1261aac42fd237495a34b1f68","observation_id":"93526065-f240-49b7-829c-505b5592ac06","resolution":{"observed_at":"2026-08-06T20:11:36.339374Z","resolver_source":"raw_fallback","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-06T20:11:36.395755Z","title":null,"venue":null,"work_id":"d90b4329-6188-47e7-bfc3-dc285299984e","year":2006},"citing_paper":{"arxiv_id":"2507.03714","last_updated":"2025-07-26T05:21:16Z","snapshot_observed_at":"2026-08-13T02:07:38.729270Z","submitted_at":"2025-07-04T17:05:07Z","title":"Efficient Quantum Access Model for Sparse Structured Matrices using Linear Combination of Things","version":2},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-06T20:11:36.156752Z"},"links":{"citing_paper":"/paper/2507.03714"},"observation_digest":"sha256:7db91de0ae9feec443fe75bb965c6da7355287f9591981028590facbbe48f22d","observation_id":"c9e057ec-c595-4908-ad82-ccfa0c88033a","resolution":{"observed_at":"2026-08-06T20:11:36.397770Z","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":{"arxiv_id":"2402.05053","last_updated":"2024-02-07T17:53:21Z","snapshot_observed_at":"2026-08-16T14:20:30.800283Z","submitted_at":"2024-02-07T17:53:21Z","title":"Quantum circuit for multi-qubit Toffoli gate with optimal resource","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.05053","snapshot_observed_at":"2026-08-06T20:11:36.158938Z","title":"Quantum circuit for multi-qubit toffoli gate with optimal resource","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2507.03714","last_updated":"2025-07-26T05:21:16Z","snapshot_observed_at":"2026-08-13T02:07:38.729270Z","submitted_at":"2025-07-04T17:05:07Z","title":"Efficient Quantum Access Model for Sparse Structured Matrices using Linear Combination of Things","version":2},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-06T20:11:36.158938Z"},"links":{"cited_paper":"/paper/2402.05053","citing_paper":"/paper/2507.03714"},"observation_digest":"sha256:a72d4f6a91ad6c9065fc5062b07f16c06393b0837f03f9389a5fd1bd17b5a990","observation_id":"787a62ec-0a5f-4da9-9b14-0b8aa9b3ccbe","resolution":{"observed_at":"2026-08-06T20:11:36.158938Z","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-06T20:11:36.389727Z","title":"N-body interactions between trapped ion qubits via spin-dependent squeezing","venue":null,"work_id":"47f5ea3e-2ac1-43f7-9bc6-a8bd348756d2","year":2022},"citing_paper":{"arxiv_id":"2507.03714","last_updated":"2025-07-26T05:21:16Z","snapshot_observed_at":"2026-08-13T02:07:38.729270Z","submitted_at":"2025-07-04T17:05:07Z","title":"Efficient Quantum Access Model for Sparse Structured Matrices using Linear Combination of Things","version":2},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-06T20:11:36.161498Z"},"links":{"citing_paper":"/paper/2507.03714"},"observation_digest":"sha256:4a61845a01398fbf103c756de5a682a4bbc81196a9fa4d1cd54b0703b202bd72","observation_id":"c72b564c-3783-4ab5-b2fd-013102d04fcb","resolution":{"observed_at":"2026-08-06T20:11:36.392046Z","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-06T20:11:36.383851Z","title":"Lecture notes on quantum algorithms for scientific computation, 2022","venue":null,"work_id":"948f9059-e7c7-444f-b462-b697626c870c","year":2022},"citing_paper":{"arxiv_id":"2507.03714","last_updated":"2025-07-26T05:21:16Z","snapshot_observed_at":"2026-08-13T02:07:38.729270Z","submitted_at":"2025-07-04T17:05:07Z","title":"Efficient Quantum Access Model for Sparse Structured Matrices using Linear Combination of Things","version":2},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-06T20:11:36.163553Z"},"links":{"citing_paper":"/paper/2507.03714"},"observation_digest":"sha256:7e1dd4d37e25b02c9f9154da68be5d2e6b3e8bda5c934b29b976a13c54fe8b09","observation_id":"11035748-4f63-4ab3-8c7a-b64b6b3d8290","resolution":{"observed_at":"2026-08-06T20:11:36.385957Z","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-06T20:11:36.377699Z","title":"Fable: Fast approximate quantum circuits for block- encodings","venue":null,"work_id":"594c2fb1-41ad-4137-afb5-bbddaafdad4a","year":2022},"citing_paper":{"arxiv_id":"2507.03714","last_updated":"2025-07-26T05:21:16Z","snapshot_observed_at":"2026-08-13T02:07:38.729270Z","submitted_at":"2025-07-04T17:05:07Z","title":"Efficient Quantum Access Model for Sparse Structured Matrices using Linear Combination of Things","version":2},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-06T20:11:36.165417Z"},"links":{"citing_paper":"/paper/2507.03714"},"observation_digest":"sha256:2c7a44c73f266d09d87b0b703cf629607c38ec73b83d0df84827e013826e306c","observation_id":"575bf85a-eba4-4ea7-bcc6-3504ff19e41a","resolution":{"observed_at":"2026-08-06T20:11:36.379856Z","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-06T20:11:36.371067Z","title":"Explicit quantum circuits for block encodings of certain sparse matrices","venue":null,"work_id":"bac63288-dd51-4310-a411-e833607efbf2","year":2024},"citing_paper":{"arxiv_id":"2507.03714","last_updated":"2025-07-26T05:21:16Z","snapshot_observed_at":"2026-08-13T02:07:38.729270Z","submitted_at":"2025-07-04T17:05:07Z","title":"Efficient Quantum Access Model for Sparse Structured Matrices using Linear Combination of Things","version":2},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-06T20:11:36.167377Z"},"links":{"citing_paper":"/paper/2507.03714"},"observation_digest":"sha256:6d5ef42bea5b157555d8ca4d37a16678c3aefd387218b9e78a87586ec590bad8","observation_id":"d8024873-ea21-411d-a40e-7a14454a6e47","resolution":{"observed_at":"2026-08-06T20:11:36.373382Z","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-06T20:11:36.364326Z","title":"Block-encoding structured ma- trices for data input in quantum computing","venue":null,"work_id":"a854610c-626e-4326-a929-c836fa5a821e","year":2024},"citing_paper":{"arxiv_id":"2507.03714","last_updated":"2025-07-26T05:21:16Z","snapshot_observed_at":"2026-08-13T02:07:38.729270Z","submitted_at":"2025-07-04T17:05:07Z","title":"Efficient Quantum Access Model for Sparse Structured Matrices using Linear Combination of Things","version":2},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-06T20:11:36.169225Z"},"links":{"citing_paper":"/paper/2507.03714"},"observation_digest":"sha256:5995cdea986d2b7eff9364a90562040334c7a127a1fb2036755c17129c3fa799","observation_id":"c156e3cd-1159-4d52-a232-bea4f8cc55bc","resolution":{"observed_at":"2026-08-06T20:11:36.366744Z","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-06T20:11:36.357755Z","title":"Quantum signal processing and singular value transformation: Lecture 1, 2023","venue":null,"work_id":"84608029-137d-4a0e-b409-ed5c45ed8dbf","year":2023},"citing_paper":{"arxiv_id":"2507.03714","last_updated":"2025-07-26T05:21:16Z","snapshot_observed_at":"2026-08-13T02:07:38.729270Z","submitted_at":"2025-07-04T17:05:07Z","title":"Efficient Quantum Access Model for Sparse Structured Matrices using Linear Combination of Things","version":2},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-06T20:11:36.171110Z"},"links":{"citing_paper":"/paper/2507.03714"},"observation_digest":"sha256:0c61229509e139d4274d6c2a8682806cbe46cfa5a418af5e9d465c9f00e5bed7","observation_id":"59ae6b43-9594-4c50-a464-380625dcd6d7","resolution":{"observed_at":"2026-08-06T20:11:36.360093Z","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-06T20:11:36.350625Z","title":"Circuit com- plexity of quantum access models for encod- ing classical data","venue":null,"work_id":"54ccb256-d747-4afb-bb87-fbe323a3668e","year":2024},"citing_paper":{"arxiv_id":"2507.03714","last_updated":"2025-07-26T05:21:16Z","snapshot_observed_at":"2026-08-13T02:07:38.729270Z","submitted_at":"2025-07-04T17:05:07Z","title":"Efficient Quantum Access Model for Sparse Structured Matrices using Linear Combination of Things","version":2},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-06T20:11:36.172947Z"},"links":{"citing_paper":"/paper/2507.03714"},"observation_digest":"sha256:b6590f379ab59a8477b1712588ee4ef8bedbee0e2cc4f685c2f2e2166bdf9d85","observation_id":"4e472312-fe76-455b-8a44-8a4dbe8014be","resolution":{"observed_at":"2026-08-06T20:11:36.353126Z","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-06T20:11:36.343840Z","title":"On unitary dilations of contrac- tions","venue":null,"work_id":"5e5f2e4b-85d2-408d-9a89-505a1be19142","year":1955},"citing_paper":{"arxiv_id":"2507.03714","last_updated":"2025-07-26T05:21:16Z","snapshot_observed_at":"2026-08-13T02:07:38.729270Z","submitted_at":"2025-07-04T17:05:07Z","title":"Efficient Quantum Access Model for Sparse Structured Matrices using Linear Combination of Things","version":2},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-06T20:11:36.174799Z"},"links":{"citing_paper":"/paper/2507.03714"},"observation_digest":"sha256:5ebb26cde256df0b2982c6c781452d56120e97d5c36179d7ca223a7cad10ec5f","observation_id":"75a731f3-6fa2-4991-8d41-2f2cfd58a02e","resolution":{"observed_at":"2026-08-06T20:11:36.346346Z","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":"2405.16651","last_updated":"2024-06-10T22:15:11Z","snapshot_observed_at":"2026-08-16T13:49:17.193177Z","submitted_at":"2024-05-26T18:06:43Z","title":"Variational Quantum Framework for Partial Differential Equation Constrained Optimization","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2405.16651","snapshot_observed_at":"2026-08-06T20:11:36.176763Z","title":"Variational quantum framework for partial differential equation constrained optimization","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2507.03714","last_updated":"2025-07-26T05:21:16Z","snapshot_observed_at":"2026-08-13T02:07:38.729270Z","submitted_at":"2025-07-04T17:05:07Z","title":"Efficient Quantum Access Model for Sparse Structured Matrices using Linear Combination of Things","version":2},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-06T20:11:36.176763Z"},"links":{"cited_paper":"/paper/2405.16651","citing_paper":"/paper/2507.03714"},"observation_digest":"sha256:e37941fa4346332e8b21876ad655e06e26d0c1f0fab45959744b2a7e24b9d918","observation_id":"9c5a8082-bd97-4cde-b0c9-4373135e1ea3","resolution":{"observed_at":"2026-08-06T20:11:36.176763Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2507.03714","last_updated":"2025-07-26T05:21:16Z","latest_version":2,"primary_category":"quant-ph","snapshot_observed_at":"2026-08-13T02:07:38.729270Z","submitted_at":"2025-07-04T17:05:07Z","title":"Efficient Quantum Access Model for Sparse Structured Matrices using Linear Combination of Things"},"reference_resolution":{"displayed":43,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":6,"verified_exact":1,"verified_fuzzy":36},"total_outbound_references":43},"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 19 August 2026, this Paper Citation Record lists 43 of 43 outbound references and 1 inbound Pith citation observation for arXiv:2507.03714."}