{"as_of":"2026-08-16T12:03:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:5d621a120dc708c7ecbe85adf20d0eb310edff66e7257f23f3992a2ea30d558b","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":6,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":6,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-16T06:30:59.297886+00:00","state":"measured"},{"denominator":6,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":6,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-10T20:20:18.101494Z","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-16T12:02:51.264185Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1910.12091","last_updated":"2019-10-31T16:14:17Z","snapshot_observed_at":"2026-08-02T22:38:12.443280Z","submitted_at":"2019-10-26T15:52:42Z","title":"Understanding Isomorphism Bias in Graph Data Sets","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1910.12091","snapshot_observed_at":"2026-08-10T20:20:18.101494Z","title":"Understanding isomorphism bias in graph data sets","venue":null,"work_id":null,"year":1910},"citing_paper":{"arxiv_id":"2501.08850","last_updated":"2025-01-15T15:04:10Z","snapshot_observed_at":"2026-08-12T00:46:29.743437Z","submitted_at":"2025-01-15T15:04:10Z","title":"Graph Counterfactual Explainable AI via Latent Space Traversal","version":1},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-10T20:20:18.101494Z"},"links":{"cited_paper":"/paper/1910.12091","citing_paper":"/paper/2501.08850"},"observation_digest":"sha256:dd5c29bef429b752fce70633dab129d6f8af14f0b8d860bc39b2dbd959d931d4","observation_id":"03e35464-78d7-4393-80a8-171310b01354","resolution":{"observed_at":"2026-08-10T20:20:18.101494Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1910.12091","last_updated":"2019-10-31T16:14:17Z","snapshot_observed_at":"2026-08-02T22:38:12.443280Z","submitted_at":"2019-10-26T15:52:42Z","title":"Understanding Isomorphism Bias in Graph Data Sets","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1910.12091","snapshot_observed_at":"2026-08-10T16:16:19.104474Z","title":"Understanding isomorphism bias in graph data sets","venue":null,"work_id":null,"year":1910},"citing_paper":{"arxiv_id":"2501.13456","last_updated":"2025-03-11T08:59:12Z","snapshot_observed_at":"2026-08-13T22:44:19.963117Z","submitted_at":"2025-01-23T08:14:55Z","title":"KAA: Kolmogorov-Arnold Attention for Enhancing Attentive Graph Neural Networks","version":4},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-10T16:16:19.104474Z"},"links":{"cited_paper":"/paper/1910.12091","citing_paper":"/paper/2501.13456"},"observation_digest":"sha256:6e33e8f2db85bdb0d472add2b24ec5ad505c531cf7b4a59a4aac93ecb14079ef","observation_id":"29552b67-086a-456a-997b-ce1330d2bbd7","resolution":{"observed_at":"2026-08-10T16:16:19.104474Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1910.12091","last_updated":"2019-10-31T16:14:17Z","snapshot_observed_at":"2026-08-02T22:38:12.443280Z","submitted_at":"2019-10-26T15:52:42Z","title":"Understanding Isomorphism Bias in Graph Data Sets","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1910.12091","snapshot_observed_at":"2026-08-09T17:31:23.574817Z","title":"Ivanov, S","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2502.01693","last_updated":"2025-09-08T03:35:37Z","snapshot_observed_at":"2026-08-16T10:35:14.234843Z","submitted_at":"2025-02-02T17:29:10Z","title":"Predicting Steady-State Behavior in Complex Networks with Graph Neural Networks","version":3},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-09T17:31:23.574817Z"},"links":{"cited_paper":"/paper/1910.12091","citing_paper":"/paper/2502.01693"},"observation_digest":"sha256:c248d16bf277de3731ac2a829267fa70df585ddf152e539a4122c313e1d940ec","observation_id":"13c97194-5039-46cf-bfa1-3c15ca5ddb04","resolution":{"observed_at":"2026-08-09T17:31:23.574817Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1910.12091","last_updated":"2019-10-31T16:14:17Z","snapshot_observed_at":"2026-08-02T22:38:12.443280Z","submitted_at":"2019-10-26T15:52:42Z","title":"Understanding Isomorphism Bias in Graph Data Sets","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1910.12091","snapshot_observed_at":"2026-08-08T20:45:53.858667Z","title":null,"venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2502.05000","last_updated":"2025-02-07T15:21:47Z","snapshot_observed_at":"2026-08-13T07:15:10.383055Z","submitted_at":"2025-02-07T15:21:47Z","title":"Robust Graph Learning Against Adversarial Evasion Attacks via Prior-Free Diffusion-Based Structure Purification","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-08T20:45:53.858667Z"},"links":{"cited_paper":"/paper/1910.12091","citing_paper":"/paper/2502.05000"},"observation_digest":"sha256:783b9c188d2fedb71927a578c14020debc006809140ede86ffee8e69e466ae54","observation_id":"d1f99b2d-42ef-450e-864f-07cfdcb68dec","resolution":{"observed_at":"2026-08-08T20:45:53.858667Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1910.12091","last_updated":"2019-10-31T16:14:17Z","snapshot_observed_at":"2026-08-02T22:38:12.443280Z","submitted_at":"2019-10-26T15:52:42Z","title":"Understanding Isomorphism Bias in Graph Data Sets","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1910.12091","snapshot_observed_at":"2026-08-04T19:49:43.586961Z","title":null,"venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2509.09107","last_updated":"2025-09-11T02:35:33Z","snapshot_observed_at":"2026-08-10T06:17:09.652344Z","submitted_at":"2025-09-11T02:35:33Z","title":"CryptGNN: Enabling Secure Inference for Graph Neural Networks","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-04T19:49:43.586961Z"},"links":{"cited_paper":"/paper/1910.12091","citing_paper":"/paper/2509.09107"},"observation_digest":"sha256:61e5f18913355f8dbf26f5ec829cec7b06b8f86f14f446c63a3971ef3285863e","observation_id":"6419b2bd-e6be-46b5-86c2-aec1971bcbb7","resolution":{"observed_at":"2026-08-04T19:49:43.586961Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1910.12091","last_updated":"2019-10-31T16:14:17Z","snapshot_observed_at":"2026-08-02T22:38:12.443280Z","submitted_at":"2019-10-26T15:52:42Z","title":"Understanding Isomorphism Bias in Graph Data Sets","version":2},"cited_work":{"arxiv_id":"1910.12091","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"1910.12091","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Understand- ing isomorphism bias in graph data sets","venue":null,"work_id":"c73a90b9-aa7a-45c5-bde6-b39eb81bf1e8","year":1910},"citing_paper":{"arxiv_id":"2601.15474","last_updated":"2026-04-08T16:01:56Z","snapshot_observed_at":"2026-08-15T01:59:20.617867Z","submitted_at":"2026-01-21T21:23:51Z","title":"BadImplant: Injection-based Multi-Targeted Graph Backdoor Attack","version":2},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-05-16T12:00:57.663884Z"},"links":{"cited_paper":"/paper/1910.12091","citing_paper":"/paper/2601.15474"},"observation_digest":"sha256:77ec06ad10e85c437b294ed0e4723827d5e7d984148b5e07f7134fb12e5fcc6c","observation_id":"5b7a485b-96e1-43a3-b031-3cb301476de3","resolution":{"observed_at":"2026-05-16T12:02:51.266349Z","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/1910.12091/citation-record","integrity":"/paper/1910.12091/integrity","json":"/paper/1910.12091/citation-record.json","paper":"/paper/1910.12091"},"outbound":[],"paper":{"arxiv_id":"1910.12091","last_updated":"2019-10-31T16:14:17Z","latest_version":2,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-02T22:38:12.443280Z","submitted_at":"2019-10-26T15:52:42Z","title":"Understanding Isomorphism Bias in Graph Data Sets"},"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 16 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 6 inbound Pith citation observations for arXiv:1910.12091."}