{"as_of":"2026-08-08T04:43:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:848c90a5b3c0555b3317c32bda0a0b06e9dc40d3bf70fc5cae2ea51f9dc8bf91","coverage":[{"denominator":26,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":26,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T14:06:06.578203Z","state":"measured"},{"denominator":28,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":28,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-07T06:34:17.273281+00:00","state":"measured"},{"denominator":2,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":2,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-03T08:31:24.638718Z","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.561981Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2505.20089","last_updated":"2025-05-31T04:25:27Z","snapshot_observed_at":"2026-08-07T18:13:28.553649Z","submitted_at":"2025-05-26T15:02:08Z","title":"Homophily Enhanced Graph Domain Adaptation","version":3},"cited_work":{"arxiv_id":"2505.20089","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2505.20089","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Homophily enhanced graph domain adaptation","venue":null,"work_id":"17d48eb2-a2a1-40c4-80ed-d3318a30e6bc","year":2025},"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":12,"source":"pdf_text","source_observed_at":"2026-05-13T19:34:21.724329Z"},"links":{"cited_paper":"/paper/2505.20089","citing_paper":"/paper/2604.03154"},"observation_digest":"sha256:7836d6d5754ea0bc2e0e3e71d98719e0a39614d990988c2ca8ac462c82d91a97","observation_id":"5b6a6bb1-abe1-4fd9-b236-71a0c0d40bf9","resolution":{"observed_at":"2026-05-13T19:38:10.563656Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2505.20089","last_updated":"2025-05-31T04:25:27Z","snapshot_observed_at":"2026-08-07T18:13:28.553649Z","submitted_at":"2025-05-26T15:02:08Z","title":"Homophily Enhanced Graph Domain Adaptation","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2505.20089","snapshot_observed_at":"2026-08-03T08:31:24.638718Z","title":"arXiv preprint arXiv:2505.20089 , 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-07T19:39:07.552840Z","submitted_at":"2026-07-31T12:52:10Z","title":"Cross-Resolution Semantic Learning for Graph Domain Adaptation","version":1},"reference_index":93,"source":"arxiv_source","source_observed_at":"2026-08-03T08:31:24.638718Z"},"links":{"cited_paper":"/paper/2505.20089","citing_paper":"/paper/2607.29365"},"observation_digest":"sha256:396733ba1e27d315d7c228fd3939817ceaa22af06d17fa5b603d08f958d8d03f","observation_id":"c443f842-b918-4887-9658-a4228b3d2fee","resolution":{"observed_at":"2026-08-03T08:31:24.638718Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2505.20089/citation-record","integrity":"/paper/2505.20089/integrity","json":"/paper/2505.20089/citation-record.json","paper":"/paper/2505.20089"},"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-07T14:06:08.022497Z","title":null,"venue":null,"work_id":"9d4b1526-2040-4f83-9845-02b94775a405","year":2021},"citing_paper":{"arxiv_id":"2505.20089","last_updated":"2025-05-31T04:25:27Z","snapshot_observed_at":"2026-08-07T18:13:28.553649Z","submitted_at":"2025-05-26T15:02:08Z","title":"Homophily Enhanced Graph Domain Adaptation","version":3},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-07T14:06:06.578203Z"},"links":{"citing_paper":"/paper/2505.20089"},"observation_digest":"sha256:73ac0fa21291e8e0d755485b022f11534851241297a89706fdeca8a2152a7d3c","observation_id":"0065618a-0231-4c28-8f7b-1edc440c810e","resolution":{"observed_at":"2026-08-07T14:06:08.075430Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2501.15461","last_updated":"2026-04-10T08:17:30Z","snapshot_observed_at":"2026-07-06T20:26:17.112340Z","submitted_at":"2025-01-26T09:09:44Z","title":"Mamba-Based Graph Convolutional Networks: Tackling Over-smoothing with Selective State Space","version":4},"cited_work":{"arxiv_id":"2501.15461","doi":null,"metadata_source":"pith","pith_arxiv_id":"2501.15461","snapshot_observed_at":"2026-08-07T14:06:07.725025Z","title":"Mamba-Based Graph Convolutional Networks: Tackling Over-smoothing with Selective State Space","venue":"cs.LG","work_id":"a805f81f-a641-4dbf-a8ea-1b9378cb15c4","year":2025},"citing_paper":{"arxiv_id":"2505.20089","last_updated":"2025-05-31T04:25:27Z","snapshot_observed_at":"2026-08-07T18:13:28.553649Z","submitted_at":"2025-05-26T15:02:08Z","title":"Homophily Enhanced Graph Domain Adaptation","version":3},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-07T14:06:04.444870Z"},"links":{"cited_paper":"/paper/2501.15461","citing_paper":"/paper/2505.20089"},"observation_digest":"sha256:7b3ab8a3c56cd39930b8eca65352e6ea3fef99d045a157b94fc5c0d5c4f1a509","observation_id":"308ebaef-0f05-436e-ad3c-04481c3f003e","resolution":{"observed_at":"2026-08-07T14:06:07.816392Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T14:06:09.536844Z","title":"Robust mid-pass filtering graph convolutional networks","venue":null,"work_id":"d6f5ffae-010b-490b-b748-290bf33b3805","year":2023},"citing_paper":{"arxiv_id":"2505.20089","last_updated":"2025-05-31T04:25:27Z","snapshot_observed_at":"2026-08-07T18:13:28.553649Z","submitted_at":"2025-05-26T15:02:08Z","title":"Homophily Enhanced Graph Domain Adaptation","version":3},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-07T14:06:04.520806Z"},"links":{"citing_paper":"/paper/2505.20089"},"observation_digest":"sha256:7c21ef69549ec9e6771b790cddc7eb30cec498a3755ecf036b744cdbf6223bc6","observation_id":"b248a1e0-f143-4a60-a45f-b0a88c65d136","resolution":{"observed_at":"2026-08-07T14:06:09.615291Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2403.01092","last_updated":"2024-06-05T00:20:38Z","snapshot_observed_at":"2026-07-06T17:38:30.401240Z","submitted_at":"2024-03-02T04:31:28Z","title":"Pairwise Alignment Improves Graph Domain Adaptation","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2403.01092","snapshot_observed_at":"2026-08-07T14:06:04.865292Z","title":"Rethinking propagation for unsupervised graph domain adaptation","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.20089","last_updated":"2025-05-31T04:25:27Z","snapshot_observed_at":"2026-08-07T18:13:28.553649Z","submitted_at":"2025-05-26T15:02:08Z","title":"Homophily Enhanced Graph Domain Adaptation","version":3},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-07T14:06:04.865292Z"},"links":{"cited_paper":"/paper/2403.01092","citing_paper":"/paper/2505.20089"},"observation_digest":"sha256:29d0c1a21fdc2857a534fefc40b74ff7b02ea2c9351225550a32a026923a0143","observation_id":"99927c3e-03c2-410f-a8eb-78446f7af9aa","resolution":{"observed_at":"2026-08-07T14:06:04.865292Z","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-07T14:06:09.297649Z","title":"Demystifying structural disparity in graph neural networks: Can one size fit all?Advances in neural information processing systems, 36, 2024a","venue":null,"work_id":"deec7f6b-e30b-4d79-bb75-75f45621fa33","year":2024},"citing_paper":{"arxiv_id":"2505.20089","last_updated":"2025-05-31T04:25:27Z","snapshot_observed_at":"2026-08-07T18:13:28.553649Z","submitted_at":"2025-05-26T15:02:08Z","title":"Homophily Enhanced Graph Domain Adaptation","version":3},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-07T14:06:04.975155Z"},"links":{"citing_paper":"/paper/2505.20089"},"observation_digest":"sha256:9f01b2da853642fc9f15a38e3b24a918e1ec006ebdbf6a6803db56f2c5253bb3","observation_id":"175b1b56-15dc-4aca-a215-6123922fa10e","resolution":{"observed_at":"2026-08-07T14:06:09.449206Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1905.09550","last_updated":"2019-05-26T05:21:04Z","snapshot_observed_at":"2026-07-06T07:54:54.802338Z","submitted_at":"2019-05-23T09:27:21Z","title":"Revisiting Graph Neural Networks: All We Have is Low-Pass Filters","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1905.09550","snapshot_observed_at":"2026-08-07T14:06:05.098637Z","title":null,"venue":null,"work_id":null,"year":1905},"citing_paper":{"arxiv_id":"2505.20089","last_updated":"2025-05-31T04:25:27Z","snapshot_observed_at":"2026-08-07T18:13:28.553649Z","submitted_at":"2025-05-26T15:02:08Z","title":"Homophily Enhanced Graph Domain Adaptation","version":3},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-07T14:06:05.098637Z"},"links":{"cited_paper":"/paper/1905.09550","citing_paper":"/paper/2505.20089"},"observation_digest":"sha256:af8e632db659daf1a5a7282c01c671c302d4be4b09f819c4fb3ed74395b5029d","observation_id":"956f6885-d42f-42e3-b402-1755e292ee90","resolution":{"observed_at":"2026-08-07T14:06:05.098637Z","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-07T14:06:09.126341Z","title":"Adversarial deep network embedding for cross-network node classification","venue":null,"work_id":"e60a33bf-4e23-4e12-ab0c-19d0cbc3ecbb","year":1935},"citing_paper":{"arxiv_id":"2505.20089","last_updated":"2025-05-31T04:25:27Z","snapshot_observed_at":"2026-08-07T18:13:28.553649Z","submitted_at":"2025-05-26T15:02:08Z","title":"Homophily Enhanced Graph Domain Adaptation","version":3},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-07T14:06:05.303756Z"},"links":{"citing_paper":"/paper/2505.20089"},"observation_digest":"sha256:ce075e237b7c45bd5a685e496a8c79c70cb8a2e187647800046e0fa7412ade60","observation_id":"740a6b3d-f5d9-468d-9d86-a28485efcbdc","resolution":{"observed_at":"2026-08-07T14:06:09.198666Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T14:06:08.944573Z","title":"Unsu- pervised domain adaptive graph convolutional networks","venue":null,"work_id":"33955b3a-5a46-48b2-8f99-8c5544e0f99b","year":2020},"citing_paper":{"arxiv_id":"2505.20089","last_updated":"2025-05-31T04:25:27Z","snapshot_observed_at":"2026-08-07T18:13:28.553649Z","submitted_at":"2025-05-26T15:02:08Z","title":"Homophily Enhanced Graph Domain Adaptation","version":3},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-07T14:06:05.483696Z"},"links":{"citing_paper":"/paper/2505.20089"},"observation_digest":"sha256:6c20b0c92576b53d67f1b24afe857c6f7840638d4a0c575db066f47f9e7a847a","observation_id":"7ee7dd8f-d89a-4881-90e4-87fe6317854f","resolution":{"observed_at":"2026-08-07T14:06:09.007033Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2405.20790","last_updated":"2024-06-07T00:55:32Z","snapshot_observed_at":"2026-08-03T18:03:59.657424Z","submitted_at":"2024-05-31T13:45:52Z","title":"Intersectional Unfairness Discovery","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2405.20790","snapshot_observed_at":"2026-08-07T14:06:05.733247Z","title":"Intersectional unfairness discovery.arXiv preprint arXiv:2405.20790, 2024a","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2505.20089","last_updated":"2025-05-31T04:25:27Z","snapshot_observed_at":"2026-08-07T18:13:28.553649Z","submitted_at":"2025-05-26T15:02:08Z","title":"Homophily Enhanced Graph Domain Adaptation","version":3},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-07T14:06:05.733247Z"},"links":{"cited_paper":"/paper/2405.20790","citing_paper":"/paper/2505.20089"},"observation_digest":"sha256:d5d86426f36f2045f20b2ba7192005951836900317362f2be75d2a0db345b41a","observation_id":"84c88170-2d46-408a-abcd-a73f44c8c2aa","resolution":{"observed_at":"2026-08-07T14:06:05.733247Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2202.03628","last_updated":"2023-04-21T02:40:15Z","snapshot_observed_at":"2026-08-03T10:19:00.998466Z","submitted_at":"2022-02-08T03:53:32Z","title":"Graph-Relational Domain Adaptation","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2202.03628","snapshot_observed_at":"2026-08-07T14:06:05.861822Z","title":"Graph-relational domain adaptation.arXiv preprint arXiv:2202.03628,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2505.20089","last_updated":"2025-05-31T04:25:27Z","snapshot_observed_at":"2026-08-07T18:13:28.553649Z","submitted_at":"2025-05-26T15:02:08Z","title":"Homophily Enhanced Graph Domain Adaptation","version":3},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-07T14:06:05.861822Z"},"links":{"cited_paper":"/paper/2202.03628","citing_paper":"/paper/2505.20089"},"observation_digest":"sha256:7bfa521e0713802445cf3b1d9fa7589bd9812fcbdd6265ff4251332df9535039","observation_id":"b3164548-a414-4aa1-af6f-cc5cdf150fea","resolution":{"observed_at":"2026-08-07T14:06:05.861822Z","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-07T14:06:08.740122Z","title":"and Wang, C","venue":null,"work_id":"b1714a42-825b-4237-93a3-9dbd7b89fae9","year":1958},"citing_paper":{"arxiv_id":"2505.20089","last_updated":"2025-05-31T04:25:27Z","snapshot_observed_at":"2026-08-07T18:13:28.553649Z","submitted_at":"2025-05-26T15:02:08Z","title":"Homophily Enhanced Graph Domain Adaptation","version":3},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-07T14:06:05.946440Z"},"links":{"citing_paper":"/paper/2505.20089"},"observation_digest":"sha256:83297eb5cf3d3ff1239cd2359e6bd87dfbae3a52db049a29941ed5bc4b09fb01","observation_id":"9de87c1f-dc91-42cf-b8a3-3977e85eeff7","resolution":{"observed_at":"2026-08-07T14:06:08.833842Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T14:06:08.578077Z","title":"Diverse message passing for attribute with het- erophily","venue":null,"work_id":"4ce016eb-4f5d-4ae4-b95a-a9e25df5ce24","year":2021},"citing_paper":{"arxiv_id":"2505.20089","last_updated":"2025-05-31T04:25:27Z","snapshot_observed_at":"2026-08-07T18:13:28.553649Z","submitted_at":"2025-05-26T15:02:08Z","title":"Homophily Enhanced Graph Domain Adaptation","version":3},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-07T14:06:06.096597Z"},"links":{"citing_paper":"/paper/2505.20089"},"observation_digest":"sha256:aa0a2c6701583148f001761bd07859d1abcba7dd5bcb3e81a0feef8c73ce34db","observation_id":"eec8026f-9fd2-4642-9003-66bc11e91075","resolution":{"observed_at":"2026-08-07T14:06:08.644892Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T14:06:08.367429Z","title":"Cluster-guided contrastive graph clustering network","venue":null,"work_id":"932b9a4e-51ef-4eeb-a86f-1292ae27761e","year":2024},"citing_paper":{"arxiv_id":"2505.20089","last_updated":"2025-05-31T04:25:27Z","snapshot_observed_at":"2026-08-07T18:13:28.553649Z","submitted_at":"2025-05-26T15:02:08Z","title":"Homophily Enhanced Graph Domain Adaptation","version":3},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-07T14:06:06.205086Z"},"links":{"citing_paper":"/paper/2505.20089"},"observation_digest":"sha256:d00015ede15b133567bcb9c920d41ac760787c2c7b3c54754bc8c0b284a9e74f","observation_id":"01b0ce3f-8036-4d7d-8e31-f56bbb91298e","resolution":{"observed_at":"2026-08-07T14:06:08.477327Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1906.00684","last_updated":"2019-08-19T23:34:19Z","snapshot_observed_at":"2026-07-06T07:57:26.611285Z","submitted_at":"2019-06-03T10:11:15Z","title":"DANE: Domain Adaptive Network Embedding","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1906.00684","snapshot_observed_at":"2026-08-07T14:06:06.308544Z","title":"Dane: Domain adaptive network embedding.arXiv preprint arXiv:1906.00684,","venue":null,"work_id":null,"year":1906},"citing_paper":{"arxiv_id":"2505.20089","last_updated":"2025-05-31T04:25:27Z","snapshot_observed_at":"2026-08-07T18:13:28.553649Z","submitted_at":"2025-05-26T15:02:08Z","title":"Homophily Enhanced Graph Domain Adaptation","version":3},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-07T14:06:06.308544Z"},"links":{"cited_paper":"/paper/1906.00684","citing_paper":"/paper/2505.20089"},"observation_digest":"sha256:96d4540ab0ef6909bc0f8b4a8d263193c188ccde21dad94268b705e1ffc19951","observation_id":"2f13e0eb-b9f5-4534-87c7-2972edf0ac67","resolution":{"observed_at":"2026-08-07T14:06:06.308544Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2503.10284","last_updated":"2025-03-13T11:52:23Z","snapshot_observed_at":"2026-08-07T17:07:20.388842Z","submitted_at":"2025-03-13T11:52:23Z","title":"PyGDA: A Python Library for Graph Domain Adaptation","version":1},"cited_work":{"arxiv_id":"2503.10284","doi":null,"metadata_source":"pith","pith_arxiv_id":"2503.10284","snapshot_observed_at":"2026-08-07T14:06:06.686365Z","title":"PyGDA: A Python Library for Graph Domain Adaptation","venue":"cs.LG","work_id":"e828e800-dd40-4be1-9052-d2e02e69e04c","year":2025},"citing_paper":{"arxiv_id":"2505.20089","last_updated":"2025-05-31T04:25:27Z","snapshot_observed_at":"2026-08-07T18:13:28.553649Z","submitted_at":"2025-05-26T15:02:08Z","title":"Homophily Enhanced Graph Domain Adaptation","version":3},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-07T14:06:06.381927Z"},"links":{"cited_paper":"/paper/2503.10284","citing_paper":"/paper/2505.20089"},"observation_digest":"sha256:357adfd4ba0936cf2e439f966ea634720e27bcb50c4a04772e6a6e1a2af127f7","observation_id":"f15f88a1-08dc-4972-9f11-6c2a5d429e26","resolution":{"observed_at":"2026-08-07T14:06:06.770797Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T14:06:08.209568Z","title":null,"venue":null,"work_id":"43fbb303-9cec-4097-a09f-bc44d5bf1fd1","year":2021},"citing_paper":{"arxiv_id":"2505.20089","last_updated":"2025-05-31T04:25:27Z","snapshot_observed_at":"2026-08-07T18:13:28.553649Z","submitted_at":"2025-05-26T15:02:08Z","title":"Homophily Enhanced Graph Domain Adaptation","version":3},"reference_index":1999,"source":"pdf_text","source_observed_at":"2026-08-07T14:06:06.487942Z"},"links":{"citing_paper":"/paper/2505.20089"},"observation_digest":"sha256:e38c21df53d68e193aebceb7ffae4b3e0013a3192abaa735e0ba5b2a07c2ef3a","observation_id":"c8da4f08-4cf4-4616-830b-e7cdd6d7740b","resolution":{"observed_at":"2026-08-07T14:06:08.281211Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T14:06:04.610630Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2505.20089","last_updated":"2025-05-31T04:25:27Z","snapshot_observed_at":"2026-08-07T18:13:28.553649Z","submitted_at":"2025-05-26T15:02:08Z","title":"Homophily Enhanced Graph Domain Adaptation","version":3},"reference_index":2015,"source":"pdf_text","source_observed_at":"2026-08-07T14:06:04.610630Z"},"links":{"cited_paper":"/paper/1609.02907","citing_paper":"/paper/2505.20089"},"observation_digest":"sha256:16b363d4b5cda8f524c0c08bcd009edaaf655eb2f01c6500ddbddb8bbc94ad8c","observation_id":"a8f4dc0d-9e01-46c8-937c-311011a6ffb9","resolution":{"observed_at":"2026-08-07T14:06:04.610630Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2502.12608","last_updated":"2025-02-18T07:46:10Z","snapshot_observed_at":"2026-08-07T18:09:58.336236Z","submitted_at":"2025-02-18T07:46:10Z","title":"Unveiling Mode Connectivity in Graph Neural Networks","version":1},"cited_work":{"arxiv_id":"2502.12608","doi":null,"metadata_source":"pith","pith_arxiv_id":"2502.12608","snapshot_observed_at":"2026-08-07T14:06:07.499769Z","title":"Unveiling Mode Connectivity in Graph Neural Networks","venue":"cs.LG","work_id":"093577d8-0e91-4a80-82fa-674f69f77fa3","year":2025},"citing_paper":{"arxiv_id":"2505.20089","last_updated":"2025-05-31T04:25:27Z","snapshot_observed_at":"2026-08-07T18:13:28.553649Z","submitted_at":"2025-05-26T15:02:08Z","title":"Homophily Enhanced Graph Domain Adaptation","version":3},"reference_index":2016,"source":"pdf_text","source_observed_at":"2026-08-07T14:06:04.710213Z"},"links":{"cited_paper":"/paper/2502.12608","citing_paper":"/paper/2505.20089"},"observation_digest":"sha256:b9d1d8ecf68b3d9179d3f676f0f7f0a04555ca8b9d5da84929248b3468b62c81","observation_id":"451c9e44-1823-4423-b9f0-7f44f2078e9b","resolution":{"observed_at":"2026-08-07T14:06:07.613701Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1901.07264","last_updated":"2020-06-05T11:29:09Z","snapshot_observed_at":"2026-07-06T07:28:11.835900Z","submitted_at":"2019-01-22T11:18:24Z","title":"Network Together: Node Classification via Cross network Deep Network Embedding","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1901.07264","snapshot_observed_at":"2026-08-07T14:06:05.176441Z","title":"and Chung, F","venue":null,"work_id":null,"year":1901},"citing_paper":{"arxiv_id":"2505.20089","last_updated":"2025-05-31T04:25:27Z","snapshot_observed_at":"2026-08-07T18:13:28.553649Z","submitted_at":"2025-05-26T15:02:08Z","title":"Homophily Enhanced Graph Domain Adaptation","version":3},"reference_index":2017,"source":"pdf_text","source_observed_at":"2026-08-07T14:06:05.176441Z"},"links":{"cited_paper":"/paper/1901.07264","citing_paper":"/paper/2505.20089"},"observation_digest":"sha256:c015a74bc3015d23e2c1c9d776a6252a19fae6a4abddbbfd5fe5734a36625902","observation_id":"5b8a6ead-37f4-4f40-bb36-5d13c3216a00","resolution":{"observed_at":"2026-08-07T14:06:05.176441Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2406.10727","last_updated":"2024-06-15T19:56:21Z","snapshot_observed_at":"2026-07-06T18:31:36.504766Z","submitted_at":"2024-06-15T19:56:21Z","title":"Text-space Graph Foundation Models: Comprehensive Benchmarks and New Insights","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.10727","snapshot_observed_at":"2026-08-07T14:06:04.021216Z","title":"Text-space graph foundation models: Comprehensive benchmarks and new insights.arXiv preprint arXiv:2406.10727,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2505.20089","last_updated":"2025-05-31T04:25:27Z","snapshot_observed_at":"2026-08-07T18:13:28.553649Z","submitted_at":"2025-05-26T15:02:08Z","title":"Homophily Enhanced Graph Domain Adaptation","version":3},"reference_index":2019,"source":"pdf_text","source_observed_at":"2026-08-07T14:06:04.021216Z"},"links":{"cited_paper":"/paper/2406.10727","citing_paper":"/paper/2505.20089"},"observation_digest":"sha256:c8a85ee64e046587c3e8b33419e355fcf1f112ffa7e483d9a36bddd48adb9681","observation_id":"09e26837-6d45-4c86-af9e-a4a4dc31f4ac","resolution":{"observed_at":"2026-08-07T14:06:04.021216Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2403.03666","last_updated":"2026-06-21T18:25:43Z","snapshot_observed_at":"2026-07-06T17:40:25.159401Z","submitted_at":"2024-03-06T12:37:49Z","title":"Provable Filter for Real-world Graph Clustering","version":3},"cited_work":{"arxiv_id":"2403.03666","doi":null,"metadata_source":"pith","pith_arxiv_id":"2403.03666","snapshot_observed_at":"2026-08-07T14:06:06.922564Z","title":"Provable Filter for Real-world Graph Clustering","venue":"cs.LG","work_id":"502cf28c-d1bc-42de-82e4-7de8e1c2b480","year":2024},"citing_paper":{"arxiv_id":"2505.20089","last_updated":"2025-05-31T04:25:27Z","snapshot_observed_at":"2026-08-07T18:13:28.553649Z","submitted_at":"2025-05-26T15:02:08Z","title":"Homophily Enhanced Graph Domain Adaptation","version":3},"reference_index":2020,"source":"pdf_text","source_observed_at":"2026-08-07T14:06:05.570569Z"},"links":{"cited_paper":"/paper/2403.03666","citing_paper":"/paper/2505.20089"},"observation_digest":"sha256:29de51a0c55045f09d28d97d7f57a49240733833c3a317336b3139667f3ba676","observation_id":"88814837-59f1-48bb-866a-e67309a731d0","resolution":{"observed_at":"2026-08-07T14:06:06.993164Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2505.15746","last_updated":"2025-05-21T16:51:44Z","snapshot_observed_at":"2026-08-07T17:20:36.235432Z","submitted_at":"2025-05-21T16:51:44Z","title":"Higher-order Structure Boosts Link Prediction on Temporal Graphs","version":1},"cited_work":{"arxiv_id":"2505.15746","doi":null,"metadata_source":"pith","pith_arxiv_id":"2505.15746","snapshot_observed_at":"2026-08-07T14:06:07.340780Z","title":"Higher-order Structure Boosts Link Prediction on Temporal Graphs","venue":"cs.LG","work_id":"b4de59f7-4a5f-4175-8882-edc96f6a86b8","year":2025},"citing_paper":{"arxiv_id":"2505.20089","last_updated":"2025-05-31T04:25:27Z","snapshot_observed_at":"2026-08-07T18:13:28.553649Z","submitted_at":"2025-05-26T15:02:08Z","title":"Homophily Enhanced Graph Domain Adaptation","version":3},"reference_index":2021,"source":"pdf_text","source_observed_at":"2026-08-07T14:06:04.778779Z"},"links":{"cited_paper":"/paper/2505.15746","citing_paper":"/paper/2505.20089"},"observation_digest":"sha256:7a32fe5a38e4e19db6bb2ab3b83ff39951091eb13f1df4598a157fd6a7906bae","observation_id":"65a3face-30c2-42fd-af20-fd491ee5bc93","resolution":{"observed_at":"2026-08-07T14:06:07.391508Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T14:06:09.918467Z","title":"One2multi graph autoencoder for multi-view graph clustering","venue":null,"work_id":"c3186b50-b764-42e7-bba7-c35aeb5cfb4b","year":2020},"citing_paper":{"arxiv_id":"2505.20089","last_updated":"2025-05-31T04:25:27Z","snapshot_observed_at":"2026-08-07T18:13:28.553649Z","submitted_at":"2025-05-26T15:02:08Z","title":"Homophily Enhanced Graph Domain Adaptation","version":3},"reference_index":2022,"source":"pdf_text","source_observed_at":"2026-08-07T14:06:04.264589Z"},"links":{"citing_paper":"/paper/2505.20089"},"observation_digest":"sha256:91195586db36a02effe247bb3689df9a39b5e7f9bc9aed5a21231cba4487091b","observation_id":"a28820ce-ce06-4f9e-a79f-c4bbb00ef7b7","resolution":{"observed_at":"2026-08-07T14:06:10.005928Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2402.00904","last_updated":"2024-02-01T02:44:32Z","snapshot_observed_at":"2026-07-06T17:23:55.166594Z","submitted_at":"2024-02-01T02:44:32Z","title":"Graph Domain Adaptation: Challenges, Progress and Prospects","version":1},"cited_work":{"arxiv_id":"2402.00904","doi":null,"metadata_source":"pith","pith_arxiv_id":"2402.00904","snapshot_observed_at":"2026-08-07T14:06:07.098193Z","title":"Graph Domain Adaptation: Challenges, Progress and Prospects","venue":"cs.LG","work_id":"35d3255a-f5b1-45fb-89a6-18c323558b40","year":2024},"citing_paper":{"arxiv_id":"2505.20089","last_updated":"2025-05-31T04:25:27Z","snapshot_observed_at":"2026-08-07T18:13:28.553649Z","submitted_at":"2025-05-26T15:02:08Z","title":"Homophily Enhanced Graph Domain Adaptation","version":3},"reference_index":2023,"source":"pdf_text","source_observed_at":"2026-08-07T14:06:05.398073Z"},"links":{"cited_paper":"/paper/2402.00904","citing_paper":"/paper/2505.20089"},"observation_digest":"sha256:9748a1fc7148c735278841bbbcb971123afc910e1b0d2671523935595e7d40f5","observation_id":"43eefdca-aa6d-4422-a16d-1425c5e0114b","resolution":{"observed_at":"2026-08-07T14:06:07.195014Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T14:06:10.141086Z","title":"Adaptive uni- versal generalized pagerank graph neural network","venue":null,"work_id":"0d2ab3ca-34ce-482e-867d-c8f67a3f9afd","year":2021},"citing_paper":{"arxiv_id":"2505.20089","last_updated":"2025-05-31T04:25:27Z","snapshot_observed_at":"2026-08-07T18:13:28.553649Z","submitted_at":"2025-05-26T15:02:08Z","title":"Homophily Enhanced Graph Domain Adaptation","version":3},"reference_index":2024,"source":"pdf_text","source_observed_at":"2026-08-07T14:06:04.133037Z"},"links":{"citing_paper":"/paper/2505.20089"},"observation_digest":"sha256:67a378a4f52269854ee65900dd867c70975002c4758c4f806bb6e310faa3297e","observation_id":"05186426-c95f-4ef2-9039-84c61115350e","resolution":{"observed_at":"2026-08-07T14:06:10.232636Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T14:06:09.745210Z","title":"Magnn: Metapath aggregated graph neural network for heterogeneous graph embedding","venue":null,"work_id":"0ffbad7f-e9dc-4e5b-b007-94445b8b7f55","year":2020},"citing_paper":{"arxiv_id":"2505.20089","last_updated":"2025-05-31T04:25:27Z","snapshot_observed_at":"2026-08-07T18:13:28.553649Z","submitted_at":"2025-05-26T15:02:08Z","title":"Homophily Enhanced Graph Domain Adaptation","version":3},"reference_index":2025,"source":"pdf_text","source_observed_at":"2026-08-07T14:06:04.360426Z"},"links":{"citing_paper":"/paper/2505.20089"},"observation_digest":"sha256:e48b70a937ab69b79d4020c9de0eaf4977384e81918b994aca9c588d1608b418","observation_id":"126df305-e2fd-4f26-ae54-d72b309fee31","resolution":{"observed_at":"2026-08-07T14:06:09.840353Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2505.20089","last_updated":"2025-05-31T04:25:27Z","latest_version":3,"primary_category":"cs.SI","snapshot_observed_at":"2026-08-07T18:13:28.553649Z","submitted_at":"2025-05-26T15:02:08Z","title":"Homophily Enhanced Graph Domain Adaptation"},"reference_resolution":{"displayed":26,"state_counts":{"malformed_identifier":0,"metadata_mismatch":1,"parse_uncertain":0,"unresolved":10,"verified_exact":5,"verified_fuzzy":10},"total_outbound_references":26},"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-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"thesis":"As of 8 August 2026, this Paper Citation Record lists 26 of 26 outbound references and 2 inbound Pith citation observations for arXiv:2505.20089."}