{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:GLLBYKABULVS3FJKA4WEUFTYTK","short_pith_number":"pith:GLLBYKAB","schema_version":"1.0","canonical_sha256":"32d61c2801a2eb2d952a072c4a16789abf137785870c98db31392b8554f19d1b","source":{"kind":"arxiv","id":"2004.04704","version":1},"attestation_state":"computed","paper":{"title":"Heuristics for Link Prediction in Multiplex Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SI","stat.ML"],"primary_cat":"cs.LG","authors_text":"Jiahao Chen, Manuela Veloso, Prashant Reddy, Robert E. Tillman, Vamsi K. Potluru","submitted_at":"2020-04-09T17:36:18Z","abstract_excerpt":"Link prediction, or the inference of future or missing connections between entities, is a well-studied problem in network analysis. A multitude of heuristics exist for link prediction in ordinary networks with a single type of connection. However, link prediction in multiplex networks, or networks with multiple types of connections, is not a well understood problem. We propose a novel general framework and three families of heuristics for multiplex network link prediction that are simple, interpretable, and take advantage of the rich connection type correlation structure that exists in many re"},"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":"2004.04704","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-04-09T17:36:18Z","cross_cats_sorted":["cs.SI","stat.ML"],"title_canon_sha256":"1bd18318754910fa4773d858a4d18f99112eb7450f8a6f4284d1d0b3d9d8a928","abstract_canon_sha256":"1ed23d5b34f686d79ef0edecedba7b21e59bcc4b672f44d6f2b95ecd2d5db6f7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:54:10.576867Z","signature_b64":"ZOGHH/eS9sNTM8RbgjNiHwi6HtSzTph0Iib7RvBg1fkjC961tQfXCzJULd2X79JJ6FzzZ7HRqCMgFjSeetU/Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"32d61c2801a2eb2d952a072c4a16789abf137785870c98db31392b8554f19d1b","last_reissued_at":"2026-07-05T00:54:10.576484Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:54:10.576484Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Heuristics for Link Prediction in Multiplex Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SI","stat.ML"],"primary_cat":"cs.LG","authors_text":"Jiahao Chen, Manuela Veloso, Prashant Reddy, Robert E. Tillman, Vamsi K. Potluru","submitted_at":"2020-04-09T17:36:18Z","abstract_excerpt":"Link prediction, or the inference of future or missing connections between entities, is a well-studied problem in network analysis. A multitude of heuristics exist for link prediction in ordinary networks with a single type of connection. However, link prediction in multiplex networks, or networks with multiple types of connections, is not a well understood problem. We propose a novel general framework and three families of heuristics for multiplex network link prediction that are simple, interpretable, and take advantage of the rich connection type correlation structure that exists in many re"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2004.04704","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/2004.04704/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":"2004.04704","created_at":"2026-07-05T00:54:10.576545+00:00"},{"alias_kind":"arxiv_version","alias_value":"2004.04704v1","created_at":"2026-07-05T00:54:10.576545+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2004.04704","created_at":"2026-07-05T00:54:10.576545+00:00"},{"alias_kind":"pith_short_12","alias_value":"GLLBYKABULVS","created_at":"2026-07-05T00:54:10.576545+00:00"},{"alias_kind":"pith_short_16","alias_value":"GLLBYKABULVS3FJK","created_at":"2026-07-05T00:54:10.576545+00:00"},{"alias_kind":"pith_short_8","alias_value":"GLLBYKAB","created_at":"2026-07-05T00:54:10.576545+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"1908.03875","citing_title":"Inference of Edge Correlations in Multilayer Networks","ref_index":82,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/GLLBYKABULVS3FJKA4WEUFTYTK","json":"https://pith.science/pith/GLLBYKABULVS3FJKA4WEUFTYTK.json","graph_json":"https://pith.science/api/pith-number/GLLBYKABULVS3FJKA4WEUFTYTK/graph.json","events_json":"https://pith.science/api/pith-number/GLLBYKABULVS3FJKA4WEUFTYTK/events.json","paper":"https://pith.science/paper/GLLBYKAB"},"agent_actions":{"view_html":"https://pith.science/pith/GLLBYKABULVS3FJKA4WEUFTYTK","download_json":"https://pith.science/pith/GLLBYKABULVS3FJKA4WEUFTYTK.json","view_paper":"https://pith.science/paper/GLLBYKAB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2004.04704&json=true","fetch_graph":"https://pith.science/api/pith-number/GLLBYKABULVS3FJKA4WEUFTYTK/graph.json","fetch_events":"https://pith.science/api/pith-number/GLLBYKABULVS3FJKA4WEUFTYTK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GLLBYKABULVS3FJKA4WEUFTYTK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GLLBYKABULVS3FJKA4WEUFTYTK/action/storage_attestation","attest_author":"https://pith.science/pith/GLLBYKABULVS3FJKA4WEUFTYTK/action/author_attestation","sign_citation":"https://pith.science/pith/GLLBYKABULVS3FJKA4WEUFTYTK/action/citation_signature","submit_replication":"https://pith.science/pith/GLLBYKABULVS3FJKA4WEUFTYTK/action/replication_record"}},"created_at":"2026-07-05T00:54:10.576545+00:00","updated_at":"2026-07-05T00:54:10.576545+00:00"}