{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:DQUCECQYS2OBRDCOEBFI3ZOPHP","short_pith_number":"pith:DQUCECQY","canonical_record":{"source":{"id":"1708.05908","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2017-08-19T22:48:39Z","cross_cats_sorted":["cs.NI","cs.SY"],"title_canon_sha256":"8151580cceb474313685f3c7b1a1ef01dfb679f4ec4a2c487a8aeadc8d94d66b","abstract_canon_sha256":"a73982877225b36b3d1e4ca6c55339073fb046da32e835be0aa2e35c631c07c1"},"schema_version":"1.0"},"canonical_sha256":"1c28220a18969c188c4e204a8de5cf3bee93c25e7ace154896c1a47f268e3b1a","source":{"kind":"arxiv","id":"1708.05908","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.05908","created_at":"2026-05-18T00:33:58Z"},{"alias_kind":"arxiv_version","alias_value":"1708.05908v3","created_at":"2026-05-18T00:33:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.05908","created_at":"2026-05-18T00:33:58Z"},{"alias_kind":"pith_short_12","alias_value":"DQUCECQYS2OB","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_16","alias_value":"DQUCECQYS2OBRDCO","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_8","alias_value":"DQUCECQY","created_at":"2026-05-18T12:31:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:DQUCECQYS2OBRDCOEBFI3ZOPHP","target":"record","payload":{"canonical_record":{"source":{"id":"1708.05908","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2017-08-19T22:48:39Z","cross_cats_sorted":["cs.NI","cs.SY"],"title_canon_sha256":"8151580cceb474313685f3c7b1a1ef01dfb679f4ec4a2c487a8aeadc8d94d66b","abstract_canon_sha256":"a73982877225b36b3d1e4ca6c55339073fb046da32e835be0aa2e35c631c07c1"},"schema_version":"1.0"},"canonical_sha256":"1c28220a18969c188c4e204a8de5cf3bee93c25e7ace154896c1a47f268e3b1a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:33:58.610711Z","signature_b64":"6r2qmNaxtHDSctkQCNWnWXx4Ze0LC/eTXw+wfcYPUPFnI01BdjV7EU8TW3j9rN8lhEFtoCVIF2c+/uwhMboTBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1c28220a18969c188c4e204a8de5cf3bee93c25e7ace154896c1a47f268e3b1a","last_reissued_at":"2026-05-18T00:33:58.610076Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:33:58.610076Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1708.05908","source_version":3,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:33:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XRt61SOdOdm91CXZDUwlUunR0HOrrKfv+SOv8g5+Gt9P5CkbJEMjMqh2lpNuhNZafCGp2CC8v4SVcRPmSzlMCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T00:04:02.459309Z"},"content_sha256":"ad8206d7986e4cf6b3c9f624ded5c75e8af346df7c6e55f1337db8d31ef78e2a","schema_version":"1.0","event_id":"sha256:ad8206d7986e4cf6b3c9f624ded5c75e8af346df7c6e55f1337db8d31ef78e2a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:DQUCECQYS2OBRDCOEBFI3ZOPHP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Designing virus-resistant, high-performance networks: a game-formation approach","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NI","cs.SY"],"primary_cat":"cs.GT","authors_text":"Eitan Altman, Fernando A. Kuipers, Piet Van Mieghem, Stojan Trajanovski, Yezekael Hayel","submitted_at":"2017-08-19T22:48:39Z","abstract_excerpt":"Designing an optimal network topology while balancing multiple, possibly conflicting objectives like cost, performance, and resiliency to viruses is a challenging endeavor, let alone in the case of decentralized network formation. We therefore propose a game-formation technique where each player aims to minimize its cost in installing links, the probability of being infected by a virus and the sum of hopcounts on its shortest paths to all other nodes.\n  In this article, we (1) determine the Nash Equilibria and the Price of Anarchy for our novel network formation game, (2) demonstrate that the "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.05908","kind":"arxiv","version":3},"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:33:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FIrSVOs45+myKKCc0kCtuw15J+72H2HoLooDNpJU3k4rL3DdXgNSGNjF3zN3mbfi25DNreS6INEzcHZGzYfcDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T00:04:02.459853Z"},"content_sha256":"c219031addef0e207e90e329d8a19de6c3cba8cb294facc3b82f71bfdf5f6b35","schema_version":"1.0","event_id":"sha256:c219031addef0e207e90e329d8a19de6c3cba8cb294facc3b82f71bfdf5f6b35"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DQUCECQYS2OBRDCOEBFI3ZOPHP/bundle.json","state_url":"https://pith.science/pith/DQUCECQYS2OBRDCOEBFI3ZOPHP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DQUCECQYS2OBRDCOEBFI3ZOPHP/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-27T00:04:02Z","links":{"resolver":"https://pith.science/pith/DQUCECQYS2OBRDCOEBFI3ZOPHP","bundle":"https://pith.science/pith/DQUCECQYS2OBRDCOEBFI3ZOPHP/bundle.json","state":"https://pith.science/pith/DQUCECQYS2OBRDCOEBFI3ZOPHP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DQUCECQYS2OBRDCOEBFI3ZOPHP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:DQUCECQYS2OBRDCOEBFI3ZOPHP","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"a73982877225b36b3d1e4ca6c55339073fb046da32e835be0aa2e35c631c07c1","cross_cats_sorted":["cs.NI","cs.SY"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2017-08-19T22:48:39Z","title_canon_sha256":"8151580cceb474313685f3c7b1a1ef01dfb679f4ec4a2c487a8aeadc8d94d66b"},"schema_version":"1.0","source":{"id":"1708.05908","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.05908","created_at":"2026-05-18T00:33:58Z"},{"alias_kind":"arxiv_version","alias_value":"1708.05908v3","created_at":"2026-05-18T00:33:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.05908","created_at":"2026-05-18T00:33:58Z"},{"alias_kind":"pith_short_12","alias_value":"DQUCECQYS2OB","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_16","alias_value":"DQUCECQYS2OBRDCO","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_8","alias_value":"DQUCECQY","created_at":"2026-05-18T12:31:12Z"}],"graph_snapshots":[{"event_id":"sha256:c219031addef0e207e90e329d8a19de6c3cba8cb294facc3b82f71bfdf5f6b35","target":"graph","created_at":"2026-05-18T00:33:58Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"Designing an optimal network topology while balancing multiple, possibly conflicting objectives like cost, performance, and resiliency to viruses is a challenging endeavor, let alone in the case of decentralized network formation. We therefore propose a game-formation technique where each player aims to minimize its cost in installing links, the probability of being infected by a virus and the sum of hopcounts on its shortest paths to all other nodes.\n  In this article, we (1) determine the Nash Equilibria and the Price of Anarchy for our novel network formation game, (2) demonstrate that the ","authors_text":"Eitan Altman, Fernando A. Kuipers, Piet Van Mieghem, Stojan Trajanovski, Yezekael Hayel","cross_cats":["cs.NI","cs.SY"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2017-08-19T22:48:39Z","title":"Designing virus-resistant, high-performance networks: a game-formation approach"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.05908","kind":"arxiv","version":3},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:ad8206d7986e4cf6b3c9f624ded5c75e8af346df7c6e55f1337db8d31ef78e2a","target":"record","created_at":"2026-05-18T00:33:58Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"a73982877225b36b3d1e4ca6c55339073fb046da32e835be0aa2e35c631c07c1","cross_cats_sorted":["cs.NI","cs.SY"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2017-08-19T22:48:39Z","title_canon_sha256":"8151580cceb474313685f3c7b1a1ef01dfb679f4ec4a2c487a8aeadc8d94d66b"},"schema_version":"1.0","source":{"id":"1708.05908","kind":"arxiv","version":3}},"canonical_sha256":"1c28220a18969c188c4e204a8de5cf3bee93c25e7ace154896c1a47f268e3b1a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1c28220a18969c188c4e204a8de5cf3bee93c25e7ace154896c1a47f268e3b1a","first_computed_at":"2026-05-18T00:33:58.610076Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:33:58.610076Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"6r2qmNaxtHDSctkQCNWnWXx4Ze0LC/eTXw+wfcYPUPFnI01BdjV7EU8TW3j9rN8lhEFtoCVIF2c+/uwhMboTBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:33:58.610711Z","signed_message":"canonical_sha256_bytes"},"source_id":"1708.05908","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ad8206d7986e4cf6b3c9f624ded5c75e8af346df7c6e55f1337db8d31ef78e2a","sha256:c219031addef0e207e90e329d8a19de6c3cba8cb294facc3b82f71bfdf5f6b35"],"state_sha256":"dfc5c37ca2fc52eeb9cdb2b493dc98e9916fbeb768b63779c60a2da056ec101d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"79GEaI5gS0v8dzI6yYftATUQIrJUJgCuAmUBnLJLe2sfXO6Fz6RPn9xAr+jZ6K6a9IqbWcEJzQWL+wTYIsp5BQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T00:04:02.463382Z","bundle_sha256":"9b8bd847634b662dc9076c26737f57880c6d04a3141a0a8daccc79435d044db2"}}