{"as_of":"2026-08-17T20:13:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:e12ef02063284a3c9068113ccde5ad83f58cf5870046430d33f5994ae0a9476b","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":1,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":1,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-17T06:30:58.91139+00:00","state":"measured"},{"denominator":1,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-14T14:54:46.319888Z","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-14T14:54:46.478138Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1701.05584","last_updated":"2017-01-19T20:06:46Z","snapshot_observed_at":"2026-08-16T23:11:44.212613Z","submitted_at":"2017-01-19T20:06:46Z","title":"Adiabatic quantum computing solution of the knapsack problem","version":1},"cited_work":{"arxiv_id":"1701.05584","doi":null,"metadata_source":"pith","pith_arxiv_id":"1701.05584","snapshot_observed_at":"2026-08-14T14:54:46.478138Z","title":"Adiabatic quantum computing solution of the knapsack problem","venue":"quant-ph","work_id":"0ac840d1-82e1-41ad-8e4f-265b72edfdf2","year":2017},"citing_paper":{"arxiv_id":"1908.02210","last_updated":"2019-08-15T12:51:24Z","snapshot_observed_at":"2026-08-16T23:11:21.773510Z","submitted_at":"2019-08-06T15:23:34Z","title":"Knapsack Problem variants of QAOA for battery revenue optimisation","version":2},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-14T14:54:46.319888Z"},"links":{"cited_paper":"/paper/1701.05584","citing_paper":"/paper/1908.02210"},"observation_digest":"sha256:6dd5659d39c95ff3c0491df34f422ed466bf78d07732e574cf04a5e25e40127f","observation_id":"81b21e76-c569-4247-9713-6cbda9c55303","resolution":{"observed_at":"2026-08-14T14:54:46.483935Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/1701.05584/citation-record","integrity":"/paper/1701.05584/integrity","json":"/paper/1701.05584/citation-record.json","paper":"/paper/1701.05584"},"outbound":[],"paper":{"arxiv_id":"1701.05584","last_updated":"2017-01-19T20:06:46Z","latest_version":1,"primary_category":"quant-ph","snapshot_observed_at":"2026-08-16T23:11:44.212613Z","submitted_at":"2017-01-19T20:06:46Z","title":"Adiabatic quantum computing solution of the knapsack problem"},"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-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"thesis":"As of 17 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:1701.05584."}