{"as_of":"2026-08-10T20:38:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:06b88a37951c1aabba77bbd37dc44f596973af6e5a9f1eb980e3308bf8c59d85","coverage":[{"denominator":19,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":19,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-09T13:57:08.485341Z","state":"measured"},{"denominator":22,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":22,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-10T06:31:04.303077+00:00","state":"measured"},{"denominator":3,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":3,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-03T08:31:17.492176Z","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-16T09:07:39.228125Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2502.06808","last_updated":"2025-02-24T19:57:07Z","snapshot_observed_at":"2026-08-10T12:18:02.397375Z","submitted_at":"2025-02-04T03:04:04Z","title":"On the Benefits of Attribute-Driven Graph Domain Adaptation","version":3},"cited_work":{"arxiv_id":"2502.06808","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2502.06808","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"H., Pu, R., Wang, B., and Ling, C","venue":null,"work_id":"7d0f41c6-efbd-4502-b48a-df9382e68985","year":2025},"citing_paper":{"arxiv_id":"2602.00656","last_updated":"2026-05-07T10:06:18Z","snapshot_observed_at":"2026-08-02T22:28:38.324728Z","submitted_at":"2026-01-31T11:05:35Z","title":"DisRFM: Polar Riemannian Flow Matching for Structure-Preserving Graph Domain Adaptation","version":2},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-05-16T09:04:27.194613Z"},"links":{"cited_paper":"/paper/2502.06808","citing_paper":"/paper/2602.00656"},"observation_digest":"sha256:2aa723b6523672b8a68edfeb169dfa30fedc94f313bd5303b0c7d455e2e6c0a5","observation_id":"0a1728cc-5781-44c1-9746-99f824e578cb","resolution":{"observed_at":"2026-05-16T09:07:39.230134Z","resolver_source":"arxiv_id","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":{"arxiv_id":"2502.06808","last_updated":"2025-02-24T19:57:07Z","snapshot_observed_at":"2026-08-10T12:18:02.397375Z","submitted_at":"2025-02-04T03:04:04Z","title":"On the Benefits of Attribute-Driven Graph Domain Adaptation","version":3},"cited_work":{"arxiv_id":"2502.06808","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2502.06808","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"H., Pu, R., Wang, B., and Ling, C","venue":null,"work_id":"7d0f41c6-efbd-4502-b48a-df9382e68985","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":11,"source":"pdf_text","source_observed_at":"2026-05-13T19:34:21.724329Z"},"links":{"cited_paper":"/paper/2502.06808","citing_paper":"/paper/2604.03154"},"observation_digest":"sha256:7f412959c809da27e37c4f478bbf6ee2939a675ab29afab675a271e6c7afd226","observation_id":"cca3426c-d96c-4b61-bdb0-11b9295e0bca","resolution":{"observed_at":"2026-05-13T19:38:10.580908Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"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":"2502.06808","last_updated":"2025-02-24T19:57:07Z","snapshot_observed_at":"2026-08-10T12:18:02.397375Z","submitted_at":"2025-02-04T03:04:04Z","title":"On the Benefits of Attribute-Driven Graph Domain Adaptation","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2502.06808","snapshot_observed_at":"2026-08-03T08:31:17.492176Z","title":"arXiv preprint arXiv:2502.06808 , 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":23,"source":"arxiv_source","source_observed_at":"2026-08-03T08:31:17.492176Z"},"links":{"cited_paper":"/paper/2502.06808","citing_paper":"/paper/2607.29365"},"observation_digest":"sha256:d4fa7d319f931128589c77f1ecdecc657769a64147f4fe0e1775227c13151441","observation_id":"13b6674f-0d06-4d34-b7f4-d9b28f766246","resolution":{"observed_at":"2026-08-03T08:31:17.492176Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2502.06808/citation-record","integrity":"/paper/2502.06808/integrity","json":"/paper/2502.06808/citation-record.json","paper":"/paper/2502.06808"},"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-09T13:57:08.720169Z","title":"(16) Proof","venue":null,"work_id":"59d063a6-e6dc-42af-9f99-1c0e6c704ced","year":2025},"citing_paper":{"arxiv_id":"2502.06808","last_updated":"2025-02-24T19:57:07Z","snapshot_observed_at":"2026-08-10T12:18:02.397375Z","submitted_at":"2025-02-04T03:04:04Z","title":"On the Benefits of Attribute-Driven Graph Domain Adaptation","version":3},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-09T13:57:08.470897Z"},"links":{"citing_paper":"/paper/2502.06808"},"observation_digest":"sha256:b12abc65eeb314daf44fceb221607484263d1342c1a17d0b7c1d15d5679f0ed7","observation_id":"704d79b2-fa02-4d34-8908-7af011448aac","resolution":{"observed_at":"2026-08-09T13:57:08.724984Z","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":"2403.01092","last_updated":"2024-06-05T00:20:38Z","snapshot_observed_at":"2026-08-10T12:17:41.677252Z","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-09T13:57:08.416041Z","title":"Rethinking propagation for unsupervised graph domain adaptation","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2502.06808","last_updated":"2025-02-24T19:57:07Z","snapshot_observed_at":"2026-08-10T12:18:02.397375Z","submitted_at":"2025-02-04T03:04:04Z","title":"On the Benefits of Attribute-Driven Graph Domain Adaptation","version":3},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-09T13:57:08.416041Z"},"links":{"cited_paper":"/paper/2403.01092","citing_paper":"/paper/2502.06808"},"observation_digest":"sha256:72a46ed1d20994d3d767c21c151d275043ab141f6ff748ccfc6ff1e8ed1e7ae5","observation_id":"9f98d370-61d1-43ec-9e01-8f6068cb0f87","resolution":{"observed_at":"2026-08-09T13:57:08.416041Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2310.00793","last_updated":"2024-11-07T20:01:16Z","snapshot_observed_at":"2026-07-31T16:17:23.887942Z","submitted_at":"2023-10-01T21:09:59Z","title":"Revisiting Link Prediction: A Data Perspective","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2310.00793","snapshot_observed_at":"2026-08-09T13:57:08.420903Z","title":"Revisiting link prediction: A data perspective","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2502.06808","last_updated":"2025-02-24T19:57:07Z","snapshot_observed_at":"2026-08-10T12:18:02.397375Z","submitted_at":"2025-02-04T03:04:04Z","title":"On the Benefits of Attribute-Driven Graph Domain Adaptation","version":3},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-09T13:57:08.420903Z"},"links":{"cited_paper":"/paper/2310.00793","citing_paper":"/paper/2502.06808"},"observation_digest":"sha256:685d28753121a0b28e673d0f24fcd785581fabf54c56c083af8c0b15ebfa0f51","observation_id":"8023f2cc-c241-4cea-b0f6-2a9080947b5f","resolution":{"observed_at":"2026-08-09T13:57:08.420903Z","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-09T13:57:08.766602Z","title":"Adversarial deep network embedding for cross-network node classification","venue":null,"work_id":"543fbcab-0eb8-4b63-ba5e-edfb7e0d3ee2","year":1935},"citing_paper":{"arxiv_id":"2502.06808","last_updated":"2025-02-24T19:57:07Z","snapshot_observed_at":"2026-08-10T12:18:02.397375Z","submitted_at":"2025-02-04T03:04:04Z","title":"On the Benefits of Attribute-Driven Graph Domain Adaptation","version":3},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-09T13:57:08.435716Z"},"links":{"citing_paper":"/paper/2502.06808"},"observation_digest":"sha256:5ac118216161c0ac8cce2db390d5dfcdea3b6b45bb8b30b11bde4595c40328a2","observation_id":"a3f21b77-3ce4-4471-9530-8318536d7743","resolution":{"observed_at":"2026-08-09T13:57:08.771418Z","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-09T13:57:08.751602Z","title":"Unsupervised domain adaptive graph convolutional networks","venue":null,"work_id":"fbab24da-6d8e-4ec9-82ae-b6e2d7ade611","year":2020},"citing_paper":{"arxiv_id":"2502.06808","last_updated":"2025-02-24T19:57:07Z","snapshot_observed_at":"2026-08-10T12:18:02.397375Z","submitted_at":"2025-02-04T03:04:04Z","title":"On the Benefits of Attribute-Driven Graph Domain Adaptation","version":3},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-09T13:57:08.445523Z"},"links":{"citing_paper":"/paper/2502.06808"},"observation_digest":"sha256:1fd33f53f8accf2dbc085c7c8c79dccf95e49bf6137e01b361f8de30d35702b3","observation_id":"14867c18-97f0-4b6e-8d8e-fe47774962a8","resolution":{"observed_at":"2026-08-09T13:57:08.756185Z","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":"2202.03628","last_updated":"2023-04-21T02:40:15Z","snapshot_observed_at":"2026-08-10T07:36:13.756382Z","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-09T13:57:08.456539Z","title":"Graph-relational domain adaptation","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2502.06808","last_updated":"2025-02-24T19:57:07Z","snapshot_observed_at":"2026-08-10T12:18:02.397375Z","submitted_at":"2025-02-04T03:04:04Z","title":"On the Benefits of Attribute-Driven Graph Domain Adaptation","version":3},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-09T13:57:08.456539Z"},"links":{"cited_paper":"/paper/2202.03628","citing_paper":"/paper/2502.06808"},"observation_digest":"sha256:1916cf7d1d844a06c478a5199fbf9e3c5293193290977f040d45fc469dd4caac","observation_id":"63546508-f3da-4374-9628-bbea25c8959e","resolution":{"observed_at":"2026-08-09T13:57:08.456539Z","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-09T13:57:08.734821Z","title":"Graphae: adaptive embedding across graphs","venue":null,"work_id":"0fd0b9db-2bef-43ba-965b-7d7e369c2855","year":2020},"citing_paper":{"arxiv_id":"2502.06808","last_updated":"2025-02-24T19:57:07Z","snapshot_observed_at":"2026-08-10T12:18:02.397375Z","submitted_at":"2025-02-04T03:04:04Z","title":"On the Benefits of Attribute-Driven Graph Domain Adaptation","version":3},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-09T13:57:08.461138Z"},"links":{"citing_paper":"/paper/2502.06808"},"observation_digest":"sha256:2417e1563edbc8dcd48a22f58608c9260508b32c0f605405ec52efddaf5f9604","observation_id":"f0eebdc7-3275-4b89-b761-f8dcfb152690","resolution":{"observed_at":"2026-08-09T13:57:08.740491Z","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":"1906.00684","last_updated":"2019-08-19T23:34:19Z","snapshot_observed_at":"2026-08-10T12:18:42.681501Z","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-09T13:57:08.465536Z","title":"Dane: Domain adaptive network embedding","venue":null,"work_id":null,"year":1906},"citing_paper":{"arxiv_id":"2502.06808","last_updated":"2025-02-24T19:57:07Z","snapshot_observed_at":"2026-08-10T12:18:02.397375Z","submitted_at":"2025-02-04T03:04:04Z","title":"On the Benefits of Attribute-Driven Graph Domain Adaptation","version":3},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-09T13:57:08.465536Z"},"links":{"cited_paper":"/paper/1906.00684","citing_paper":"/paper/2502.06808"},"observation_digest":"sha256:700fbbc570e4beb13db9ef730e17e8fec5d68d91deda675dddf55b6c80f83d74","observation_id":"e8bec0a8-bf79-4ca3-957e-0a025b45ec77","resolution":{"observed_at":"2026-08-09T13:57:08.465536Z","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-09T13:57:08.704863Z","title":"Given the sparsity of this dataset, α, β and τ should be set relatively higher to emphasize topology alignment and capture key structural relationships","venue":null,"work_id":"863d6939-66ce-4c4b-af8d-1ef8d02ae270","year":2025},"citing_paper":{"arxiv_id":"2502.06808","last_updated":"2025-02-24T19:57:07Z","snapshot_observed_at":"2026-08-10T12:18:02.397375Z","submitted_at":"2025-02-04T03:04:04Z","title":"On the Benefits of Attribute-Driven Graph Domain Adaptation","version":3},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-09T13:57:08.476077Z"},"links":{"citing_paper":"/paper/2502.06808"},"observation_digest":"sha256:8d12a621aae9c6259df41a13066e10090ab854d8efcef06029ad684f9f56a9a3","observation_id":"e8ff6e07-c02b-480e-8d64-f3b1f784b6b0","resolution":{"observed_at":"2026-08-09T13:57:08.709478Z","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-09T13:57:08.675079Z","title":null,"venue":null,"work_id":"623354c6-fa91-44af-9939-36fa3f4d3d8f","year":2025},"citing_paper":{"arxiv_id":"2502.06808","last_updated":"2025-02-24T19:57:07Z","snapshot_observed_at":"2026-08-10T12:18:02.397375Z","submitted_at":"2025-02-04T03:04:04Z","title":"On the Benefits of Attribute-Driven Graph Domain Adaptation","version":3},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-09T13:57:08.485341Z"},"links":{"citing_paper":"/paper/2502.06808"},"observation_digest":"sha256:6567259bceb7630a322d3a6642e4740091e90d54807de08ba0e0dbc1db4527d0","observation_id":"ced841c5-b949-4ef7-a0f3-11133c7dd244","resolution":{"observed_at":"2026-08-09T13:57:08.679591Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T13:57:08.689891Z","title":"Conversely, the classification performance declines with increasing attribute discrepancy, highlighting that the bound attribute component is closely related to the GDA performance","venue":null,"work_id":"ec7f3ca8-d72c-4661-984e-1e7925438574","year":2025},"citing_paper":{"arxiv_id":"2502.06808","last_updated":"2025-02-24T19:57:07Z","snapshot_observed_at":"2026-08-10T12:18:02.397375Z","submitted_at":"2025-02-04T03:04:04Z","title":"On the Benefits of Attribute-Driven Graph Domain Adaptation","version":3},"reference_index":100,"source":"pdf_text","source_observed_at":"2026-08-09T13:57:08.480775Z"},"links":{"citing_paper":"/paper/2502.06808"},"observation_digest":"sha256:cb8d54a33b5dc81854b39105edbc7637816c51f5bf21304b9cbac3e7ec3d5145","observation_id":"ba08ca39-03fa-44c2-a1d2-fdad9bfda8bc","resolution":{"observed_at":"2026-08-09T13:57:08.694723Z","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-09T13:57:08.410902Z","title":"Semi-supervised classification with graph convolutional networks","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2502.06808","last_updated":"2025-02-24T19:57:07Z","snapshot_observed_at":"2026-08-10T12:18:02.397375Z","submitted_at":"2025-02-04T03:04:04Z","title":"On the Benefits of Attribute-Driven Graph Domain Adaptation","version":3},"reference_index":2015,"source":"pdf_text","source_observed_at":"2026-08-09T13:57:08.410902Z"},"links":{"cited_paper":"/paper/1609.02907","citing_paper":"/paper/2502.06808"},"observation_digest":"sha256:71bffc2e45cd70f80cb34dbeb0883e254272192013aa78bc70a382147f6650c6","observation_id":"985c3a8f-6ac7-4fe8-8883-ccbb22f1a72e","resolution":{"observed_at":"2026-08-09T13:57:08.410902Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"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-09T13:57:08.430485Z","title":"Network embedding for cross-network node classification","venue":null,"work_id":null,"year":1901},"citing_paper":{"arxiv_id":"2502.06808","last_updated":"2025-02-24T19:57:07Z","snapshot_observed_at":"2026-08-10T12:18:02.397375Z","submitted_at":"2025-02-04T03:04:04Z","title":"On the Benefits of Attribute-Driven Graph Domain Adaptation","version":3},"reference_index":2017,"source":"pdf_text","source_observed_at":"2026-08-09T13:57:08.430485Z"},"links":{"cited_paper":"/paper/1901.07264","citing_paper":"/paper/2502.06808"},"observation_digest":"sha256:de1f449e7371fa15e54a544a30c6b2a1c954de228b35ed466bf0a223d0bc984f","observation_id":"ac64f3f3-de66-4d20-966c-2945973864ea","resolution":{"observed_at":"2026-08-09T13:57:08.430485Z","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-09T13:57:08.809877Z","title":"Graph transfer learning via adversarial domain adaptation with graph convolution","venue":null,"work_id":"2111869b-5fa9-47eb-ac8a-ac5d6e1aeba0","year":2025},"citing_paper":{"arxiv_id":"2502.06808","last_updated":"2025-02-24T19:57:07Z","snapshot_observed_at":"2026-08-10T12:18:02.397375Z","submitted_at":"2025-02-04T03:04:04Z","title":"On the Benefits of Attribute-Driven Graph Domain Adaptation","version":3},"reference_index":2019,"source":"pdf_text","source_observed_at":"2026-08-09T13:57:08.395150Z"},"links":{"citing_paper":"/paper/2502.06808"},"observation_digest":"sha256:0eaa3eabc80f553455418aa830d15ea9187fbc79c82cf6dd80e6387b32512fcd","observation_id":"8624b6dd-2a33-4a5d-9b8a-dd230def805c","resolution":{"observed_at":"2026-08-09T13:57:08.814351Z","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":"2412.09902","last_updated":"2024-12-18T04:51:33Z","snapshot_observed_at":"2026-07-06T20:06:21.957662Z","submitted_at":"2024-12-13T06:42:36Z","title":"One Node One Model: Featuring the Missing-Half for Graph Clustering","version":2},"cited_work":{"arxiv_id":"2412.09902","doi":null,"metadata_source":"pith","pith_arxiv_id":"2412.09902","snapshot_observed_at":"2026-08-09T13:57:08.557672Z","title":"One Node One Model: Featuring the Missing-Half for Graph Clustering","venue":"cs.LG","work_id":"dfa79bc3-f194-48c1-b699-2d619368006a","year":2024},"citing_paper":{"arxiv_id":"2502.06808","last_updated":"2025-02-24T19:57:07Z","snapshot_observed_at":"2026-08-10T12:18:02.397375Z","submitted_at":"2025-02-04T03:04:04Z","title":"On the Benefits of Attribute-Driven Graph Domain Adaptation","version":3},"reference_index":2020,"source":"pdf_text","source_observed_at":"2026-08-09T13:57:08.450591Z"},"links":{"cited_paper":"/paper/2412.09902","citing_paper":"/paper/2502.06808"},"observation_digest":"sha256:4e3590e77b537d360a5da37bfa98e326807848e5cf607dca8f475d763b20802a","observation_id":"2c1f9bde-83b8-4826-bea7-9669c17d161a","resolution":{"observed_at":"2026-08-09T13:57:08.564759Z","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":{"arxiv_id":"2403.03670","last_updated":"2025-01-09T06:47:34Z","snapshot_observed_at":"2026-08-05T10:19:26.663734Z","submitted_at":"2024-03-06T12:47:14Z","title":"CDC: A Simple Framework for Complex Data Clustering","version":2},"cited_work":{"arxiv_id":"2403.03670","doi":null,"metadata_source":"pith","pith_arxiv_id":"2403.03670","snapshot_observed_at":"2026-08-09T13:57:08.659222Z","title":"CDC: A Simple Framework for Complex Data Clustering","venue":"cs.LG","work_id":"9b732e80-d866-4771-809c-db754679bcf5","year":2024},"citing_paper":{"arxiv_id":"2502.06808","last_updated":"2025-02-24T19:57:07Z","snapshot_observed_at":"2026-08-10T12:18:02.397375Z","submitted_at":"2025-02-04T03:04:04Z","title":"On the Benefits of Attribute-Driven Graph Domain Adaptation","version":3},"reference_index":2021,"source":"pdf_text","source_observed_at":"2026-08-09T13:57:08.405681Z"},"links":{"cited_paper":"/paper/2403.03670","citing_paper":"/paper/2502.06808"},"observation_digest":"sha256:47512dfe2e0e8cea6f119ed327d9f9541a2917b4fb7f5b67235448b92e9c2fa7","observation_id":"087e2df9-daeb-43bb-8eff-14c4d431ec6b","resolution":{"observed_at":"2026-08-09T13:57:08.664599Z","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-09T13:57:08.795444Z","title":"Structure-preserving graph represen- tation learning","venue":null,"work_id":"3b4685f7-2142-46c0-8aa6-e49a17b51489","year":2022},"citing_paper":{"arxiv_id":"2502.06808","last_updated":"2025-02-24T19:57:07Z","snapshot_observed_at":"2026-08-10T12:18:02.397375Z","submitted_at":"2025-02-04T03:04:04Z","title":"On the Benefits of Attribute-Driven Graph Domain Adaptation","version":3},"reference_index":2022,"source":"pdf_text","source_observed_at":"2026-08-09T13:57:08.400925Z"},"links":{"citing_paper":"/paper/2502.06808"},"observation_digest":"sha256:9fb7852b4a759dc2de60f4c21cc3999d1e28ca098a86346649d3983ba240c104","observation_id":"18df8739-8468-4a98-bd09-e492b68e076d","resolution":{"observed_at":"2026-08-09T13:57:08.799873Z","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.00904","last_updated":"2024-02-01T02:44:32Z","snapshot_observed_at":"2026-08-09T23:19:32.123062Z","submitted_at":"2024-02-01T02:44:32Z","title":"Graph Domain Adaptation: Challenges, Progress and Prospects","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.00904","snapshot_observed_at":"2026-08-09T13:57:08.440657Z","title":"Graph domain adaptation: Challenges, progress and prospects","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2502.06808","last_updated":"2025-02-24T19:57:07Z","snapshot_observed_at":"2026-08-10T12:18:02.397375Z","submitted_at":"2025-02-04T03:04:04Z","title":"On the Benefits of Attribute-Driven Graph Domain Adaptation","version":3},"reference_index":2023,"source":"pdf_text","source_observed_at":"2026-08-09T13:57:08.440657Z"},"links":{"cited_paper":"/paper/2402.00904","citing_paper":"/paper/2502.06808"},"observation_digest":"sha256:8a1e139e6aaa9f8f70d173ed8a37baad889d43052c57ceb429a729536fd6d673","observation_id":"6c097632-a793-4bc0-aa73-572ee8f23fab","resolution":{"observed_at":"2026-08-09T13:57:08.440657Z","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-09T13:57:08.781228Z","title":"Upper bounding barlow twins: A novel filter for multi-relational clustering","venue":null,"work_id":"ae907432-8401-466b-89de-dfb57560177f","year":2025},"citing_paper":{"arxiv_id":"2502.06808","last_updated":"2025-02-24T19:57:07Z","snapshot_observed_at":"2026-08-10T12:18:02.397375Z","submitted_at":"2025-02-04T03:04:04Z","title":"On the Benefits of Attribute-Driven Graph Domain Adaptation","version":3},"reference_index":2025,"source":"pdf_text","source_observed_at":"2026-08-09T13:57:08.425927Z"},"links":{"citing_paper":"/paper/2502.06808"},"observation_digest":"sha256:829ad94b80cffef29f5ec2ebc2c9e099782116cc0628125b5a8a6ac56fb29428","observation_id":"e18d195a-9765-4083-8927-c82d33b357fe","resolution":{"observed_at":"2026-08-09T13:57:08.785886Z","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"}}],"paper":{"arxiv_id":"2502.06808","last_updated":"2025-02-24T19:57:07Z","latest_version":3,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-10T12:18:02.397375Z","submitted_at":"2025-02-04T03:04:04Z","title":"On the Benefits of Attribute-Driven Graph Domain Adaptation"},"reference_resolution":{"displayed":19,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":8,"verified_exact":2,"verified_fuzzy":9},"total_outbound_references":19},"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 19 of 19 outbound references and 3 inbound Pith citation observations for arXiv:2502.06808."}