{"as_of":"2026-08-14T07:26:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:24d9c52fddf49cc1aef313d07995b0b2fe4f1f943a58fb01619443a3fb13ae29","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-14T06:32:32.682623+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-05T00:26:43.730655Z","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-05T00:26:44.222567Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1011.5666","last_updated":"2011-06-12T20:40:54Z","snapshot_observed_at":"2026-07-06T02:19:44.391146Z","submitted_at":"2010-11-25T18:24:17Z","title":"Enumerative Lattice Algorithms in Any Norm via M-Ellipsoid Coverings","version":4},"cited_work":{"arxiv_id":"1011.5666","doi":null,"metadata_source":"pith","pith_arxiv_id":"1011.5666","snapshot_observed_at":"2026-08-05T00:26:44.222567Z","title":"Enumerative Lattice Algorithms in Any Norm via M-Ellipsoid Coverings","venue":"cs.DS","work_id":"df772904-65e0-43af-8e06-113612bd5dff","year":2010},"citing_paper":{"arxiv_id":"2608.00795","last_updated":"2026-08-01T17:51:30Z","snapshot_observed_at":"2026-08-12T16:01:30.479103Z","submitted_at":"2026-08-01T17:51:30Z","title":"Exact Algorithms for Minimum Steiner Point Trees","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-05T00:26:43.730655Z"},"links":{"cited_paper":"/paper/1011.5666","citing_paper":"/paper/2608.00795"},"observation_digest":"sha256:1ec09e86f9b3bdc8310b23fba845c03ace8c1bffef8b84c70bac5e94ff51e506","observation_id":"f5adb8d6-9525-4e64-af6b-c21207afc94e","resolution":{"observed_at":"2026-08-05T00:26:44.228918Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/1011.5666/citation-record","integrity":"/paper/1011.5666/integrity","json":"/paper/1011.5666/citation-record.json","paper":"/paper/1011.5666"},"outbound":[],"paper":{"arxiv_id":"1011.5666","last_updated":"2011-06-12T20:40:54Z","latest_version":4,"primary_category":"cs.DS","snapshot_observed_at":"2026-07-06T02:19:44.391146Z","submitted_at":"2010-11-25T18:24:17Z","title":"Enumerative Lattice Algorithms in Any Norm via M-Ellipsoid Coverings"},"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-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"thesis":"As of 14 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:1011.5666."}