{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:U56AEFIAEQZWC7RL7I6LRKNEUS","short_pith_number":"pith:U56AEFIA","canonical_record":{"source":{"id":"1803.04051","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-03-11T22:00:33Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"8b14046f42edf03e09884d0f8ceb417d58d45ad9925d96751b5118224adc714f","abstract_canon_sha256":"07576043d762ea0be52b527fa9302978d086aae973c0eb307f9c95330fa28b49"},"schema_version":"1.0"},"canonical_sha256":"a77c0215002433617e2bfa3cb8a9a4a492f3956461a082289b95ea3ba66e789e","source":{"kind":"arxiv","id":"1803.04051","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1803.04051","created_at":"2026-05-18T00:20:46Z"},{"alias_kind":"arxiv_version","alias_value":"1803.04051v2","created_at":"2026-05-18T00:20:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.04051","created_at":"2026-05-18T00:20:46Z"},{"alias_kind":"pith_short_12","alias_value":"U56AEFIAEQZW","created_at":"2026-05-18T12:32:56Z"},{"alias_kind":"pith_short_16","alias_value":"U56AEFIAEQZWC7RL","created_at":"2026-05-18T12:32:56Z"},{"alias_kind":"pith_short_8","alias_value":"U56AEFIA","created_at":"2026-05-18T12:32:56Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:U56AEFIAEQZWC7RL7I6LRKNEUS","target":"record","payload":{"canonical_record":{"source":{"id":"1803.04051","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-03-11T22:00:33Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"8b14046f42edf03e09884d0f8ceb417d58d45ad9925d96751b5118224adc714f","abstract_canon_sha256":"07576043d762ea0be52b527fa9302978d086aae973c0eb307f9c95330fa28b49"},"schema_version":"1.0"},"canonical_sha256":"a77c0215002433617e2bfa3cb8a9a4a492f3956461a082289b95ea3ba66e789e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:20:46.185786Z","signature_b64":"P+zXtE0OTLa2XrIDltjN1RsCH8el3k9TEOJnsT6lGTIHBdbwAB0596yIgzFcSUnnUs27e4y3LmujnH3mKDVbCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a77c0215002433617e2bfa3cb8a9a4a492f3956461a082289b95ea3ba66e789e","last_reissued_at":"2026-05-18T00:20:46.185252Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:20:46.185252Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1803.04051","source_version":2,"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-05-18T00:20:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JaeCVlnvMWfS8RRY1vBEFZLA5s6Go/MhNKkGyXajhA/LN9mW5fMjtQ2h1GpgXKP+CQ5kAMYxhv2JJ0FTsiSlAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T06:05:33.242303Z"},"content_sha256":"2608b861ff4d74b4514f4efbfcb7a186eaeb51491f464108076d44643ac1c5ea","schema_version":"1.0","event_id":"sha256:2608b861ff4d74b4514f4efbfcb7a186eaeb51491f464108076d44643ac1c5ea"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:U56AEFIAEQZWC7RL7I6LRKNEUS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Representation Learning over Dynamic Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Hongyuan Zha, Mehrdad Farajtabar, Prasenjeet Biswal, Rakshit Trivedi","submitted_at":"2018-03-11T22:00:33Z","abstract_excerpt":"How can we effectively encode evolving information over dynamic graphs into low-dimensional representations? In this paper, we propose DyRep, an inductive deep representation learning framework that learns a set of functions to efficiently produce low-dimensional node embeddings that evolves over time. The learned embeddings drive the dynamics of two key processes namely, communication and association between nodes in dynamic graphs. These processes exhibit complex nonlinear dynamics that evolve at different time scales and subsequently contribute to the update of node embeddings. We employ a "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.04051","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":""},"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-05-18T00:20:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"itiheofPNNzS6Pizf/mcfyKlcLeCpyovCbTwYIpap4yl2aFVzldsgyi17rlKWWCSGG+7y5QWMtg9IN2PaKp4BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T06:05:33.242792Z"},"content_sha256":"c96dd682a10f7e043936828923e677157cc756a4a91d115a75c4aa15e0f7bae8","schema_version":"1.0","event_id":"sha256:c96dd682a10f7e043936828923e677157cc756a4a91d115a75c4aa15e0f7bae8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/U56AEFIAEQZWC7RL7I6LRKNEUS/bundle.json","state_url":"https://pith.science/pith/U56AEFIAEQZWC7RL7I6LRKNEUS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/U56AEFIAEQZWC7RL7I6LRKNEUS/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-06-24T06:05:33Z","links":{"resolver":"https://pith.science/pith/U56AEFIAEQZWC7RL7I6LRKNEUS","bundle":"https://pith.science/pith/U56AEFIAEQZWC7RL7I6LRKNEUS/bundle.json","state":"https://pith.science/pith/U56AEFIAEQZWC7RL7I6LRKNEUS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/U56AEFIAEQZWC7RL7I6LRKNEUS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:U56AEFIAEQZWC7RL7I6LRKNEUS","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":"07576043d762ea0be52b527fa9302978d086aae973c0eb307f9c95330fa28b49","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-03-11T22:00:33Z","title_canon_sha256":"8b14046f42edf03e09884d0f8ceb417d58d45ad9925d96751b5118224adc714f"},"schema_version":"1.0","source":{"id":"1803.04051","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1803.04051","created_at":"2026-05-18T00:20:46Z"},{"alias_kind":"arxiv_version","alias_value":"1803.04051v2","created_at":"2026-05-18T00:20:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.04051","created_at":"2026-05-18T00:20:46Z"},{"alias_kind":"pith_short_12","alias_value":"U56AEFIAEQZW","created_at":"2026-05-18T12:32:56Z"},{"alias_kind":"pith_short_16","alias_value":"U56AEFIAEQZWC7RL","created_at":"2026-05-18T12:32:56Z"},{"alias_kind":"pith_short_8","alias_value":"U56AEFIA","created_at":"2026-05-18T12:32:56Z"}],"graph_snapshots":[{"event_id":"sha256:c96dd682a10f7e043936828923e677157cc756a4a91d115a75c4aa15e0f7bae8","target":"graph","created_at":"2026-05-18T00:20:46Z","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"},"paper":{"abstract_excerpt":"How can we effectively encode evolving information over dynamic graphs into low-dimensional representations? In this paper, we propose DyRep, an inductive deep representation learning framework that learns a set of functions to efficiently produce low-dimensional node embeddings that evolves over time. The learned embeddings drive the dynamics of two key processes namely, communication and association between nodes in dynamic graphs. These processes exhibit complex nonlinear dynamics that evolve at different time scales and subsequently contribute to the update of node embeddings. We employ a ","authors_text":"Hongyuan Zha, Mehrdad Farajtabar, Prasenjeet Biswal, Rakshit Trivedi","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-03-11T22:00:33Z","title":"Representation Learning over Dynamic Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.04051","kind":"arxiv","version":2},"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:2608b861ff4d74b4514f4efbfcb7a186eaeb51491f464108076d44643ac1c5ea","target":"record","created_at":"2026-05-18T00:20:46Z","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":"07576043d762ea0be52b527fa9302978d086aae973c0eb307f9c95330fa28b49","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-03-11T22:00:33Z","title_canon_sha256":"8b14046f42edf03e09884d0f8ceb417d58d45ad9925d96751b5118224adc714f"},"schema_version":"1.0","source":{"id":"1803.04051","kind":"arxiv","version":2}},"canonical_sha256":"a77c0215002433617e2bfa3cb8a9a4a492f3956461a082289b95ea3ba66e789e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a77c0215002433617e2bfa3cb8a9a4a492f3956461a082289b95ea3ba66e789e","first_computed_at":"2026-05-18T00:20:46.185252Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:20:46.185252Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"P+zXtE0OTLa2XrIDltjN1RsCH8el3k9TEOJnsT6lGTIHBdbwAB0596yIgzFcSUnnUs27e4y3LmujnH3mKDVbCg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:20:46.185786Z","signed_message":"canonical_sha256_bytes"},"source_id":"1803.04051","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2608b861ff4d74b4514f4efbfcb7a186eaeb51491f464108076d44643ac1c5ea","sha256:c96dd682a10f7e043936828923e677157cc756a4a91d115a75c4aa15e0f7bae8"],"state_sha256":"db0cb419cf93d87b4a83f2bf91e2c39ecf261d5ef4ab35f1b93e9b99e2a2ee39"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Fb6gm/9YDXsEf7eXnA3ZdjNROZ3WjAh3RSSaCRYt8imgCEiocURfC71lHeZs2tr3TWo+nKpeiiKPi4G79zK0Cg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-24T06:05:33.245471Z","bundle_sha256":"1753e5b8b4e26835ed7a29b265e81c7fdd5faf5fba0d965f2223080697aa2eb6"}}