{"as_of":"2026-08-23T04:08:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:a658d8647eceebfe8da65c9c52c4587e6f38f49e6b5e8b8d6215643c5977f32a","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-22T06:32:14.747728+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-15T14:20:33.227286Z","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-29T07:13:17.470597Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2009.07309","last_updated":"2020-09-15T18:17:27Z","snapshot_observed_at":"2026-08-22T19:47:33.353927Z","submitted_at":"2020-09-15T18:17:27Z","title":"Space-efficient binary optimization for variational computing","version":1},"cited_work":{"arxiv_id":"2009.07309","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2009.07309","snapshot_observed_at":"2026-06-29T07:13:17.470597Z","title":"Space-efficient binary optimization for variational computing","venue":null,"work_id":"48e4db5c-8daf-41c8-9b02-f92d31bfb49b","year":2020},"citing_paper":{"arxiv_id":"2604.06106","last_updated":"2026-04-07T17:17:34Z","snapshot_observed_at":"2026-08-13T04:02:21.788619Z","submitted_at":"2026-04-07T17:17:34Z","title":"Nonvariational quantum optimisation approaches to pangenome-guided sequence assembly","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-05-10T19:15:50.044830Z"},"links":{"cited_paper":"/paper/2009.07309","citing_paper":"/paper/2604.06106"},"observation_digest":"sha256:4717eb061890f25769be977d96464579cf8400240aa4711e4415dbbdba8fd3b2","observation_id":"ecf4a7cd-0431-4ff3-8b9f-3afa523a9ba1","resolution":{"observed_at":"2026-05-10T23:15:48.513497Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2009.07309","last_updated":"2020-09-15T18:17:27Z","snapshot_observed_at":"2026-08-22T19:47:33.353927Z","submitted_at":"2020-09-15T18:17:27Z","title":"Space-efficient binary optimization for variational computing","version":1},"cited_work":{"arxiv_id":"2009.07309","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2009.07309","snapshot_observed_at":"2026-06-29T07:13:17.470597Z","title":"Space-efficient binary optimization for variational computing","venue":null,"work_id":"48e4db5c-8daf-41c8-9b02-f92d31bfb49b","year":2020},"citing_paper":{"arxiv_id":"2604.24297","last_updated":"2026-04-27T10:39:21Z","snapshot_observed_at":"2026-08-10T22:16:24.403602Z","submitted_at":"2026-04-27T10:39:21Z","title":"Exhaustive and feasible parametrisation with applications to the travelling salesperson problem","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-05-08T04:21:56.576515Z"},"links":{"cited_paper":"/paper/2009.07309","citing_paper":"/paper/2604.24297"},"observation_digest":"sha256:3f0bfbc52cc31d3ea492c61652d8fc295e17c2bdd48656bd341c68cba2f35dc1","observation_id":"af1a97b7-1934-433e-899b-d2cd42fd4b72","resolution":{"observed_at":"2026-05-11T21:46:43.426164Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2009.07309","last_updated":"2020-09-15T18:17:27Z","snapshot_observed_at":"2026-08-22T19:47:33.353927Z","submitted_at":"2020-09-15T18:17:27Z","title":"Space-efficient binary optimization for variational computing","version":1},"cited_work":{"arxiv_id":"2009.07309","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2009.07309","snapshot_observed_at":"2026-06-29T07:13:17.470597Z","title":"Space-efficient binary optimization for variational computing","venue":null,"work_id":"48e4db5c-8daf-41c8-9b02-f92d31bfb49b","year":2020},"citing_paper":{"arxiv_id":"2605.30252","last_updated":"2026-05-28T17:15:46Z","snapshot_observed_at":"2026-08-13T03:15:39.778683Z","submitted_at":"2026-05-28T17:15:46Z","title":"Quantum optimization beyond QUBO for industrial logistics and scheduling","version":1},"reference_index":59,"source":"pdf_text","source_observed_at":"2026-06-29T06:58:46.170185Z"},"links":{"cited_paper":"/paper/2009.07309","citing_paper":"/paper/2605.30252"},"observation_digest":"sha256:9d88ac0a6b9c197062e89288ae4ed4b18a4af73bd4958820dff5a4213cabb5ad","observation_id":"c01f6b02-f798-4a13-a382-82446e3a4f95","resolution":{"observed_at":"2026-06-29T07:13:17.473098Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2009.07309","last_updated":"2020-09-15T18:17:27Z","snapshot_observed_at":"2026-08-22T19:47:33.353927Z","submitted_at":"2020-09-15T18:17:27Z","title":"Space-efficient binary optimization for variational computing","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2009.07309","snapshot_observed_at":"2026-08-15T14:20:33.227286Z","title":"Space-efficient binary optimization for variational quantum computing","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2608.11503","last_updated":"2026-08-11T23:39:28Z","snapshot_observed_at":"2026-08-22T12:27:37.813463Z","submitted_at":"2026-08-11T23:39:28Z","title":"Joint symmetry and dynamical accessibility in compact Hamiltonian encodings of set cover","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-15T14:20:33.227286Z"},"links":{"cited_paper":"/paper/2009.07309","citing_paper":"/paper/2608.11503"},"observation_digest":"sha256:7b333c53054c67f9d423bbbc836c7e17ecc25b2e3498453f2f19a057d4bf3292","observation_id":"6c3006c8-48db-4cff-93ff-d89e7d08bafa","resolution":{"observed_at":"2026-08-15T14:20:33.227286Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2009.07309/citation-record","integrity":"/paper/2009.07309/integrity","json":"/paper/2009.07309/citation-record.json","paper":"/paper/2009.07309"},"outbound":[],"paper":{"arxiv_id":"2009.07309","last_updated":"2020-09-15T18:17:27Z","latest_version":1,"primary_category":"quant-ph","snapshot_observed_at":"2026-08-22T19:47:33.353927Z","submitted_at":"2020-09-15T18:17:27Z","title":"Space-efficient binary optimization for variational computing"},"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-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"thesis":"As of 23 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 4 inbound Pith citation observations for arXiv:2009.07309."}