{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:4VIRWLIUBR5MPX7ZLMOVQVHM7P","short_pith_number":"pith:4VIRWLIU","schema_version":"1.0","canonical_sha256":"e5511b2d140c7ac7dff95b1d5854ecfbc2b649829ef012d7a0ccd27af0c27994","source":{"kind":"arxiv","id":"1906.04548","version":1},"attestation_state":"computed","paper":{"title":"Spring-Electrical Models For Link Prediction","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"cs.SI","authors_text":"Akmal Artikov, Egor Samosvat, Yana Kashinskaya","submitted_at":"2019-05-24T13:47:44Z","abstract_excerpt":"We propose a link prediction algorithm that is based on spring-electrical models. The idea to study these models came from the fact that spring-electrical models have been successfully used for networks visualization. A good network visualization usually implies that nodes similar in terms of network topology, e.g., connected and/or belonging to one cluster, tend to be visualized close to each other. Therefore, we assumed that the Euclidean distance between nodes in the obtained network layout correlates with a probability of a link between them. We evaluate the proposed method against several"},"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":"1906.04548","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2019-05-24T13:47:44Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"a6dc6351a158ec3c6ad8f7eaa77110e76cb77b88a70efc878ec8f8c8bb11f588","abstract_canon_sha256":"c22baea37b795c314169a754a64f05213f4b32c008b9a6782b041c0f77a8b57c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:43:38.952432Z","signature_b64":"TeXHi/TEMnUqrdaIkr/St4qB1nTNyp+RCw1icH3WupW5q+/3Rb987+B+g9XXM5Pyhbg/VB/Xma4FTbSkNVqkCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e5511b2d140c7ac7dff95b1d5854ecfbc2b649829ef012d7a0ccd27af0c27994","last_reissued_at":"2026-05-17T23:43:38.951760Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:43:38.951760Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Spring-Electrical Models For Link Prediction","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"cs.SI","authors_text":"Akmal Artikov, Egor Samosvat, Yana Kashinskaya","submitted_at":"2019-05-24T13:47:44Z","abstract_excerpt":"We propose a link prediction algorithm that is based on spring-electrical models. The idea to study these models came from the fact that spring-electrical models have been successfully used for networks visualization. A good network visualization usually implies that nodes similar in terms of network topology, e.g., connected and/or belonging to one cluster, tend to be visualized close to each other. Therefore, we assumed that the Euclidean distance between nodes in the obtained network layout correlates with a probability of a link between them. We evaluate the proposed method against several"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.04548","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":"1906.04548","created_at":"2026-05-17T23:43:38.951865+00:00"},{"alias_kind":"arxiv_version","alias_value":"1906.04548v1","created_at":"2026-05-17T23:43:38.951865+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.04548","created_at":"2026-05-17T23:43:38.951865+00:00"},{"alias_kind":"pith_short_12","alias_value":"4VIRWLIUBR5M","created_at":"2026-05-18T12:33:10.108867+00:00"},{"alias_kind":"pith_short_16","alias_value":"4VIRWLIUBR5MPX7Z","created_at":"2026-05-18T12:33:10.108867+00:00"},{"alias_kind":"pith_short_8","alias_value":"4VIRWLIU","created_at":"2026-05-18T12:33:10.108867+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/4VIRWLIUBR5MPX7ZLMOVQVHM7P","json":"https://pith.science/pith/4VIRWLIUBR5MPX7ZLMOVQVHM7P.json","graph_json":"https://pith.science/api/pith-number/4VIRWLIUBR5MPX7ZLMOVQVHM7P/graph.json","events_json":"https://pith.science/api/pith-number/4VIRWLIUBR5MPX7ZLMOVQVHM7P/events.json","paper":"https://pith.science/paper/4VIRWLIU"},"agent_actions":{"view_html":"https://pith.science/pith/4VIRWLIUBR5MPX7ZLMOVQVHM7P","download_json":"https://pith.science/pith/4VIRWLIUBR5MPX7ZLMOVQVHM7P.json","view_paper":"https://pith.science/paper/4VIRWLIU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1906.04548&json=true","fetch_graph":"https://pith.science/api/pith-number/4VIRWLIUBR5MPX7ZLMOVQVHM7P/graph.json","fetch_events":"https://pith.science/api/pith-number/4VIRWLIUBR5MPX7ZLMOVQVHM7P/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4VIRWLIUBR5MPX7ZLMOVQVHM7P/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4VIRWLIUBR5MPX7ZLMOVQVHM7P/action/storage_attestation","attest_author":"https://pith.science/pith/4VIRWLIUBR5MPX7ZLMOVQVHM7P/action/author_attestation","sign_citation":"https://pith.science/pith/4VIRWLIUBR5MPX7ZLMOVQVHM7P/action/citation_signature","submit_replication":"https://pith.science/pith/4VIRWLIUBR5MPX7ZLMOVQVHM7P/action/replication_record"}},"created_at":"2026-05-17T23:43:38.951865+00:00","updated_at":"2026-05-17T23:43:38.951865+00:00"}