{"as_of":"2026-08-13T22:34:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:536ee332b3b803d301bfd16dbdec807d16284cefa97a2a4739be65b528c52eb5","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":2,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":2,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-13T06:32:02.005865+00:00","state":"measured"},{"denominator":2,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":2,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-10T21:18:56.751383Z","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-10T19:17:50.226414Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1908.00063","last_updated":"2022-02-02T18:19:36Z","snapshot_observed_at":"2026-08-13T18:42:51.426610Z","submitted_at":"2019-07-31T19:42:44Z","title":"Intrinsic Interleaving Distance for Merge Trees","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1908.00063","snapshot_observed_at":"2026-08-10T21:18:56.751383Z","title":"Gasparovic, E","venue":null,"work_id":null,"year":1908},"citing_paper":{"arxiv_id":"2501.05529","last_updated":"2025-01-09T19:08:18Z","snapshot_observed_at":"2026-08-10T21:10:41.505627Z","submitted_at":"2025-01-09T19:08:18Z","title":"Accelerating Computation of Stable Merge Tree Edit Distances using Parameterized Heuristics","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-10T21:18:56.751383Z"},"links":{"cited_paper":"/paper/1908.00063","citing_paper":"/paper/2501.05529"},"observation_digest":"sha256:fe1631a8dfad34dafde908e39978e60d65e076676a58bf74a36d5a0b5c65332d","observation_id":"13c28c64-b426-4cc6-9e1b-b4e1fd99ba1d","resolution":{"observed_at":"2026-08-10T21:18:56.751383Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1908.00063","last_updated":"2022-02-02T18:19:36Z","snapshot_observed_at":"2026-08-13T18:42:51.426610Z","submitted_at":"2019-07-31T19:42:44Z","title":"Intrinsic Interleaving Distance for Merge Trees","version":2},"cited_work":{"arxiv_id":"1908.00063","doi":null,"metadata_source":"pith","pith_arxiv_id":"1908.00063","snapshot_observed_at":"2026-08-10T19:17:50.226414Z","title":"Intrinsic Interleaving Distance for Merge Trees","venue":"cs.CG","work_id":"09b3fcf5-dff6-48fd-9b0c-2ce311384407","year":2019},"citing_paper":{"arxiv_id":"2501.10728","last_updated":"2025-02-14T10:15:28Z","snapshot_observed_at":"2026-08-13T20:10:31.187978Z","submitted_at":"2025-01-18T11:07:00Z","title":"ParkView: Visualizing Monotone Interleavings","version":2},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-10T19:17:48.793708Z"},"links":{"cited_paper":"/paper/1908.00063","citing_paper":"/paper/2501.10728"},"observation_digest":"sha256:02094dd415c7d215e0db3592485017c633ced086f84df2fe70ab9708ec2c3252","observation_id":"a7b0cc6c-b6ac-4756-809d-0d714e28e991","resolution":{"observed_at":"2026-08-10T19:17:50.231846Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/1908.00063/citation-record","integrity":"/paper/1908.00063/integrity","json":"/paper/1908.00063/citation-record.json","paper":"/paper/1908.00063"},"outbound":[],"paper":{"arxiv_id":"1908.00063","last_updated":"2022-02-02T18:19:36Z","latest_version":2,"primary_category":"cs.CG","snapshot_observed_at":"2026-08-13T18:42:51.426610Z","submitted_at":"2019-07-31T19:42:44Z","title":"Intrinsic Interleaving Distance for Merge 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-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"thesis":"As of 13 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:1908.00063."}