{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:E4A3EU7PORSHS22DU7EUOD5WKT","short_pith_number":"pith:E4A3EU7P","schema_version":"1.0","canonical_sha256":"2701b253ef7464796b43a7c9470fb654cc659fc678f57091dbf0154bcd78f530","source":{"kind":"arxiv","id":"1602.07745","version":1},"attestation_state":"computed","paper":{"title":"Interdependent Network Formation Games","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.GT"],"primary_cat":"cs.SI","authors_text":"Juntao Chen, Quanyan Zhu","submitted_at":"2016-02-24T23:02:30Z","abstract_excerpt":"Designing optimal interdependent networks is important for the robustness and efficiency of national critical infrastructures. Here, we establish a two-person game-theoretic model in which two network designers choose to maximize the global connectivity independently. This framework enables decentralized network design by using iterative algorithms. After a finite number of steps, the algorithm will converge to a Nash equilibrium, and yields the equilibrium topology of the network. We corroborate our results by using numerical experiments, and compare the Nash equilibrium solutions with their "},"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":"1602.07745","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2016-02-24T23:02:30Z","cross_cats_sorted":["cs.GT"],"title_canon_sha256":"8f98339cfff890607d0cacbedd8192c1a09d91f87198248cdc24346ddbbb32ea","abstract_canon_sha256":"2bc306375758cfcefd612511279b4f09d6946cddf1a76ddde8c7e206df3ba287"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:20:00.484501Z","signature_b64":"/E1+Omreb9wENVVvPeyyurhLRIojfNIJw740Tq14xzW1p6xCh9Eyqor/GmwbHa6qaA0KBw0nmlExERCoHWXNBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2701b253ef7464796b43a7c9470fb654cc659fc678f57091dbf0154bcd78f530","last_reissued_at":"2026-05-18T01:20:00.483765Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:20:00.483765Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Interdependent Network Formation Games","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.GT"],"primary_cat":"cs.SI","authors_text":"Juntao Chen, Quanyan Zhu","submitted_at":"2016-02-24T23:02:30Z","abstract_excerpt":"Designing optimal interdependent networks is important for the robustness and efficiency of national critical infrastructures. Here, we establish a two-person game-theoretic model in which two network designers choose to maximize the global connectivity independently. This framework enables decentralized network design by using iterative algorithms. After a finite number of steps, the algorithm will converge to a Nash equilibrium, and yields the equilibrium topology of the network. We corroborate our results by using numerical experiments, and compare the Nash equilibrium solutions with their "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.07745","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":"1602.07745","created_at":"2026-05-18T01:20:00.483888+00:00"},{"alias_kind":"arxiv_version","alias_value":"1602.07745v1","created_at":"2026-05-18T01:20:00.483888+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.07745","created_at":"2026-05-18T01:20:00.483888+00:00"},{"alias_kind":"pith_short_12","alias_value":"E4A3EU7PORSH","created_at":"2026-05-18T12:30:12.583610+00:00"},{"alias_kind":"pith_short_16","alias_value":"E4A3EU7PORSHS22D","created_at":"2026-05-18T12:30:12.583610+00:00"},{"alias_kind":"pith_short_8","alias_value":"E4A3EU7P","created_at":"2026-05-18T12:30:12.583610+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/E4A3EU7PORSHS22DU7EUOD5WKT","json":"https://pith.science/pith/E4A3EU7PORSHS22DU7EUOD5WKT.json","graph_json":"https://pith.science/api/pith-number/E4A3EU7PORSHS22DU7EUOD5WKT/graph.json","events_json":"https://pith.science/api/pith-number/E4A3EU7PORSHS22DU7EUOD5WKT/events.json","paper":"https://pith.science/paper/E4A3EU7P"},"agent_actions":{"view_html":"https://pith.science/pith/E4A3EU7PORSHS22DU7EUOD5WKT","download_json":"https://pith.science/pith/E4A3EU7PORSHS22DU7EUOD5WKT.json","view_paper":"https://pith.science/paper/E4A3EU7P","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1602.07745&json=true","fetch_graph":"https://pith.science/api/pith-number/E4A3EU7PORSHS22DU7EUOD5WKT/graph.json","fetch_events":"https://pith.science/api/pith-number/E4A3EU7PORSHS22DU7EUOD5WKT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/E4A3EU7PORSHS22DU7EUOD5WKT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/E4A3EU7PORSHS22DU7EUOD5WKT/action/storage_attestation","attest_author":"https://pith.science/pith/E4A3EU7PORSHS22DU7EUOD5WKT/action/author_attestation","sign_citation":"https://pith.science/pith/E4A3EU7PORSHS22DU7EUOD5WKT/action/citation_signature","submit_replication":"https://pith.science/pith/E4A3EU7PORSHS22DU7EUOD5WKT/action/replication_record"}},"created_at":"2026-05-18T01:20:00.483888+00:00","updated_at":"2026-05-18T01:20:00.483888+00:00"}