{"as_of":"2026-08-21T17:52:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:0f8661b5bc87193d898e0ca209cab5de90827c4557926108f0fc0d7f5e503484","coverage":[{"denominator":0,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":5,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":5,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-21T06:32:19.484+00:00","state":"measured"},{"denominator":5,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":5,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T15:36:01.072923Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-07-02T14:37:03.600347Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2311.03977","last_updated":"2024-10-16T12:11:03Z","snapshot_observed_at":"2026-08-20T07:43:15.101732Z","submitted_at":"2023-11-07T13:26:20Z","title":"A quantum central path algorithm for linear optimization","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2311.03977","snapshot_observed_at":"2026-08-07T15:36:01.072923Z","title":"A quantum central path algorithm for linear optimization","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2505.14670","last_updated":"2025-05-20T17:55:52Z","snapshot_observed_at":"2026-08-17T22:32:25.648910Z","submitted_at":"2025-05-20T17:55:52Z","title":"Quantum Optimization via Gradient-Based Hamiltonian Descent","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-07T15:36:01.072923Z"},"links":{"cited_paper":"/paper/2311.03977","citing_paper":"/paper/2505.14670"},"observation_digest":"sha256:37addb415d2a6301dd2a5a8e4619d85cb8f6f7dc911c25f61f21cb1f52519d53","observation_id":"c66dc0dd-8f9e-477f-8e4e-fd24dbbe26dd","resolution":{"observed_at":"2026-08-07T15:36:01.072923Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2311.03977","last_updated":"2024-10-16T12:11:03Z","snapshot_observed_at":"2026-08-20T07:43:15.101732Z","submitted_at":"2023-11-07T13:26:20Z","title":"A quantum central path algorithm for linear optimization","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2311.03977","snapshot_observed_at":"2026-08-06T19:57:36.875885Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2507.04438","last_updated":"2025-07-06T15:52:37Z","snapshot_observed_at":"2026-08-18T09:28:36.348797Z","submitted_at":"2025-07-06T15:52:37Z","title":"Quantum Algorithms for Bandits with Knapsacks with Improved Regret and Time Complexities","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-06T19:57:36.875885Z"},"links":{"cited_paper":"/paper/2311.03977","citing_paper":"/paper/2507.04438"},"observation_digest":"sha256:bd5f9fa41d8420bf037e881e1f2c8ffb9c931d567199fdbc89c440645137c14e","observation_id":"642124cf-93f1-4751-b970-3a4440b17d37","resolution":{"observed_at":"2026-08-06T19:57:36.875885Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2311.03977","last_updated":"2024-10-16T12:11:03Z","snapshot_observed_at":"2026-08-20T07:43:15.101732Z","submitted_at":"2023-11-07T13:26:20Z","title":"A quantum central path algorithm for linear optimization","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2311.03977","snapshot_observed_at":"2026-08-06T15:48:50.932546Z","title":"Augustino, J","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2507.15424","last_updated":"2025-07-21T09:24:49Z","snapshot_observed_at":"2026-08-15T08:27:19.538644Z","submitted_at":"2025-07-21T09:24:49Z","title":"Stochastic Quantum Hamiltonian Descent","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-06T15:48:50.932546Z"},"links":{"cited_paper":"/paper/2311.03977","citing_paper":"/paper/2507.15424"},"observation_digest":"sha256:8878b76dfe7c72e3c300c53105bbe808485076bb139b4414f7b624d8e5df79ef","observation_id":"df66f52e-40cf-423e-a1e6-33671d78b49e","resolution":{"observed_at":"2026-08-06T15:48:50.932546Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2311.03977","last_updated":"2024-10-16T12:11:03Z","snapshot_observed_at":"2026-08-20T07:43:15.101732Z","submitted_at":"2023-11-07T13:26:20Z","title":"A quantum central path algorithm for linear optimization","version":2},"cited_work":{"arxiv_id":"2311.03977","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2311.03977","snapshot_observed_at":"2026-07-02T14:37:03.600347Z","title":"Augustino, J","venue":null,"work_id":"60ae3267-8435-46cd-b30c-477364d71318","year":2023},"citing_paper":{"arxiv_id":"2604.11825","last_updated":"2026-04-11T11:37:24Z","snapshot_observed_at":"2026-07-06T23:00:08.171601Z","submitted_at":"2026-04-11T11:37:24Z","title":"Quantum algorithms for Young measures: applications to nonlinear partial differential equations","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-05-10T16:07:57.846989Z"},"links":{"cited_paper":"/paper/2311.03977","citing_paper":"/paper/2604.11825"},"observation_digest":"sha256:2326478b40b47cc3abb59d085f82f22170db35315a6211e1e04aeb3a0ce89a7a","observation_id":"57e687ef-4539-4f89-85a9-7d30cfad6b4f","resolution":{"observed_at":"2026-05-11T09:16:03.147383Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2311.03977","last_updated":"2024-10-16T12:11:03Z","snapshot_observed_at":"2026-08-20T07:43:15.101732Z","submitted_at":"2023-11-07T13:26:20Z","title":"A quantum central path algorithm for linear optimization","version":2},"cited_work":{"arxiv_id":"2311.03977","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2311.03977","snapshot_observed_at":"2026-07-02T14:37:03.600347Z","title":"Augustino, J","venue":null,"work_id":"60ae3267-8435-46cd-b30c-477364d71318","year":2023},"citing_paper":{"arxiv_id":"2606.06165","last_updated":"2026-06-05T13:53:41Z","snapshot_observed_at":"2026-08-14T17:00:16.686761Z","submitted_at":"2026-06-04T13:37:06Z","title":"Young Measure Based Quantum Linear Programming Algorithms for Nonlinear/Stochastic Multiscale Partial Differential Equations and Homogenization","version":2},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-06-28T00:20:54.861439Z"},"links":{"cited_paper":"/paper/2311.03977","citing_paper":"/paper/2606.06165"},"observation_digest":"sha256:308ad1dad3f90acd5ed7622e5614fa3013282fa6824bfc1e29d74133aeab689b","observation_id":"f696d508-6c6a-4f8a-b25f-6975f46693cd","resolution":{"observed_at":"2026-07-02T14:37:03.602760Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2311.03977/citation-record","integrity":"/paper/2311.03977/integrity","json":"/paper/2311.03977/citation-record.json","paper":"/paper/2311.03977"},"outbound":[],"paper":{"arxiv_id":"2311.03977","last_updated":"2024-10-16T12:11:03Z","latest_version":2,"primary_category":"quant-ph","snapshot_observed_at":"2026-08-20T07:43:15.101732Z","submitted_at":"2023-11-07T13:26:20Z","title":"A quantum central path algorithm for linear optimization"},"reference_resolution":{"displayed":0,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":0,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":0},"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-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"thesis":"As of 21 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 5 inbound Pith citation observations for arXiv:2311.03977."}