{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:IYOAI7UJLLRTAFFABUI67BCL2W","short_pith_number":"pith:IYOAI7UJ","schema_version":"1.0","canonical_sha256":"461c047e895ae33014a00d11ef844bd58b9c3f22c7c3ca26845a045d4bd8f396","source":{"kind":"arxiv","id":"1605.06821","version":2},"attestation_state":"computed","paper":{"title":"The Game-Theoretic Formation of Interconnections Between Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SI"],"primary_cat":"cs.GT","authors_text":"Ebrahim Moradi Shahrivar, Shreyas Sundaram","submitted_at":"2016-05-22T17:10:06Z","abstract_excerpt":"We introduce a network design game where the objective of the players is to design the interconnections between the nodes of two different networks $G_1$ and $G_2$ in order to maximize certain local utility functions. In this setting, each player is associated with a node in $G_1$ and has functional dependencies on certain nodes in $G_2$. We use a distance-based utility for the players in which the goal of each player is to purchase a set of edges (incident to its associated node) such that the sum of the distances between its associated node and the nodes it depends on in $G_2$ is minimized. "},"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":"1605.06821","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2016-05-22T17:10:06Z","cross_cats_sorted":["cs.SI"],"title_canon_sha256":"3649df98b8b47dff194a5433028b6399bf877f06baed5a353ffd7dee758d52a2","abstract_canon_sha256":"7c97c96ce9510902e95fe759556c1b6eb2a43d77e1b79377b2ea943141b149a2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:54:15.605303Z","signature_b64":"aLeZ9dNsFMF0LTvJmXVppajrc6QlknntuPD72VNO14n+tlpQRqJpKcMaLmxf1cwNl1jgjcTgUbo7ekAPNigRBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"461c047e895ae33014a00d11ef844bd58b9c3f22c7c3ca26845a045d4bd8f396","last_reissued_at":"2026-05-18T00:54:15.604807Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:54:15.604807Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Game-Theoretic Formation of Interconnections Between Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SI"],"primary_cat":"cs.GT","authors_text":"Ebrahim Moradi Shahrivar, Shreyas Sundaram","submitted_at":"2016-05-22T17:10:06Z","abstract_excerpt":"We introduce a network design game where the objective of the players is to design the interconnections between the nodes of two different networks $G_1$ and $G_2$ in order to maximize certain local utility functions. In this setting, each player is associated with a node in $G_1$ and has functional dependencies on certain nodes in $G_2$. We use a distance-based utility for the players in which the goal of each player is to purchase a set of edges (incident to its associated node) such that the sum of the distances between its associated node and the nodes it depends on in $G_2$ is minimized. "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.06821","kind":"arxiv","version":2},"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":"1605.06821","created_at":"2026-05-18T00:54:15.604884+00:00"},{"alias_kind":"arxiv_version","alias_value":"1605.06821v2","created_at":"2026-05-18T00:54:15.604884+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.06821","created_at":"2026-05-18T00:54:15.604884+00:00"},{"alias_kind":"pith_short_12","alias_value":"IYOAI7UJLLRT","created_at":"2026-05-18T12:30:22.444734+00:00"},{"alias_kind":"pith_short_16","alias_value":"IYOAI7UJLLRTAFFA","created_at":"2026-05-18T12:30:22.444734+00:00"},{"alias_kind":"pith_short_8","alias_value":"IYOAI7UJ","created_at":"2026-05-18T12:30:22.444734+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/IYOAI7UJLLRTAFFABUI67BCL2W","json":"https://pith.science/pith/IYOAI7UJLLRTAFFABUI67BCL2W.json","graph_json":"https://pith.science/api/pith-number/IYOAI7UJLLRTAFFABUI67BCL2W/graph.json","events_json":"https://pith.science/api/pith-number/IYOAI7UJLLRTAFFABUI67BCL2W/events.json","paper":"https://pith.science/paper/IYOAI7UJ"},"agent_actions":{"view_html":"https://pith.science/pith/IYOAI7UJLLRTAFFABUI67BCL2W","download_json":"https://pith.science/pith/IYOAI7UJLLRTAFFABUI67BCL2W.json","view_paper":"https://pith.science/paper/IYOAI7UJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1605.06821&json=true","fetch_graph":"https://pith.science/api/pith-number/IYOAI7UJLLRTAFFABUI67BCL2W/graph.json","fetch_events":"https://pith.science/api/pith-number/IYOAI7UJLLRTAFFABUI67BCL2W/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IYOAI7UJLLRTAFFABUI67BCL2W/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IYOAI7UJLLRTAFFABUI67BCL2W/action/storage_attestation","attest_author":"https://pith.science/pith/IYOAI7UJLLRTAFFABUI67BCL2W/action/author_attestation","sign_citation":"https://pith.science/pith/IYOAI7UJLLRTAFFABUI67BCL2W/action/citation_signature","submit_replication":"https://pith.science/pith/IYOAI7UJLLRTAFFABUI67BCL2W/action/replication_record"}},"created_at":"2026-05-18T00:54:15.604884+00:00","updated_at":"2026-05-18T00:54:15.604884+00:00"}