{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:GDGPNABDDEPPNU3NW3KEM5ZHPV","short_pith_number":"pith:GDGPNABD","schema_version":"1.0","canonical_sha256":"30ccf68023191ef6d36db6d44677277d583d41333914a3c9ba9af6c317faf7ec","source":{"kind":"arxiv","id":"2401.07516","version":1},"attestation_state":"computed","paper":{"title":"Temporal Link Prediction Using Graph Embedding Dynamics","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SI"],"primary_cat":"cs.LG","authors_text":"Mohammad Ghassemi, Sanaz Hasanzadeh Fard","submitted_at":"2024-01-15T07:35:29Z","abstract_excerpt":"Graphs are a powerful representation tool in machine learning applications, with link prediction being a key task in graph learning. Temporal link prediction in dynamic networks is of particular interest due to its potential for solving complex scientific and real-world problems. Traditional approaches to temporal link prediction have focused on finding the aggregation of dynamics of the network as a unified output. In this study, we propose a novel perspective on temporal link prediction by defining nodes as Newtonian objects and incorporating the concept of velocity to predict network dynami"},"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":"2401.07516","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2024-01-15T07:35:29Z","cross_cats_sorted":["cs.SI"],"title_canon_sha256":"42173561d9cbdc80b8e9c9c61ee6447f2a6aebcc8603523ce9c9a7a6054501e7","abstract_canon_sha256":"27f17c63c06f8a63309da756d954840e073bf3b682495f11f974fc451149d69a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:33:38.191450Z","signature_b64":"+bCj4dJZHPgSBaCzq92h8i8329vRFa+RJsimE2rGmR3Ybj36biwwo20sXLTcnrNeu7PdNopeLJ2k0/COPtclDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"30ccf68023191ef6d36db6d44677277d583d41333914a3c9ba9af6c317faf7ec","last_reissued_at":"2026-07-05T07:33:38.191013Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:33:38.191013Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Temporal Link Prediction Using Graph Embedding Dynamics","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SI"],"primary_cat":"cs.LG","authors_text":"Mohammad Ghassemi, Sanaz Hasanzadeh Fard","submitted_at":"2024-01-15T07:35:29Z","abstract_excerpt":"Graphs are a powerful representation tool in machine learning applications, with link prediction being a key task in graph learning. Temporal link prediction in dynamic networks is of particular interest due to its potential for solving complex scientific and real-world problems. Traditional approaches to temporal link prediction have focused on finding the aggregation of dynamics of the network as a unified output. In this study, we propose a novel perspective on temporal link prediction by defining nodes as Newtonian objects and incorporating the concept of velocity to predict network dynami"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2401.07516","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/2401.07516/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":"2401.07516","created_at":"2026-07-05T07:33:38.191070+00:00"},{"alias_kind":"arxiv_version","alias_value":"2401.07516v1","created_at":"2026-07-05T07:33:38.191070+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2401.07516","created_at":"2026-07-05T07:33:38.191070+00:00"},{"alias_kind":"pith_short_12","alias_value":"GDGPNABDDEPP","created_at":"2026-07-05T07:33:38.191070+00:00"},{"alias_kind":"pith_short_16","alias_value":"GDGPNABDDEPPNU3N","created_at":"2026-07-05T07:33:38.191070+00:00"},{"alias_kind":"pith_short_8","alias_value":"GDGPNABD","created_at":"2026-07-05T07:33:38.191070+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2507.05317","citing_title":"PWD: Prior-Guided and Wavelet-Enhanced Diffusion Model for Limited-Angle CT","ref_index":20,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/GDGPNABDDEPPNU3NW3KEM5ZHPV","json":"https://pith.science/pith/GDGPNABDDEPPNU3NW3KEM5ZHPV.json","graph_json":"https://pith.science/api/pith-number/GDGPNABDDEPPNU3NW3KEM5ZHPV/graph.json","events_json":"https://pith.science/api/pith-number/GDGPNABDDEPPNU3NW3KEM5ZHPV/events.json","paper":"https://pith.science/paper/GDGPNABD"},"agent_actions":{"view_html":"https://pith.science/pith/GDGPNABDDEPPNU3NW3KEM5ZHPV","download_json":"https://pith.science/pith/GDGPNABDDEPPNU3NW3KEM5ZHPV.json","view_paper":"https://pith.science/paper/GDGPNABD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2401.07516&json=true","fetch_graph":"https://pith.science/api/pith-number/GDGPNABDDEPPNU3NW3KEM5ZHPV/graph.json","fetch_events":"https://pith.science/api/pith-number/GDGPNABDDEPPNU3NW3KEM5ZHPV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GDGPNABDDEPPNU3NW3KEM5ZHPV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GDGPNABDDEPPNU3NW3KEM5ZHPV/action/storage_attestation","attest_author":"https://pith.science/pith/GDGPNABDDEPPNU3NW3KEM5ZHPV/action/author_attestation","sign_citation":"https://pith.science/pith/GDGPNABDDEPPNU3NW3KEM5ZHPV/action/citation_signature","submit_replication":"https://pith.science/pith/GDGPNABDDEPPNU3NW3KEM5ZHPV/action/replication_record"}},"created_at":"2026-07-05T07:33:38.191070+00:00","updated_at":"2026-07-05T07:33:38.191070+00:00"}