{"as_of":"2026-08-08T23:28:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:ce24ec7ab04909d52de0d8e26cbc2306d23d7f742405071519abe58702c1b723","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-08T06:32:00.761636+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-06T23:00:04.157468Z","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-11T00:15:51.037225Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1808.05689","last_updated":"2020-03-01T19:10:52Z","snapshot_observed_at":"2026-07-06T06:56:05.603132Z","submitted_at":"2018-08-16T22:02:15Z","title":"SimGNN: A Neural Network Approach to Fast Graph Similarity Computation","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1808.05689","snapshot_observed_at":"2026-08-06T23:00:04.157468Z","title":"Graph edit distance computation via graph neural networks,","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2506.20070","last_updated":"2025-06-25T00:25:08Z","snapshot_observed_at":"2026-08-06T22:55:03.551711Z","submitted_at":"2025-06-25T00:25:08Z","title":"Multimodal Information Retrieval for Open World with Edit Distance Weak Supervision","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-06T23:00:04.157468Z"},"links":{"cited_paper":"/paper/1808.05689","citing_paper":"/paper/2506.20070"},"observation_digest":"sha256:6524a7d59a5daffb4fb85acbe79a32152e3f14fee3dec5a79554728e40fd8e05","observation_id":"b5fc6951-625b-4916-8640-ef40675452cb","resolution":{"observed_at":"2026-08-06T23:00:04.157468Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1808.05689","last_updated":"2020-03-01T19:10:52Z","snapshot_observed_at":"2026-07-06T06:56:05.603132Z","submitted_at":"2018-08-16T22:02:15Z","title":"SimGNN: A Neural Network Approach to Fast Graph Similarity Computation","version":4},"cited_work":{"arxiv_id":"1808.05689","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"1808.05689","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"8e9e3419-6b47-47a5-b8f9-bf2164094fc0","year":2018},"citing_paper":{"arxiv_id":"2604.05929","last_updated":"2026-04-07T14:31:19Z","snapshot_observed_at":"2026-07-06T22:54:30.567988Z","submitted_at":"2026-04-07T14:31:19Z","title":"ReLU Networks for Exact Generation of Similar Graphs","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-05-10T18:38:54.623816Z"},"links":{"cited_paper":"/paper/1808.05689","citing_paper":"/paper/2604.05929"},"observation_digest":"sha256:92c1153982f3e1237444d0958936f53f690ad09a22c16692aa8b63706f4ee8f0","observation_id":"fe951b3b-099b-44ea-adc6-0c602aa12deb","resolution":{"observed_at":"2026-05-11T00:15:51.044990Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/1808.05689/citation-record","integrity":"/paper/1808.05689/integrity","json":"/paper/1808.05689/citation-record.json","paper":"/paper/1808.05689"},"outbound":[],"paper":{"arxiv_id":"1808.05689","last_updated":"2020-03-01T19:10:52Z","latest_version":4,"primary_category":"cs.LG","snapshot_observed_at":"2026-07-06T06:56:05.603132Z","submitted_at":"2018-08-16T22:02:15Z","title":"SimGNN: A Neural Network Approach to Fast Graph Similarity 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-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"thesis":"As of 8 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:1808.05689."}