{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:MYVIVHGONXCOGWJRMSPHKFVLGD","short_pith_number":"pith:MYVIVHGO","schema_version":"1.0","canonical_sha256":"662a8a9cce6dc4e35931649e7516ab30c81bf938431842d4794d684b0f7829c7","source":{"kind":"arxiv","id":"2112.07435","version":1},"attestation_state":"computed","paper":{"title":"Multi-Leader Congestion Games with an Adversary","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.DM"],"primary_cat":"cs.GT","authors_text":"Anja Schedel, Jannik Matuschke, Max Klimm, Mona Henle, Tobias Harks","submitted_at":"2021-12-14T14:47:43Z","abstract_excerpt":"We study a multi-leader single-follower congestion game where multiple users (leaders) choose one resource out of a set of resources and, after observing the realized loads, an adversary (single-follower) attacks the resources with maximum loads, causing additional costs for the leaders. For the resulting strategic game among the leaders, we show that pure Nash equilibria may fail to exist and therefore, we consider approximate equilibria instead. As our first main result, we show that the existence of a $K$-approximate equilibrium can always be guaranteed, where $K \\approx 1.1974$ is the uniq"},"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":"2112.07435","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2021-12-14T14:47:43Z","cross_cats_sorted":["cs.AI","cs.DM"],"title_canon_sha256":"e285ab2f172bf8d5b9b89f3d72df2d27316580dcf6d800a9fa8950bec3f93305","abstract_canon_sha256":"f01b984e535467614a9e4b2cddbeb4d4691e139975b7a0bf1827434f7e27f3b3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:40:58.223826Z","signature_b64":"Y6AHtIIeBOWdeqVfz4mbUaqer/f+DlvdpOEJOhjcqVZJj0BhZgBlMMga2RotB2futlwWTe9vn6FUQhVKZJG9Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"662a8a9cce6dc4e35931649e7516ab30c81bf938431842d4794d684b0f7829c7","last_reissued_at":"2026-07-05T03:40:58.223362Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:40:58.223362Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Multi-Leader Congestion Games with an Adversary","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.DM"],"primary_cat":"cs.GT","authors_text":"Anja Schedel, Jannik Matuschke, Max Klimm, Mona Henle, Tobias Harks","submitted_at":"2021-12-14T14:47:43Z","abstract_excerpt":"We study a multi-leader single-follower congestion game where multiple users (leaders) choose one resource out of a set of resources and, after observing the realized loads, an adversary (single-follower) attacks the resources with maximum loads, causing additional costs for the leaders. For the resulting strategic game among the leaders, we show that pure Nash equilibria may fail to exist and therefore, we consider approximate equilibria instead. As our first main result, we show that the existence of a $K$-approximate equilibrium can always be guaranteed, where $K \\approx 1.1974$ is the uniq"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2112.07435","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2112.07435/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2112.07435","created_at":"2026-07-05T03:40:58.223420+00:00"},{"alias_kind":"arxiv_version","alias_value":"2112.07435v1","created_at":"2026-07-05T03:40:58.223420+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2112.07435","created_at":"2026-07-05T03:40:58.223420+00:00"},{"alias_kind":"pith_short_12","alias_value":"MYVIVHGONXCO","created_at":"2026-07-05T03:40:58.223420+00:00"},{"alias_kind":"pith_short_16","alias_value":"MYVIVHGONXCOGWJR","created_at":"2026-07-05T03:40:58.223420+00:00"},{"alias_kind":"pith_short_8","alias_value":"MYVIVHGO","created_at":"2026-07-05T03:40:58.223420+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/MYVIVHGONXCOGWJRMSPHKFVLGD","json":"https://pith.science/pith/MYVIVHGONXCOGWJRMSPHKFVLGD.json","graph_json":"https://pith.science/api/pith-number/MYVIVHGONXCOGWJRMSPHKFVLGD/graph.json","events_json":"https://pith.science/api/pith-number/MYVIVHGONXCOGWJRMSPHKFVLGD/events.json","paper":"https://pith.science/paper/MYVIVHGO"},"agent_actions":{"view_html":"https://pith.science/pith/MYVIVHGONXCOGWJRMSPHKFVLGD","download_json":"https://pith.science/pith/MYVIVHGONXCOGWJRMSPHKFVLGD.json","view_paper":"https://pith.science/paper/MYVIVHGO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2112.07435&json=true","fetch_graph":"https://pith.science/api/pith-number/MYVIVHGONXCOGWJRMSPHKFVLGD/graph.json","fetch_events":"https://pith.science/api/pith-number/MYVIVHGONXCOGWJRMSPHKFVLGD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MYVIVHGONXCOGWJRMSPHKFVLGD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MYVIVHGONXCOGWJRMSPHKFVLGD/action/storage_attestation","attest_author":"https://pith.science/pith/MYVIVHGONXCOGWJRMSPHKFVLGD/action/author_attestation","sign_citation":"https://pith.science/pith/MYVIVHGONXCOGWJRMSPHKFVLGD/action/citation_signature","submit_replication":"https://pith.science/pith/MYVIVHGONXCOGWJRMSPHKFVLGD/action/replication_record"}},"created_at":"2026-07-05T03:40:58.223420+00:00","updated_at":"2026-07-05T03:40:58.223420+00:00"}