{"as_of":"2026-08-10T08:25:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:e7f430805ee3829fc2aab4c705d4cd8478390eacd79016b3b688fb44b2fbf517","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-08-07T10:58:57.509778Z","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-07T10:59:02.769864Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2409.05671","last_updated":"2025-01-13T19:14:26Z","snapshot_observed_at":"2026-07-06T19:12:36.212757Z","submitted_at":"2024-09-09T14:40:21Z","title":"HyperSteiner: Computing Heuristic Hyperbolic Steiner Minimal Trees","version":2},"cited_work":{"arxiv_id":"2409.05671","doi":null,"metadata_source":"pith","pith_arxiv_id":"2409.05671","snapshot_observed_at":"2026-08-07T10:59:02.769864Z","title":"HyperSteiner: Computing Heuristic Hyperbolic Steiner Minimal Trees","venue":"cs.CG","work_id":"902513d5-9aec-4ec8-83f8-53faf081b385","year":2024},"citing_paper":{"arxiv_id":"2506.04360","last_updated":"2025-06-04T18:20:30Z","snapshot_observed_at":"2026-08-10T07:10:47.740056Z","submitted_at":"2025-06-04T18:20:30Z","title":"Even Faster Hyperbolic Random Forests: A Beltrami-Klein Wrapper Approach","version":1},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-07T10:58:57.509778Z"},"links":{"cited_paper":"/paper/2409.05671","citing_paper":"/paper/2506.04360"},"observation_digest":"sha256:a42ccdc52914e5bc3dfbc75ba58d8be4e819be93eb41576b8dc71cc6e884991f","observation_id":"4f165d96-83d7-415e-92bd-4341981855d0","resolution":{"observed_at":"2026-08-07T10:59:02.848944Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"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/2409.05671/citation-record","integrity":"/paper/2409.05671/integrity","json":"/paper/2409.05671/citation-record.json","paper":"/paper/2409.05671"},"outbound":[],"paper":{"arxiv_id":"2409.05671","last_updated":"2025-01-13T19:14:26Z","latest_version":2,"primary_category":"cs.CG","snapshot_observed_at":"2026-07-06T19:12:36.212757Z","submitted_at":"2024-09-09T14:40:21Z","title":"HyperSteiner: Computing Heuristic Hyperbolic Steiner Minimal Trees"},"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 10 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:2409.05671."}