{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:A2PWKZ4NBFUC3OBTNMAK7BFQ3S","short_pith_number":"pith:A2PWKZ4N","schema_version":"1.0","canonical_sha256":"069f65678d09682db8336b00af84b0dc92feaa8d422908b592a5b936c7a471a9","source":{"kind":"arxiv","id":"2304.05729","version":1},"attestation_state":"computed","paper":{"title":"Dynamic Graph Representation Learning with Neural Networks: A Survey","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Cl\\'ement Chatelain, Leshanshui Yang, S\\'ebastien Adam","submitted_at":"2023-04-12T09:39:17Z","abstract_excerpt":"In recent years, Dynamic Graph (DG) representations have been increasingly used for modeling dynamic systems due to their ability to integrate both topological and temporal information in a compact representation. Dynamic graphs allow to efficiently handle applications such as social network prediction, recommender systems, traffic forecasting or electroencephalography analysis, that can not be adressed using standard numeric representations. As a direct consequence of the emergence of dynamic graph representations, dynamic graph learning has emerged as a new machine learning problem, combinin"},"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":"2304.05729","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2023-04-12T09:39:17Z","cross_cats_sorted":[],"title_canon_sha256":"af1e63e4cd9f56ecf06e283cf36c0af0ba70eb60208910b52491eabd9697a3b3","abstract_canon_sha256":"9df259e1a7f104623908ed3487e8b3f0c1bc0c0c53d95c18c4983001a231293a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:00:22.877116Z","signature_b64":"Q0XhN5yCYAMao1P3PjUyWesQC43nzJH6qkuDCa3aeOeyzgM6TerRi97K3F2gfMt86JaICABg9RmlxnyOsN8MCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"069f65678d09682db8336b00af84b0dc92feaa8d422908b592a5b936c7a471a9","last_reissued_at":"2026-07-05T06:00:22.876688Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:00:22.876688Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Dynamic Graph Representation Learning with Neural Networks: A Survey","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Cl\\'ement Chatelain, Leshanshui Yang, S\\'ebastien Adam","submitted_at":"2023-04-12T09:39:17Z","abstract_excerpt":"In recent years, Dynamic Graph (DG) representations have been increasingly used for modeling dynamic systems due to their ability to integrate both topological and temporal information in a compact representation. Dynamic graphs allow to efficiently handle applications such as social network prediction, recommender systems, traffic forecasting or electroencephalography analysis, that can not be adressed using standard numeric representations. As a direct consequence of the emergence of dynamic graph representations, dynamic graph learning has emerged as a new machine learning problem, combinin"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2304.05729","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/2304.05729/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":"2304.05729","created_at":"2026-07-05T06:00:22.876744+00:00"},{"alias_kind":"arxiv_version","alias_value":"2304.05729v1","created_at":"2026-07-05T06:00:22.876744+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2304.05729","created_at":"2026-07-05T06:00:22.876744+00:00"},{"alias_kind":"pith_short_12","alias_value":"A2PWKZ4NBFUC","created_at":"2026-07-05T06:00:22.876744+00:00"},{"alias_kind":"pith_short_16","alias_value":"A2PWKZ4NBFUC3OBT","created_at":"2026-07-05T06:00:22.876744+00:00"},{"alias_kind":"pith_short_8","alias_value":"A2PWKZ4N","created_at":"2026-07-05T06:00:22.876744+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2501.11880","citing_title":"Community-Aware Temporal Walks: Parameter-Free Representation Learning on Continuous-Time Dynamic Graphs","ref_index":13,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/A2PWKZ4NBFUC3OBTNMAK7BFQ3S","json":"https://pith.science/pith/A2PWKZ4NBFUC3OBTNMAK7BFQ3S.json","graph_json":"https://pith.science/api/pith-number/A2PWKZ4NBFUC3OBTNMAK7BFQ3S/graph.json","events_json":"https://pith.science/api/pith-number/A2PWKZ4NBFUC3OBTNMAK7BFQ3S/events.json","paper":"https://pith.science/paper/A2PWKZ4N"},"agent_actions":{"view_html":"https://pith.science/pith/A2PWKZ4NBFUC3OBTNMAK7BFQ3S","download_json":"https://pith.science/pith/A2PWKZ4NBFUC3OBTNMAK7BFQ3S.json","view_paper":"https://pith.science/paper/A2PWKZ4N","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2304.05729&json=true","fetch_graph":"https://pith.science/api/pith-number/A2PWKZ4NBFUC3OBTNMAK7BFQ3S/graph.json","fetch_events":"https://pith.science/api/pith-number/A2PWKZ4NBFUC3OBTNMAK7BFQ3S/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/A2PWKZ4NBFUC3OBTNMAK7BFQ3S/action/timestamp_anchor","attest_storage":"https://pith.science/pith/A2PWKZ4NBFUC3OBTNMAK7BFQ3S/action/storage_attestation","attest_author":"https://pith.science/pith/A2PWKZ4NBFUC3OBTNMAK7BFQ3S/action/author_attestation","sign_citation":"https://pith.science/pith/A2PWKZ4NBFUC3OBTNMAK7BFQ3S/action/citation_signature","submit_replication":"https://pith.science/pith/A2PWKZ4NBFUC3OBTNMAK7BFQ3S/action/replication_record"}},"created_at":"2026-07-05T06:00:22.876744+00:00","updated_at":"2026-07-05T06:00:22.876744+00:00"}