{"as_of":"2026-08-11T06:55:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:0de123c81337f012e9050f743c92867b410bf6478bd7ac2088d7c52a36c16202","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":5,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":5,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-11T06:34:44.6726+00:00","state":"measured"},{"denominator":5,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":5,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-09T05:27:45.644781Z","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-07-02T01:46:26.704154Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2405.20445","last_updated":"2025-04-08T00:15:02Z","snapshot_observed_at":"2026-07-06T18:23:01.681030Z","submitted_at":"2024-05-30T19:43:29Z","title":"Fully-inductive Node Classification on Arbitrary Graphs","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2405.20445","snapshot_observed_at":"2026-08-09T05:27:45.644781Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2502.03251","last_updated":"2025-04-08T07:04:29Z","snapshot_observed_at":"2026-08-10T04:47:59.307734Z","submitted_at":"2025-02-05T15:06:09Z","title":"RiemannGFM: Learning a Graph Foundation Model from Riemannian Geometry","version":2},"reference_index":59,"source":"pdf_text","source_observed_at":"2026-08-09T05:27:45.644781Z"},"links":{"cited_paper":"/paper/2405.20445","citing_paper":"/paper/2502.03251"},"observation_digest":"sha256:2276dedf1090bf7f3794ce6d5b5a18fe5a1cd7af1a1d66bbcbcd043b81e4f89f","observation_id":"a8f9637b-e626-43dd-b717-4d7796a984bb","resolution":{"observed_at":"2026-08-09T05:27:45.644781Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2405.20445","last_updated":"2025-04-08T00:15:02Z","snapshot_observed_at":"2026-07-06T18:23:01.681030Z","submitted_at":"2024-05-30T19:43:29Z","title":"Fully-inductive Node Classification on Arbitrary Graphs","version":5},"cited_work":{"arxiv_id":"2405.20445","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2405.20445","snapshot_observed_at":"2026-07-02T01:46:26.704154Z","title":"Graphany: A foundation model for node classification on any graph.arXiv preprint arXiv:2405.20445, 2024a","venue":null,"work_id":"bbe7b964-85e5-430d-8d8c-a9507f11d74e","year":2024},"citing_paper":{"arxiv_id":"2602.04244","last_updated":"2026-05-07T12:31:58Z","snapshot_observed_at":"2026-08-11T00:54:32.864202Z","submitted_at":"2026-02-04T06:06:28Z","title":"GraphVec: Cross-Domain Graph Vectorization for Graph-Level Representation Learning","version":2},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-05-16T07:25:35.324582Z"},"links":{"cited_paper":"/paper/2405.20445","citing_paper":"/paper/2602.04244"},"observation_digest":"sha256:6acc8ac69081cc6f2cabe809bfcb228a1dadea419ea4f244ec5563bc90f03dce","observation_id":"b6db9ee2-0292-4710-82af-95f60a560da4","resolution":{"observed_at":"2026-05-16T07:27:31.624559Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2405.20445","last_updated":"2025-04-08T00:15:02Z","snapshot_observed_at":"2026-07-06T18:23:01.681030Z","submitted_at":"2024-05-30T19:43:29Z","title":"Fully-inductive Node Classification on Arbitrary Graphs","version":5},"cited_work":{"arxiv_id":"2405.20445","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2405.20445","snapshot_observed_at":"2026-07-02T01:46:26.704154Z","title":"Graphany: A foundation model for node classification on any graph.arXiv preprint arXiv:2405.20445, 2024a","venue":null,"work_id":"bbe7b964-85e5-430d-8d8c-a9507f11d74e","year":2024},"citing_paper":{"arxiv_id":"2605.04834","last_updated":"2026-05-06T12:30:50Z","snapshot_observed_at":"2026-08-08T07:12:46.232151Z","submitted_at":"2026-05-06T12:30:50Z","title":"Bridging Input Feature Spaces Towards Graph Foundation Models","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-05-08T17:18:21.259797Z"},"links":{"cited_paper":"/paper/2405.20445","citing_paper":"/paper/2605.04834"},"observation_digest":"sha256:552e05f7fefa33c11162e1446e716f496fec088dabf2eba93c0cb488ec68285d","observation_id":"390bb1f4-9b56-4bcc-9fdf-306586703766","resolution":{"observed_at":"2026-05-11T17:41:08.786505Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2405.20445","last_updated":"2025-04-08T00:15:02Z","snapshot_observed_at":"2026-07-06T18:23:01.681030Z","submitted_at":"2024-05-30T19:43:29Z","title":"Fully-inductive Node Classification on Arbitrary Graphs","version":5},"cited_work":{"arxiv_id":"2405.20445","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2405.20445","snapshot_observed_at":"2026-07-02T01:46:26.704154Z","title":"Graphany: A foundation model for node classification on any graph.arXiv preprint arXiv:2405.20445, 2024a","venue":null,"work_id":"bbe7b964-85e5-430d-8d8c-a9507f11d74e","year":2024},"citing_paper":{"arxiv_id":"2606.03315","last_updated":"2026-06-02T08:27:03Z","snapshot_observed_at":"2026-08-02T01:16:29.098858Z","submitted_at":"2026-06-02T08:27:03Z","title":"A Graph Foundation Model with Spectral Parsing and Prototype-Guided Spatial Propagation","version":1},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-06-28T11:34:22.107760Z"},"links":{"cited_paper":"/paper/2405.20445","citing_paper":"/paper/2606.03315"},"observation_digest":"sha256:d27b3af4c0345997eed41e828feebaff1d67f7c5b9a76481588d91cc4b6d39eb","observation_id":"916627ac-98fb-4cc0-8019-15d4c2a7ea5a","resolution":{"observed_at":"2026-07-02T01:46:26.706216Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2405.20445","last_updated":"2025-04-08T00:15:02Z","snapshot_observed_at":"2026-07-06T18:23:01.681030Z","submitted_at":"2024-05-30T19:43:29Z","title":"Fully-inductive Node Classification on Arbitrary Graphs","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2405.20445","snapshot_observed_at":"2026-08-03T16:12:22.241005Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.28980","last_updated":"2026-07-31T03:12:09Z","snapshot_observed_at":"2026-08-09T03:25:54.058940Z","submitted_at":"2026-07-31T03:12:09Z","title":"Beyond Feature and Structure Alignment: Learning Transferable Propagation Knowledge for Graph Foundation Models","version":1},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-08-03T16:12:22.241005Z"},"links":{"cited_paper":"/paper/2405.20445","citing_paper":"/paper/2607.28980"},"observation_digest":"sha256:ab1682937a6da2484863cc07ab5d4ac86cbe12921bc8f245287c3ef55bdb1d9f","observation_id":"65f9f0c4-33b0-4769-a56b-4e93564a9477","resolution":{"observed_at":"2026-08-03T16:12:22.241005Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2405.20445/citation-record","integrity":"/paper/2405.20445/integrity","json":"/paper/2405.20445/citation-record.json","paper":"/paper/2405.20445"},"outbound":[],"paper":{"arxiv_id":"2405.20445","last_updated":"2025-04-08T00:15:02Z","latest_version":5,"primary_category":"cs.LG","snapshot_observed_at":"2026-07-06T18:23:01.681030Z","submitted_at":"2024-05-30T19:43:29Z","title":"Fully-inductive Node Classification on Arbitrary Graphs"},"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-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"thesis":"As of 11 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 5 inbound Pith citation observations for arXiv:2405.20445."}