{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:25TXQIY2UXVATXLGS6KZ6P5NOR","short_pith_number":"pith:25TXQIY2","schema_version":"1.0","canonical_sha256":"d76778231aa5ea09dd6697959f3fad745baa584c1da1e19720880ab4e220f563","source":{"kind":"arxiv","id":"2101.05974","version":5},"attestation_state":"computed","paper":{"title":"Inductive Representation Learning in Temporal Networks via Causal Anonymous Walks","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.SI","stat.ML"],"primary_cat":"cs.LG","authors_text":"Jure Leskovec, Pan Li, Yanbang Wang, Yen-Yu Chang, Yunyu Liu","submitted_at":"2021-01-15T05:47:26Z","abstract_excerpt":"Temporal networks serve as abstractions of many real-world dynamic systems. These networks typically evolve according to certain laws, such as the law of triadic closure, which is universal in social networks. Inductive representation learning of temporal networks should be able to capture such laws and further be applied to systems that follow the same laws but have not been unseen during the training stage. Previous works in this area depend on either network node identities or rich edge attributes and typically fail to extract these laws. Here, we propose Causal Anonymous Walks (CAWs) to in"},"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":"2101.05974","kind":"arxiv","version":5},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2021-01-15T05:47:26Z","cross_cats_sorted":["cs.SI","stat.ML"],"title_canon_sha256":"f67af18b0953dcdb968d476ca051431472a40fa6f964d743122a75c4115009cc","abstract_canon_sha256":"252571ade331899746a22cabef293213c4f797acd44417208c168b8bc5a6112b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:12:07.551792Z","signature_b64":"ImIvHjENOfWiTvitldAeX3c+rmDtxqe2kyqFMZWnpmQcDdJejz4LxGZ/VkQtxLjLkoCEov1QExglDU6YLZvBBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d76778231aa5ea09dd6697959f3fad745baa584c1da1e19720880ab4e220f563","last_reissued_at":"2026-07-05T05:12:07.551282Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:12:07.551282Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Inductive Representation Learning in Temporal Networks via Causal Anonymous Walks","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.SI","stat.ML"],"primary_cat":"cs.LG","authors_text":"Jure Leskovec, Pan Li, Yanbang Wang, Yen-Yu Chang, Yunyu Liu","submitted_at":"2021-01-15T05:47:26Z","abstract_excerpt":"Temporal networks serve as abstractions of many real-world dynamic systems. These networks typically evolve according to certain laws, such as the law of triadic closure, which is universal in social networks. Inductive representation learning of temporal networks should be able to capture such laws and further be applied to systems that follow the same laws but have not been unseen during the training stage. Previous works in this area depend on either network node identities or rich edge attributes and typically fail to extract these laws. Here, we propose Causal Anonymous Walks (CAWs) to in"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2101.05974","kind":"arxiv","version":5},"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/2101.05974/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":"2101.05974","created_at":"2026-07-05T05:12:07.551374+00:00"},{"alias_kind":"arxiv_version","alias_value":"2101.05974v5","created_at":"2026-07-05T05:12:07.551374+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2101.05974","created_at":"2026-07-05T05:12:07.551374+00:00"},{"alias_kind":"pith_short_12","alias_value":"25TXQIY2UXVA","created_at":"2026-07-05T05:12:07.551374+00:00"},{"alias_kind":"pith_short_16","alias_value":"25TXQIY2UXVATXLG","created_at":"2026-07-05T05:12:07.551374+00:00"},{"alias_kind":"pith_short_8","alias_value":"25TXQIY2","created_at":"2026-07-05T05:12:07.551374+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2411.11259","citing_title":"Graph Retention Networks for Dynamic Graphs","ref_index":40,"is_internal_anchor":false},{"citing_arxiv_id":"2605.21916","citing_title":"A2QTGN: Adaptive Amplitude Quantum-Integrated Temporal Graph Network for Dynamic Link Prediction","ref_index":32,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/25TXQIY2UXVATXLGS6KZ6P5NOR","json":"https://pith.science/pith/25TXQIY2UXVATXLGS6KZ6P5NOR.json","graph_json":"https://pith.science/api/pith-number/25TXQIY2UXVATXLGS6KZ6P5NOR/graph.json","events_json":"https://pith.science/api/pith-number/25TXQIY2UXVATXLGS6KZ6P5NOR/events.json","paper":"https://pith.science/paper/25TXQIY2"},"agent_actions":{"view_html":"https://pith.science/pith/25TXQIY2UXVATXLGS6KZ6P5NOR","download_json":"https://pith.science/pith/25TXQIY2UXVATXLGS6KZ6P5NOR.json","view_paper":"https://pith.science/paper/25TXQIY2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2101.05974&json=true","fetch_graph":"https://pith.science/api/pith-number/25TXQIY2UXVATXLGS6KZ6P5NOR/graph.json","fetch_events":"https://pith.science/api/pith-number/25TXQIY2UXVATXLGS6KZ6P5NOR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/25TXQIY2UXVATXLGS6KZ6P5NOR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/25TXQIY2UXVATXLGS6KZ6P5NOR/action/storage_attestation","attest_author":"https://pith.science/pith/25TXQIY2UXVATXLGS6KZ6P5NOR/action/author_attestation","sign_citation":"https://pith.science/pith/25TXQIY2UXVATXLGS6KZ6P5NOR/action/citation_signature","submit_replication":"https://pith.science/pith/25TXQIY2UXVATXLGS6KZ6P5NOR/action/replication_record"}},"created_at":"2026-07-05T05:12:07.551374+00:00","updated_at":"2026-07-05T05:12:07.551374+00:00"}