{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:XL72NIDZ45QSAK5HVBAX2YOPI5","short_pith_number":"pith:XL72NIDZ","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"},"canonical_sha256":"baffa6a079e761202ba7a8417d61cf4751db51a8d67392d8ba1e8b1e6a1e481e","source":{"kind":"arxiv","id":"1101.2883","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1101.2883","created_at":"2026-05-18T04:31:31Z"},{"alias_kind":"arxiv_version","alias_value":"1101.2883v1","created_at":"2026-05-18T04:31:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1101.2883","created_at":"2026-05-18T04:31:31Z"},{"alias_kind":"pith_short_12","alias_value":"XL72NIDZ45QS","created_at":"2026-05-18T12:26:47Z"},{"alias_kind":"pith_short_16","alias_value":"XL72NIDZ45QSAK5H","created_at":"2026-05-18T12:26:47Z"},{"alias_kind":"pith_short_8","alias_value":"XL72NIDZ","created_at":"2026-05-18T12:26:47Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:XL72NIDZ45QSAK5HVBAX2YOPI5","target":"record","payload":{"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"},"canonical_sha256":"baffa6a079e761202ba7a8417d61cf4751db51a8d67392d8ba1e8b1e6a1e481e","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"},"source_kind":"arxiv","source_id":"1101.2883","source_version":1,"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:31:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mRQmTpPRvkGdY88Ln25nL7scB7syaOroJjykZMjwE0Zp/+Vwtu2s+t6jrxnAZbb2/PMpRN71wGNYBoLE5qKqCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T21:15:58.499166Z"},"content_sha256":"c49c9a3dacdf5fdee7e01f0740f084dc5a6ab574fc0c597f8fd4073c6f250a5a","schema_version":"1.0","event_id":"sha256:c49c9a3dacdf5fdee7e01f0740f084dc5a6ab574fc0c597f8fd4073c6f250a5a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:XL72NIDZ45QSAK5HVBAX2YOPI5","target":"graph","payload":{"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"},"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:31:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aWzYn741B5zv2d4/oaFaVHsVkAHcSE4QPw6SoLx2WqGUQcF4RAzSyQqwznpnbu87UUbg10P+yNaNLAgfbfmNBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T21:15:58.499757Z"},"content_sha256":"e42f1af8b09ee3a45d6dc242369c9a3992b691d3f92cfc428cad5f3de9a344a3","schema_version":"1.0","event_id":"sha256:e42f1af8b09ee3a45d6dc242369c9a3992b691d3f92cfc428cad5f3de9a344a3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XL72NIDZ45QSAK5HVBAX2YOPI5/bundle.json","state_url":"https://pith.science/pith/XL72NIDZ45QSAK5HVBAX2YOPI5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XL72NIDZ45QSAK5HVBAX2YOPI5/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-30T21:15:58Z","links":{"resolver":"https://pith.science/pith/XL72NIDZ45QSAK5HVBAX2YOPI5","bundle":"https://pith.science/pith/XL72NIDZ45QSAK5HVBAX2YOPI5/bundle.json","state":"https://pith.science/pith/XL72NIDZ45QSAK5HVBAX2YOPI5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XL72NIDZ45QSAK5HVBAX2YOPI5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:XL72NIDZ45QSAK5HVBAX2YOPI5","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":"172a43ef2535a22439f217cc536525d7052e865fa4335a89d4dd6fda2774fcd1","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2011-01-14T20:09:03Z","title_canon_sha256":"cb4ab61feba38da548e024ef79347375243a72217a40e77e9b27702cd058f6af"},"schema_version":"1.0","source":{"id":"1101.2883","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1101.2883","created_at":"2026-05-18T04:31:31Z"},{"alias_kind":"arxiv_version","alias_value":"1101.2883v1","created_at":"2026-05-18T04:31:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1101.2883","created_at":"2026-05-18T04:31:31Z"},{"alias_kind":"pith_short_12","alias_value":"XL72NIDZ45QS","created_at":"2026-05-18T12:26:47Z"},{"alias_kind":"pith_short_16","alias_value":"XL72NIDZ45QSAK5H","created_at":"2026-05-18T12:26:47Z"},{"alias_kind":"pith_short_8","alias_value":"XL72NIDZ","created_at":"2026-05-18T12:26:47Z"}],"graph_snapshots":[{"event_id":"sha256:e42f1af8b09ee3a45d6dc242369c9a3992b691d3f92cfc428cad5f3de9a344a3","target":"graph","created_at":"2026-05-18T04:31:31Z","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 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","authors_text":"Adam Tauman Kalai, Andrew Postlewaite, Ankur Moitra, Brendan Lucier, Moshe Tennenholtz, Nicole Immorlica","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2011-01-14T20:09:03Z","title":"Dueling Algorithms"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1101.2883","kind":"arxiv","version":1},"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:c49c9a3dacdf5fdee7e01f0740f084dc5a6ab574fc0c597f8fd4073c6f250a5a","target":"record","created_at":"2026-05-18T04:31:31Z","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":"172a43ef2535a22439f217cc536525d7052e865fa4335a89d4dd6fda2774fcd1","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2011-01-14T20:09:03Z","title_canon_sha256":"cb4ab61feba38da548e024ef79347375243a72217a40e77e9b27702cd058f6af"},"schema_version":"1.0","source":{"id":"1101.2883","kind":"arxiv","version":1}},"canonical_sha256":"baffa6a079e761202ba7a8417d61cf4751db51a8d67392d8ba1e8b1e6a1e481e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"baffa6a079e761202ba7a8417d61cf4751db51a8d67392d8ba1e8b1e6a1e481e","first_computed_at":"2026-05-18T04:31:31.643484Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:31:31.643484Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"kjbpn5Q6TxLgFYThr41RjlkKcFs4fYDuTsHHNnhujQ0y5GWq9pPYfj5QCq6+r8i630QUswmvhZJ4nMXCAPwfDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T04:31:31.644032Z","signed_message":"canonical_sha256_bytes"},"source_id":"1101.2883","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c49c9a3dacdf5fdee7e01f0740f084dc5a6ab574fc0c597f8fd4073c6f250a5a","sha256:e42f1af8b09ee3a45d6dc242369c9a3992b691d3f92cfc428cad5f3de9a344a3"],"state_sha256":"3edf77a8e5eb9519e437dc4cb0a8efaad77bbc04d7caca4b5220aaffd0732f35"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PgPcU7mYsBBfoNc4N6s0bcS5a75F8SmH6ciokY0fgRAbbYBMrinrZocmSu5QkYiS9F+kC7Ps/QNa76ZbKE5TCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T21:15:58.502556Z","bundle_sha256":"2b58ffb3b2913518eba547c6d822a3443cff3669da51360adfe67ff98b645101"}}