{"as_of":"2026-08-11T02:53:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:df227f9d2596ed02558fe7367359862fb9030f782df779cc4266613d7d90ef7b","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-10T06:31:04.303077+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-06-30T06:20:32.505136Z","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-06-30T06:24:19.249311Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2012.04984","last_updated":"2021-04-12T13:59:57Z","snapshot_observed_at":"2026-07-06T10:22:08.875344Z","submitted_at":"2020-12-09T11:21:50Z","title":"Hybrid Quantum Computing -- Tabu Search Algorithm for Partitioning Problems: preliminary study on the Traveling Salesman Problem","version":2},"cited_work":{"arxiv_id":"2012.04984","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2012.04984","snapshot_observed_at":"2026-06-30T06:24:19.249311Z","title":"://arxiv.org/abs/2012.04984","venue":null,"work_id":"16099f60-3ea8-4058-aa76-ebb109b1a960","year":2021},"citing_paper":{"arxiv_id":"2606.30415","last_updated":"2026-06-29T15:01:18Z","snapshot_observed_at":"2026-08-01T15:56:02.188610Z","submitted_at":"2026-06-29T15:01:18Z","title":"Quantum-enhanced Monte Carlo Tree Search framework for combinatorial optimization problems","version":1},"reference_index":85,"source":"arxiv_source","source_observed_at":"2026-06-30T06:20:32.505136Z"},"links":{"cited_paper":"/paper/2012.04984","citing_paper":"/paper/2606.30415"},"observation_digest":"sha256:a2086ee9ed1c1563a1883ebd091ccb560d09b3511e4f4c50494b9b303e7513ce","observation_id":"f217b058-685c-4514-bb63-13732b919f65","resolution":{"observed_at":"2026-06-30T06:24:19.250579Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2012.04984/citation-record","integrity":"/paper/2012.04984/integrity","json":"/paper/2012.04984/citation-record.json","paper":"/paper/2012.04984"},"outbound":[],"paper":{"arxiv_id":"2012.04984","last_updated":"2021-04-12T13:59:57Z","latest_version":2,"primary_category":"cs.ET","snapshot_observed_at":"2026-07-06T10:22:08.875344Z","submitted_at":"2020-12-09T11:21:50Z","title":"Hybrid Quantum Computing -- Tabu Search Algorithm for Partitioning Problems: preliminary study on the Traveling Salesman 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-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"thesis":"As of 11 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:2012.04984."}