{"as_of":"2026-08-17T01:01:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:7212d4d164ac3ae0c553411259c853563b9cdec2502b92d59f77e9fcebbd81b9","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-16T06:30:59.297886+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-14T11:21:40.112242Z","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-21T01:09:20.494250Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1805.06869","last_updated":"2022-09-14T09:30:03Z","snapshot_observed_at":"2026-08-16T16:58:51.512707Z","submitted_at":"2018-05-17T17:16:07Z","title":"Revisiting the tree edit distance and its backtracing: A tutorial","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1805.06869","snapshot_observed_at":"2026-08-14T11:21:40.112242Z","title":"Benjamin Paaßen","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"1908.09364","last_updated":"2019-08-27T07:53:03Z","snapshot_observed_at":"2026-08-14T11:11:39.258923Z","submitted_at":"2019-08-25T17:20:15Z","title":"Adversarial Edit Attacks for Tree Data","version":2},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-14T11:21:40.112242Z"},"links":{"cited_paper":"/paper/1805.06869","citing_paper":"/paper/1908.09364"},"observation_digest":"sha256:c0e69411bacdac1eedbb19a36b25f1689edb245efaf9beafca040c3e8170d1e8","observation_id":"55f91421-4602-4ee0-9ee0-29728db53383","resolution":{"observed_at":"2026-08-14T11:21:40.112242Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1805.06869","last_updated":"2022-09-14T09:30:03Z","snapshot_observed_at":"2026-08-16T16:58:51.512707Z","submitted_at":"2018-05-17T17:16:07Z","title":"Revisiting the tree edit distance and its backtracing: A tutorial","version":4},"cited_work":{"arxiv_id":"1805.06869","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"1805.06869","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Revisiting the tree edit distance and its backtracing: A tutorial.CoRR, abs/1805.06869","venue":null,"work_id":"c770ee1b-bb7b-4e39-8f2c-4b4fb33d7ad0","year":null},"citing_paper":{"arxiv_id":"2605.18774","last_updated":"2026-04-17T05:33:45Z","snapshot_observed_at":"2026-08-15T07:41:10.920492Z","submitted_at":"2026-04-17T05:33:45Z","title":"M3DocDep: Multi-modal, Multi-page, Multi-document Dependency Chunking with Large Vision-Language Models","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-05-21T01:05:18.162259Z"},"links":{"cited_paper":"/paper/1805.06869","citing_paper":"/paper/2605.18774"},"observation_digest":"sha256:b36a4d77aa678b6483c749c5db09f124acd8da93a227abc07fc90b7b8a1364a5","observation_id":"2dd9307a-14f3-4a1b-9c57-fc7b9aeb3517","resolution":{"observed_at":"2026-05-21T01:09:20.497430Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/1805.06869/citation-record","integrity":"/paper/1805.06869/integrity","json":"/paper/1805.06869/citation-record.json","paper":"/paper/1805.06869"},"outbound":[],"paper":{"arxiv_id":"1805.06869","last_updated":"2022-09-14T09:30:03Z","latest_version":4,"primary_category":"cs.DS","snapshot_observed_at":"2026-08-16T16:58:51.512707Z","submitted_at":"2018-05-17T17:16:07Z","title":"Revisiting the tree edit distance and its backtracing: A tutorial"},"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-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"thesis":"As of 17 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:1805.06869."}