{"as_of":"2026-08-10T21:16:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:8bd8817222120e4a99def40488551225416e1a814ffa7c7213055e3c699b6abb","coverage":[{"denominator":56,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":56,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-10T14:05:43.976313Z","state":"measured"},{"denominator":56,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":56,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-10T06:31:04.303077+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2501.15696/citation-record","integrity":"/paper/2501.15696/integrity","json":"/paper/2501.15696/citation-record.json","paper":"/paper/2501.15696"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T14:05:45.167148Z","title":"Multi-relational poincar´e graph em- beddings","venue":null,"work_id":"9fa44b81-ea08-42cb-81e3-e15d3a8eb972","year":2019},"citing_paper":{"arxiv_id":"2501.15696","last_updated":"2025-01-26T22:55:34Z","snapshot_observed_at":"2026-08-10T14:00:32.093089Z","submitted_at":"2025-01-26T22:55:34Z","title":"Random Walk Guided Hyperbolic Graph Distillation","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-10T14:05:43.621896Z"},"links":{"citing_paper":"/paper/2501.15696"},"observation_digest":"sha256:3f33df5d20419e032e80c9940a778f5839399423eb48f8f6672db47e5e4f638b","observation_id":"5fa8ae02-8fe2-40cb-8e37-7c7d8bb48238","resolution":{"observed_at":"2026-08-10T14:05:45.172258Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T14:05:44.436462Z","title":"For GDEM, while it can capture the commute time for a few pairs of nodes, there remains a significant gap in capturing the overall distribution of values in the original graphs","venue":null,"work_id":"89b94b21-6a95-4352-983b-d069dbfb311c","year":2017},"citing_paper":{"arxiv_id":"2501.15696","last_updated":"2025-01-26T22:55:34Z","snapshot_observed_at":"2026-08-10T14:00:32.093089Z","submitted_at":"2025-01-26T22:55:34Z","title":"Random Walk Guided Hyperbolic Graph Distillation","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-10T14:05:43.976313Z"},"links":{"citing_paper":"/paper/2501.15696"},"observation_digest":"sha256:e1dd787c5b3fd6a2485c96374a5ef684e32f3368374a8f629fb148c11ce47180","observation_id":"8552d3df-77b8-4d39-a179-d335848391d2","resolution":{"observed_at":"2026-08-10T14:05:44.441506Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T14:05:45.047097Z","title":"A general framework for graph sparsification","venue":null,"work_id":"fac9aabb-ef45-4c1f-bd86-7f904b930556","year":2011},"citing_paper":{"arxiv_id":"2501.15696","last_updated":"2025-01-26T22:55:34Z","snapshot_observed_at":"2026-08-10T14:00:32.093089Z","submitted_at":"2025-01-26T22:55:34Z","title":"Random Walk Guided Hyperbolic Graph Distillation","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-10T14:05:43.664370Z"},"links":{"citing_paper":"/paper/2501.15696"},"observation_digest":"sha256:d53bee2d8f1355224dd49be478a4404729dc28328c510f8a8c69cc0bbb748870","observation_id":"f9f156ec-a5b7-45c0-ab83-e54a6504792a","resolution":{"observed_at":"2026-08-10T14:05:45.052043Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T14:05:43.690476Z","title":"Gc4nc: A benchmark framework for graph condensation on node classifica- tion with new insights","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2501.15696","last_updated":"2025-01-26T22:55:34Z","snapshot_observed_at":"2026-08-10T14:00:32.093089Z","submitted_at":"2025-01-26T22:55:34Z","title":"Random Walk Guided Hyperbolic Graph Distillation","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-10T14:05:43.690476Z"},"links":{"citing_paper":"/paper/2501.15696"},"observation_digest":"sha256:ac4584c7aa3b865993ee61431f357467be6ea86c666eb96ee0a78dce1de3f11b","observation_id":"64ea36df-b789-4dda-bf93-5323527bc0c7","resolution":{"observed_at":"2026-08-10T14:05:43.690476Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T14:05:44.990232Z","title":"The hidden flow structure and metric space of network embedding algorithms based on random walks","venue":null,"work_id":"5e4d2b97-29a0-4239-ac5d-ab4f28319040","year":2017},"citing_paper":{"arxiv_id":"2501.15696","last_updated":"2025-01-26T22:55:34Z","snapshot_observed_at":"2026-08-10T14:00:32.093089Z","submitted_at":"2025-01-26T22:55:34Z","title":"Random Walk Guided Hyperbolic Graph Distillation","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-10T14:05:43.695185Z"},"links":{"citing_paper":"/paper/2501.15696"},"observation_digest":"sha256:4fed450897bc1119af9ee75a8ecf69d78451956ed907241fd0ddc6a3690438d1","observation_id":"7e330388-91df-4184-8c85-6e7bd8da95f4","resolution":{"observed_at":"2026-08-10T14:05:44.995652Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2402.03358","last_updated":"2024-06-29T13:07:00Z","snapshot_observed_at":"2026-08-10T12:42:50.590479Z","submitted_at":"2024-01-29T01:19:09Z","title":"A Comprehensive Survey on Graph Reduction: Sparsification, Coarsening, and Condensation","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.03358","snapshot_observed_at":"2026-08-10T14:05:43.704420Z","title":"A comprehensive survey on graph reduction: Sparsification, coarsening, and condensation","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2501.15696","last_updated":"2025-01-26T22:55:34Z","snapshot_observed_at":"2026-08-10T14:00:32.093089Z","submitted_at":"2025-01-26T22:55:34Z","title":"Random Walk Guided Hyperbolic Graph Distillation","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-10T14:05:43.704420Z"},"links":{"cited_paper":"/paper/2402.03358","citing_paper":"/paper/2501.15696"},"observation_digest":"sha256:ff245c5e638cfc4cd67fa47954a00234edd367769ec82f1ae829ce1fae86dc56","observation_id":"00d3379a-107d-481c-9e3b-b876cd089ff2","resolution":{"observed_at":"2026-08-10T14:05:43.704420Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T14:05:44.962313Z","title":"Spectral gaps of random graphs and applications","venue":null,"work_id":"33d745ee-90ee-4d35-94bf-f43957720c02","year":2021},"citing_paper":{"arxiv_id":"2501.15696","last_updated":"2025-01-26T22:55:34Z","snapshot_observed_at":"2026-08-10T14:00:32.093089Z","submitted_at":"2025-01-26T22:55:34Z","title":"Random Walk Guided Hyperbolic Graph Distillation","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-10T14:05:43.710129Z"},"links":{"citing_paper":"/paper/2501.15696"},"observation_digest":"sha256:7ae1628d95ba9d6be2de3d6666b48ea22a1d70f618c3aafcc0cc2d0d8098d9ae","observation_id":"240a6405-a856-4c09-a50a-352ad120dbec","resolution":{"observed_at":"2026-08-10T14:05:44.967262Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T14:05:44.933647Z","title":"Scaling up graph neu- ral networks via graph coarsening","venue":null,"work_id":"8b28cfa6-dd1c-4241-b99d-d3e71d466efd","year":2021},"citing_paper":{"arxiv_id":"2501.15696","last_updated":"2025-01-26T22:55:34Z","snapshot_observed_at":"2026-08-10T14:00:32.093089Z","submitted_at":"2025-01-26T22:55:34Z","title":"Random Walk Guided Hyperbolic Graph Distillation","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-10T14:05:43.720163Z"},"links":{"citing_paper":"/paper/2501.15696"},"observation_digest":"sha256:a7d70279abc065c719615d528a408b75afc98634a36bddf9597f8a552de8e3c1","observation_id":"5d33469e-b06a-440f-9f01-c94f8265d0c7","resolution":{"observed_at":"2026-08-10T14:05:44.938846Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T14:05:44.915751Z","title":"Adversarial inter-group link injection degrades the fairness of graph neural networks","venue":null,"work_id":"74fcf752-27f4-4058-bb04-a75a169cbcd3","year":2022},"citing_paper":{"arxiv_id":"2501.15696","last_updated":"2025-01-26T22:55:34Z","snapshot_observed_at":"2026-08-10T14:00:32.093089Z","submitted_at":"2025-01-26T22:55:34Z","title":"Random Walk Guided Hyperbolic Graph Distillation","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-10T14:05:43.725907Z"},"links":{"citing_paper":"/paper/2501.15696"},"observation_digest":"sha256:1235dee7b41f292fb023d518c67835263737d912eabf0c57d6ede00569219f0a","observation_id":"fea426db-50fa-45be-8e6e-7b98fd16329e","resolution":{"observed_at":"2026-08-10T14:05:44.921214Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T14:05:44.899854Z","title":"Condensing graphs via one-step gradient matching","venue":null,"work_id":"7976166a-df8d-4693-9394-cc45bc488352","year":2022},"citing_paper":{"arxiv_id":"2501.15696","last_updated":"2025-01-26T22:55:34Z","snapshot_observed_at":"2026-08-10T14:00:32.093089Z","submitted_at":"2025-01-26T22:55:34Z","title":"Random Walk Guided Hyperbolic Graph Distillation","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-10T14:05:43.739317Z"},"links":{"citing_paper":"/paper/2501.15696"},"observation_digest":"sha256:a197d79ef5a267a3f3d6bfa3428daffc637212428f127405641ac40b2d51901c","observation_id":"5c028d2c-a006-4a50-beea-ab08e00e1f54","resolution":{"observed_at":"2026-08-10T14:05:44.904996Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1609.02907","last_updated":"2017-02-22T09:55:36Z","snapshot_observed_at":"2026-07-06T05:10:16.862707Z","submitted_at":"2016-09-09T19:48:41Z","title":"Semi-Supervised Classification with Graph Convolutional Networks","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1609.02907","snapshot_observed_at":"2026-08-10T14:05:43.745939Z","title":"Semi-supervised classification with graph convolutional networks","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2501.15696","last_updated":"2025-01-26T22:55:34Z","snapshot_observed_at":"2026-08-10T14:00:32.093089Z","submitted_at":"2025-01-26T22:55:34Z","title":"Random Walk Guided Hyperbolic Graph Distillation","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-10T14:05:43.745939Z"},"links":{"cited_paper":"/paper/1609.02907","citing_paper":"/paper/2501.15696"},"observation_digest":"sha256:7b1c1d5533f5e41daed4c771e95c4a6ff42e8b89764386d5427e2ce53b27690d","observation_id":"0e65351c-c28f-46f7-9258-2bd46a1300d7","resolution":{"observed_at":"2026-08-10T14:05:43.745939Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T14:05:44.881103Z","title":"Predict then propa- gate: Graph neural networks meet personalized pagerank","venue":null,"work_id":"7d96109d-6fa4-4af8-b4c3-ec8b21828045","year":2019},"citing_paper":{"arxiv_id":"2501.15696","last_updated":"2025-01-26T22:55:34Z","snapshot_observed_at":"2026-08-10T14:00:32.093089Z","submitted_at":"2025-01-26T22:55:34Z","title":"Random Walk Guided Hyperbolic Graph Distillation","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-10T14:05:43.756668Z"},"links":{"citing_paper":"/paper/2501.15696"},"observation_digest":"sha256:91456fa9e31ad8a395d55a412d9f35b598087d0db43c7acf05bdb5be65f17033","observation_id":"0e284a2a-3694-4ae4-a083-cbb25dbcc6c0","resolution":{"observed_at":"2026-08-10T14:05:44.887733Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T14:05:44.861956Z","title":"Random walk: a modern introduction, volume","venue":null,"work_id":"0a7511c8-c4b2-488f-bd9c-3b55f48b8d22","year":2010},"citing_paper":{"arxiv_id":"2501.15696","last_updated":"2025-01-26T22:55:34Z","snapshot_observed_at":"2026-08-10T14:00:32.093089Z","submitted_at":"2025-01-26T22:55:34Z","title":"Random Walk Guided Hyperbolic Graph Distillation","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-10T14:05:43.764453Z"},"links":{"citing_paper":"/paper/2501.15696"},"observation_digest":"sha256:6c9aa0dc7654be43b0742493803be0187aeb2e5b25cd8b95ce8ae0c4948b4733","observation_id":"1c7db1d0-21cc-4b05-94d1-c461d10f6690","resolution":{"observed_at":"2026-08-10T14:05:44.867016Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T14:05:44.828087Z","title":"Survey of graph neural net- works and applications","venue":null,"work_id":"ba26a572-26aa-4d82-ab5a-d3fe4c44fc0d","year":2022},"citing_paper":{"arxiv_id":"2501.15696","last_updated":"2025-01-26T22:55:34Z","snapshot_observed_at":"2026-08-10T14:00:32.093089Z","submitted_at":"2025-01-26T22:55:34Z","title":"Random Walk Guided Hyperbolic Graph Distillation","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-10T14:05:43.774410Z"},"links":{"citing_paper":"/paper/2501.15696"},"observation_digest":"sha256:5613b8d7ac96a14daabd8f0aedf8ba118d429992120cb3513d58ad8b11b604c4","observation_id":"22b5a8ff-727c-4157-9e6e-1a8a46651cf2","resolution":{"observed_at":"2026-08-10T14:05:44.832770Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T14:05:44.812080Z","title":"The geometry of graphs and some of its algo- rithmic applications","venue":null,"work_id":"8bdc8603-6dc3-4e5d-8997-b03ced6bfd8a","year":1995},"citing_paper":{"arxiv_id":"2501.15696","last_updated":"2025-01-26T22:55:34Z","snapshot_observed_at":"2026-08-10T14:00:32.093089Z","submitted_at":"2025-01-26T22:55:34Z","title":"Random Walk Guided Hyperbolic Graph Distillation","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-10T14:05:43.780688Z"},"links":{"citing_paper":"/paper/2501.15696"},"observation_digest":"sha256:39e84e743d78ae6d1a3a2e1c8b4025778f34b133edae948e4bb50e1de84c1fcd","observation_id":"592be445-bc00-4410-8ea7-eaa353f5d108","resolution":{"observed_at":"2026-08-10T14:05:44.817603Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-08-10T14:05:43.793114Z","title":"Graph condensation via eigenbasis matching","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2501.15696","last_updated":"2025-01-26T22:55:34Z","snapshot_observed_at":"2026-08-10T14:00:32.093089Z","submitted_at":"2025-01-26T22:55:34Z","title":"Random Walk Guided Hyperbolic Graph Distillation","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-10T14:05:43.793114Z"},"links":{"cited_paper":"/paper/2310.09202","citing_paper":"/paper/2501.15696"},"observation_digest":"sha256:a9dd89b10adb7366b1d02843643af7ed9b472de45c446793ef3dce7ef71490fb","observation_id":"4d73ced8-fa8a-4b6f-994e-5ca6eebfeee8","resolution":{"observed_at":"2026-08-10T14:05:43.793114Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T14:05:44.796136Z","title":"Cat: Balanced continual graph learning with graph con- densation","venue":null,"work_id":"98c2eb81-771c-4552-8fcb-8fa8b28498fc","year":2023},"citing_paper":{"arxiv_id":"2501.15696","last_updated":"2025-01-26T22:55:34Z","snapshot_observed_at":"2026-08-10T14:00:32.093089Z","submitted_at":"2025-01-26T22:55:34Z","title":"Random Walk Guided Hyperbolic Graph Distillation","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-10T14:05:43.799200Z"},"links":{"citing_paper":"/paper/2501.15696"},"observation_digest":"sha256:497eec7b8589bf7d8fded9e4bf4cc6aa3e81c8cec5956ce470cfdf2e3c25ccb7","observation_id":"bc837933-77c8-4db5-a56a-282923c721d4","resolution":{"observed_at":"2026-08-10T14:05:44.800941Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2405.14246","last_updated":"2024-07-10T04:01:55Z","snapshot_observed_at":"2026-07-06T18:18:21.334080Z","submitted_at":"2024-05-23T07:25:31Z","title":"GCondenser: Benchmarking Graph Condensation","version":3},"cited_work":{"arxiv_id":"2405.14246","doi":null,"metadata_source":"pith","pith_arxiv_id":"2405.14246","snapshot_observed_at":"2026-08-10T14:05:44.159556Z","title":"GCondenser: Benchmarking Graph Condensation","venue":"cs.LG","work_id":"34a5d847-0171-4ed2-8222-4daff817d49a","year":2024},"citing_paper":{"arxiv_id":"2501.15696","last_updated":"2025-01-26T22:55:34Z","snapshot_observed_at":"2026-08-10T14:00:32.093089Z","submitted_at":"2025-01-26T22:55:34Z","title":"Random Walk Guided Hyperbolic Graph Distillation","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-10T14:05:43.805268Z"},"links":{"cited_paper":"/paper/2405.14246","citing_paper":"/paper/2501.15696"},"observation_digest":"sha256:82ec53a2b5da50df4a3d60aea6726038c1c32103b4c77d024a3a547a871d1d84","observation_id":"cc6d2017-a8dd-419f-b2c5-603cb09372cf","resolution":{"observed_at":"2026-08-10T14:05:44.165628Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T14:05:44.774999Z","title":"Spectrally approximating large graphs with smaller graphs","venue":null,"work_id":"33e0ea87-8704-420f-9259-04ed1f89423f","year":2018},"citing_paper":{"arxiv_id":"2501.15696","last_updated":"2025-01-26T22:55:34Z","snapshot_observed_at":"2026-08-10T14:00:32.093089Z","submitted_at":"2025-01-26T22:55:34Z","title":"Random Walk Guided Hyperbolic Graph Distillation","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-10T14:05:43.817604Z"},"links":{"citing_paper":"/paper/2501.15696"},"observation_digest":"sha256:827c495229e1a407d284c0620ab6466c6af91284f6ecee7658102427c14fa881","observation_id":"cf18293b-e135-4cd1-b759-94cd1a4159d6","resolution":{"observed_at":"2026-08-10T14:05:44.780777Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T14:05:44.753328Z","title":"Random walks on graphs","venue":null,"work_id":"3ae34c6c-8b58-4af4-93e2-d7848bc9d2cc","year":1993},"citing_paper":{"arxiv_id":"2501.15696","last_updated":"2025-01-26T22:55:34Z","snapshot_observed_at":"2026-08-10T14:00:32.093089Z","submitted_at":"2025-01-26T22:55:34Z","title":"Random Walk Guided Hyperbolic Graph Distillation","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-10T14:05:43.829870Z"},"links":{"citing_paper":"/paper/2501.15696"},"observation_digest":"sha256:b7ce6a4c699a77c89fd6871e4799b8a1aa2d6f69c0c003405b1cebe590d154c8","observation_id":"fb2361fc-e875-4a9d-9ab1-ccf278ce6ed6","resolution":{"observed_at":"2026-08-10T14:05:44.759055Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T14:05:44.702400Z","title":"Poincar ´e embeddings for learning hierarchical rep- resentations","venue":null,"work_id":"58f401c4-fda0-4914-a24d-d1da3ed02e59","year":2017},"citing_paper":{"arxiv_id":"2501.15696","last_updated":"2025-01-26T22:55:34Z","snapshot_observed_at":"2026-08-10T14:00:32.093089Z","submitted_at":"2025-01-26T22:55:34Z","title":"Random Walk Guided Hyperbolic Graph Distillation","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-10T14:05:43.853519Z"},"links":{"citing_paper":"/paper/2501.15696"},"observation_digest":"sha256:274ecefe034b2ad50bde10162f1f0ebd2c71543e3606a6829076c89f24c76b54","observation_id":"4e4dad69-9e6f-4b59-b8d6-bfb1d382ff15","resolution":{"observed_at":"2026-08-10T14:05:44.707230Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T14:05:44.683179Z","title":"Deepwalk: Online learning of social rep- resentations","venue":null,"work_id":"660fb3dd-a67d-4f10-bdb3-58a340494333","year":2014},"citing_paper":{"arxiv_id":"2501.15696","last_updated":"2025-01-26T22:55:34Z","snapshot_observed_at":"2026-08-10T14:00:32.093089Z","submitted_at":"2025-01-26T22:55:34Z","title":"Random Walk Guided Hyperbolic Graph Distillation","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-10T14:05:43.859983Z"},"links":{"citing_paper":"/paper/2501.15696"},"observation_digest":"sha256:6bc8f41d63f8b471cd2c24819fe1e07ff347ce257f87b1002de68e3765591371","observation_id":"65c9d6b5-7f77-4845-a45a-7b59679d6a61","resolution":{"observed_at":"2026-08-10T14:05:44.688516Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1811.05868","last_updated":"2019-06-18T13:15:39Z","snapshot_observed_at":"2026-08-10T09:46:29.797564Z","submitted_at":"2018-11-14T15:53:19Z","title":"Pitfalls of Graph Neural Network Evaluation","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1811.05868","snapshot_observed_at":"2026-08-10T14:05:43.878502Z","title":"Pitfalls of graph neural network evaluation","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2501.15696","last_updated":"2025-01-26T22:55:34Z","snapshot_observed_at":"2026-08-10T14:00:32.093089Z","submitted_at":"2025-01-26T22:55:34Z","title":"Random Walk Guided Hyperbolic Graph Distillation","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-10T14:05:43.878502Z"},"links":{"cited_paper":"/paper/1811.05868","citing_paper":"/paper/2501.15696"},"observation_digest":"sha256:4e33c2bd11465a8fced82f28f8c4af990d3cac0de1f5790059200a682a078021","observation_id":"58755f6b-3826-45e3-ae8f-712c168c705c","resolution":{"observed_at":"2026-08-10T14:05:43.878502Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2407.00615","last_updated":"2024-11-21T19:57:09Z","snapshot_observed_at":"2026-07-06T18:39:03.315371Z","submitted_at":"2024-06-30T07:47:34Z","title":"GC-Bench: An Open and Unified Benchmark for Graph Condensation","version":2},"cited_work":{"arxiv_id":"2407.00615","doi":null,"metadata_source":"pith","pith_arxiv_id":"2407.00615","snapshot_observed_at":"2026-08-10T14:05:44.089788Z","title":"GC-Bench: An Open and Unified Benchmark for Graph Condensation","venue":"cs.LG","work_id":"f3041f96-abe6-41a2-90f0-f02f953ff103","year":2024},"citing_paper":{"arxiv_id":"2501.15696","last_updated":"2025-01-26T22:55:34Z","snapshot_observed_at":"2026-08-10T14:00:32.093089Z","submitted_at":"2025-01-26T22:55:34Z","title":"Random Walk Guided Hyperbolic Graph Distillation","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-10T14:05:43.883522Z"},"links":{"cited_paper":"/paper/2407.00615","citing_paper":"/paper/2501.15696"},"observation_digest":"sha256:61680a2f08192eb0dd3ef63d0598f769ba4c9e79354619e748feeaf2d63015eb","observation_id":"c31b5402-89ef-49ad-8a67-3144fadfcbc9","resolution":{"observed_at":"2026-08-10T14:05:44.097057Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T14:05:44.645623Z","title":"Arnetminer: Extraction and mining of academic social networks","venue":null,"work_id":"9581a733-e68a-416e-8075-3a24a3bad94d","year":2008},"citing_paper":{"arxiv_id":"2501.15696","last_updated":"2025-01-26T22:55:34Z","snapshot_observed_at":"2026-08-10T14:00:32.093089Z","submitted_at":"2025-01-26T22:55:34Z","title":"Random Walk Guided Hyperbolic Graph Distillation","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-10T14:05:43.888353Z"},"links":{"citing_paper":"/paper/2501.15696"},"observation_digest":"sha256:578a9c6b28f980290ce1e5a500c01b0a833c719173bc08d7c33134f13fc0bf79","observation_id":"a1acc439-1a02-4ece-b7d2-b49dc0f56c52","resolution":{"observed_at":"2026-08-10T14:05:44.651802Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T14:05:44.609557Z","title":"Hitting and commute times in large random neighborhood graphs","venue":null,"work_id":"aa884f9f-7b4c-4d80-bb7e-a71a3258a705","year":2014},"citing_paper":{"arxiv_id":"2501.15696","last_updated":"2025-01-26T22:55:34Z","snapshot_observed_at":"2026-08-10T14:00:32.093089Z","submitted_at":"2025-01-26T22:55:34Z","title":"Random Walk Guided Hyperbolic Graph Distillation","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-10T14:05:43.898712Z"},"links":{"citing_paper":"/paper/2501.15696"},"observation_digest":"sha256:545f9cebcfd15fc060cedd11b9817b49c29131a87a6a6a08713f12c296e2fd16","observation_id":"17468c35-954a-48c7-bc1e-4453faa57d99","resolution":{"observed_at":"2026-08-10T14:05:44.614784Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1811.10959","last_updated":"2020-02-24T23:25:50Z","snapshot_observed_at":"2026-07-06T07:17:20.813296Z","submitted_at":"2018-11-27T13:17:45Z","title":"Dataset Distillation","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1811.10959","snapshot_observed_at":"2026-08-10T14:05:43.903395Z","title":"Dataset distillation","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2501.15696","last_updated":"2025-01-26T22:55:34Z","snapshot_observed_at":"2026-08-10T14:00:32.093089Z","submitted_at":"2025-01-26T22:55:34Z","title":"Random Walk Guided Hyperbolic Graph Distillation","version":1},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-10T14:05:43.903395Z"},"links":{"cited_paper":"/paper/1811.10959","citing_paper":"/paper/2501.15696"},"observation_digest":"sha256:57753f1ab09256b9a62bea7de4f1717cb3e6a7d39a3074a7f4084b2c66080350","observation_id":"a8ebccb7-a1b1-4e02-9f7b-7896f98259d8","resolution":{"observed_at":"2026-08-10T14:05:43.903395Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T14:05:44.592581Z","title":"Fast graph condensation with structure- based neural tangent kernel","venue":null,"work_id":"897dc4cf-d8b1-4379-ab4c-fa488ee31442","year":2024},"citing_paper":{"arxiv_id":"2501.15696","last_updated":"2025-01-26T22:55:34Z","snapshot_observed_at":"2026-08-10T14:00:32.093089Z","submitted_at":"2025-01-26T22:55:34Z","title":"Random Walk Guided Hyperbolic Graph Distillation","version":1},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-10T14:05:43.909580Z"},"links":{"citing_paper":"/paper/2501.15696"},"observation_digest":"sha256:9a347df998c0240e835adaaab5a556d5b4e52765ec4dc92da4b5f67c0dedaad8","observation_id":"a2c0ea2d-e33b-407b-a80d-3a698aadb5ff","resolution":{"observed_at":"2026-08-10T14:05:44.597930Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T14:05:44.574283Z","title":"Herding dynamical weights to learn","venue":null,"work_id":"ca22907a-ce16-4dd7-92a3-94061921193e","year":2009},"citing_paper":{"arxiv_id":"2501.15696","last_updated":"2025-01-26T22:55:34Z","snapshot_observed_at":"2026-08-10T14:00:32.093089Z","submitted_at":"2025-01-26T22:55:34Z","title":"Random Walk Guided Hyperbolic Graph Distillation","version":1},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-10T14:05:43.915653Z"},"links":{"citing_paper":"/paper/2501.15696"},"observation_digest":"sha256:0cd0b6a7015526997a2e944fde8831f9c519805587c05f7a1bf95e7882f61e59","observation_id":"cf51b966-54a6-481a-b8c4-9e14f4f98c27","resolution":{"observed_at":"2026-08-10T14:05:44.579252Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T14:05:44.556971Z","title":null,"venue":null,"work_id":"33fc2616-c253-410e-92b5-61fe8125aa2c","year":2024},"citing_paper":{"arxiv_id":"2501.15696","last_updated":"2025-01-26T22:55:34Z","snapshot_observed_at":"2026-08-10T14:00:32.093089Z","submitted_at":"2025-01-26T22:55:34Z","title":"Random Walk Guided Hyperbolic Graph Distillation","version":1},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-10T14:05:43.920982Z"},"links":{"citing_paper":"/paper/2501.15696"},"observation_digest":"sha256:358c5b2868c226f03e5b5b3f8f60c423b3fedf7347e9e44781a0f6893a71ded7","observation_id":"2ce31095-58d9-42a5-9f56-374bccd533b6","resolution":{"observed_at":"2026-08-10T14:05:44.561809Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T14:05:43.926100Z","title":"Simpli- fying graph convolutional networks","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2501.15696","last_updated":"2025-01-26T22:55:34Z","snapshot_observed_at":"2026-08-10T14:00:32.093089Z","submitted_at":"2025-01-26T22:55:34Z","title":"Random Walk Guided Hyperbolic Graph Distillation","version":1},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-08-10T14:05:43.926100Z"},"links":{"citing_paper":"/paper/2501.15696"},"observation_digest":"sha256:3e8be9c08ae18662c4f027461ae007f55b5f9797e86e1e200972d201fafdd988","observation_id":"17f1fa83-a8bb-4ecc-9087-90dbe16f87cd","resolution":{"observed_at":"2026-08-10T14:05:43.926100Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T14:05:44.525884Z","title":"Simplifying and empowering transformers for large-graph representations","venue":null,"work_id":"a408aa60-b53c-4891-a0dd-6808f87a5c70","year":2024},"citing_paper":{"arxiv_id":"2501.15696","last_updated":"2025-01-26T22:55:34Z","snapshot_observed_at":"2026-08-10T14:00:32.093089Z","submitted_at":"2025-01-26T22:55:34Z","title":"Random Walk Guided Hyperbolic Graph Distillation","version":1},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-08-10T14:05:43.932082Z"},"links":{"citing_paper":"/paper/2501.15696"},"observation_digest":"sha256:9b49d3a26a10eaea5bcd595bf0dc8b3c0becdd8c6cc03ccab628d96a8416cc9d","observation_id":"81667db4-b8f2-45e4-8951-86710f0bf8f4","resolution":{"observed_at":"2026-08-10T14:05:44.532223Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T14:05:44.507327Z","title":"Random walks: A review of algorithms and applications","venue":null,"work_id":"0588752b-0601-4bae-9875-4e37f61f08c9","year":2019},"citing_paper":{"arxiv_id":"2501.15696","last_updated":"2025-01-26T22:55:34Z","snapshot_observed_at":"2026-08-10T14:00:32.093089Z","submitted_at":"2025-01-26T22:55:34Z","title":"Random Walk Guided Hyperbolic Graph Distillation","version":1},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-08-10T14:05:43.938080Z"},"links":{"citing_paper":"/paper/2501.15696"},"observation_digest":"sha256:db1a101e949307ccf6a8014d6f5763fe324b11eeb6838f1f3026b96acdff656a","observation_id":"4f094491-d5d9-411e-abdb-69b4a9980a42","resolution":{"observed_at":"2026-08-10T14:05:44.513281Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T14:05:44.487184Z","title":"Does graph distillation see like vision dataset counter- part? Advances in Neural Information Processing Sys- tems, 36,","venue":null,"work_id":"f0f36619-11c2-49ba-8bbd-07e10b8ff911","year":2024},"citing_paper":{"arxiv_id":"2501.15696","last_updated":"2025-01-26T22:55:34Z","snapshot_observed_at":"2026-08-10T14:00:32.093089Z","submitted_at":"2025-01-26T22:55:34Z","title":"Random Walk Guided Hyperbolic Graph Distillation","version":1},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-08-10T14:05:43.944226Z"},"links":{"citing_paper":"/paper/2501.15696"},"observation_digest":"sha256:a61803bde3ee9ed9a4491855873c67b88cd20d356bfa85567c6f01fbe6ed8e66","observation_id":"464e55e3-1916-45f5-9244-28cb4d52e39d","resolution":{"observed_at":"2026-08-10T14:05:44.493268Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1907.04931","last_updated":"2020-02-16T00:42:48Z","snapshot_observed_at":"2026-08-05T00:16:40.110456Z","submitted_at":"2019-07-10T21:11:13Z","title":"GraphSAINT: Graph Sampling Based Inductive Learning Method","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1907.04931","snapshot_observed_at":"2026-08-10T14:05:43.950839Z","title":"Graph- saint: Graph sampling based inductive learning method","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2501.15696","last_updated":"2025-01-26T22:55:34Z","snapshot_observed_at":"2026-08-10T14:00:32.093089Z","submitted_at":"2025-01-26T22:55:34Z","title":"Random Walk Guided Hyperbolic Graph Distillation","version":1},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-08-10T14:05:43.950839Z"},"links":{"cited_paper":"/paper/1907.04931","citing_paper":"/paper/2501.15696"},"observation_digest":"sha256:5146f85729225ead96b6dda76807af5873a7e31f97855b6f4d967ff2ba75f8f7","observation_id":"9559f085-2461-4517-b19e-c6511ddb4593","resolution":{"observed_at":"2026-08-10T14:05:43.950839Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2402.05011","last_updated":"2024-06-18T12:38:51Z","snapshot_observed_at":"2026-08-01T22:34:05.442458Z","submitted_at":"2024-02-07T16:32:02Z","title":"Navigating Complexity: Toward Lossless Graph Condensation via Expanding Window Matching","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.05011","snapshot_observed_at":"2026-08-10T14:05:43.959764Z","title":"Navigating complexity: Toward loss- less graph condensation via expanding window matching","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2501.15696","last_updated":"2025-01-26T22:55:34Z","snapshot_observed_at":"2026-08-10T14:00:32.093089Z","submitted_at":"2025-01-26T22:55:34Z","title":"Random Walk Guided Hyperbolic Graph Distillation","version":1},"reference_index":54,"source":"pdf_text","source_observed_at":"2026-08-10T14:05:43.959764Z"},"links":{"cited_paper":"/paper/2402.05011","citing_paper":"/paper/2501.15696"},"observation_digest":"sha256:677b142543f442429bdfedd73edb77dc3b964019d3c03a25d3ebd014e992578b","observation_id":"ce54e3ba-1a3b-462f-8782-c18bb1db7628","resolution":{"observed_at":"2026-08-10T14:05:43.959764Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T14:05:44.470713Z","title":"Structure-free graph condensation: From large-scale graphs to condensed graph-free data","venue":null,"work_id":"782a6b1b-a998-4796-bd73-f51fbc8976ad","year":2024},"citing_paper":{"arxiv_id":"2501.15696","last_updated":"2025-01-26T22:55:34Z","snapshot_observed_at":"2026-08-10T14:00:32.093089Z","submitted_at":"2025-01-26T22:55:34Z","title":"Random Walk Guided Hyperbolic Graph Distillation","version":1},"reference_index":55,"source":"pdf_text","source_observed_at":"2026-08-10T14:05:43.965842Z"},"links":{"citing_paper":"/paper/2501.15696"},"observation_digest":"sha256:39858cc70161dce767a361a5d871ba733401d0ebc03ec68f552399ddbf4c76c3","observation_id":"df92e6ba-6621-4c5c-a81b-325714448d61","resolution":{"observed_at":"2026-08-10T14:05:44.475153Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T14:05:44.452636Z","title":"Once identified, these hyperparameters were applied consistently across all different reduction rates to ensure uniformity in the evaluation","venue":null,"work_id":"f936e8fa-cf1b-4d74-9312-d2eb500cdaba","year":2007},"citing_paper":{"arxiv_id":"2501.15696","last_updated":"2025-01-26T22:55:34Z","snapshot_observed_at":"2026-08-10T14:00:32.093089Z","submitted_at":"2025-01-26T22:55:34Z","title":"Random Walk Guided Hyperbolic Graph Distillation","version":1},"reference_index":56,"source":"pdf_text","source_observed_at":"2026-08-10T14:05:43.970944Z"},"links":{"citing_paper":"/paper/2501.15696"},"observation_digest":"sha256:f19d27e92f80972bb4a76940d57f5621bccb5aa582ba58a48afe68c262a94345","observation_id":"68705a65-7925-4250-9438-bfc799179075","resolution":{"observed_at":"2026-08-10T14:05:44.457978Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T14:05:44.737834Z","title":"M ¨obius transforma- tion and cauchy parameter estimation","venue":null,"work_id":"8a9f3e67-261d-4163-a712-c495eeb5903c","year":1996},"citing_paper":{"arxiv_id":"2501.15696","last_updated":"2025-01-26T22:55:34Z","snapshot_observed_at":"2026-08-10T14:00:32.093089Z","submitted_at":"2025-01-26T22:55:34Z","title":"Random Walk Guided Hyperbolic Graph Distillation","version":1},"reference_index":1993,"source":"pdf_text","source_observed_at":"2026-08-10T14:05:43.840571Z"},"links":{"citing_paper":"/paper/2501.15696"},"observation_digest":"sha256:7e88dabf8fd2a5be34aef84547d69fc12e26425ecf58a2f0693200e5dd29e3d0","observation_id":"7d068c3f-8659-4a58-b01c-f4bc4c25c289","resolution":{"observed_at":"2026-08-10T14:05:44.742304Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2206.13697","last_updated":"2022-06-28T02:10:05Z","snapshot_observed_at":"2026-08-10T10:10:15.395028Z","submitted_at":"2022-06-28T02:10:05Z","title":"Graph Condensation via Receptive Field Distribution Matching","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2206.13697","snapshot_observed_at":"2026-08-10T14:05:43.786127Z","title":"Graph condensation via receptive field distribution matching","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2501.15696","last_updated":"2025-01-26T22:55:34Z","snapshot_observed_at":"2026-08-10T14:00:32.093089Z","submitted_at":"2025-01-26T22:55:34Z","title":"Random Walk Guided Hyperbolic Graph Distillation","version":1},"reference_index":1995,"source":"pdf_text","source_observed_at":"2026-08-10T14:05:43.786127Z"},"links":{"cited_paper":"/paper/2206.13697","citing_paper":"/paper/2501.15696"},"observation_digest":"sha256:f1a445c25eb1d2b5bd0a6ecd35f97fbb4b8e3eeea6d3215be634b2b3dc80ec50","observation_id":"9e364113-f99d-4f66-b83a-d77ad6014c08","resolution":{"observed_at":"2026-08-10T14:05:43.786127Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T14:05:44.719233Z","title":"Wiki-cs: A wikipedia-based benchmark for graph neural networks,","venue":null,"work_id":"909de0fd-5247-43b9-8b8d-b5175f5dc097","year":2022},"citing_paper":{"arxiv_id":"2501.15696","last_updated":"2025-01-26T22:55:34Z","snapshot_observed_at":"2026-08-10T14:00:32.093089Z","submitted_at":"2025-01-26T22:55:34Z","title":"Random Walk Guided Hyperbolic Graph Distillation","version":1},"reference_index":1996,"source":"pdf_text","source_observed_at":"2026-08-10T14:05:43.848602Z"},"links":{"citing_paper":"/paper/2501.15696"},"observation_digest":"sha256:5a9a9f6b3845516ea955a5e700b0996d8a1460c78083ab9c9d5ee276fd04a1aa","observation_id":"307889cf-255a-43c8-a7fd-930350dd5fae","resolution":{"observed_at":"2026-08-10T14:05:44.726124Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T14:05:45.130303Z","title":"The spectral gap of random graphs with given expected degrees","venue":null,"work_id":"e94d88de-69c6-4736-965d-aec019367a96","year":2009},"citing_paper":{"arxiv_id":"2501.15696","last_updated":"2025-01-26T22:55:34Z","snapshot_observed_at":"2026-08-10T14:00:32.093089Z","submitted_at":"2025-01-26T22:55:34Z","title":"Random Walk Guided Hyperbolic Graph Distillation","version":1},"reference_index":1997,"source":"pdf_text","source_observed_at":"2026-08-10T14:05:43.636346Z"},"links":{"citing_paper":"/paper/2501.15696"},"observation_digest":"sha256:0bf377fec5ab9bcb6a687ec844c949df9d114902101efae9cf2f0c99f43f9747","observation_id":"b019b923-62df-44d0-814f-1d9849dc4609","resolution":{"observed_at":"2026-08-10T14:05:45.138446Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1708.00489","last_updated":"2018-06-01T10:17:23Z","snapshot_observed_at":"2026-07-06T05:53:39.440274Z","submitted_at":"2017-08-01T19:50:53Z","title":"Active Learning for Convolutional Neural Networks: A Core-Set Approach","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1708.00489","snapshot_observed_at":"2026-08-10T14:05:43.873281Z","title":"Active learning for convolutional neural networks: A core- set approach","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2501.15696","last_updated":"2025-01-26T22:55:34Z","snapshot_observed_at":"2026-08-10T14:00:32.093089Z","submitted_at":"2025-01-26T22:55:34Z","title":"Random Walk Guided Hyperbolic Graph Distillation","version":1},"reference_index":2007,"source":"pdf_text","source_observed_at":"2026-08-10T14:05:43.873281Z"},"links":{"cited_paper":"/paper/1708.00489","citing_paper":"/paper/2501.15696"},"observation_digest":"sha256:eaa482cc7ed3774cc9d0285720347d64460b4a3764825696a0d308e5d342dbc4","observation_id":"92d33567-6b4d-4b68-b0da-846b2a110af5","resolution":{"observed_at":"2026-08-10T14:05:43.873281Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T14:05:44.627116Z","title":"Graph attention networks","venue":null,"work_id":"5dd7729d-df16-4d70-bdac-615191dd9eb9","year":2018},"citing_paper":{"arxiv_id":"2501.15696","last_updated":"2025-01-26T22:55:34Z","snapshot_observed_at":"2026-08-10T14:00:32.093089Z","submitted_at":"2025-01-26T22:55:34Z","title":"Random Walk Guided Hyperbolic Graph Distillation","version":1},"reference_index":2008,"source":"pdf_text","source_observed_at":"2026-08-10T14:05:43.893981Z"},"links":{"citing_paper":"/paper/2501.15696"},"observation_digest":"sha256:7aef33655b8ffb956b571e869da9895ab2a817615b4ab1161d9b47adfc7e2f89","observation_id":"ebd48b40-d10c-4f40-b04b-d9f06dc674e6","resolution":{"observed_at":"2026-08-10T14:05:44.632798Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T14:05:43.643280Z","title":"Convolutional neural networks on graphs with fast localized spectral filtering","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2501.15696","last_updated":"2025-01-26T22:55:34Z","snapshot_observed_at":"2026-08-10T14:00:32.093089Z","submitted_at":"2025-01-26T22:55:34Z","title":"Random Walk Guided Hyperbolic Graph Distillation","version":1},"reference_index":2009,"source":"pdf_text","source_observed_at":"2026-08-10T14:05:43.643280Z"},"links":{"citing_paper":"/paper/2501.15696"},"observation_digest":"sha256:2c7ec923ed33fb482cfdad7ad4a45d522385e36468207bd3ca874bbb70f40653","observation_id":"efa0ae7d-7ec2-445c-9054-b37c94e6c986","resolution":{"observed_at":"2026-08-10T14:05:43.643280Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T14:05:44.845585Z","title":"Lazy random walks and optimal transport on graphs","venue":null,"work_id":"24caeb2f-5af2-44d1-94e2-dec138d13ecd","year":2016},"citing_paper":{"arxiv_id":"2501.15696","last_updated":"2025-01-26T22:55:34Z","snapshot_observed_at":"2026-08-10T14:00:32.093089Z","submitted_at":"2025-01-26T22:55:34Z","title":"Random Walk Guided Hyperbolic Graph Distillation","version":1},"reference_index":2010,"source":"pdf_text","source_observed_at":"2026-08-10T14:05:43.769617Z"},"links":{"citing_paper":"/paper/2501.15696"},"observation_digest":"sha256:420235aad940dfcd7c88cd2e7a16cf2b68e964835927eb3ba40acee7fa0042a1","observation_id":"d064e002-8a6c-40a9-ba5e-6a307fe4d424","resolution":{"observed_at":"2026-08-10T14:05:44.850436Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T14:05:45.028829Z","title":"Hyperbolic neural networks","venue":null,"work_id":"34b35844-9167-47bb-b742-01805b63a01b","year":2018},"citing_paper":{"arxiv_id":"2501.15696","last_updated":"2025-01-26T22:55:34Z","snapshot_observed_at":"2026-08-10T14:00:32.093089Z","submitted_at":"2025-01-26T22:55:34Z","title":"Random Walk Guided Hyperbolic Graph Distillation","version":1},"reference_index":2011,"source":"pdf_text","source_observed_at":"2026-08-10T14:05:43.669923Z"},"links":{"citing_paper":"/paper/2501.15696"},"observation_digest":"sha256:54114c40c6b8d516b2e2d7b0e0a92c955486b0da675746e0a5c7f87d8f4d1c2b","observation_id":"1455e012-9396-4c25-b967-b80cc20be67c","resolution":{"observed_at":"2026-08-10T14:05:45.034545Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T14:05:44.664739Z","title":"Graph simplification and matching using commute times","venue":null,"work_id":"3a812887-1df7-490f-abbc-836ea35fd9ab","year":2007},"citing_paper":{"arxiv_id":"2501.15696","last_updated":"2025-01-26T22:55:34Z","snapshot_observed_at":"2026-08-10T14:00:32.093089Z","submitted_at":"2025-01-26T22:55:34Z","title":"Random Walk Guided Hyperbolic Graph Distillation","version":1},"reference_index":2014,"source":"pdf_text","source_observed_at":"2026-08-10T14:05:43.865876Z"},"links":{"citing_paper":"/paper/2501.15696"},"observation_digest":"sha256:4e2cbae2df6cc80ed8418b9d46d4809518dc75e810a49eafc2fb80404a07b457","observation_id":"1b9bb151-afbc-45c1-afe9-77ca1aaa86dc","resolution":{"observed_at":"2026-08-10T14:05:44.671077Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T14:05:45.093347Z","title":"Quantifying privacy leakage in graph em- bedding","venue":null,"work_id":"dfe14b52-6d12-4c2f-a042-7e2a61aaeb0d","year":2020},"citing_paper":{"arxiv_id":"2501.15696","last_updated":"2025-01-26T22:55:34Z","snapshot_observed_at":"2026-08-10T14:00:32.093089Z","submitted_at":"2025-01-26T22:55:34Z","title":"Random Walk Guided Hyperbolic Graph Distillation","version":1},"reference_index":2016,"source":"pdf_text","source_observed_at":"2026-08-10T14:05:43.650001Z"},"links":{"citing_paper":"/paper/2501.15696"},"observation_digest":"sha256:1a6fdffb0c8240d18c7930086794a5dc547bbecd696ce863800a0c033302e2d5","observation_id":"8c186025-55b5-42c9-a2f0-7c9b63950de8","resolution":{"observed_at":"2026-08-10T14:05:45.101103Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T14:05:43.700297Z","title":"Inductive representation learning on large graphs","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2501.15696","last_updated":"2025-01-26T22:55:34Z","snapshot_observed_at":"2026-08-10T14:00:32.093089Z","submitted_at":"2025-01-26T22:55:34Z","title":"Random Walk Guided Hyperbolic Graph Distillation","version":1},"reference_index":2017,"source":"pdf_text","source_observed_at":"2026-08-10T14:05:43.700297Z"},"links":{"citing_paper":"/paper/2501.15696"},"observation_digest":"sha256:05561045cc000ace20875b1768f1def8a806926112803654cbecdb5b38815929","observation_id":"b6b59218-bc3f-4773-9b7c-4b9a3213de21","resolution":{"observed_at":"2026-08-10T14:05:43.700297Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T14:05:45.009549Z","title":"Multiple sparse graphs condensation","venue":null,"work_id":"b01c25ef-5582-4a5a-8e9a-6c86a729b99b","year":2023},"citing_paper":{"arxiv_id":"2501.15696","last_updated":"2025-01-26T22:55:34Z","snapshot_observed_at":"2026-08-10T14:00:32.093089Z","submitted_at":"2025-01-26T22:55:34Z","title":"Random Walk Guided Hyperbolic Graph Distillation","version":1},"reference_index":2018,"source":"pdf_text","source_observed_at":"2026-08-10T14:05:43.674881Z"},"links":{"citing_paper":"/paper/2501.15696"},"observation_digest":"sha256:6c1eac6a841066d75d4521d73269e5801ec99b2eb423cf0e838fd065e1fff8d2","observation_id":"70fcbf67-2c46-4e3d-90c6-f3a7e96fd08d","resolution":{"observed_at":"2026-08-10T14:05:45.014937Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T14:05:45.149533Z","title":"Static and dynamic path selection on expander graphs (preliminary version) a random walk approach","venue":null,"work_id":"6832b85e-8210-4f47-8df6-9c3269131629","year":1997},"citing_paper":{"arxiv_id":"2501.15696","last_updated":"2025-01-26T22:55:34Z","snapshot_observed_at":"2026-08-10T14:00:32.093089Z","submitted_at":"2025-01-26T22:55:34Z","title":"Random Walk Guided Hyperbolic Graph Distillation","version":1},"reference_index":2019,"source":"pdf_text","source_observed_at":"2026-08-10T14:05:43.628857Z"},"links":{"citing_paper":"/paper/2501.15696"},"observation_digest":"sha256:eae8836f97ca424e3c2a2ccba5991258ab107b392c88f192b6336c092087bd36","observation_id":"07cc0dd8-215b-4321-bf16-9c747d756f56","resolution":{"observed_at":"2026-08-10T14:05:45.154737Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T14:05:45.075134Z","title":"Graph neural networks for social recommendation","venue":null,"work_id":"dd466bb1-15a0-4ed3-a33d-baf457de1a37","year":2019},"citing_paper":{"arxiv_id":"2501.15696","last_updated":"2025-01-26T22:55:34Z","snapshot_observed_at":"2026-08-10T14:00:32.093089Z","submitted_at":"2025-01-26T22:55:34Z","title":"Random Walk Guided Hyperbolic Graph Distillation","version":1},"reference_index":2020,"source":"pdf_text","source_observed_at":"2026-08-10T14:05:43.656185Z"},"links":{"citing_paper":"/paper/2501.15696"},"observation_digest":"sha256:15de1cd9ec71f92d92fcbcbd67be7f247eaaeb3abc0231b30ab79555ad214dc9","observation_id":"2d2fc533-843c-49e7-be7d-4a249c17e8d6","resolution":{"observed_at":"2026-08-10T14:05:45.080477Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T14:05:43.715484Z","title":"Open graph benchmark: Datasets for machine learning on graphs","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2501.15696","last_updated":"2025-01-26T22:55:34Z","snapshot_observed_at":"2026-08-10T14:00:32.093089Z","submitted_at":"2025-01-26T22:55:34Z","title":"Random Walk Guided Hyperbolic Graph Distillation","version":1},"reference_index":2021,"source":"pdf_text","source_observed_at":"2026-08-10T14:05:43.715484Z"},"links":{"citing_paper":"/paper/2501.15696"},"observation_digest":"sha256:c89dfd78514aaf39e63d64aecfcdba815e67f0c32deaa517187f479951da9e8f","observation_id":"0db0c45b-7b26-47aa-9b8a-ac292886f101","resolution":{"observed_at":"2026-08-10T14:05:43.715484Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2110.07580","last_updated":"2022-09-27T20:48:28Z","snapshot_observed_at":"2026-08-10T16:57:58.335004Z","submitted_at":"2021-10-14T17:42:14Z","title":"Graph Condensation for Graph Neural Networks","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2110.07580","snapshot_observed_at":"2026-08-10T14:05:43.731953Z","title":"Graph con- densation for graph neural networks","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2501.15696","last_updated":"2025-01-26T22:55:34Z","snapshot_observed_at":"2026-08-10T14:00:32.093089Z","submitted_at":"2025-01-26T22:55:34Z","title":"Random Walk Guided Hyperbolic Graph Distillation","version":1},"reference_index":2022,"source":"pdf_text","source_observed_at":"2026-08-10T14:05:43.731953Z"},"links":{"cited_paper":"/paper/2110.07580","citing_paper":"/paper/2501.15696"},"observation_digest":"sha256:37dd4ce78c5ae8b18cbd0fb191ca9ab2bdaaf7633a41dc26f109327b8b102a61","observation_id":"e6334290-46f1-4eda-8d62-9be135827917","resolution":{"observed_at":"2026-08-10T14:05:43.731953Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2401.11720","last_updated":"2025-01-27T09:40:25Z","snapshot_observed_at":"2026-08-06T21:35:38.323897Z","submitted_at":"2024-01-22T06:47:00Z","title":"Graph Condensation: A Survey","version":3},"cited_work":{"arxiv_id":"2401.11720","doi":null,"metadata_source":"pith","pith_arxiv_id":"2401.11720","snapshot_observed_at":"2026-08-10T14:05:44.417918Z","title":"Graph Condensation: A Survey","venue":"cs.LG","work_id":"c2e3f775-43c5-4093-b35f-b45d734a2d09","year":2024},"citing_paper":{"arxiv_id":"2501.15696","last_updated":"2025-01-26T22:55:34Z","snapshot_observed_at":"2026-08-10T14:00:32.093089Z","submitted_at":"2025-01-26T22:55:34Z","title":"Random Walk Guided Hyperbolic Graph Distillation","version":1},"reference_index":2023,"source":"pdf_text","source_observed_at":"2026-08-10T14:05:43.680306Z"},"links":{"cited_paper":"/paper/2401.11720","citing_paper":"/paper/2501.15696"},"observation_digest":"sha256:5df672396a76df1d619e09797db40209be09a11b1b7f50d0b4ee0458f8625904","observation_id":"cb96c9ce-108a-4bbe-b803-4f58c458b25d","resolution":{"observed_at":"2026-08-10T14:05:44.423094Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2501.15696","last_updated":"2025-01-26T22:55:34Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-10T14:00:32.093089Z","submitted_at":"2025-01-26T22:55:34Z","title":"Random Walk Guided Hyperbolic Graph Distillation"},"reference_resolution":{"displayed":56,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":16,"verified_exact":3,"verified_fuzzy":37},"total_outbound_references":56},"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-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"thesis":"As of 10 August 2026, this Paper Citation Record lists 56 of 56 outbound references and 0 inbound Pith citation observations for arXiv:2501.15696."}