{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:PXZFHJYP3WL6JBBTH6JTNXHSET","short_pith_number":"pith:PXZFHJYP","schema_version":"1.0","canonical_sha256":"7df253a70fdd97e484333f9336dcf224c06c45399f1fe7e67da4dee7074290ba","source":{"kind":"arxiv","id":"2503.14641","version":1},"attestation_state":"computed","paper":{"title":"Link Prediction and Navigability of Multiplex Energy Networks","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.SY","eess.SY"],"primary_cat":"cs.SI","authors_text":"Chau Le, Harun Pirim, Muhammad Kazim, Om Prakash Yadav, Trung Le","submitted_at":"2025-03-18T18:41:41Z","abstract_excerpt":"In modern energy networks, where operational efficiency and resilience are critical, this study introduces an in-depth analysis from a multiplex network perspective - defined as a network where multiple types of connections exist between the same set of nodes. Utilizing Belgium's electricity and gas networks, we construct a five-layer multiplex network to simulate random node shutdown scenarios. We tailored the Jaccard and Adamic-Adar link prediction algorithms by integrating the concept of exclusive neighbors, thereby enhancing prediction accuracy with such multi-layered information. Emphasiz"},"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":"2503.14641","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.SI","submitted_at":"2025-03-18T18:41:41Z","cross_cats_sorted":["cs.SY","eess.SY"],"title_canon_sha256":"1c56256b37ede96e26fd66b717d35b83a91e1b8d154751008d041d1a496642ac","abstract_canon_sha256":"df14caea70a763c8bf19b5d7a21a061b6c33d1810add6be57e203fd2a6161f10"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:34:21.759438Z","signature_b64":"Bku8y1VK3obQqYMebiRkfRL4qI3Ou3TV1Zz8KcsSLHcbud4wn+NLyVM4wLKZnTcVMGLyQR/3UNfktr4alrLMDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7df253a70fdd97e484333f9336dcf224c06c45399f1fe7e67da4dee7074290ba","last_reissued_at":"2026-07-05T10:34:21.758944Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:34:21.758944Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Link Prediction and Navigability of Multiplex Energy Networks","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.SY","eess.SY"],"primary_cat":"cs.SI","authors_text":"Chau Le, Harun Pirim, Muhammad Kazim, Om Prakash Yadav, Trung Le","submitted_at":"2025-03-18T18:41:41Z","abstract_excerpt":"In modern energy networks, where operational efficiency and resilience are critical, this study introduces an in-depth analysis from a multiplex network perspective - defined as a network where multiple types of connections exist between the same set of nodes. Utilizing Belgium's electricity and gas networks, we construct a five-layer multiplex network to simulate random node shutdown scenarios. We tailored the Jaccard and Adamic-Adar link prediction algorithms by integrating the concept of exclusive neighbors, thereby enhancing prediction accuracy with such multi-layered information. Emphasiz"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2503.14641","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/2503.14641/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":"2503.14641","created_at":"2026-07-05T10:34:21.758999+00:00"},{"alias_kind":"arxiv_version","alias_value":"2503.14641v1","created_at":"2026-07-05T10:34:21.758999+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2503.14641","created_at":"2026-07-05T10:34:21.758999+00:00"},{"alias_kind":"pith_short_12","alias_value":"PXZFHJYP3WL6","created_at":"2026-07-05T10:34:21.758999+00:00"},{"alias_kind":"pith_short_16","alias_value":"PXZFHJYP3WL6JBBT","created_at":"2026-07-05T10:34:21.758999+00:00"},{"alias_kind":"pith_short_8","alias_value":"PXZFHJYP","created_at":"2026-07-05T10:34:21.758999+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2507.07298","citing_title":"Multilayer GNN for Predictive Maintenance and Clustering in Power Grids","ref_index":13,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/PXZFHJYP3WL6JBBTH6JTNXHSET","json":"https://pith.science/pith/PXZFHJYP3WL6JBBTH6JTNXHSET.json","graph_json":"https://pith.science/api/pith-number/PXZFHJYP3WL6JBBTH6JTNXHSET/graph.json","events_json":"https://pith.science/api/pith-number/PXZFHJYP3WL6JBBTH6JTNXHSET/events.json","paper":"https://pith.science/paper/PXZFHJYP"},"agent_actions":{"view_html":"https://pith.science/pith/PXZFHJYP3WL6JBBTH6JTNXHSET","download_json":"https://pith.science/pith/PXZFHJYP3WL6JBBTH6JTNXHSET.json","view_paper":"https://pith.science/paper/PXZFHJYP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2503.14641&json=true","fetch_graph":"https://pith.science/api/pith-number/PXZFHJYP3WL6JBBTH6JTNXHSET/graph.json","fetch_events":"https://pith.science/api/pith-number/PXZFHJYP3WL6JBBTH6JTNXHSET/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PXZFHJYP3WL6JBBTH6JTNXHSET/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PXZFHJYP3WL6JBBTH6JTNXHSET/action/storage_attestation","attest_author":"https://pith.science/pith/PXZFHJYP3WL6JBBTH6JTNXHSET/action/author_attestation","sign_citation":"https://pith.science/pith/PXZFHJYP3WL6JBBTH6JTNXHSET/action/citation_signature","submit_replication":"https://pith.science/pith/PXZFHJYP3WL6JBBTH6JTNXHSET/action/replication_record"}},"created_at":"2026-07-05T10:34:21.758999+00:00","updated_at":"2026-07-05T10:34:21.758999+00:00"}