{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:MRTNVIEZSMML7J7XCL4KXK5QZA","short_pith_number":"pith:MRTNVIEZ","schema_version":"1.0","canonical_sha256":"6466daa0999318bfa7f712f8ababb0c817173455eff22fe423d47cae379cea76","source":{"kind":"arxiv","id":"2501.16002","version":2},"attestation_state":"computed","paper":{"title":"ScaDyG:A New Paradigm for Large-scale Dynamic Graph Learning","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Guoren Wang, Kangfei Zhao, Rong-Hua Li, Xiang Wu, Xunkai Li","submitted_at":"2025-01-27T12:39:16Z","abstract_excerpt":"Dynamic graphs (DGs), which capture time-evolving relationships between graph entities, have widespread real-world applications. To efficiently encode DGs for downstream tasks, most dynamic graph neural networks follow the traditional message-passing mechanism and extend it with time-based techniques. Despite their effectiveness, the growth of historical interactions introduces significant scalability issues, particularly in industry scenarios. To address this limitation, we propose ScaDyG, with the core idea of designing a time-aware scalable learning paradigm as follows: 1) Time-aware Topolo"},"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":"2501.16002","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2025-01-27T12:39:16Z","cross_cats_sorted":[],"title_canon_sha256":"e7934f7418bc27f5c276d002834de96b7afc8a56f872cfb6397af9a1d32fc045","abstract_canon_sha256":"95440e8593aba086eb55b4b8d5a502c5df300168650d07470120d1f52ed8d7cf"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:07:29.804693Z","signature_b64":"EG0ILVlwhQ2HdCO1juPeRwkI1msGDUvhJL0No+kcwsrLoIvk7uzFcNFvhaCcKZyDnCpM3Wm4ycoOqhTx2/D5Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6466daa0999318bfa7f712f8ababb0c817173455eff22fe423d47cae379cea76","last_reissued_at":"2026-07-05T10:07:29.804223Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:07:29.804223Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"ScaDyG:A New Paradigm for Large-scale Dynamic Graph Learning","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Guoren Wang, Kangfei Zhao, Rong-Hua Li, Xiang Wu, Xunkai Li","submitted_at":"2025-01-27T12:39:16Z","abstract_excerpt":"Dynamic graphs (DGs), which capture time-evolving relationships between graph entities, have widespread real-world applications. To efficiently encode DGs for downstream tasks, most dynamic graph neural networks follow the traditional message-passing mechanism and extend it with time-based techniques. Despite their effectiveness, the growth of historical interactions introduces significant scalability issues, particularly in industry scenarios. To address this limitation, we propose ScaDyG, with the core idea of designing a time-aware scalable learning paradigm as follows: 1) Time-aware Topolo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2501.16002","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/2501.16002/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":"2501.16002","created_at":"2026-07-05T10:07:29.804281+00:00"},{"alias_kind":"arxiv_version","alias_value":"2501.16002v2","created_at":"2026-07-05T10:07:29.804281+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2501.16002","created_at":"2026-07-05T10:07:29.804281+00:00"},{"alias_kind":"pith_short_12","alias_value":"MRTNVIEZSMML","created_at":"2026-07-05T10:07:29.804281+00:00"},{"alias_kind":"pith_short_16","alias_value":"MRTNVIEZSMML7J7X","created_at":"2026-07-05T10:07:29.804281+00:00"},{"alias_kind":"pith_short_8","alias_value":"MRTNVIEZ","created_at":"2026-07-05T10:07:29.804281+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/MRTNVIEZSMML7J7XCL4KXK5QZA","json":"https://pith.science/pith/MRTNVIEZSMML7J7XCL4KXK5QZA.json","graph_json":"https://pith.science/api/pith-number/MRTNVIEZSMML7J7XCL4KXK5QZA/graph.json","events_json":"https://pith.science/api/pith-number/MRTNVIEZSMML7J7XCL4KXK5QZA/events.json","paper":"https://pith.science/paper/MRTNVIEZ"},"agent_actions":{"view_html":"https://pith.science/pith/MRTNVIEZSMML7J7XCL4KXK5QZA","download_json":"https://pith.science/pith/MRTNVIEZSMML7J7XCL4KXK5QZA.json","view_paper":"https://pith.science/paper/MRTNVIEZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2501.16002&json=true","fetch_graph":"https://pith.science/api/pith-number/MRTNVIEZSMML7J7XCL4KXK5QZA/graph.json","fetch_events":"https://pith.science/api/pith-number/MRTNVIEZSMML7J7XCL4KXK5QZA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MRTNVIEZSMML7J7XCL4KXK5QZA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MRTNVIEZSMML7J7XCL4KXK5QZA/action/storage_attestation","attest_author":"https://pith.science/pith/MRTNVIEZSMML7J7XCL4KXK5QZA/action/author_attestation","sign_citation":"https://pith.science/pith/MRTNVIEZSMML7J7XCL4KXK5QZA/action/citation_signature","submit_replication":"https://pith.science/pith/MRTNVIEZSMML7J7XCL4KXK5QZA/action/replication_record"}},"created_at":"2026-07-05T10:07:29.804281+00:00","updated_at":"2026-07-05T10:07:29.804281+00:00"}