{"as_of":"2026-08-19T05:53:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:77dad6c666023421bf815413420e90c4f7db3553a73d31db67b3fe21bf537b9c","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-18T06:34:40.430872+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-16T01:08:47.343385Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":1,"source":"pith","source_observed_at":"2026-08-10T05:30:23.456663Z","state":"measured"}],"external_citation_measurements":[{"count":6,"observed_at":"2026-08-10T05:30:23.456663Z","source":"pith"}],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1908.00265","last_updated":"2019-08-01T08:33:48Z","snapshot_observed_at":"2026-08-17T14:04:12.261915Z","submitted_at":"2019-08-01T08:33:48Z","title":"New Techniques for Graph Edit Distance Computation","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1908.00265","snapshot_observed_at":"2026-08-16T01:08:47.343385Z","title":null,"venue":null,"work_id":null,"year":1908},"citing_paper":{"arxiv_id":"2505.02124","last_updated":"2025-05-04T14:14:24Z","snapshot_observed_at":"2026-08-18T09:31:39.377506Z","submitted_at":"2025-05-04T14:14:24Z","title":"GRAIL: Graph Edit Distance and Node Alignment Using LLM-Generated Code","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-16T01:08:47.343385Z"},"links":{"cited_paper":"/paper/1908.00265","citing_paper":"/paper/2505.02124"},"observation_digest":"sha256:2750e1c129efa1faa4d85fb37088773398437a3c4cec170bdb12899cef5997c6","observation_id":"1634bd79-bef0-4c5d-b0fb-906eaf82837b","resolution":{"observed_at":"2026-08-16T01:08:47.343385Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1908.00265","last_updated":"2019-08-01T08:33:48Z","snapshot_observed_at":"2026-08-17T14:04:12.261915Z","submitted_at":"2019-08-01T08:33:48Z","title":"New Techniques for Graph Edit Distance Computation","version":1},"cited_work":{"arxiv_id":"1908.00265","doi":"10.48550/arxiv.1908.00265","metadata_source":"pith","pith_arxiv_id":"1908.00265","snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":"New Techniques for Graph Edit Distance Computation","venue":"cs.DS","work_id":"6ae6012d-552c-44a0-88ab-eed1c053c6e8","year":2019},"citing_paper":{"arxiv_id":"2608.04583","last_updated":"2026-08-05T08:48:18Z","snapshot_observed_at":"2026-08-19T04:48:40.284991Z","submitted_at":"2026-08-05T08:48:18Z","title":"A Separator-based Algorithm for the Graph Edit Distance Problem","version":1},"reference_index":2019,"source":"pdf_text","source_observed_at":"2026-08-06T21:47:34.116116Z"},"links":{"cited_paper":"/paper/1908.00265","citing_paper":"/paper/2608.04583"},"observation_digest":"sha256:07caca10e39e6ab12f94e23e729e86cd6a8e9c0cde80e1f9ef426efa046b9f54","observation_id":"35152067-609e-4495-a2db-3ea50faa69f6","resolution":{"observed_at":"2026-08-06T21:47:35.548099Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/1908.00265/citation-record","integrity":"/paper/1908.00265/integrity","json":"/paper/1908.00265/citation-record.json","paper":"/paper/1908.00265"},"outbound":[],"paper":{"arxiv_id":"1908.00265","last_updated":"2019-08-01T08:33:48Z","latest_version":1,"primary_category":"cs.DS","snapshot_observed_at":"2026-08-17T14:04:12.261915Z","submitted_at":"2019-08-01T08:33:48Z","title":"New Techniques for Graph Edit Distance Computation"},"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-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"thesis":"As of 19 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:1908.00265."}