{"as_of":"2026-08-09T00:09:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:cdabeecca1578a24edda94c83345f0f664616083b865d7df4488f3a98296840a","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":4,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":4,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-08T06:32:00.761636+00:00","state":"measured"},{"denominator":4,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":4,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T05:29:27.876939Z","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-08-06T18:55:23.828926Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2504.15367","last_updated":"2025-04-21T18:19:19Z","snapshot_observed_at":"2026-08-07T16:00:28.628090Z","submitted_at":"2025-04-21T18:19:19Z","title":"Branch-and-bound digitized counterdiabatic quantum optimization","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2504.15367","snapshot_observed_at":"2026-08-07T05:29:27.876939Z","title":"Simen, S","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2506.07866","last_updated":"2025-06-10T22:46:38Z","snapshot_observed_at":"2026-08-07T05:21:06.060556Z","submitted_at":"2025-06-09T15:34:02Z","title":"Protein folding with an all-to-all trapped-ion quantum computer","version":2},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-08-07T05:29:27.876939Z"},"links":{"cited_paper":"/paper/2504.15367","citing_paper":"/paper/2506.07866"},"observation_digest":"sha256:f698e4a26541e3c442edbc014cab30214398dcb1954ba0606ca608a3d9e12df3","observation_id":"e389fc78-44e9-40f3-9498-ec57bd803411","resolution":{"observed_at":"2026-08-07T05:29:27.876939Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2504.15367","last_updated":"2025-04-21T18:19:19Z","snapshot_observed_at":"2026-08-07T16:00:28.628090Z","submitted_at":"2025-04-21T18:19:19Z","title":"Branch-and-bound digitized counterdiabatic quantum optimization","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2504.15367","snapshot_observed_at":"2026-08-06T22:49:25.075584Z","title":"Simen, S","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2506.20655","last_updated":"2025-06-25T17:51:29Z","snapshot_observed_at":"2026-08-08T20:53:11.607341Z","submitted_at":"2025-06-25T17:51:29Z","title":"Sequential Quantum Computing","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-06T22:49:25.075584Z"},"links":{"cited_paper":"/paper/2504.15367","citing_paper":"/paper/2506.20655"},"observation_digest":"sha256:4d7e6c0eace7139a88b231c17fc3fb5348d6d0190acd214c1073f6d468aaa305","observation_id":"7d4642c1-90b3-49e7-a5f3-9249756577c5","resolution":{"observed_at":"2026-08-06T22:49:25.075584Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2504.15367","last_updated":"2025-04-21T18:19:19Z","snapshot_observed_at":"2026-08-07T16:00:28.628090Z","submitted_at":"2025-04-21T18:19:19Z","title":"Branch-and-bound digitized counterdiabatic quantum optimization","version":1},"cited_work":{"arxiv_id":"2504.15367","doi":null,"metadata_source":"pith","pith_arxiv_id":"2504.15367","snapshot_observed_at":"2026-08-06T18:55:23.828926Z","title":"Branch-and-bound digitized counterdiabatic quantum optimization","venue":"quant-ph","work_id":"2db75e25-2b6b-4ed7-9f74-87b380ce4fbf","year":2025},"citing_paper":{"arxiv_id":"2507.07159","last_updated":"2025-07-09T17:46:59Z","snapshot_observed_at":"2026-08-06T18:45:28.046553Z","submitted_at":"2025-07-09T17:46:59Z","title":"Large-scale portfolio optimization with variational neural annealing","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-06T18:55:23.031857Z"},"links":{"cited_paper":"/paper/2504.15367","citing_paper":"/paper/2507.07159"},"observation_digest":"sha256:3e1a3fa9c1f26925cc0e228f16f96bbea82b5436082856ff2746fbd7d6f6be11","observation_id":"a2a153c3-59c0-4e0a-b1b9-da55048a9025","resolution":{"observed_at":"2026-08-06T18:55:23.833833Z","resolver_source":"local_arxiv","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":"2504.15367","last_updated":"2025-04-21T18:19:19Z","snapshot_observed_at":"2026-08-07T16:00:28.628090Z","submitted_at":"2025-04-21T18:19:19Z","title":"Branch-and-bound digitized counterdiabatic quantum optimization","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2504.15367","snapshot_observed_at":"2026-08-04T17:16:00.354409Z","title":"Branch- and-bound digitized counterdiabatic quantum optimization.arXiv preprint arXiv:2504.15367,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2509.11040","last_updated":"2025-09-14T02:10:16Z","snapshot_observed_at":"2026-08-08T04:33:23.624679Z","submitted_at":"2025-09-14T02:10:16Z","title":"Hybrid Quantum Branch-and-Bound Method for Quadratic Unconstrained Binary Optimization","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-04T17:16:00.354409Z"},"links":{"cited_paper":"/paper/2504.15367","citing_paper":"/paper/2509.11040"},"observation_digest":"sha256:6a633e48f04f2eb4bd4c56516912bdb0620786f09788df815498c5fb39f1a1fe","observation_id":"17d9461e-8684-4ab4-abb7-6822b4446bdb","resolution":{"observed_at":"2026-08-04T17:16:00.354409Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2504.15367/citation-record","integrity":"/paper/2504.15367/integrity","json":"/paper/2504.15367/citation-record.json","paper":"/paper/2504.15367"},"outbound":[],"paper":{"arxiv_id":"2504.15367","last_updated":"2025-04-21T18:19:19Z","latest_version":1,"primary_category":"quant-ph","snapshot_observed_at":"2026-08-07T16:00:28.628090Z","submitted_at":"2025-04-21T18:19:19Z","title":"Branch-and-bound digitized counterdiabatic quantum 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-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"thesis":"As of 9 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 4 inbound Pith citation observations for arXiv:2504.15367."}