{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:N7UPGHA4MCCMIC3S5T3Q7C75FT","short_pith_number":"pith:N7UPGHA4","schema_version":"1.0","canonical_sha256":"6fe8f31c1c6084c40b72ecf70f8bfd2cf8d4743b869d85e9f63ec0399695d1c8","source":{"kind":"arxiv","id":"1604.03221","version":1},"attestation_state":"computed","paper":{"title":"Leveraging Network Dynamics for Improved Link Prediction","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.SI","authors_text":"Alireza Hajibagheri, Gita Sukthankar, Kiran Lakkaraju","submitted_at":"2016-04-08T20:46:13Z","abstract_excerpt":"The aim of link prediction is to forecast connections that are most likely to occur in the future, based on examples of previously observed links. A key insight is that it is useful to explicitly model network dynamics, how frequently links are created or destroyed when doing link prediction. In this paper, we introduce a new supervised link prediction framework, RPM (Rate Prediction Model). In addition to network similarity measures, RPM uses the predicted rate of link modifications, modeled using time series data; it is implemented in Spark-ML and trained with the original link distribution,"},"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":"1604.03221","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2016-04-08T20:46:13Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"d582ac2e0aded9808e55c2b7a7b3cdd4c202332857c0379a33e890b2769dc96e","abstract_canon_sha256":"7b7ebe7096717ef80ff90ddc00b4151f341c16dc8660326ba410d57511077e6b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:17:16.087859Z","signature_b64":"WmWZHN8astRncxE7FlH+K6ZuyPdTdpF4rj9fDle40p2AVzo3RHQtVFf+dI2vi94glMqZwhoVltlPV/j4LecFDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6fe8f31c1c6084c40b72ecf70f8bfd2cf8d4743b869d85e9f63ec0399695d1c8","last_reissued_at":"2026-05-18T01:17:16.087098Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:17:16.087098Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Leveraging Network Dynamics for Improved Link Prediction","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.SI","authors_text":"Alireza Hajibagheri, Gita Sukthankar, Kiran Lakkaraju","submitted_at":"2016-04-08T20:46:13Z","abstract_excerpt":"The aim of link prediction is to forecast connections that are most likely to occur in the future, based on examples of previously observed links. A key insight is that it is useful to explicitly model network dynamics, how frequently links are created or destroyed when doing link prediction. In this paper, we introduce a new supervised link prediction framework, RPM (Rate Prediction Model). In addition to network similarity measures, RPM uses the predicted rate of link modifications, modeled using time series data; it is implemented in Spark-ML and trained with the original link distribution,"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.03221","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":""},"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":"1604.03221","created_at":"2026-05-18T01:17:16.087218+00:00"},{"alias_kind":"arxiv_version","alias_value":"1604.03221v1","created_at":"2026-05-18T01:17:16.087218+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.03221","created_at":"2026-05-18T01:17:16.087218+00:00"},{"alias_kind":"pith_short_12","alias_value":"N7UPGHA4MCCM","created_at":"2026-05-18T12:30:32.724797+00:00"},{"alias_kind":"pith_short_16","alias_value":"N7UPGHA4MCCMIC3S","created_at":"2026-05-18T12:30:32.724797+00:00"},{"alias_kind":"pith_short_8","alias_value":"N7UPGHA4","created_at":"2026-05-18T12:30:32.724797+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/N7UPGHA4MCCMIC3S5T3Q7C75FT","json":"https://pith.science/pith/N7UPGHA4MCCMIC3S5T3Q7C75FT.json","graph_json":"https://pith.science/api/pith-number/N7UPGHA4MCCMIC3S5T3Q7C75FT/graph.json","events_json":"https://pith.science/api/pith-number/N7UPGHA4MCCMIC3S5T3Q7C75FT/events.json","paper":"https://pith.science/paper/N7UPGHA4"},"agent_actions":{"view_html":"https://pith.science/pith/N7UPGHA4MCCMIC3S5T3Q7C75FT","download_json":"https://pith.science/pith/N7UPGHA4MCCMIC3S5T3Q7C75FT.json","view_paper":"https://pith.science/paper/N7UPGHA4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1604.03221&json=true","fetch_graph":"https://pith.science/api/pith-number/N7UPGHA4MCCMIC3S5T3Q7C75FT/graph.json","fetch_events":"https://pith.science/api/pith-number/N7UPGHA4MCCMIC3S5T3Q7C75FT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/N7UPGHA4MCCMIC3S5T3Q7C75FT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/N7UPGHA4MCCMIC3S5T3Q7C75FT/action/storage_attestation","attest_author":"https://pith.science/pith/N7UPGHA4MCCMIC3S5T3Q7C75FT/action/author_attestation","sign_citation":"https://pith.science/pith/N7UPGHA4MCCMIC3S5T3Q7C75FT/action/citation_signature","submit_replication":"https://pith.science/pith/N7UPGHA4MCCMIC3S5T3Q7C75FT/action/replication_record"}},"created_at":"2026-05-18T01:17:16.087218+00:00","updated_at":"2026-05-18T01:17:16.087218+00:00"}