{"as_of":"2026-08-23T12:55:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:2dfe7c54c59176db06c736abe332be8dae0bdc2a239dbe82a144a33c0b2be9ca","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-23T06:30:58.430688+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-15T14:20:33.222473Z","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-15T14:20:33.444856Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2007.01774","last_updated":"2021-04-21T05:22:39Z","snapshot_observed_at":"2026-08-18T04:04:36.510690Z","submitted_at":"2020-07-03T15:52:24Z","title":"Qubit-efficient encoding schemes for binary optimisation problems","version":2},"cited_work":{"arxiv_id":"2007.01774","doi":null,"metadata_source":"pith","pith_arxiv_id":"2007.01774","snapshot_observed_at":"2026-08-15T14:20:33.444856Z","title":"Qubit-efficient encoding schemes for binary optimisation problems","venue":"quant-ph","work_id":"6aeb7490-bbd5-4891-8cfc-cf223c5464bc","year":2020},"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":3,"source":"pdf_text","source_observed_at":"2026-08-15T14:20:33.222473Z"},"links":{"cited_paper":"/paper/2007.01774","citing_paper":"/paper/2608.11503"},"observation_digest":"sha256:904b6d8b6f292cb9a3aa20059b5c3d74ca241ba96538a523ce13bb41c61b6a0c","observation_id":"a4f48540-f7b2-4345-8b0a-12f0e8ae1da9","resolution":{"observed_at":"2026-08-15T14:20:33.449337Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2007.01774/citation-record","integrity":"/paper/2007.01774/integrity","json":"/paper/2007.01774/citation-record.json","paper":"/paper/2007.01774"},"outbound":[],"paper":{"arxiv_id":"2007.01774","last_updated":"2021-04-21T05:22:39Z","latest_version":2,"primary_category":"quant-ph","snapshot_observed_at":"2026-08-18T04:04:36.510690Z","submitted_at":"2020-07-03T15:52:24Z","title":"Qubit-efficient encoding schemes for binary optimisation problems"},"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-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"thesis":"As of 23 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:2007.01774."}