{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:O32KQ5RGMP3WTVUAU5OATLW5C5","short_pith_number":"pith:O32KQ5RG","schema_version":"1.0","canonical_sha256":"76f4a8762663f769d680a75c09aedd1742da20aab90eef71827ec09a0f7032d7","source":{"kind":"arxiv","id":"1202.2877","version":2},"attestation_state":"computed","paper":{"title":"Improving the Price of Anarchy for Selfish Routing via Coordination Mechanisms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Evangelia Pyrga, George Christodoulou, Kurt Mehlhorn","submitted_at":"2012-02-13T21:41:11Z","abstract_excerpt":"We reconsider the well-studied Selfish Routing game with affine latency functions. The Price of Anarchy for this class of games takes maximum value 4/3; this maximum is attained already for a simple network of two parallel links, known as Pigou's network. We improve upon the value 4/3 by means of Coordination Mechanisms.\n  We increase the latency functions of the edges in the network, i.e., if $\\ell_e(x)$ is the latency function of an edge $e$, we replace it by $\\hat{\\ell}_e(x)$ with $\\ell_e(x) \\le \\hat{\\ell}_e(x)$ for all $x$. Then an adversary fixes a demand rate as input. The engineered Pri"},"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":"1202.2877","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2012-02-13T21:41:11Z","cross_cats_sorted":[],"title_canon_sha256":"7b04f6af2d673c52cf1791066dbe345d9d13efa88dbe2fe0e0c0411110fd51c0","abstract_canon_sha256":"d91cc11d24380d5300ed9cbd914857a34f5186642cb2de627a6ef2f8e836106c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:21:17.871660Z","signature_b64":"CmF7IvHf6/AAD3VvTkn/hfwa1aLCfQzs9Y9/Gd8lgR7NY1SKbrZnRfr5tOKV0aWLYRLOPaiDKuL+dJ3a1qFBDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"76f4a8762663f769d680a75c09aedd1742da20aab90eef71827ec09a0f7032d7","last_reissued_at":"2026-05-18T02:21:17.870922Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:21:17.870922Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Improving the Price of Anarchy for Selfish Routing via Coordination Mechanisms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Evangelia Pyrga, George Christodoulou, Kurt Mehlhorn","submitted_at":"2012-02-13T21:41:11Z","abstract_excerpt":"We reconsider the well-studied Selfish Routing game with affine latency functions. The Price of Anarchy for this class of games takes maximum value 4/3; this maximum is attained already for a simple network of two parallel links, known as Pigou's network. We improve upon the value 4/3 by means of Coordination Mechanisms.\n  We increase the latency functions of the edges in the network, i.e., if $\\ell_e(x)$ is the latency function of an edge $e$, we replace it by $\\hat{\\ell}_e(x)$ with $\\ell_e(x) \\le \\hat{\\ell}_e(x)$ for all $x$. Then an adversary fixes a demand rate as input. The engineered Pri"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1202.2877","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":"1202.2877","created_at":"2026-05-18T02:21:17.871041+00:00"},{"alias_kind":"arxiv_version","alias_value":"1202.2877v2","created_at":"2026-05-18T02:21:17.871041+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1202.2877","created_at":"2026-05-18T02:21:17.871041+00:00"},{"alias_kind":"pith_short_12","alias_value":"O32KQ5RGMP3W","created_at":"2026-05-18T12:27:16.716162+00:00"},{"alias_kind":"pith_short_16","alias_value":"O32KQ5RGMP3WTVUA","created_at":"2026-05-18T12:27:16.716162+00:00"},{"alias_kind":"pith_short_8","alias_value":"O32KQ5RG","created_at":"2026-05-18T12:27:16.716162+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/O32KQ5RGMP3WTVUAU5OATLW5C5","json":"https://pith.science/pith/O32KQ5RGMP3WTVUAU5OATLW5C5.json","graph_json":"https://pith.science/api/pith-number/O32KQ5RGMP3WTVUAU5OATLW5C5/graph.json","events_json":"https://pith.science/api/pith-number/O32KQ5RGMP3WTVUAU5OATLW5C5/events.json","paper":"https://pith.science/paper/O32KQ5RG"},"agent_actions":{"view_html":"https://pith.science/pith/O32KQ5RGMP3WTVUAU5OATLW5C5","download_json":"https://pith.science/pith/O32KQ5RGMP3WTVUAU5OATLW5C5.json","view_paper":"https://pith.science/paper/O32KQ5RG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1202.2877&json=true","fetch_graph":"https://pith.science/api/pith-number/O32KQ5RGMP3WTVUAU5OATLW5C5/graph.json","fetch_events":"https://pith.science/api/pith-number/O32KQ5RGMP3WTVUAU5OATLW5C5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/O32KQ5RGMP3WTVUAU5OATLW5C5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/O32KQ5RGMP3WTVUAU5OATLW5C5/action/storage_attestation","attest_author":"https://pith.science/pith/O32KQ5RGMP3WTVUAU5OATLW5C5/action/author_attestation","sign_citation":"https://pith.science/pith/O32KQ5RGMP3WTVUAU5OATLW5C5/action/citation_signature","submit_replication":"https://pith.science/pith/O32KQ5RGMP3WTVUAU5OATLW5C5/action/replication_record"}},"created_at":"2026-05-18T02:21:17.871041+00:00","updated_at":"2026-05-18T02:21:17.871041+00:00"}