{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:XL72NIDZ45QSAK5HVBAX2YOPI5","short_pith_number":"pith:XL72NIDZ","schema_version":"1.0","canonical_sha256":"baffa6a079e761202ba7a8417d61cf4751db51a8d67392d8ba1e8b1e6a1e481e","source":{"kind":"arxiv","id":"1101.2883","version":1},"attestation_state":"computed","paper":{"title":"Dueling Algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.GT","authors_text":"Adam Tauman Kalai, Andrew Postlewaite, Ankur Moitra, Brendan Lucier, Moshe Tennenholtz, Nicole Immorlica","submitted_at":"2011-01-14T20:09:03Z","abstract_excerpt":"We revisit classic algorithmic search and optimization problems from the perspective of competition. Rather than a single optimizer minimizing expected cost, we consider a zero-sum game in which an optimization problem is presented to two players, whose only goal is to outperform the opponent. Such games are typically exponentially large zero-sum games, but they often have a rich combinatorial structure. We provide general techniques by which such structure can be leveraged to find minmax-optimal and approximate minmax-optimal strategies. We give examples of ranking, hiring, compression, and b"},"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":"1101.2883","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2011-01-14T20:09:03Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"cb4ab61feba38da548e024ef79347375243a72217a40e77e9b27702cd058f6af","abstract_canon_sha256":"172a43ef2535a22439f217cc536525d7052e865fa4335a89d4dd6fda2774fcd1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:31:31.644032Z","signature_b64":"kjbpn5Q6TxLgFYThr41RjlkKcFs4fYDuTsHHNnhujQ0y5GWq9pPYfj5QCq6+r8i630QUswmvhZJ4nMXCAPwfDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"baffa6a079e761202ba7a8417d61cf4751db51a8d67392d8ba1e8b1e6a1e481e","last_reissued_at":"2026-05-18T04:31:31.643484Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:31:31.643484Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Dueling Algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.GT","authors_text":"Adam Tauman Kalai, Andrew Postlewaite, Ankur Moitra, Brendan Lucier, Moshe Tennenholtz, Nicole Immorlica","submitted_at":"2011-01-14T20:09:03Z","abstract_excerpt":"We revisit classic algorithmic search and optimization problems from the perspective of competition. Rather than a single optimizer minimizing expected cost, we consider a zero-sum game in which an optimization problem is presented to two players, whose only goal is to outperform the opponent. Such games are typically exponentially large zero-sum games, but they often have a rich combinatorial structure. We provide general techniques by which such structure can be leveraged to find minmax-optimal and approximate minmax-optimal strategies. We give examples of ranking, hiring, compression, and b"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1101.2883","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1101.2883","created_at":"2026-05-18T04:31:31.643543+00:00"},{"alias_kind":"arxiv_version","alias_value":"1101.2883v1","created_at":"2026-05-18T04:31:31.643543+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1101.2883","created_at":"2026-05-18T04:31:31.643543+00:00"},{"alias_kind":"pith_short_12","alias_value":"XL72NIDZ45QS","created_at":"2026-05-18T12:26:47.523578+00:00"},{"alias_kind":"pith_short_16","alias_value":"XL72NIDZ45QSAK5H","created_at":"2026-05-18T12:26:47.523578+00:00"},{"alias_kind":"pith_short_8","alias_value":"XL72NIDZ","created_at":"2026-05-18T12:26:47.523578+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/XL72NIDZ45QSAK5HVBAX2YOPI5","json":"https://pith.science/pith/XL72NIDZ45QSAK5HVBAX2YOPI5.json","graph_json":"https://pith.science/api/pith-number/XL72NIDZ45QSAK5HVBAX2YOPI5/graph.json","events_json":"https://pith.science/api/pith-number/XL72NIDZ45QSAK5HVBAX2YOPI5/events.json","paper":"https://pith.science/paper/XL72NIDZ"},"agent_actions":{"view_html":"https://pith.science/pith/XL72NIDZ45QSAK5HVBAX2YOPI5","download_json":"https://pith.science/pith/XL72NIDZ45QSAK5HVBAX2YOPI5.json","view_paper":"https://pith.science/paper/XL72NIDZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1101.2883&json=true","fetch_graph":"https://pith.science/api/pith-number/XL72NIDZ45QSAK5HVBAX2YOPI5/graph.json","fetch_events":"https://pith.science/api/pith-number/XL72NIDZ45QSAK5HVBAX2YOPI5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XL72NIDZ45QSAK5HVBAX2YOPI5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XL72NIDZ45QSAK5HVBAX2YOPI5/action/storage_attestation","attest_author":"https://pith.science/pith/XL72NIDZ45QSAK5HVBAX2YOPI5/action/author_attestation","sign_citation":"https://pith.science/pith/XL72NIDZ45QSAK5HVBAX2YOPI5/action/citation_signature","submit_replication":"https://pith.science/pith/XL72NIDZ45QSAK5HVBAX2YOPI5/action/replication_record"}},"created_at":"2026-05-18T04:31:31.643543+00:00","updated_at":"2026-05-18T04:31:31.643543+00:00"}