{"as_of":"2026-08-08T07:59:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:a2ba73887255759353b177aa0ce7093982ef869e18a03c30937a307c0cf0735c","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":2,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":2,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-08T06:32:00.761636+00:00","state":"measured"},{"denominator":2,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":2,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T13:05:25.791032Z","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-05-23T22:33:32.448140Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2302.11595","last_updated":"2023-02-22T19:00:12Z","snapshot_observed_at":"2026-07-06T14:54:44.947783Z","submitted_at":"2023-02-22T19:00:12Z","title":"Towards Finding an Optimal Flight Gate Assignment on a Digital Quantum Computer","version":1},"cited_work":{"arxiv_id":"2302.11595","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2302.11595","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"176abf89-5c2e-4c87-b907-c498bc5d918c","year":2023},"citing_paper":{"arxiv_id":"2408.03073","last_updated":"2024-08-06T09:57:34Z","snapshot_observed_at":"2026-07-06T18:57:22.433852Z","submitted_at":"2024-08-06T09:57:34Z","title":"Benchmarking Variational Quantum Algorithms for Combinatorial Optimization in Practice","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-05-23T22:32:15.684437Z"},"links":{"cited_paper":"/paper/2302.11595","citing_paper":"/paper/2408.03073"},"observation_digest":"sha256:da70b95265dfa5eeb439adc5f79c4c54fb06daafcbdb5a4120fdf3a47e44120e","observation_id":"1035fba4-8c2e-4e91-8b9d-aba1424a6b87","resolution":{"observed_at":"2026-05-23T22:33:32.451170Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2302.11595","last_updated":"2023-02-22T19:00:12Z","snapshot_observed_at":"2026-07-06T14:54:44.947783Z","submitted_at":"2023-02-22T19:00:12Z","title":"Towards Finding an Optimal Flight Gate Assignment on a Digital Quantum Computer","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2302.11595","snapshot_observed_at":"2026-08-07T13:05:25.791032Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2505.22924","last_updated":"2025-06-18T16:10:05Z","snapshot_observed_at":"2026-08-07T23:01:57.486243Z","submitted_at":"2025-05-28T22:56:57Z","title":"Optimizing QUBO on a quantum computer by mimicking imaginary time evolution","version":2},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-07T13:05:25.791032Z"},"links":{"cited_paper":"/paper/2302.11595","citing_paper":"/paper/2505.22924"},"observation_digest":"sha256:a408b4410c5e3cdc7816750814cf80b29845d713d1e713857d4abf1cd798fb2f","observation_id":"ee0d2d15-85f5-45e9-a044-12b54f1af6d4","resolution":{"observed_at":"2026-08-07T13:05:25.791032Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2302.11595/citation-record","integrity":"/paper/2302.11595/integrity","json":"/paper/2302.11595/citation-record.json","paper":"/paper/2302.11595"},"outbound":[],"paper":{"arxiv_id":"2302.11595","last_updated":"2023-02-22T19:00:12Z","latest_version":1,"primary_category":"quant-ph","snapshot_observed_at":"2026-07-06T14:54:44.947783Z","submitted_at":"2023-02-22T19:00:12Z","title":"Towards Finding an Optimal Flight Gate Assignment on a Digital Quantum Computer"},"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-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"thesis":"As of 8 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:2302.11595."}