{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:5RDYTNOOWTGACGAN7QRLQBZJG6","short_pith_number":"pith:5RDYTNOO","schema_version":"1.0","canonical_sha256":"ec4789b5ceb4cc01180dfc22b807293781d3d895a2aebdda70849671a92c4b2b","source":{"kind":"arxiv","id":"2206.09345","version":1},"attestation_state":"computed","paper":{"title":"Finding Diverse and Predictable Subgraphs for Graph Domain Generalization","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Jian Liang, Junchi Yu, Ran He","submitted_at":"2022-06-19T07:57:56Z","abstract_excerpt":"This paper focuses on out-of-distribution generalization on graphs where performance drops due to the unseen distribution shift. Previous graph domain generalization works always resort to learning an invariant predictor among different source domains. However, they assume sufficient source domains are available during training, posing huge challenges for realistic applications. By contrast, we propose a new graph domain generalization framework, dubbed as DPS, by constructing multiple populations from the source domains. Specifically, DPS aims to discover multiple \\textbf{D}iverse and \\textbf"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2206.09345","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.LG","submitted_at":"2022-06-19T07:57:56Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"7e1b09ab60e02eb146efeb1cb4070ac9cdf794848a67ac53a3f9f1f69f6b4511","abstract_canon_sha256":"1a6200e09bd0108f1f73b348b0f8d7a3b973709d599918641138fc27c1f05ff9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:33:06.493908Z","signature_b64":"TG3WwTuABS6/hcOplTlML6WAlv98LUui6OyGCBnZQfQ/F08Hr33enSIlu/U7U5sWsMxlVLY+T90XBv61Iw9KBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ec4789b5ceb4cc01180dfc22b807293781d3d895a2aebdda70849671a92c4b2b","last_reissued_at":"2026-07-05T04:33:06.493441Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:33:06.493441Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Finding Diverse and Predictable Subgraphs for Graph Domain Generalization","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Jian Liang, Junchi Yu, Ran He","submitted_at":"2022-06-19T07:57:56Z","abstract_excerpt":"This paper focuses on out-of-distribution generalization on graphs where performance drops due to the unseen distribution shift. Previous graph domain generalization works always resort to learning an invariant predictor among different source domains. However, they assume sufficient source domains are available during training, posing huge challenges for realistic applications. By contrast, we propose a new graph domain generalization framework, dubbed as DPS, by constructing multiple populations from the source domains. Specifically, DPS aims to discover multiple \\textbf{D}iverse and \\textbf"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2206.09345","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2206.09345/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"2206.09345","created_at":"2026-07-05T04:33:06.493503+00:00"},{"alias_kind":"arxiv_version","alias_value":"2206.09345v1","created_at":"2026-07-05T04:33:06.493503+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2206.09345","created_at":"2026-07-05T04:33:06.493503+00:00"},{"alias_kind":"pith_short_12","alias_value":"5RDYTNOOWTGA","created_at":"2026-07-05T04:33:06.493503+00:00"},{"alias_kind":"pith_short_16","alias_value":"5RDYTNOOWTGACGAN","created_at":"2026-07-05T04:33:06.493503+00:00"},{"alias_kind":"pith_short_8","alias_value":"5RDYTNOO","created_at":"2026-07-05T04:33:06.493503+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2501.00305","citing_title":"diffIRM: A Diffusion-Augmented Invariant Risk Minimization Framework for Spatiotemporal Prediction over Graphs","ref_index":20,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/5RDYTNOOWTGACGAN7QRLQBZJG6","json":"https://pith.science/pith/5RDYTNOOWTGACGAN7QRLQBZJG6.json","graph_json":"https://pith.science/api/pith-number/5RDYTNOOWTGACGAN7QRLQBZJG6/graph.json","events_json":"https://pith.science/api/pith-number/5RDYTNOOWTGACGAN7QRLQBZJG6/events.json","paper":"https://pith.science/paper/5RDYTNOO"},"agent_actions":{"view_html":"https://pith.science/pith/5RDYTNOOWTGACGAN7QRLQBZJG6","download_json":"https://pith.science/pith/5RDYTNOOWTGACGAN7QRLQBZJG6.json","view_paper":"https://pith.science/paper/5RDYTNOO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2206.09345&json=true","fetch_graph":"https://pith.science/api/pith-number/5RDYTNOOWTGACGAN7QRLQBZJG6/graph.json","fetch_events":"https://pith.science/api/pith-number/5RDYTNOOWTGACGAN7QRLQBZJG6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5RDYTNOOWTGACGAN7QRLQBZJG6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5RDYTNOOWTGACGAN7QRLQBZJG6/action/storage_attestation","attest_author":"https://pith.science/pith/5RDYTNOOWTGACGAN7QRLQBZJG6/action/author_attestation","sign_citation":"https://pith.science/pith/5RDYTNOOWTGACGAN7QRLQBZJG6/action/citation_signature","submit_replication":"https://pith.science/pith/5RDYTNOOWTGACGAN7QRLQBZJG6/action/replication_record"}},"created_at":"2026-07-05T04:33:06.493503+00:00","updated_at":"2026-07-05T04:33:06.493503+00:00"}