{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:LKPQGI264AJSWOZDHOSQW37PEH","short_pith_number":"pith:LKPQGI26","canonical_record":{"source":{"id":"1207.5212","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2012-07-22T10:22:09Z","cross_cats_sorted":[],"title_canon_sha256":"f62b4095989f89749c3f8a851bd1dc1357bb04eafe12534e54196472939baa8e","abstract_canon_sha256":"7c0bb403246ab859267fe3e2a789147652471eb725f1a1d7a7a37dbbea66f239"},"schema_version":"1.0"},"canonical_sha256":"5a9f03235ee0132b3b233ba50b6fef21d0e78fab14aa7925cbd0bc5cf966f72b","source":{"kind":"arxiv","id":"1207.5212","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1207.5212","created_at":"2026-05-18T03:50:24Z"},{"alias_kind":"arxiv_version","alias_value":"1207.5212v1","created_at":"2026-05-18T03:50:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.5212","created_at":"2026-05-18T03:50:24Z"},{"alias_kind":"pith_short_12","alias_value":"LKPQGI264AJS","created_at":"2026-05-18T12:27:14Z"},{"alias_kind":"pith_short_16","alias_value":"LKPQGI264AJSWOZD","created_at":"2026-05-18T12:27:14Z"},{"alias_kind":"pith_short_8","alias_value":"LKPQGI26","created_at":"2026-05-18T12:27:14Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:LKPQGI264AJSWOZDHOSQW37PEH","target":"record","payload":{"canonical_record":{"source":{"id":"1207.5212","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2012-07-22T10:22:09Z","cross_cats_sorted":[],"title_canon_sha256":"f62b4095989f89749c3f8a851bd1dc1357bb04eafe12534e54196472939baa8e","abstract_canon_sha256":"7c0bb403246ab859267fe3e2a789147652471eb725f1a1d7a7a37dbbea66f239"},"schema_version":"1.0"},"canonical_sha256":"5a9f03235ee0132b3b233ba50b6fef21d0e78fab14aa7925cbd0bc5cf966f72b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:50:24.142808Z","signature_b64":"PspptQ8EDeuD+LpEaGWV4mp00NohM0HNU8bcZn6hOuG4vRXywm/U58y357vvQGVZB+dfpA9ZobyjlyK7C80rDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5a9f03235ee0132b3b233ba50b6fef21d0e78fab14aa7925cbd0bc5cf966f72b","last_reissued_at":"2026-05-18T03:50:24.141982Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:50:24.141982Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1207.5212","source_version":1,"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-18T03:50:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6PfawVAomwX9hrhGzgvERg4LEFwOZh1/mvddiMMDvS+H/6+q/gEPbwIqSo1lFV4yXcDvBl8LLHpUXPa9s6f7Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T14:34:20.278401Z"},"content_sha256":"b2073fedc7c2afa66cb6c62e985355638ced29d62374ea1fefb78465266c1e3e","schema_version":"1.0","event_id":"sha256:b2073fedc7c2afa66cb6c62e985355638ced29d62374ea1fefb78465266c1e3e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:LKPQGI264AJSWOZDHOSQW37PEH","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the Hardness of Network Design for Bottleneck Routing Games","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Alexis C. Kaporis, Dimitris Fotakis, Paul G. Spirakis, Thanasis Lianeas","submitted_at":"2012-07-22T10:22:09Z","abstract_excerpt":"In routing games, the network performance at equilibrium can be significantly improved if we remove some edges from the network. This counterintuitive fact, widely known as Braess's paradox, gives rise to the (selfish) network design problem, where we seek to recognize routing games suffering from the paradox, and to improve the equilibrium performance by edge removal. In this work, we investigate the computational complexity and the approximability of the network design problem for non-atomic bottleneck routing games, where the individual cost of each player is the bottleneck cost of her path"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1207.5212","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"},"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-18T03:50:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8TsPRn87P0px6OhGlFOn+OYvHTFpKJt8BuDRpHWiynAQsiyQkwQ4voYxsQd2wNweInKgJB2g/ftLaAoyopruCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T14:34:20.278748Z"},"content_sha256":"6e7b21122e765bf9deff5079bdd24de49d1115407e8fa380b21017b12a159254","schema_version":"1.0","event_id":"sha256:6e7b21122e765bf9deff5079bdd24de49d1115407e8fa380b21017b12a159254"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LKPQGI264AJSWOZDHOSQW37PEH/bundle.json","state_url":"https://pith.science/pith/LKPQGI264AJSWOZDHOSQW37PEH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LKPQGI264AJSWOZDHOSQW37PEH/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-06-01T14:34:20Z","links":{"resolver":"https://pith.science/pith/LKPQGI264AJSWOZDHOSQW37PEH","bundle":"https://pith.science/pith/LKPQGI264AJSWOZDHOSQW37PEH/bundle.json","state":"https://pith.science/pith/LKPQGI264AJSWOZDHOSQW37PEH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LKPQGI264AJSWOZDHOSQW37PEH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:LKPQGI264AJSWOZDHOSQW37PEH","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":"7c0bb403246ab859267fe3e2a789147652471eb725f1a1d7a7a37dbbea66f239","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2012-07-22T10:22:09Z","title_canon_sha256":"f62b4095989f89749c3f8a851bd1dc1357bb04eafe12534e54196472939baa8e"},"schema_version":"1.0","source":{"id":"1207.5212","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1207.5212","created_at":"2026-05-18T03:50:24Z"},{"alias_kind":"arxiv_version","alias_value":"1207.5212v1","created_at":"2026-05-18T03:50:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.5212","created_at":"2026-05-18T03:50:24Z"},{"alias_kind":"pith_short_12","alias_value":"LKPQGI264AJS","created_at":"2026-05-18T12:27:14Z"},{"alias_kind":"pith_short_16","alias_value":"LKPQGI264AJSWOZD","created_at":"2026-05-18T12:27:14Z"},{"alias_kind":"pith_short_8","alias_value":"LKPQGI26","created_at":"2026-05-18T12:27:14Z"}],"graph_snapshots":[{"event_id":"sha256:6e7b21122e765bf9deff5079bdd24de49d1115407e8fa380b21017b12a159254","target":"graph","created_at":"2026-05-18T03:50:24Z","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":"In routing games, the network performance at equilibrium can be significantly improved if we remove some edges from the network. This counterintuitive fact, widely known as Braess's paradox, gives rise to the (selfish) network design problem, where we seek to recognize routing games suffering from the paradox, and to improve the equilibrium performance by edge removal. In this work, we investigate the computational complexity and the approximability of the network design problem for non-atomic bottleneck routing games, where the individual cost of each player is the bottleneck cost of her path","authors_text":"Alexis C. Kaporis, Dimitris Fotakis, Paul G. Spirakis, Thanasis Lianeas","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2012-07-22T10:22:09Z","title":"On the Hardness of Network Design for Bottleneck Routing Games"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1207.5212","kind":"arxiv","version":1},"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:b2073fedc7c2afa66cb6c62e985355638ced29d62374ea1fefb78465266c1e3e","target":"record","created_at":"2026-05-18T03:50:24Z","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":"7c0bb403246ab859267fe3e2a789147652471eb725f1a1d7a7a37dbbea66f239","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2012-07-22T10:22:09Z","title_canon_sha256":"f62b4095989f89749c3f8a851bd1dc1357bb04eafe12534e54196472939baa8e"},"schema_version":"1.0","source":{"id":"1207.5212","kind":"arxiv","version":1}},"canonical_sha256":"5a9f03235ee0132b3b233ba50b6fef21d0e78fab14aa7925cbd0bc5cf966f72b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5a9f03235ee0132b3b233ba50b6fef21d0e78fab14aa7925cbd0bc5cf966f72b","first_computed_at":"2026-05-18T03:50:24.141982Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:50:24.141982Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"PspptQ8EDeuD+LpEaGWV4mp00NohM0HNU8bcZn6hOuG4vRXywm/U58y357vvQGVZB+dfpA9ZobyjlyK7C80rDg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:50:24.142808Z","signed_message":"canonical_sha256_bytes"},"source_id":"1207.5212","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b2073fedc7c2afa66cb6c62e985355638ced29d62374ea1fefb78465266c1e3e","sha256:6e7b21122e765bf9deff5079bdd24de49d1115407e8fa380b21017b12a159254"],"state_sha256":"ca5766a699d60e0ce3d1fc008fc421dfaeae029f2a6e04c6c188cd8d9b6a9a73"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2aL2e3qOvmpDk9CfCIYKWOgdq/1JzR32fV3tb9FNYGB2qcP8eHzm8F5PvGdf35lPXkJwd2C843cSKpMgz9TbCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T14:34:20.280995Z","bundle_sha256":"217244e159c018d700e88e54e099784a6fb221ae8a49ca6358f775050f54d2b4"}}