{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:TJ3S4TKH44FHD3HUG74ADVVEEG","short_pith_number":"pith:TJ3S4TKH","canonical_record":{"source":{"id":"1107.2248","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2011-07-12T11:21:16Z","cross_cats_sorted":[],"title_canon_sha256":"1f1c6d231ed000dd85c3b8461800955443d205930b1dc10521f325bf775cdcfa","abstract_canon_sha256":"345236442f123f4809203ea203182a23a063bc3a01d27a7fa6640fc46690e87c"},"schema_version":"1.0"},"canonical_sha256":"9a772e4d47e70a71ecf437f801d6a421b800f735490999a6b43bc7efb8d7a56c","source":{"kind":"arxiv","id":"1107.2248","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1107.2248","created_at":"2026-05-18T04:08:33Z"},{"alias_kind":"arxiv_version","alias_value":"1107.2248v2","created_at":"2026-05-18T04:08:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1107.2248","created_at":"2026-05-18T04:08:33Z"},{"alias_kind":"pith_short_12","alias_value":"TJ3S4TKH44FH","created_at":"2026-05-18T12:26:42Z"},{"alias_kind":"pith_short_16","alias_value":"TJ3S4TKH44FHD3HU","created_at":"2026-05-18T12:26:42Z"},{"alias_kind":"pith_short_8","alias_value":"TJ3S4TKH","created_at":"2026-05-18T12:26:42Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:TJ3S4TKH44FHD3HUG74ADVVEEG","target":"record","payload":{"canonical_record":{"source":{"id":"1107.2248","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2011-07-12T11:21:16Z","cross_cats_sorted":[],"title_canon_sha256":"1f1c6d231ed000dd85c3b8461800955443d205930b1dc10521f325bf775cdcfa","abstract_canon_sha256":"345236442f123f4809203ea203182a23a063bc3a01d27a7fa6640fc46690e87c"},"schema_version":"1.0"},"canonical_sha256":"9a772e4d47e70a71ecf437f801d6a421b800f735490999a6b43bc7efb8d7a56c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:08:33.403283Z","signature_b64":"GMabgw5klupvNsaLA7yWj7CdajgaSmFv9zTlRIjK/c1O6i3jR2qxEW3LleZIyg3otUIoTBU3SCUnqMsircCwCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9a772e4d47e70a71ecf437f801d6a421b800f735490999a6b43bc7efb8d7a56c","last_reissued_at":"2026-05-18T04:08:33.402508Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:08:33.402508Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1107.2248","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-18T04:08:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JLnjMEZ8myagCGCjotdBs7IZBHVZS475xskXcPeJAEin8RKPF8xyH7a501yTRwDoE9lOIy0o7WA8lBqdwFblDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-21T18:58:04.100536Z"},"content_sha256":"78e0f3cb82e7365fdeee9d40f50ea73df46acd5c5e5616a4abe641d408c8dc1d","schema_version":"1.0","event_id":"sha256:78e0f3cb82e7365fdeee9d40f50ea73df46acd5c5e5616a4abe641d408c8dc1d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:TJ3S4TKH44FHD3HUG74ADVVEEG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Approximate Pure Nash Equilibria in Weighted Congestion Games: Existence, Efficient Computation, and Structure","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Alexander Skopalik, Angelo Fanelli, Ioannis Caragiannis, Nick Gravin","submitted_at":"2011-07-12T11:21:16Z","abstract_excerpt":"We consider structural and algorithmic questions related to the Nash dynamics of weighted congestion games. In weighted congestion games with linear latency functions, the existence of (pure Nash) equilibria is guaranteed by potential function arguments. Unfortunately, this proof of existence is inefficient and computing equilibria is such games is a {\\sf PLS}-hard problem. The situation gets worse when superlinear latency functions come into play; in this case, the Nash dynamics of the game may contain cycles and equilibria may not even exist. Given these obstacles, we consider approximate eq"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1107.2248","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-18T04:08:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tTJM0a7A5WAdec4n8Pgir+QE+jHCKBsZYDEXm0o8leasZFfMXuQUfJg6+fdGVWG6F8Dnj6mEZuy2/HtDvpNhBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-21T18:58:04.100888Z"},"content_sha256":"59d40fa886a25145848a0dbb31764922ae719a0b06cf7a854454be371bae67c3","schema_version":"1.0","event_id":"sha256:59d40fa886a25145848a0dbb31764922ae719a0b06cf7a854454be371bae67c3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TJ3S4TKH44FHD3HUG74ADVVEEG/bundle.json","state_url":"https://pith.science/pith/TJ3S4TKH44FHD3HUG74ADVVEEG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TJ3S4TKH44FHD3HUG74ADVVEEG/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-21T18:58:04Z","links":{"resolver":"https://pith.science/pith/TJ3S4TKH44FHD3HUG74ADVVEEG","bundle":"https://pith.science/pith/TJ3S4TKH44FHD3HUG74ADVVEEG/bundle.json","state":"https://pith.science/pith/TJ3S4TKH44FHD3HUG74ADVVEEG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TJ3S4TKH44FHD3HUG74ADVVEEG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:TJ3S4TKH44FHD3HUG74ADVVEEG","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":"345236442f123f4809203ea203182a23a063bc3a01d27a7fa6640fc46690e87c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2011-07-12T11:21:16Z","title_canon_sha256":"1f1c6d231ed000dd85c3b8461800955443d205930b1dc10521f325bf775cdcfa"},"schema_version":"1.0","source":{"id":"1107.2248","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1107.2248","created_at":"2026-05-18T04:08:33Z"},{"alias_kind":"arxiv_version","alias_value":"1107.2248v2","created_at":"2026-05-18T04:08:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1107.2248","created_at":"2026-05-18T04:08:33Z"},{"alias_kind":"pith_short_12","alias_value":"TJ3S4TKH44FH","created_at":"2026-05-18T12:26:42Z"},{"alias_kind":"pith_short_16","alias_value":"TJ3S4TKH44FHD3HU","created_at":"2026-05-18T12:26:42Z"},{"alias_kind":"pith_short_8","alias_value":"TJ3S4TKH","created_at":"2026-05-18T12:26:42Z"}],"graph_snapshots":[{"event_id":"sha256:59d40fa886a25145848a0dbb31764922ae719a0b06cf7a854454be371bae67c3","target":"graph","created_at":"2026-05-18T04:08:33Z","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":"We consider structural and algorithmic questions related to the Nash dynamics of weighted congestion games. In weighted congestion games with linear latency functions, the existence of (pure Nash) equilibria is guaranteed by potential function arguments. Unfortunately, this proof of existence is inefficient and computing equilibria is such games is a {\\sf PLS}-hard problem. The situation gets worse when superlinear latency functions come into play; in this case, the Nash dynamics of the game may contain cycles and equilibria may not even exist. Given these obstacles, we consider approximate eq","authors_text":"Alexander Skopalik, Angelo Fanelli, Ioannis Caragiannis, Nick Gravin","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2011-07-12T11:21:16Z","title":"Approximate Pure Nash Equilibria in Weighted Congestion Games: Existence, Efficient Computation, and Structure"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1107.2248","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:78e0f3cb82e7365fdeee9d40f50ea73df46acd5c5e5616a4abe641d408c8dc1d","target":"record","created_at":"2026-05-18T04:08:33Z","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":"345236442f123f4809203ea203182a23a063bc3a01d27a7fa6640fc46690e87c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2011-07-12T11:21:16Z","title_canon_sha256":"1f1c6d231ed000dd85c3b8461800955443d205930b1dc10521f325bf775cdcfa"},"schema_version":"1.0","source":{"id":"1107.2248","kind":"arxiv","version":2}},"canonical_sha256":"9a772e4d47e70a71ecf437f801d6a421b800f735490999a6b43bc7efb8d7a56c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9a772e4d47e70a71ecf437f801d6a421b800f735490999a6b43bc7efb8d7a56c","first_computed_at":"2026-05-18T04:08:33.402508Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:08:33.402508Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"GMabgw5klupvNsaLA7yWj7CdajgaSmFv9zTlRIjK/c1O6i3jR2qxEW3LleZIyg3otUIoTBU3SCUnqMsircCwCw==","signature_status":"signed_v1","signed_at":"2026-05-18T04:08:33.403283Z","signed_message":"canonical_sha256_bytes"},"source_id":"1107.2248","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:78e0f3cb82e7365fdeee9d40f50ea73df46acd5c5e5616a4abe641d408c8dc1d","sha256:59d40fa886a25145848a0dbb31764922ae719a0b06cf7a854454be371bae67c3"],"state_sha256":"98efbb6aca026e2b40c404fce79d076848c224a55da7dbe2670e459e9e23254e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9KsaJo5qzQMMm+Dzw5pPZJidgABpiiPum8ikep6qPWPgX2Npq/ntkPmM0fed6hfJEzAOJOyBBi8Ef1eFU4thAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-21T18:58:04.103229Z","bundle_sha256":"841a7325bbd5d65822572f760af62644e19a0415a8994d8d8714eb83ab441f54"}}