{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:O7N6RTOUA4XHCLX5QFJL7BFMAU","short_pith_number":"pith:O7N6RTOU","schema_version":"1.0","canonical_sha256":"77dbe8cdd4072e712efd8152bf84ac05107aa1a79e91ce172781e469f6861a4a","source":{"kind":"arxiv","id":"1510.06785","version":1},"attestation_state":"computed","paper":{"title":"Maximizing Algebraic Connectivity in Interconnected Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"physics.soc-ph","authors_text":"Caterina Scoglio, Faryad Darabi Sahneh, Heman Shakeri, Nathan Albin, Pietro Poggi-Corradini","submitted_at":"2015-10-22T22:51:31Z","abstract_excerpt":"Algebraic connectivity, the second eigenvalue of the Laplacian matrix, is a measure of node and link connectivity on networks. When studying interconnected networks it is useful to consider a multiplex model, where the component networks operate together with inter-layer links among them. In order to have a well-connected multilayer structure, it is necessary to optimally design these inter-layer links considering realistic constraints. In this work, we solve the problem of finding an optimal weight distribution for one-to-one inter-layer links under budget constraint. We show that for the spe"},"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":"1510.06785","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"physics.soc-ph","submitted_at":"2015-10-22T22:51:31Z","cross_cats_sorted":[],"title_canon_sha256":"bb40013004dd70f96d5e825dcb32663eed231e758789ac04730f845713339d8a","abstract_canon_sha256":"ec3416b37ebb76341a7866dd36f728bdbc9a0d42e290b876d636a83bdb642127"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:18:09.221882Z","signature_b64":"MDZDOp3gy2E/LNTwfha0BZ6WK6EPD3OvOCK1rId/3FAKO7pBrC59GUEgHHEta9MCmCAAm6SlYu1eUt4b+OebBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"77dbe8cdd4072e712efd8152bf84ac05107aa1a79e91ce172781e469f6861a4a","last_reissued_at":"2026-05-18T01:18:09.221288Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:18:09.221288Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Maximizing Algebraic Connectivity in Interconnected Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"physics.soc-ph","authors_text":"Caterina Scoglio, Faryad Darabi Sahneh, Heman Shakeri, Nathan Albin, Pietro Poggi-Corradini","submitted_at":"2015-10-22T22:51:31Z","abstract_excerpt":"Algebraic connectivity, the second eigenvalue of the Laplacian matrix, is a measure of node and link connectivity on networks. When studying interconnected networks it is useful to consider a multiplex model, where the component networks operate together with inter-layer links among them. In order to have a well-connected multilayer structure, it is necessary to optimally design these inter-layer links considering realistic constraints. In this work, we solve the problem of finding an optimal weight distribution for one-to-one inter-layer links under budget constraint. We show that for the spe"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1510.06785","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":"1510.06785","created_at":"2026-05-18T01:18:09.221388+00:00"},{"alias_kind":"arxiv_version","alias_value":"1510.06785v1","created_at":"2026-05-18T01:18:09.221388+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.06785","created_at":"2026-05-18T01:18:09.221388+00:00"},{"alias_kind":"pith_short_12","alias_value":"O7N6RTOUA4XH","created_at":"2026-05-18T12:29:34.919912+00:00"},{"alias_kind":"pith_short_16","alias_value":"O7N6RTOUA4XHCLX5","created_at":"2026-05-18T12:29:34.919912+00:00"},{"alias_kind":"pith_short_8","alias_value":"O7N6RTOU","created_at":"2026-05-18T12:29:34.919912+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/O7N6RTOUA4XHCLX5QFJL7BFMAU","json":"https://pith.science/pith/O7N6RTOUA4XHCLX5QFJL7BFMAU.json","graph_json":"https://pith.science/api/pith-number/O7N6RTOUA4XHCLX5QFJL7BFMAU/graph.json","events_json":"https://pith.science/api/pith-number/O7N6RTOUA4XHCLX5QFJL7BFMAU/events.json","paper":"https://pith.science/paper/O7N6RTOU"},"agent_actions":{"view_html":"https://pith.science/pith/O7N6RTOUA4XHCLX5QFJL7BFMAU","download_json":"https://pith.science/pith/O7N6RTOUA4XHCLX5QFJL7BFMAU.json","view_paper":"https://pith.science/paper/O7N6RTOU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1510.06785&json=true","fetch_graph":"https://pith.science/api/pith-number/O7N6RTOUA4XHCLX5QFJL7BFMAU/graph.json","fetch_events":"https://pith.science/api/pith-number/O7N6RTOUA4XHCLX5QFJL7BFMAU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/O7N6RTOUA4XHCLX5QFJL7BFMAU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/O7N6RTOUA4XHCLX5QFJL7BFMAU/action/storage_attestation","attest_author":"https://pith.science/pith/O7N6RTOUA4XHCLX5QFJL7BFMAU/action/author_attestation","sign_citation":"https://pith.science/pith/O7N6RTOUA4XHCLX5QFJL7BFMAU/action/citation_signature","submit_replication":"https://pith.science/pith/O7N6RTOUA4XHCLX5QFJL7BFMAU/action/replication_record"}},"created_at":"2026-05-18T01:18:09.221388+00:00","updated_at":"2026-05-18T01:18:09.221388+00:00"}