{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:RMENHRYFQ7FW2VB5TDOR5KAPHA","short_pith_number":"pith:RMENHRYF","schema_version":"1.0","canonical_sha256":"8b08d3c70587cb6d543d98dd1ea80f381c19b1d10b075fa3da4546ab4e6a694f","source":{"kind":"arxiv","id":"1605.04004","version":3},"attestation_state":"computed","paper":{"title":"Price of Competition and Dueling Games","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Hamid Mahini, MohammadTaghi Hajiaghayi, Saeed Seddighin, Sina Dehghani","submitted_at":"2016-05-12T22:50:36Z","abstract_excerpt":"We study competition in a general framework introduced by Immorlica et al. and answer their main open question. Immorlica et al. considered classic optimization problems in terms of competition and introduced a general class of games called dueling games. They model this competition as a zero-sum game, where two players are competing for a user's satisfaction. In their main and most natural game, the ranking duel, a user requests a webpage by submitting a query and players output an ordering over all possible webpages based on the submitted query. The user tends to choose the ordering which di"},"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":"1605.04004","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2016-05-12T22:50:36Z","cross_cats_sorted":[],"title_canon_sha256":"d45e64bd9bc3b29f2c04aacd82f7927274ee5842f22b08fc01b8d66e2f61a2a1","abstract_canon_sha256":"aacbbe3bcd2c2372215a923fad3e6baede4f0c89948c8633d66c2aee884f3816"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:54:47.737885Z","signature_b64":"UbhjeBuRZa8T7p8wj/csFn+ynwLp8tIj9daDljLBRlUIBE4vAYmtnsRCZHBh0pkiimRHHyK7kbk2IIxsesKcDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8b08d3c70587cb6d543d98dd1ea80f381c19b1d10b075fa3da4546ab4e6a694f","last_reissued_at":"2026-05-18T00:54:47.737400Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:54:47.737400Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Price of Competition and Dueling Games","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Hamid Mahini, MohammadTaghi Hajiaghayi, Saeed Seddighin, Sina Dehghani","submitted_at":"2016-05-12T22:50:36Z","abstract_excerpt":"We study competition in a general framework introduced by Immorlica et al. and answer their main open question. Immorlica et al. considered classic optimization problems in terms of competition and introduced a general class of games called dueling games. They model this competition as a zero-sum game, where two players are competing for a user's satisfaction. In their main and most natural game, the ranking duel, a user requests a webpage by submitting a query and players output an ordering over all possible webpages based on the submitted query. The user tends to choose the ordering which di"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.04004","kind":"arxiv","version":3},"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":"1605.04004","created_at":"2026-05-18T00:54:47.737479+00:00"},{"alias_kind":"arxiv_version","alias_value":"1605.04004v3","created_at":"2026-05-18T00:54:47.737479+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.04004","created_at":"2026-05-18T00:54:47.737479+00:00"},{"alias_kind":"pith_short_12","alias_value":"RMENHRYFQ7FW","created_at":"2026-05-18T12:30:41.710351+00:00"},{"alias_kind":"pith_short_16","alias_value":"RMENHRYFQ7FW2VB5","created_at":"2026-05-18T12:30:41.710351+00:00"},{"alias_kind":"pith_short_8","alias_value":"RMENHRYF","created_at":"2026-05-18T12:30:41.710351+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/RMENHRYFQ7FW2VB5TDOR5KAPHA","json":"https://pith.science/pith/RMENHRYFQ7FW2VB5TDOR5KAPHA.json","graph_json":"https://pith.science/api/pith-number/RMENHRYFQ7FW2VB5TDOR5KAPHA/graph.json","events_json":"https://pith.science/api/pith-number/RMENHRYFQ7FW2VB5TDOR5KAPHA/events.json","paper":"https://pith.science/paper/RMENHRYF"},"agent_actions":{"view_html":"https://pith.science/pith/RMENHRYFQ7FW2VB5TDOR5KAPHA","download_json":"https://pith.science/pith/RMENHRYFQ7FW2VB5TDOR5KAPHA.json","view_paper":"https://pith.science/paper/RMENHRYF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1605.04004&json=true","fetch_graph":"https://pith.science/api/pith-number/RMENHRYFQ7FW2VB5TDOR5KAPHA/graph.json","fetch_events":"https://pith.science/api/pith-number/RMENHRYFQ7FW2VB5TDOR5KAPHA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RMENHRYFQ7FW2VB5TDOR5KAPHA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RMENHRYFQ7FW2VB5TDOR5KAPHA/action/storage_attestation","attest_author":"https://pith.science/pith/RMENHRYFQ7FW2VB5TDOR5KAPHA/action/author_attestation","sign_citation":"https://pith.science/pith/RMENHRYFQ7FW2VB5TDOR5KAPHA/action/citation_signature","submit_replication":"https://pith.science/pith/RMENHRYFQ7FW2VB5TDOR5KAPHA/action/replication_record"}},"created_at":"2026-05-18T00:54:47.737479+00:00","updated_at":"2026-05-18T00:54:47.737479+00:00"}