{"as_of":"2026-08-06T16:54:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:8ff39676318c3ecf93101890cbf7525676a20ab784124485bade0e4e27817bb8","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":4,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":4,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-06T06:34:29.942622+00:00","state":"measured"},{"denominator":4,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":4,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-03T08:31:22.129826Z","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-13T19:38:10.567636Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2310.09202","last_updated":"2024-05-14T17:12:15Z","snapshot_observed_at":"2026-07-06T16:32:37.715900Z","submitted_at":"2023-10-13T15:48:12Z","title":"Graph Distillation with Eigenbasis Matching","version":2},"cited_work":{"arxiv_id":"2310.09202","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2310.09202","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Graph distillation with eigenbasis matching","venue":null,"work_id":"b717e3a9-c416-476c-ad8e-397702418fc1","year":2023},"citing_paper":{"arxiv_id":"2604.03154","last_updated":"2026-04-03T16:23:59Z","snapshot_observed_at":"2026-08-02T16:57:40.164429Z","submitted_at":"2026-04-03T16:23:59Z","title":"DSBD: Dual-Aligned Structural Basis Distillation for Graph Domain Adaptation","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-05-13T19:34:21.724329Z"},"links":{"cited_paper":"/paper/2310.09202","citing_paper":"/paper/2604.03154"},"observation_digest":"sha256:828aa37ec882c2783f1cffaff286f9638aca636e7c0623b919a1dc3a5f0ecf32","observation_id":"aac92265-1ca9-44f2-8d99-fee99d4a3c27","resolution":{"observed_at":"2026-05-13T19:38:10.569170Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2310.09202","last_updated":"2024-05-14T17:12:15Z","snapshot_observed_at":"2026-07-06T16:32:37.715900Z","submitted_at":"2023-10-13T15:48:12Z","title":"Graph Distillation with Eigenbasis Matching","version":2},"cited_work":{"arxiv_id":"2310.09202","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2310.09202","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Graph distillation with eigenbasis matching","venue":null,"work_id":"b717e3a9-c416-476c-ad8e-397702418fc1","year":2023},"citing_paper":{"arxiv_id":"2605.06814","last_updated":"2026-05-07T18:16:21Z","snapshot_observed_at":"2026-07-06T23:19:15.382283Z","submitted_at":"2026-05-07T18:16:21Z","title":"From Model to Data (M2D): Shifting Complexity from GNNs to Graphs for Transparent Graph Learning","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-05-11T01:08:24.251390Z"},"links":{"cited_paper":"/paper/2310.09202","citing_paper":"/paper/2605.06814"},"observation_digest":"sha256:76a4997cee1e3284a944ab8093f203700257a7b7462fc0a3b481a9941c04fa64","observation_id":"e2b93356-55bf-4570-a7e6-764624cf370c","resolution":{"observed_at":"2026-05-11T04:45:54.738352Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2310.09202","last_updated":"2024-05-14T17:12:15Z","snapshot_observed_at":"2026-07-06T16:32:37.715900Z","submitted_at":"2023-10-13T15:48:12Z","title":"Graph Distillation with Eigenbasis Matching","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2310.09202","snapshot_observed_at":"2026-07-12T04:56:04.713121Z","title":"Graph condensation via eigenbasis matching,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.03097","last_updated":"2026-07-03T08:34:11Z","snapshot_observed_at":"2026-08-04T20:25:04.516004Z","submitted_at":"2026-07-03T08:34:11Z","title":"Heterogeneous Graph Condensation via Role-Aware Clustering","version":1},"reference_index":91,"source":"pdf_text","source_observed_at":"2026-07-12T04:56:04.713121Z"},"links":{"cited_paper":"/paper/2310.09202","citing_paper":"/paper/2607.03097"},"observation_digest":"sha256:458633ec8a7be1fd035be7c75c6a6981553ada5937517064bcad02d1d13b78f7","observation_id":"d24963fb-ab7a-4b64-9d90-9bb3fe21df85","resolution":{"observed_at":"2026-07-12T04:56:04.713121Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2310.09202","last_updated":"2024-05-14T17:12:15Z","snapshot_observed_at":"2026-07-06T16:32:37.715900Z","submitted_at":"2023-10-13T15:48:12Z","title":"Graph Distillation with Eigenbasis Matching","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2310.09202","snapshot_observed_at":"2026-08-03T08:31:22.129826Z","title":"arXiv preprint arXiv:2310.09202 , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.29365","last_updated":"2026-07-31T12:52:10Z","snapshot_observed_at":"2026-08-05T23:15:09.086392Z","submitted_at":"2026-07-31T12:52:10Z","title":"Cross-Resolution Semantic Learning for Graph Domain Adaptation","version":1},"reference_index":66,"source":"arxiv_source","source_observed_at":"2026-08-03T08:31:22.129826Z"},"links":{"cited_paper":"/paper/2310.09202","citing_paper":"/paper/2607.29365"},"observation_digest":"sha256:054265fab808203d2861b38cda6caff3bb463aafac1dfa5b2e03376f1d42d512","observation_id":"31bb79a9-557c-40fb-a29d-5cda91a51471","resolution":{"observed_at":"2026-08-03T08:31:22.129826Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2310.09202/citation-record","integrity":"/paper/2310.09202/integrity","json":"/paper/2310.09202/citation-record.json","paper":"/paper/2310.09202"},"outbound":[],"paper":{"arxiv_id":"2310.09202","last_updated":"2024-05-14T17:12:15Z","latest_version":2,"primary_category":"cs.LG","snapshot_observed_at":"2026-07-06T16:32:37.715900Z","submitted_at":"2023-10-13T15:48:12Z","title":"Graph Distillation with Eigenbasis 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-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"thesis":"As of 6 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 4 inbound Pith citation observations for arXiv:2310.09202."}