{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:M3WG5V24VN42QQQKNFWT7ANLLV","short_pith_number":"pith:M3WG5V24","schema_version":"1.0","canonical_sha256":"66ec6ed75cab79a8420a696d3f81ab5d654aacacdd37695299f85651fec9bba9","source":{"kind":"arxiv","id":"1904.06449","version":2},"attestation_state":"computed","paper":{"title":"Dynamic Node Embeddings from Edge Streams","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.SI","stat.ML"],"primary_cat":"cs.LG","authors_text":"Eunyee Koh, Giang Nguyen, John Boaz Lee, Nesreen K. Ahmed, Ryan A. Rossi, Sungchul Kim","submitted_at":"2019-04-12T23:44:25Z","abstract_excerpt":"Networks evolve continuously over time with the addition, deletion, and changing of links and nodes. Such temporal networks (or edge streams) consist of a sequence of timestamped edges and are seemingly ubiquitous. Despite the importance of accurately modeling the temporal information, most embedding methods ignore it entirely or approximate the temporal network using a sequence of static snapshot graphs. In this work, we propose using the notion of temporal walks for learning dynamic embeddings from temporal networks. Temporal walks capture the temporally valid interactions (e.g., flow of inf"},"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":"1904.06449","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-04-12T23:44:25Z","cross_cats_sorted":["cs.AI","cs.SI","stat.ML"],"title_canon_sha256":"43a9c9aabf6e2752392958e52f2bcdc7ee94dd0f05b172a4c25e482e64deade8","abstract_canon_sha256":"afc48a30073a66fc1489bc774ba0785e7e516cd938f47f13de928b108c015610"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:20:04.448072Z","signature_b64":"ASn9B/8ZctPvoxFb0+5zwqU3jlHkSQ8Cph2XKGuvjxApzHd7UevQo3Or0l9AQeP1vyH84PDGTQcmxFcj3Q2PAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"66ec6ed75cab79a8420a696d3f81ab5d654aacacdd37695299f85651fec9bba9","last_reissued_at":"2026-07-05T01:20:04.447531Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:20:04.447531Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Dynamic Node Embeddings from Edge Streams","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.SI","stat.ML"],"primary_cat":"cs.LG","authors_text":"Eunyee Koh, Giang Nguyen, John Boaz Lee, Nesreen K. Ahmed, Ryan A. Rossi, Sungchul Kim","submitted_at":"2019-04-12T23:44:25Z","abstract_excerpt":"Networks evolve continuously over time with the addition, deletion, and changing of links and nodes. Such temporal networks (or edge streams) consist of a sequence of timestamped edges and are seemingly ubiquitous. Despite the importance of accurately modeling the temporal information, most embedding methods ignore it entirely or approximate the temporal network using a sequence of static snapshot graphs. In this work, we propose using the notion of temporal walks for learning dynamic embeddings from temporal networks. Temporal walks capture the temporally valid interactions (e.g., flow of inf"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.06449","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/1904.06449/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":"1904.06449","created_at":"2026-07-05T01:20:04.447597+00:00"},{"alias_kind":"arxiv_version","alias_value":"1904.06449v2","created_at":"2026-07-05T01:20:04.447597+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.06449","created_at":"2026-07-05T01:20:04.447597+00:00"},{"alias_kind":"pith_short_12","alias_value":"M3WG5V24VN42","created_at":"2026-07-05T01:20:04.447597+00:00"},{"alias_kind":"pith_short_16","alias_value":"M3WG5V24VN42QQQK","created_at":"2026-07-05T01:20:04.447597+00:00"},{"alias_kind":"pith_short_8","alias_value":"M3WG5V24","created_at":"2026-07-05T01:20:04.447597+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.12509","citing_title":"Representing Higher-Order Networks: A Survey of Graph-Based Frameworks","ref_index":206,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/M3WG5V24VN42QQQKNFWT7ANLLV","json":"https://pith.science/pith/M3WG5V24VN42QQQKNFWT7ANLLV.json","graph_json":"https://pith.science/api/pith-number/M3WG5V24VN42QQQKNFWT7ANLLV/graph.json","events_json":"https://pith.science/api/pith-number/M3WG5V24VN42QQQKNFWT7ANLLV/events.json","paper":"https://pith.science/paper/M3WG5V24"},"agent_actions":{"view_html":"https://pith.science/pith/M3WG5V24VN42QQQKNFWT7ANLLV","download_json":"https://pith.science/pith/M3WG5V24VN42QQQKNFWT7ANLLV.json","view_paper":"https://pith.science/paper/M3WG5V24","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1904.06449&json=true","fetch_graph":"https://pith.science/api/pith-number/M3WG5V24VN42QQQKNFWT7ANLLV/graph.json","fetch_events":"https://pith.science/api/pith-number/M3WG5V24VN42QQQKNFWT7ANLLV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/M3WG5V24VN42QQQKNFWT7ANLLV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/M3WG5V24VN42QQQKNFWT7ANLLV/action/storage_attestation","attest_author":"https://pith.science/pith/M3WG5V24VN42QQQKNFWT7ANLLV/action/author_attestation","sign_citation":"https://pith.science/pith/M3WG5V24VN42QQQKNFWT7ANLLV/action/citation_signature","submit_replication":"https://pith.science/pith/M3WG5V24VN42QQQKNFWT7ANLLV/action/replication_record"}},"created_at":"2026-07-05T01:20:04.447597+00:00","updated_at":"2026-07-05T01:20:04.447597+00:00"}