{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:IBPKTIPGCQ5TQZYDSRXV5CQGQJ","short_pith_number":"pith:IBPKTIPG","canonical_record":{"source":{"id":"2312.13536","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2023-12-21T02:37:56Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"ab0271e732deefa5970fcb274fd3c3bfb6d72cef7e5dce8e8e36320130f3950d","abstract_canon_sha256":"d2701469391607c10e55b1e3f3a11f88cece0c44ad4f23c21cfe0472e250593b"},"schema_version":"1.0"},"canonical_sha256":"405ea9a1e6143b386703946f5e8a068245f180333ea899a10f94b09fd8c70545","source":{"kind":"arxiv","id":"2312.13536","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2312.13536","created_at":"2026-07-05T07:26:45Z"},{"alias_kind":"arxiv_version","alias_value":"2312.13536v1","created_at":"2026-07-05T07:26:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2312.13536","created_at":"2026-07-05T07:26:45Z"},{"alias_kind":"pith_short_12","alias_value":"IBPKTIPGCQ5T","created_at":"2026-07-05T07:26:45Z"},{"alias_kind":"pith_short_16","alias_value":"IBPKTIPGCQ5TQZYD","created_at":"2026-07-05T07:26:45Z"},{"alias_kind":"pith_short_8","alias_value":"IBPKTIPG","created_at":"2026-07-05T07:26:45Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:IBPKTIPGCQ5TQZYDSRXV5CQGQJ","target":"record","payload":{"canonical_record":{"source":{"id":"2312.13536","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2023-12-21T02:37:56Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"ab0271e732deefa5970fcb274fd3c3bfb6d72cef7e5dce8e8e36320130f3950d","abstract_canon_sha256":"d2701469391607c10e55b1e3f3a11f88cece0c44ad4f23c21cfe0472e250593b"},"schema_version":"1.0"},"canonical_sha256":"405ea9a1e6143b386703946f5e8a068245f180333ea899a10f94b09fd8c70545","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:26:45.986493Z","signature_b64":"bHkMxtRsvImI2oOq2LIy0o6hkDj+P2IsnP69xq/3WWOKa4H1w1v+DB08c61EilazuGypwnjda02+czh6bb/lCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"405ea9a1e6143b386703946f5e8a068245f180333ea899a10f94b09fd8c70545","last_reissued_at":"2026-07-05T07:26:45.986117Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:26:45.986117Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2312.13536","source_version":1,"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-05T07:26:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2/C4YMBBhie7LcUjuLZ/MHNSsRVw84E+c5xX4wn91OmusF1x2LCSsNCkUnlVq59p9BYrmW4vvyAzZXBTubn/CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-01T08:44:42.483463Z"},"content_sha256":"a14eda597add608bad4700953ae87b4808f6adf8e75155dcf017d302ca24ee11","schema_version":"1.0","event_id":"sha256:a14eda597add608bad4700953ae87b4808f6adf8e75155dcf017d302ca24ee11"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:IBPKTIPGCQ5TQZYDSRXV5CQGQJ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Domain Adaptive Graph Classification","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Siyang Luo, Xiaoxuan Liang, zhenghan Chen, Ziyi Jiang","submitted_at":"2023-12-21T02:37:56Z","abstract_excerpt":"Despite the remarkable accomplishments of graph neural networks (GNNs), they typically rely on task-specific labels, posing potential challenges in terms of their acquisition. Existing work have been made to address this issue through the lens of unsupervised domain adaptation, wherein labeled source graphs are utilized to enhance the learning process for target data. However, the simultaneous exploration of graph topology and reduction of domain disparities remains a substantial hurdle. In this paper, we introduce the Dual Adversarial Graph Representation Learning (DAGRL), which explore the g"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2312.13536","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/2312.13536/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-05T07:26:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8Ozye6F1tLPbOsungNIZa+Al5pPBTBXykncxo9fyY/rGmO8x8PDPHIE5asRjnxPm/x3VkQjRMb/6ekrj4ThuCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-01T08:44:42.483968Z"},"content_sha256":"11e1e50323b1a69d7e820731155d67c6b8cb0d7a2bd4c69124f5c067ca002eb7","schema_version":"1.0","event_id":"sha256:11e1e50323b1a69d7e820731155d67c6b8cb0d7a2bd4c69124f5c067ca002eb7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IBPKTIPGCQ5TQZYDSRXV5CQGQJ/bundle.json","state_url":"https://pith.science/pith/IBPKTIPGCQ5TQZYDSRXV5CQGQJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IBPKTIPGCQ5TQZYDSRXV5CQGQJ/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-08-01T08:44:42Z","links":{"resolver":"https://pith.science/pith/IBPKTIPGCQ5TQZYDSRXV5CQGQJ","bundle":"https://pith.science/pith/IBPKTIPGCQ5TQZYDSRXV5CQGQJ/bundle.json","state":"https://pith.science/pith/IBPKTIPGCQ5TQZYDSRXV5CQGQJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IBPKTIPGCQ5TQZYDSRXV5CQGQJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:IBPKTIPGCQ5TQZYDSRXV5CQGQJ","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":"d2701469391607c10e55b1e3f3a11f88cece0c44ad4f23c21cfe0472e250593b","cross_cats_sorted":["cs.AI"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2023-12-21T02:37:56Z","title_canon_sha256":"ab0271e732deefa5970fcb274fd3c3bfb6d72cef7e5dce8e8e36320130f3950d"},"schema_version":"1.0","source":{"id":"2312.13536","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2312.13536","created_at":"2026-07-05T07:26:45Z"},{"alias_kind":"arxiv_version","alias_value":"2312.13536v1","created_at":"2026-07-05T07:26:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2312.13536","created_at":"2026-07-05T07:26:45Z"},{"alias_kind":"pith_short_12","alias_value":"IBPKTIPGCQ5T","created_at":"2026-07-05T07:26:45Z"},{"alias_kind":"pith_short_16","alias_value":"IBPKTIPGCQ5TQZYD","created_at":"2026-07-05T07:26:45Z"},{"alias_kind":"pith_short_8","alias_value":"IBPKTIPG","created_at":"2026-07-05T07:26:45Z"}],"graph_snapshots":[{"event_id":"sha256:11e1e50323b1a69d7e820731155d67c6b8cb0d7a2bd4c69124f5c067ca002eb7","target":"graph","created_at":"2026-07-05T07:26:45Z","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/2312.13536/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Despite the remarkable accomplishments of graph neural networks (GNNs), they typically rely on task-specific labels, posing potential challenges in terms of their acquisition. Existing work have been made to address this issue through the lens of unsupervised domain adaptation, wherein labeled source graphs are utilized to enhance the learning process for target data. However, the simultaneous exploration of graph topology and reduction of domain disparities remains a substantial hurdle. In this paper, we introduce the Dual Adversarial Graph Representation Learning (DAGRL), which explore the g","authors_text":"Siyang Luo, Xiaoxuan Liang, zhenghan Chen, Ziyi Jiang","cross_cats":["cs.AI"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2023-12-21T02:37:56Z","title":"Domain Adaptive Graph Classification"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2312.13536","kind":"arxiv","version":1},"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:a14eda597add608bad4700953ae87b4808f6adf8e75155dcf017d302ca24ee11","target":"record","created_at":"2026-07-05T07:26:45Z","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":"d2701469391607c10e55b1e3f3a11f88cece0c44ad4f23c21cfe0472e250593b","cross_cats_sorted":["cs.AI"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2023-12-21T02:37:56Z","title_canon_sha256":"ab0271e732deefa5970fcb274fd3c3bfb6d72cef7e5dce8e8e36320130f3950d"},"schema_version":"1.0","source":{"id":"2312.13536","kind":"arxiv","version":1}},"canonical_sha256":"405ea9a1e6143b386703946f5e8a068245f180333ea899a10f94b09fd8c70545","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"405ea9a1e6143b386703946f5e8a068245f180333ea899a10f94b09fd8c70545","first_computed_at":"2026-07-05T07:26:45.986117Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T07:26:45.986117Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"bHkMxtRsvImI2oOq2LIy0o6hkDj+P2IsnP69xq/3WWOKa4H1w1v+DB08c61EilazuGypwnjda02+czh6bb/lCg==","signature_status":"signed_v1","signed_at":"2026-07-05T07:26:45.986493Z","signed_message":"canonical_sha256_bytes"},"source_id":"2312.13536","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a14eda597add608bad4700953ae87b4808f6adf8e75155dcf017d302ca24ee11","sha256:11e1e50323b1a69d7e820731155d67c6b8cb0d7a2bd4c69124f5c067ca002eb7"],"state_sha256":"dc99537841efb44512fff898575968b08847f6c5b2b210fd1dfd33fd8a5a624a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4lOSpBnpNdRn7TXYIw0aLAutd9YVdR3DPjllZb+lbBgVweRMpAniRXbr2cyEZ8Zjw2Ksz4Neh+LApgfwGZ3BDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-01T08:44:42.489087Z","bundle_sha256":"9b3c1dbcd02e0ad20218c3b3c84a293784fc6b56c009ad76db77c1b10de3f278"}}