{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2022:M2H2VLHWVYNVTYLX4EF5X7P4PS","short_pith_number":"pith:M2H2VLHW","canonical_record":{"source":{"id":"2212.08174","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.LG","submitted_at":"2022-12-15T22:29:29Z","cross_cats_sorted":[],"title_canon_sha256":"1997d6c29f668bf32da0940eef19d337559f70c1496d154f597eb8bdd046706e","abstract_canon_sha256":"2f015dbf8ae797edd087ea762e94b5adef77766580f6c7e054bec16b4eb04673"},"schema_version":"1.0"},"canonical_sha256":"668faaacf6ae1b59e177e10bdbfdfc7c82feb94ddb298047986b6ed2a0695974","source":{"kind":"arxiv","id":"2212.08174","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2212.08174","created_at":"2026-07-05T05:52:24Z"},{"alias_kind":"arxiv_version","alias_value":"2212.08174v2","created_at":"2026-07-05T05:52:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2212.08174","created_at":"2026-07-05T05:52:24Z"},{"alias_kind":"pith_short_12","alias_value":"M2H2VLHWVYNV","created_at":"2026-07-05T05:52:24Z"},{"alias_kind":"pith_short_16","alias_value":"M2H2VLHWVYNVTYLX","created_at":"2026-07-05T05:52:24Z"},{"alias_kind":"pith_short_8","alias_value":"M2H2VLHW","created_at":"2026-07-05T05:52:24Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2022:M2H2VLHWVYNVTYLX4EF5X7P4PS","target":"record","payload":{"canonical_record":{"source":{"id":"2212.08174","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.LG","submitted_at":"2022-12-15T22:29:29Z","cross_cats_sorted":[],"title_canon_sha256":"1997d6c29f668bf32da0940eef19d337559f70c1496d154f597eb8bdd046706e","abstract_canon_sha256":"2f015dbf8ae797edd087ea762e94b5adef77766580f6c7e054bec16b4eb04673"},"schema_version":"1.0"},"canonical_sha256":"668faaacf6ae1b59e177e10bdbfdfc7c82feb94ddb298047986b6ed2a0695974","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:52:24.899781Z","signature_b64":"mOQe+5+XnFzlgCtCH631URJGyb9V+omLYp78ppqX77AVsq3yTwQxQrx80yjS0ZHjUZolnLrMQNmaUOMbVBOKDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"668faaacf6ae1b59e177e10bdbfdfc7c82feb94ddb298047986b6ed2a0695974","last_reissued_at":"2026-07-05T05:52:24.899297Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:52:24.899297Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2212.08174","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T05:52:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wpNFJC2XEkt1dLtyS8PFzCWA7bsNsUNPMdOEpn+fc55y16mkNdN0uk7yHXfpQQYscRctn93R8o7HIPiptvU+BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-06T19:07:45.279480Z"},"content_sha256":"c6e7e48cc4bd971ec02781bea735b5542dee38db65828577e9d80ff6a1c5e1bc","schema_version":"1.0","event_id":"sha256:c6e7e48cc4bd971ec02781bea735b5542dee38db65828577e9d80ff6a1c5e1bc"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2022:M2H2VLHWVYNVTYLX4EF5X7P4PS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Non-IID Transfer Learning on Graphs","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Elizabeth Ainsworth, Jingrui He, Jun Wu","submitted_at":"2022-12-15T22:29:29Z","abstract_excerpt":"Transfer learning refers to the transfer of knowledge or information from a relevant source domain to a target domain. However, most existing transfer learning theories and algorithms focus on IID tasks, where the source/target samples are assumed to be independent and identically distributed. Very little effort is devoted to theoretically studying the knowledge transferability on non-IID tasks, e.g., cross-network mining. To bridge the gap, in this paper, we propose rigorous generalization bounds and algorithms for cross-network transfer learning from a source graph to a target graph. The cru"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2212.08174","kind":"arxiv","version":2},"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/2212.08174/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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T05:52:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"78ifdzK7L5ORvtO+/qluRksfdIjme9kaRvCBhBfk4qpWDcJWEZsPiLHDBjIdesgryNg0GdiyS64QgYQSm05WAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-06T19:07:45.279854Z"},"content_sha256":"cab0832e2e40696fe374a33a3e97c57d250d07f4c0ab854c4b6ca0200df6614a","schema_version":"1.0","event_id":"sha256:cab0832e2e40696fe374a33a3e97c57d250d07f4c0ab854c4b6ca0200df6614a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/M2H2VLHWVYNVTYLX4EF5X7P4PS/bundle.json","state_url":"https://pith.science/pith/M2H2VLHWVYNVTYLX4EF5X7P4PS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/M2H2VLHWVYNVTYLX4EF5X7P4PS/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-07-06T19:07:45Z","links":{"resolver":"https://pith.science/pith/M2H2VLHWVYNVTYLX4EF5X7P4PS","bundle":"https://pith.science/pith/M2H2VLHWVYNVTYLX4EF5X7P4PS/bundle.json","state":"https://pith.science/pith/M2H2VLHWVYNVTYLX4EF5X7P4PS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/M2H2VLHWVYNVTYLX4EF5X7P4PS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:M2H2VLHWVYNVTYLX4EF5X7P4PS","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"2f015dbf8ae797edd087ea762e94b5adef77766580f6c7e054bec16b4eb04673","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.LG","submitted_at":"2022-12-15T22:29:29Z","title_canon_sha256":"1997d6c29f668bf32da0940eef19d337559f70c1496d154f597eb8bdd046706e"},"schema_version":"1.0","source":{"id":"2212.08174","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2212.08174","created_at":"2026-07-05T05:52:24Z"},{"alias_kind":"arxiv_version","alias_value":"2212.08174v2","created_at":"2026-07-05T05:52:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2212.08174","created_at":"2026-07-05T05:52:24Z"},{"alias_kind":"pith_short_12","alias_value":"M2H2VLHWVYNV","created_at":"2026-07-05T05:52:24Z"},{"alias_kind":"pith_short_16","alias_value":"M2H2VLHWVYNVTYLX","created_at":"2026-07-05T05:52:24Z"},{"alias_kind":"pith_short_8","alias_value":"M2H2VLHW","created_at":"2026-07-05T05:52:24Z"}],"graph_snapshots":[{"event_id":"sha256:cab0832e2e40696fe374a33a3e97c57d250d07f4c0ab854c4b6ca0200df6614a","target":"graph","created_at":"2026-07-05T05:52:24Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2212.08174/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Transfer learning refers to the transfer of knowledge or information from a relevant source domain to a target domain. However, most existing transfer learning theories and algorithms focus on IID tasks, where the source/target samples are assumed to be independent and identically distributed. Very little effort is devoted to theoretically studying the knowledge transferability on non-IID tasks, e.g., cross-network mining. To bridge the gap, in this paper, we propose rigorous generalization bounds and algorithms for cross-network transfer learning from a source graph to a target graph. The cru","authors_text":"Elizabeth Ainsworth, Jingrui He, Jun Wu","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.LG","submitted_at":"2022-12-15T22:29:29Z","title":"Non-IID Transfer Learning on Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2212.08174","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:c6e7e48cc4bd971ec02781bea735b5542dee38db65828577e9d80ff6a1c5e1bc","target":"record","created_at":"2026-07-05T05:52:24Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"2f015dbf8ae797edd087ea762e94b5adef77766580f6c7e054bec16b4eb04673","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.LG","submitted_at":"2022-12-15T22:29:29Z","title_canon_sha256":"1997d6c29f668bf32da0940eef19d337559f70c1496d154f597eb8bdd046706e"},"schema_version":"1.0","source":{"id":"2212.08174","kind":"arxiv","version":2}},"canonical_sha256":"668faaacf6ae1b59e177e10bdbfdfc7c82feb94ddb298047986b6ed2a0695974","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"668faaacf6ae1b59e177e10bdbfdfc7c82feb94ddb298047986b6ed2a0695974","first_computed_at":"2026-07-05T05:52:24.899297Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T05:52:24.899297Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"mOQe+5+XnFzlgCtCH631URJGyb9V+omLYp78ppqX77AVsq3yTwQxQrx80yjS0ZHjUZolnLrMQNmaUOMbVBOKDw==","signature_status":"signed_v1","signed_at":"2026-07-05T05:52:24.899781Z","signed_message":"canonical_sha256_bytes"},"source_id":"2212.08174","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c6e7e48cc4bd971ec02781bea735b5542dee38db65828577e9d80ff6a1c5e1bc","sha256:cab0832e2e40696fe374a33a3e97c57d250d07f4c0ab854c4b6ca0200df6614a"],"state_sha256":"22931a05a526522bb471442d29bdc351901e8a1626ae3704d88f5c5f51c2a8a3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4jt8QU4XZFRR/h9StjXPQGSmUyA6HtfVhxzAZJi2urXcwGLVC3VtutAj6jvtO7EbYFh7Hm3Qlv5FJ7F+g9dECA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-06T19:07:45.281753Z","bundle_sha256":"ad828993df2266be8b35b0dfc16de240ce2aa83f9ca845c7a2c576fa5c7c1382"}}