{"as_of":"2026-08-14T15:35:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:98fc129340e320be24b2dbec608f7840bcc79dd7d53c9b5a01f78634afdf2366","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-14T06:32:32.682623+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-10T19:17:48.825248Z","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-05-22T21:12:08.693536Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2111.15531","last_updated":"2024-11-08T12:04:37Z","snapshot_observed_at":"2026-08-13T23:44:11.094203Z","submitted_at":"2021-11-30T16:21:55Z","title":"A Graph-Matching Formulation of the Interleaving Distance between Merge Trees","version":6},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2111.15531","snapshot_observed_at":"2026-08-10T19:17:48.825248Z","title":"Pegoraro","venue":null,"work_id":null,"year":null},"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":18,"source":"arxiv_source","source_observed_at":"2026-08-10T19:17:48.825248Z"},"links":{"cited_paper":"/paper/2111.15531","citing_paper":"/paper/2501.10728"},"observation_digest":"sha256:6fbfbbf07245a5eef392acc9861f68163fac09bf12fb4693bf6214139ee57fdd","observation_id":"ad4ba8d7-86bd-4a76-957f-ba75680bae60","resolution":{"observed_at":"2026-08-10T19:17:48.825248Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2111.15531","last_updated":"2024-11-08T12:04:37Z","snapshot_observed_at":"2026-08-13T23:44:11.094203Z","submitted_at":"2021-11-30T16:21:55Z","title":"A Graph-Matching Formulation of the Interleaving Distance between Merge Trees","version":6},"cited_work":{"arxiv_id":"2111.15531","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2111.15531","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"A graph-matching formulation of the interleaving distance between merge trees","venue":null,"work_id":"c44896e5-a35d-427f-9be5-036dbf31753a","year":2024},"citing_paper":{"arxiv_id":"2504.03865","last_updated":"2026-04-16T17:59:37Z","snapshot_observed_at":"2026-08-14T07:47:43.570524Z","submitted_at":"2025-04-04T18:43:01Z","title":"Towards an Optimal Bound for the Interleaving Distance on Mapper Graphs","version":3},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-05-22T21:08:28.784534Z"},"links":{"cited_paper":"/paper/2111.15531","citing_paper":"/paper/2504.03865"},"observation_digest":"sha256:cc5598cee691e350ab728712f703865f7c926c1a35bf6dc341eef5c792a51383","observation_id":"64b87b53-980a-418d-bc31-0797bb42d1f0","resolution":{"observed_at":"2026-05-22T21:12:08.695705Z","resolver_source":"arxiv_id","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/2111.15531/citation-record","integrity":"/paper/2111.15531/integrity","json":"/paper/2111.15531/citation-record.json","paper":"/paper/2111.15531"},"outbound":[],"paper":{"arxiv_id":"2111.15531","last_updated":"2024-11-08T12:04:37Z","latest_version":6,"primary_category":"math.CO","snapshot_observed_at":"2026-08-13T23:44:11.094203Z","submitted_at":"2021-11-30T16:21:55Z","title":"A Graph-Matching Formulation of the Interleaving Distance between 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-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 2 inbound Pith citation observations for arXiv:2111.15531."}