{"as_of":"2026-08-17T16:24:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:8f658cf4452b55cdb57728e0ff0550854efc974b4b86c39c812ae85ece6f3f0a","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-17T06:30:58.91139+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-02T05:17:33.452765Z","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-11T19:31:08.860223Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2503.18245","last_updated":"2025-03-24T00:03:16Z","snapshot_observed_at":"2026-08-16T12:47:31.958853Z","submitted_at":"2025-03-24T00:03:16Z","title":"DiffGED: Computing Graph Edit Distance via Diffusion-based Graph Matching","version":1},"cited_work":{"arxiv_id":"2503.18245","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2503.18245","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Diffged: Computing graph edit distance via diffusion-based graph matching","venue":null,"work_id":"0fa17474-0b2f-42a6-91cd-acc0bd21b5df","year":2025},"citing_paper":{"arxiv_id":"2605.05689","last_updated":"2026-05-07T05:29:57Z","snapshot_observed_at":"2026-07-06T23:18:17.333660Z","submitted_at":"2026-05-07T05:29:57Z","title":"GCCM: Enhancing Generative Graph Prediction via Contrastive Consistency Model","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-05-08T11:46:42.010486Z"},"links":{"cited_paper":"/paper/2503.18245","citing_paper":"/paper/2605.05689"},"observation_digest":"sha256:27d15f9db1e169119d1d445351a218ca81804619fcc79e9c672f5108145e5ef8","observation_id":"7f3dcffe-a44a-4dd9-a189-b378e133b5b7","resolution":{"observed_at":"2026-05-11T19:31:08.871243Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2503.18245","last_updated":"2025-03-24T00:03:16Z","snapshot_observed_at":"2026-08-16T12:47:31.958853Z","submitted_at":"2025-03-24T00:03:16Z","title":"DiffGED: Computing Graph Edit Distance via Diffusion-based Graph Matching","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2503.18245","snapshot_observed_at":"2026-08-02T05:17:33.452765Z","title":"Diffged: Computing graph edit distance via diffusion-based graph matching.ArXiv preprint, abs/2503.18245, 2025a","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.13431","last_updated":"2026-07-15T04:23:22Z","snapshot_observed_at":"2026-08-07T01:50:04.940823Z","submitted_at":"2026-07-15T04:23:22Z","title":"Discrete Diffusion Models: A Unified Framework from Tokenization to Generation","version":1},"reference_index":78,"source":"pdf_text","source_observed_at":"2026-08-02T05:17:33.452765Z"},"links":{"cited_paper":"/paper/2503.18245","citing_paper":"/paper/2607.13431"},"observation_digest":"sha256:c084c9fdd04751bc775a010d349d9dcbc4ab6bddcdccbe469452e2d8002535c1","observation_id":"7047bd65-9896-4799-93ed-754cd26dbf24","resolution":{"observed_at":"2026-08-02T05:17:33.452765Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2503.18245/citation-record","integrity":"/paper/2503.18245/integrity","json":"/paper/2503.18245/citation-record.json","paper":"/paper/2503.18245"},"outbound":[],"paper":{"arxiv_id":"2503.18245","last_updated":"2025-03-24T00:03:16Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-16T12:47:31.958853Z","submitted_at":"2025-03-24T00:03:16Z","title":"DiffGED: Computing Graph Edit Distance via Diffusion-based Graph Matching"},"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-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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:2503.18245."}