{"as_of":"2026-08-10T20:28:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:6ac318cd507da9fbc0c8bbbcce53a6428accb032f46f2299b09f33225bc8620f","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-10T06:31:04.303077+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-09T21:41:34.823045Z","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-08T10:09:30.212073Z","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:9ed22286ae434aad86b12893dd278ee48e9139f8df66949b10909fd99c71a58a","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-09T21:41:34.823045Z","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:6ea852c7d9f9b84e93b012e7686c5f831ac2e342389b373e18e57723b3fff68f","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T21:41:34.823045Z","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:dba17e0c444d15433cf9e52d378292f1826b7749601c91c8a89f161c40e172e8","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T21:41:34.823045Z","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:40e138bb8c6671d380d97df1f95bf0170d422d989b49cdb4cef6c351be81d9f7","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T21:41:34.823045Z","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:76169f4983c4bb8ccc84f6f3a91066173690c70b06b5eb241f41e98974ed597e","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T21:41:34.823045Z","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:763eb56bad2379b349df996029f2a497061d1053217ae132c452d220db067b53","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T21:41:34.823045Z","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:b8dfa95221dc05fa2ac74a49d39485b2be38855764a3cb62495a0b3fbadfc596","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T21:41:34.823045Z","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:bad833e179634994c3170ddb9117a56c468751893283269d0367848757b4e066","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T21:41:34.823045Z","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:c1b302156e95a161b79e6748a688acdc08f5e84e5cfe23c708a0c866e076dd27","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T21:41:34.823045Z","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:b1a68ac349ceb02944fa7b8884fa10595a494b74da19ca310ce4ae2b018504a9","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T21:41:34.823045Z","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:323162da2360bfd56f18f4a4a587fcaf240afcf24bd976f4a3411799678871a0","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T21:41:34.823045Z","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:a201c6b67010961808c5efe3ab2133e3023fcdeb04a980fe534881ab8cbe85af","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T21:41:34.823045Z","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:df04095c3ab423f532f66c825b599735f1efa830a4741eeabf0d39ddf40a6f6f","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T21:41:34.823045Z","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:8bc27e5f1e372f000921a1e5d03fcfbedf76f0e630879842d65dd7dbc28b556d","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T21:41:34.823045Z","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:196e79398c915db4b96412d8c9ef20d08cb71796101d8f1c5b3a5b28d2f5f8bc","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-09T21:41:34.823045Z","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:ae0459048a4a48b168188d0460672da3f2765c2bd5f8c1fa179a6da678123a50","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T21:41:34.823045Z","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:761ab35affccfdc12162037dba1778a8c8ad5fa7799960de8dad50bce51f0f50","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T21:41:34.823045Z","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:7c3a2da1c95ffc96208be4c653f5d3ad966a18df30f58b9f88af0a2cb40a38a7","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T21:41:34.823045Z","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:69a994fcc712537385e7b1fcf3c79fbffe8a076092068ca196942fc026154208","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T21:41:34.823045Z","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:9aaa5cb64496b31f6b9b09990a6797336aa7b600394e54ba52a3c7bfe4ee748a","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T21:41:34.823045Z","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:2a9e03cda4e050812e8819f3915e859adad9e259190d0124019ff373f5ecdec8","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T21:41:34.823045Z","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:46ad81772f074a5672f269aee9386a3abfb12a0901d98c7edb9166b7300a1d56","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T21:41:34.823045Z","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:e3d58bb399f1ccd0aa53b625485f30121317deb07b4695194ed4ff5a6a5693c0","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T21:41:34.823045Z","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:54957386a0b1583977b3f564f61e5f0d280068f1fab6e794f3ccc52d0a77fc3a","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T21:41:34.823045Z","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:2178405064a16cef683aee700dd50e56d21330bbe49c08fb837fd0cea0ad8d88","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T21:41:34.823045Z","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:a50a5ccb3b8d2a88927dda2c7dde03f28a4976ba0f604882d6abde9875b8cf57","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T21:41:34.823045Z","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:7327e9094b0eacf49416bb4a1bf4bd9602a29a0a7dd4dd607c5169f0bb25df20","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T21:41:34.823045Z","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:4841d0ececbad17a8198a73467aadc98fd859e3a85d84b988c0b62ed375fca88","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T21:41:34.823045Z","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:113e0c0a59bbadb65ffe8f34beffb64243f318b938f867697534acd895132dbf","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T21:41:34.823045Z","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:82be1cdfe951877b87b5d22fd1865e966ffc116ab950ba44c31ce1144b093f2b","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T21:41:34.823045Z","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:9086a64ea720b2d0d993cb70fab311b293cf344e4a97402725d6ea55bff9122f","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T21:41:34.823045Z","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:85ebfcaa18cb89b863e0a1a67bb6c8ddc122049dbe4fb199bc8fc5fef773766a","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T21:41:34.823045Z","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:f9b58e454b29d00b94ad8eff482fb26362590d1dfab98b157338f05ff24c618c","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T21:41:34.823045Z","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:f0364b10646859da505a3e1fc3ef566d58cab158790cfede1be3a667a7693805","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T21:40:36.403228Z","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-09T21:41:34.823045Z","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:a9c5f4538a68b8c4b8cee2d17462ed2139f617199592902c6a1dfcbbeb71d327","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-09T21:41:34.823045Z","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:adf4059e65312b065a294dbb32dc86a608e1433b7880d7d71605e62740327c86","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T21:41:34.823045Z","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:6aa7e9e58571ef090222ddcdc439ca4a8f1f7fe0177c7a98daa503b6d55e2503","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T21:41:34.823045Z","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:a254086d75faf935688269039b63199150f3caa41dda2db0630eabf1b603dfe8","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T21:41:34.823045Z","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:9aa4b1464218aed8e74f474951c3488bed5b7933795efea1240bbc946820e9cf","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T21:41:34.823045Z","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:0ae645f47fec8ff1a65525715b1dce89e2d1db5d702dfadd719d4b33700e3a66","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T21:41:34.823045Z","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:b51acce9df97af5ff77ab3e6d37955ec3dd79b2428e9cf0528f65bc902881b3e","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T21:41:34.823045Z","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:949698d0a2b7a406e0e7ceafb8c36c6fdaea3f6013cd786bf0018f366201501d","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-09T21:41:34.823045Z","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:b2e0333bed75b3f74bd3a59949ef319e1efd25d94d8c607d6c8d365142ddfb41","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-10T11:15:43.393581Z","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-09T21:41:34.823045Z","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:4fc8da504ca4bf4ff0ee76aff2b88d3a0748fbb6eac63994ce402e1858425737","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-09T21:41:34.823045Z","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-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"thesis":"As of 10 August 2026, this Paper Citation Record lists 43 of 43 outbound references and 1 inbound Pith citation observation for arXiv:2507.03714."}