{"as_of":"2026-08-21T18:14:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:ddb447da62bc853f6787621286af83185030c10d342dabc43b88f19e975d931b","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-21T06:32:19.484+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-06-28T16:05:14.059558Z","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-07-01T21:56:15.537327Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2109.07524","last_updated":"2021-09-15T18:39:07Z","snapshot_observed_at":"2026-08-21T07:20:54.644008Z","submitted_at":"2021-09-15T18:39:07Z","title":"Exact and Approximation Algorithms for Many-To-Many Point Matching in the Plane","version":1},"cited_work":{"arxiv_id":"2109.07524","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2109.07524","snapshot_observed_at":"2026-07-01T21:56:15.537327Z","title":"arXiv preprint arXiv:2109.07524 , year=","venue":null,"work_id":"efb437c1-6509-43b7-a122-1da8d543d79b","year":null},"citing_paper":{"arxiv_id":"2606.01147","last_updated":"2026-05-31T10:32:24Z","snapshot_observed_at":"2026-08-04T06:06:28.634155Z","submitted_at":"2026-05-31T10:32:24Z","title":"On Fr\\'echet Traveling Salesmen Problems","version":1},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-06-28T16:05:14.059558Z"},"links":{"cited_paper":"/paper/2109.07524","citing_paper":"/paper/2606.01147"},"observation_digest":"sha256:405dd87d3a8d1d34d9e26767d240d0016c5ef65adc7f97bacb212978d1590b61","observation_id":"e203d297-f09c-43d8-ab70-5bf362742dce","resolution":{"observed_at":"2026-07-01T21:56:15.538849Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2109.07524/citation-record","integrity":"/paper/2109.07524/integrity","json":"/paper/2109.07524/citation-record.json","paper":"/paper/2109.07524"},"outbound":[],"paper":{"arxiv_id":"2109.07524","last_updated":"2021-09-15T18:39:07Z","latest_version":1,"primary_category":"cs.CG","snapshot_observed_at":"2026-08-21T07:20:54.644008Z","submitted_at":"2021-09-15T18:39:07Z","title":"Exact and Approximation Algorithms for Many-To-Many Point Matching in the Plane"},"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-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"thesis":"As of 21 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:2109.07524."}