{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:IJABFPQ4SYJ3KTSL67UNKFX5AQ","short_pith_number":"pith:IJABFPQ4","canonical_record":{"source":{"id":"1610.01861","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2016-10-06T13:23:08Z","cross_cats_sorted":["cs.DM","cs.DS","cs.NI"],"title_canon_sha256":"aa2fc78e49d218fdb03f86e42833f58a50099bebdd7c20525f90eb1f07f6c512","abstract_canon_sha256":"2a4e4e9c795f5664c2543f2c90a7eec27433baaf3b7eee144ec3a6c2a385de7a"},"schema_version":"1.0"},"canonical_sha256":"424012be1c9613b54e4bf7e8d516fd042de3cacee9002e9859e4ee31ca5f2dcc","source":{"kind":"arxiv","id":"1610.01861","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1610.01861","created_at":"2026-05-18T00:44:09Z"},{"alias_kind":"arxiv_version","alias_value":"1610.01861v2","created_at":"2026-05-18T00:44:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.01861","created_at":"2026-05-18T00:44:09Z"},{"alias_kind":"pith_short_12","alias_value":"IJABFPQ4SYJ3","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_16","alias_value":"IJABFPQ4SYJ3KTSL","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_8","alias_value":"IJABFPQ4","created_at":"2026-05-18T12:30:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:IJABFPQ4SYJ3KTSL67UNKFX5AQ","target":"record","payload":{"canonical_record":{"source":{"id":"1610.01861","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2016-10-06T13:23:08Z","cross_cats_sorted":["cs.DM","cs.DS","cs.NI"],"title_canon_sha256":"aa2fc78e49d218fdb03f86e42833f58a50099bebdd7c20525f90eb1f07f6c512","abstract_canon_sha256":"2a4e4e9c795f5664c2543f2c90a7eec27433baaf3b7eee144ec3a6c2a385de7a"},"schema_version":"1.0"},"canonical_sha256":"424012be1c9613b54e4bf7e8d516fd042de3cacee9002e9859e4ee31ca5f2dcc","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:44:09.411107Z","signature_b64":"LmlsRu6PNVGVH2eBLnKIaAnMgH71wBfgLUxdNV3aE4jZLjNCh8KRYguwBzBuDB4ChSAq7sPx+Mz44ghDn2ouCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"424012be1c9613b54e4bf7e8d516fd042de3cacee9002e9859e4ee31ca5f2dcc","last_reissued_at":"2026-05-18T00:44:09.410655Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:44:09.410655Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1610.01861","source_version":2,"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:44:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9lFyCG1eruNWPcna9TPUdnukdJANGsV7weF57GojfcifRyN4ddZ32fp2rpcNBoZA9Dn7zD72yatZ2iFVThvUAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T12:10:01.907218Z"},"content_sha256":"f194dfacfdabcdd21dec41c4404cdc1a9ea61615496a54ed40bbf5b6f985245d","schema_version":"1.0","event_id":"sha256:f194dfacfdabcdd21dec41c4404cdc1a9ea61615496a54ed40bbf5b6f985245d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:IJABFPQ4SYJ3KTSL67UNKFX5AQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Efficient Best-Response Computation for Strategic Network Formation under Attack","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","cs.DS","cs.NI"],"primary_cat":"cs.GT","authors_text":"Christoph Ke{\\ss}ler, David Schumann, Pascal Lenzner, Stefan Neubert, Sven Ihde, Tobias Friedrich","submitted_at":"2016-10-06T13:23:08Z","abstract_excerpt":"Inspired by real world examples, e.g. the Internet, researchers have introduced an abundance of strategic games to study natural phenomena in networks. Unfortunately, almost all of these games have the conceptual drawback of being computationally intractable, i.e. computing a best response strategy or checking if an equilibrium is reached is NP-hard. Thus, a main challenge in the field is to find tractable realistic network formation models.\n  We address this challenge by investigating a very recently introduced model by Goyal et al. [WINE'16] which focuses on robust networks in the presence o"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.01861","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"},"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:44:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Uhrw1LTLjhkOIn22ZacfYdiMaMWZ+HvQzUwGRRjGGlnL0bEbYmYsrNQgPYg8p/OUHv4PWrvZUSr4Lbp5MyZxAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T12:10:01.907584Z"},"content_sha256":"250e3b70cea4707301122d3980eccbffbb05d9b42b10bf00ddf892bfe773ac0a","schema_version":"1.0","event_id":"sha256:250e3b70cea4707301122d3980eccbffbb05d9b42b10bf00ddf892bfe773ac0a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IJABFPQ4SYJ3KTSL67UNKFX5AQ/bundle.json","state_url":"https://pith.science/pith/IJABFPQ4SYJ3KTSL67UNKFX5AQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IJABFPQ4SYJ3KTSL67UNKFX5AQ/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-28T12:10:01Z","links":{"resolver":"https://pith.science/pith/IJABFPQ4SYJ3KTSL67UNKFX5AQ","bundle":"https://pith.science/pith/IJABFPQ4SYJ3KTSL67UNKFX5AQ/bundle.json","state":"https://pith.science/pith/IJABFPQ4SYJ3KTSL67UNKFX5AQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IJABFPQ4SYJ3KTSL67UNKFX5AQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:IJABFPQ4SYJ3KTSL67UNKFX5AQ","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":"2a4e4e9c795f5664c2543f2c90a7eec27433baaf3b7eee144ec3a6c2a385de7a","cross_cats_sorted":["cs.DM","cs.DS","cs.NI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2016-10-06T13:23:08Z","title_canon_sha256":"aa2fc78e49d218fdb03f86e42833f58a50099bebdd7c20525f90eb1f07f6c512"},"schema_version":"1.0","source":{"id":"1610.01861","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1610.01861","created_at":"2026-05-18T00:44:09Z"},{"alias_kind":"arxiv_version","alias_value":"1610.01861v2","created_at":"2026-05-18T00:44:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.01861","created_at":"2026-05-18T00:44:09Z"},{"alias_kind":"pith_short_12","alias_value":"IJABFPQ4SYJ3","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_16","alias_value":"IJABFPQ4SYJ3KTSL","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_8","alias_value":"IJABFPQ4","created_at":"2026-05-18T12:30:22Z"}],"graph_snapshots":[{"event_id":"sha256:250e3b70cea4707301122d3980eccbffbb05d9b42b10bf00ddf892bfe773ac0a","target":"graph","created_at":"2026-05-18T00:44:09Z","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":"Inspired by real world examples, e.g. the Internet, researchers have introduced an abundance of strategic games to study natural phenomena in networks. Unfortunately, almost all of these games have the conceptual drawback of being computationally intractable, i.e. computing a best response strategy or checking if an equilibrium is reached is NP-hard. Thus, a main challenge in the field is to find tractable realistic network formation models.\n  We address this challenge by investigating a very recently introduced model by Goyal et al. [WINE'16] which focuses on robust networks in the presence o","authors_text":"Christoph Ke{\\ss}ler, David Schumann, Pascal Lenzner, Stefan Neubert, Sven Ihde, Tobias Friedrich","cross_cats":["cs.DM","cs.DS","cs.NI"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2016-10-06T13:23:08Z","title":"Efficient Best-Response Computation for Strategic Network Formation under Attack"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.01861","kind":"arxiv","version":2},"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:f194dfacfdabcdd21dec41c4404cdc1a9ea61615496a54ed40bbf5b6f985245d","target":"record","created_at":"2026-05-18T00:44:09Z","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":"2a4e4e9c795f5664c2543f2c90a7eec27433baaf3b7eee144ec3a6c2a385de7a","cross_cats_sorted":["cs.DM","cs.DS","cs.NI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2016-10-06T13:23:08Z","title_canon_sha256":"aa2fc78e49d218fdb03f86e42833f58a50099bebdd7c20525f90eb1f07f6c512"},"schema_version":"1.0","source":{"id":"1610.01861","kind":"arxiv","version":2}},"canonical_sha256":"424012be1c9613b54e4bf7e8d516fd042de3cacee9002e9859e4ee31ca5f2dcc","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"424012be1c9613b54e4bf7e8d516fd042de3cacee9002e9859e4ee31ca5f2dcc","first_computed_at":"2026-05-18T00:44:09.410655Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:44:09.410655Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"LmlsRu6PNVGVH2eBLnKIaAnMgH71wBfgLUxdNV3aE4jZLjNCh8KRYguwBzBuDB4ChSAq7sPx+Mz44ghDn2ouCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:44:09.411107Z","signed_message":"canonical_sha256_bytes"},"source_id":"1610.01861","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f194dfacfdabcdd21dec41c4404cdc1a9ea61615496a54ed40bbf5b6f985245d","sha256:250e3b70cea4707301122d3980eccbffbb05d9b42b10bf00ddf892bfe773ac0a"],"state_sha256":"514fdf9bf2ac1318c69f9468a5d69432aec2cdc7f5a4fffcddb36bbae1dc8d28"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zZkgUnaioaFVdsfyxyarIRJ16dFULHHoOt3abJBCtbE9plrStrdOx1nWK11POIlaLZEbpXL6p8Zejic5oS1JCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T12:10:01.909651Z","bundle_sha256":"cc08fa2a799713cb169ad0d1dee0ed1e615d0a6b5e76350a41f727df701862bf"}}