{"as_of":"2026-08-09T21:50:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:a14a8a264665b50f28332d7829b8dff087cceb7f1d4d8244f54870a1de53c40f","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":6,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":6,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-09T06:31:02.800959+00:00","state":"measured"},{"denominator":6,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":6,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-04T06:27:28.996197Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"pith","source_observed_at":"2026-07-04T18:30:01.364926Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2502.15917","last_updated":"2026-06-06T22:54:38Z","snapshot_observed_at":"2026-08-07T17:57:33.775945Z","submitted_at":"2025-02-21T20:15:40Z","title":"Qubit-Efficient Quantum Annealing for Stochastic Unit Commitment","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2502.15917","snapshot_observed_at":"2026-08-04T06:27:28.996197Z","title":"Qubit-efficient quantum annealing for stochastic unit commitment,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2601.01777","last_updated":"2026-08-01T19:24:06Z","snapshot_observed_at":"2026-08-08T18:28:16.403997Z","submitted_at":"2026-01-05T04:17:24Z","title":"A Survey on Applications of Quantum Computing for Unit Commitment","version":2},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-04T06:27:28.996197Z"},"links":{"cited_paper":"/paper/2502.15917","citing_paper":"/paper/2601.01777"},"observation_digest":"sha256:cdec82137c68996884acc194421bfec1b638d6199289921cec26ee7cbb01492b","observation_id":"51cf6ece-161e-4802-94e4-c67232e3783c","resolution":{"observed_at":"2026-08-04T06:27:28.996197Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2502.15917","last_updated":"2026-06-06T22:54:38Z","snapshot_observed_at":"2026-08-07T17:57:33.775945Z","submitted_at":"2025-02-21T20:15:40Z","title":"Qubit-Efficient Quantum Annealing for Stochastic Unit Commitment","version":3},"cited_work":{"arxiv_id":"2502.15917","doi":null,"metadata_source":"pith","pith_arxiv_id":"2502.15917","snapshot_observed_at":"2026-07-04T18:30:01.364926Z","title":"Qubit-efficient quantum annealing for stochastic unit commitment","venue":"quant-ph","work_id":"9e615a78-ece7-4d8c-bc4a-5b803ef55f89","year":2025},"citing_paper":{"arxiv_id":"2604.18285","last_updated":"2026-04-20T13:57:49Z","snapshot_observed_at":"2026-07-06T23:05:13.178333Z","submitted_at":"2026-04-20T13:57:49Z","title":"EQE-QAOA: An Equivalence-Preserving Qubit Efficient Framework for Combinatorial Optimization","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-05-10T03:16:10.677408Z"},"links":{"cited_paper":"/paper/2502.15917","citing_paper":"/paper/2604.18285"},"observation_digest":"sha256:b16572c83e4d88af92cb1098fcf235e98fe21369a76ce09d903d28490d1a18f4","observation_id":"3b20702d-a1e2-44f4-89d6-da7d57480e06","resolution":{"observed_at":"2026-06-09T02:06:01.999812Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2502.15917","last_updated":"2026-06-06T22:54:38Z","snapshot_observed_at":"2026-08-07T17:57:33.775945Z","submitted_at":"2025-02-21T20:15:40Z","title":"Qubit-Efficient Quantum Annealing for Stochastic Unit Commitment","version":3},"cited_work":{"arxiv_id":"2502.15917","doi":null,"metadata_source":"pith","pith_arxiv_id":"2502.15917","snapshot_observed_at":"2026-07-04T18:30:01.364926Z","title":"Qubit-efficient quantum annealing for stochastic unit commitment","venue":"quant-ph","work_id":"9e615a78-ece7-4d8c-bc4a-5b803ef55f89","year":2025},"citing_paper":{"arxiv_id":"2606.24241","last_updated":"2026-06-23T07:29:23Z","snapshot_observed_at":"2026-08-03T09:48:52.974030Z","submitted_at":"2026-06-23T07:29:23Z","title":"Evaluating the solution performance of the augmented Lagrangian function on Ising machines","version":1},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-06-25T22:51:06.119251Z"},"links":{"cited_paper":"/paper/2502.15917","citing_paper":"/paper/2606.24241"},"observation_digest":"sha256:54a26b44a312e8dd17fa0ed1ff429780e5b15f14e9ddfbe6cc01e346650d7efd","observation_id":"00530629-c971-415e-a31a-11d409987d72","resolution":{"observed_at":"2026-07-04T18:30:01.367557Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2502.15917","last_updated":"2026-06-06T22:54:38Z","snapshot_observed_at":"2026-08-07T17:57:33.775945Z","submitted_at":"2025-02-21T20:15:40Z","title":"Qubit-Efficient Quantum Annealing for Stochastic Unit Commitment","version":3},"cited_work":{"arxiv_id":"2502.15917","doi":null,"metadata_source":"pith","pith_arxiv_id":"2502.15917","snapshot_observed_at":"2026-07-04T18:30:01.364926Z","title":"Qubit-efficient quantum annealing for stochastic unit commitment","venue":"quant-ph","work_id":"9e615a78-ece7-4d8c-bc4a-5b803ef55f89","year":2025},"citing_paper":{"arxiv_id":"2606.26345","last_updated":"2026-06-24T19:37:13Z","snapshot_observed_at":"2026-08-07T03:51:56.067664Z","submitted_at":"2026-06-24T19:37:13Z","title":"Feasibility-Aware Security-Constrained Unit Commitment via Hybrid Soft Actor-Critic with Quantum-Sampled Features","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-06-26T01:18:55.557238Z"},"links":{"cited_paper":"/paper/2502.15917","citing_paper":"/paper/2606.26345"},"observation_digest":"sha256:3882adef50a72425eb39780e11e7afb2a4c58ea1cb3c7d7bc8ccb0f23a2d9a3f","observation_id":"1ee3eea9-8b18-4ba9-988a-7ab8ae99186f","resolution":{"observed_at":"2026-07-04T15:49:57.781660Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2502.15917","last_updated":"2026-06-06T22:54:38Z","snapshot_observed_at":"2026-08-07T17:57:33.775945Z","submitted_at":"2025-02-21T20:15:40Z","title":"Qubit-Efficient Quantum Annealing for Stochastic Unit Commitment","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2502.15917","snapshot_observed_at":"2026-08-01T19:15:59.113685Z","title":"Qubit-efficient quantum annealing for stochastic unit commitment,","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.17031","last_updated":"2026-07-19T02:28:51Z","snapshot_observed_at":"2026-08-08T17:20:26.482342Z","submitted_at":"2026-07-19T02:28:51Z","title":"Feasibility-Aware Security-Constrained Unit Commitment via Hybrid Soft Actor-Critic with Quantum-Sampled Features","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-01T19:15:59.113685Z"},"links":{"cited_paper":"/paper/2502.15917","citing_paper":"/paper/2607.17031"},"observation_digest":"sha256:faaae57f69e121128c41b81d33138492c94db4ea833968fb0c2f8ce5c646c387","observation_id":"6ddbf048-d6d7-41b2-9c4a-4feca28a33a5","resolution":{"observed_at":"2026-08-01T19:15:59.113685Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2502.15917","last_updated":"2026-06-06T22:54:38Z","snapshot_observed_at":"2026-08-07T17:57:33.775945Z","submitted_at":"2025-02-21T20:15:40Z","title":"Qubit-Efficient Quantum Annealing for Stochastic Unit Commitment","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2502.15917","snapshot_observed_at":"2026-08-01T07:58:23.093999Z","title":"Qubit-Efficient Quantum Annealing for Stochastic Unit Commitment","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.21286","last_updated":"2026-07-23T13:07:16Z","snapshot_observed_at":"2026-08-09T06:48:44.553468Z","submitted_at":"2026-07-23T13:07:16Z","title":"Mixed-Binary Quadratic Programming via QUBO Sampling without Continuous-Variable Binarization","version":1},"reference_index":193,"source":"arxiv_source","source_observed_at":"2026-08-01T07:58:23.093999Z"},"links":{"cited_paper":"/paper/2502.15917","citing_paper":"/paper/2607.21286"},"observation_digest":"sha256:d5eb0d8980542abc5e40a14d3e90b956f3ec5b51b171b185e04ac789d8670ad8","observation_id":"80ed58c1-56aa-4b9f-ab50-bd57431aafeb","resolution":{"observed_at":"2026-08-01T07:58:23.093999Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2502.15917/citation-record","integrity":"/paper/2502.15917/integrity","json":"/paper/2502.15917/citation-record.json","paper":"/paper/2502.15917"},"outbound":[],"paper":{"arxiv_id":"2502.15917","last_updated":"2026-06-06T22:54:38Z","latest_version":3,"primary_category":"quant-ph","snapshot_observed_at":"2026-08-07T17:57:33.775945Z","submitted_at":"2025-02-21T20:15:40Z","title":"Qubit-Efficient Quantum Annealing for Stochastic Unit Commitment"},"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-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"thesis":"As of 9 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 6 inbound Pith citation observations for arXiv:2502.15917."}