{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:7KOE4W4LPADG5ZIFGD7NWBQHNU","short_pith_number":"pith:7KOE4W4L","schema_version":"1.0","canonical_sha256":"fa9c4e5b8b78066ee50530fedb06076d34e53e756ae0b2159b6cc4e2c42a71a0","source":{"kind":"arxiv","id":"2605.31427","version":1},"attestation_state":"computed","paper":{"title":"DG-CoLearn: An Efficient Collaborative Learning Framework for Dynamic Graphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.LG","authors_text":"Ashley Hoi-Ting Au, Ligang He, Qiang Ni, Zikun Zhang","submitted_at":"2026-05-29T15:23:05Z","abstract_excerpt":"Dynamic graph learning (DGL) is essential for modelling evolving graph data, but existing methods suffer from significant computational overhead due to repeated full-snapshot retraining and are not well-suited for collaborative settings with partitioned data. In realistic graph systems, cross-partition edges are unavoidable, but direct sharing of graph structure between clients may violate privacy constraints. We propose DG-CoLearn, a client-oblivious collaborative dynamic graph learning framework built on incremental graph snapshot processing, which focuses computation on graph regions affect"},"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":"2605.31427","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-05-29T15:23:05Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"061a236d2bea7f34b8d334911be5223476122df8a0502a08895d21a486be5281","abstract_canon_sha256":"bec0e0a1846d47ed5c5829b8624a2320350600eee769582cb92fe70fd44c3849"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-01T02:04:05.163359Z","signature_b64":"ItEF3hDq5nIAXqIu2A5qsuIEueaGzY8mpubc2IxySe7zZtmvlwD/Z+6pp5XCXQyQJTSpC1Oeyc4VbiSVG33FAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fa9c4e5b8b78066ee50530fedb06076d34e53e756ae0b2159b6cc4e2c42a71a0","last_reissued_at":"2026-06-01T02:04:05.162521Z","signature_status":"signed_v1","first_computed_at":"2026-06-01T02:04:05.162521Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"DG-CoLearn: An Efficient Collaborative Learning Framework for Dynamic Graphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.LG","authors_text":"Ashley Hoi-Ting Au, Ligang He, Qiang Ni, Zikun Zhang","submitted_at":"2026-05-29T15:23:05Z","abstract_excerpt":"Dynamic graph learning (DGL) is essential for modelling evolving graph data, but existing methods suffer from significant computational overhead due to repeated full-snapshot retraining and are not well-suited for collaborative settings with partitioned data. In realistic graph systems, cross-partition edges are unavoidable, but direct sharing of graph structure between clients may violate privacy constraints. We propose DG-CoLearn, a client-oblivious collaborative dynamic graph learning framework built on incremental graph snapshot processing, which focuses computation on graph regions affect"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.31427","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/2605.31427/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":"2605.31427","created_at":"2026-06-01T02:04:05.162646+00:00"},{"alias_kind":"arxiv_version","alias_value":"2605.31427v1","created_at":"2026-06-01T02:04:05.162646+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.31427","created_at":"2026-06-01T02:04:05.162646+00:00"},{"alias_kind":"pith_short_12","alias_value":"7KOE4W4LPADG","created_at":"2026-06-01T02:04:05.162646+00:00"},{"alias_kind":"pith_short_16","alias_value":"7KOE4W4LPADG5ZIF","created_at":"2026-06-01T02:04:05.162646+00:00"},{"alias_kind":"pith_short_8","alias_value":"7KOE4W4L","created_at":"2026-06-01T02:04:05.162646+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/7KOE4W4LPADG5ZIFGD7NWBQHNU","json":"https://pith.science/pith/7KOE4W4LPADG5ZIFGD7NWBQHNU.json","graph_json":"https://pith.science/api/pith-number/7KOE4W4LPADG5ZIFGD7NWBQHNU/graph.json","events_json":"https://pith.science/api/pith-number/7KOE4W4LPADG5ZIFGD7NWBQHNU/events.json","paper":"https://pith.science/paper/7KOE4W4L"},"agent_actions":{"view_html":"https://pith.science/pith/7KOE4W4LPADG5ZIFGD7NWBQHNU","download_json":"https://pith.science/pith/7KOE4W4LPADG5ZIFGD7NWBQHNU.json","view_paper":"https://pith.science/paper/7KOE4W4L","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2605.31427&json=true","fetch_graph":"https://pith.science/api/pith-number/7KOE4W4LPADG5ZIFGD7NWBQHNU/graph.json","fetch_events":"https://pith.science/api/pith-number/7KOE4W4LPADG5ZIFGD7NWBQHNU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7KOE4W4LPADG5ZIFGD7NWBQHNU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7KOE4W4LPADG5ZIFGD7NWBQHNU/action/storage_attestation","attest_author":"https://pith.science/pith/7KOE4W4LPADG5ZIFGD7NWBQHNU/action/author_attestation","sign_citation":"https://pith.science/pith/7KOE4W4LPADG5ZIFGD7NWBQHNU/action/citation_signature","submit_replication":"https://pith.science/pith/7KOE4W4LPADG5ZIFGD7NWBQHNU/action/replication_record"}},"created_at":"2026-06-01T02:04:05.162646+00:00","updated_at":"2026-06-01T02:04:05.162646+00:00"}