{"as_of":"2026-08-20T08:07:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:b6de8c6d3179e1f162772f2e7afa5800aa54b1ee3feadbba207496f673b566f7","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-20T06:33:59.587034+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-14T11:34:14.132639Z","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-14T10:28:28.091837Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1906.10375","last_updated":"2019-06-25T08:27:50Z","snapshot_observed_at":"2026-08-19T19:58:11.683838Z","submitted_at":"2019-06-25T08:27:50Z","title":"Quantum speedup of branch-and-bound algorithms","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1906.10375","snapshot_observed_at":"2026-08-14T11:34:14.132639Z","title":"Quantum speedup of branch-and- bound algorithms,","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"1908.08949","last_updated":"2020-05-05T23:06:05Z","snapshot_observed_at":"2026-08-20T04:51:37.969864Z","submitted_at":"2019-08-23T18:00:00Z","title":"Quantum Algorithms for Jet Clustering","version":2},"reference_index":87,"source":"pdf_text","source_observed_at":"2026-08-14T11:34:14.132639Z"},"links":{"cited_paper":"/paper/1906.10375","citing_paper":"/paper/1908.08949"},"observation_digest":"sha256:0d7a724cc099b2567c9572d8934c2a35278dfc23c3089924e385a956297d441c","observation_id":"0618c2a6-d8c8-41b8-a2cf-b354c2d4391f","resolution":{"observed_at":"2026-08-14T11:34:14.132639Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1906.10375","last_updated":"2019-06-25T08:27:50Z","snapshot_observed_at":"2026-08-19T19:58:11.683838Z","submitted_at":"2019-06-25T08:27:50Z","title":"Quantum speedup of branch-and-bound algorithms","version":1},"cited_work":{"arxiv_id":"1906.10375","doi":null,"metadata_source":"pith","pith_arxiv_id":"1906.10375","snapshot_observed_at":"2026-08-14T10:28:28.091837Z","title":"Quantum speedup of branch-and-bound algorithms","venue":"cs.DS","work_id":"aa6964bb-d2e8-4d15-a185-c2c5a7dc6fb1","year":2019},"citing_paper":{"arxiv_id":"1908.11291","last_updated":"2019-08-29T15:26:48Z","snapshot_observed_at":"2026-08-19T20:35:03.899455Z","submitted_at":"2019-08-29T15:26:48Z","title":"Practical implementation of a quantum backtracking algorithm","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-14T10:28:27.915834Z"},"links":{"cited_paper":"/paper/1906.10375","citing_paper":"/paper/1908.11291"},"observation_digest":"sha256:c4907f07215263122acf4c7f97f2a096c5217737e96d9eaf489ff3648c701920","observation_id":"01494991-2e4d-4eb6-a006-1b064bf44bdf","resolution":{"observed_at":"2026-08-14T10:28:28.132997Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/1906.10375/citation-record","integrity":"/paper/1906.10375/integrity","json":"/paper/1906.10375/citation-record.json","paper":"/paper/1906.10375"},"outbound":[],"paper":{"arxiv_id":"1906.10375","last_updated":"2019-06-25T08:27:50Z","latest_version":1,"primary_category":"cs.DS","snapshot_observed_at":"2026-08-19T19:58:11.683838Z","submitted_at":"2019-06-25T08:27:50Z","title":"Quantum speedup of branch-and-bound algorithms"},"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-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"thesis":"As of 20 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:1906.10375."}