{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:T4G62TZ7C423HNMAKV52HED2OW","short_pith_number":"pith:T4G62TZ7","canonical_record":{"source":{"id":"1312.1530","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2013-12-05T13:00:23Z","cross_cats_sorted":[],"title_canon_sha256":"20281e4f73db807613ccbe839409913dfb2686d9b8a024cda73732e69cc70075","abstract_canon_sha256":"0fe7e4be75bbe802392423ec03b0c9ebc4fcf3ac56e5d27bc192b58e02ac5ca5"},"schema_version":"1.0"},"canonical_sha256":"9f0ded4f3f1735b3b580557ba3907a75902af25a55e67e424da993ad6a6f7645","source":{"kind":"arxiv","id":"1312.1530","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1312.1530","created_at":"2026-05-18T02:48:17Z"},{"alias_kind":"arxiv_version","alias_value":"1312.1530v2","created_at":"2026-05-18T02:48:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.1530","created_at":"2026-05-18T02:48:17Z"},{"alias_kind":"pith_short_12","alias_value":"T4G62TZ7C423","created_at":"2026-05-18T12:27:59Z"},{"alias_kind":"pith_short_16","alias_value":"T4G62TZ7C423HNMA","created_at":"2026-05-18T12:27:59Z"},{"alias_kind":"pith_short_8","alias_value":"T4G62TZ7","created_at":"2026-05-18T12:27:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:T4G62TZ7C423HNMAKV52HED2OW","target":"record","payload":{"canonical_record":{"source":{"id":"1312.1530","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2013-12-05T13:00:23Z","cross_cats_sorted":[],"title_canon_sha256":"20281e4f73db807613ccbe839409913dfb2686d9b8a024cda73732e69cc70075","abstract_canon_sha256":"0fe7e4be75bbe802392423ec03b0c9ebc4fcf3ac56e5d27bc192b58e02ac5ca5"},"schema_version":"1.0"},"canonical_sha256":"9f0ded4f3f1735b3b580557ba3907a75902af25a55e67e424da993ad6a6f7645","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:48:17.388243Z","signature_b64":"JCZbqmXoYom4DseKBVhoLw5HRbW6zu6syoHuBvJbu2xhr+aBWx9fTBCynLH823hQunf1U36xRktMj/MtqNs4Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9f0ded4f3f1735b3b580557ba3907a75902af25a55e67e424da993ad6a6f7645","last_reissued_at":"2026-05-18T02:48:17.387753Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:48:17.387753Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1312.1530","source_version":2,"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-18T02:48:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"F2Xziqa5jCJTpB7Gc2sB1n3vbqk54IMJz6t3moxtKTPMxj5my+l8trIVmjl9la7X3S9CNnAMl1daeBK+4svTBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T22:38:48.702955Z"},"content_sha256":"11053355beb090298f99319acca7f371ce0b256373356db55a6fe8e8c005b456","schema_version":"1.0","event_id":"sha256:11053355beb090298f99319acca7f371ce0b256373356db55a6fe8e8c005b456"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:T4G62TZ7C423HNMAKV52HED2OW","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Bandit Online Optimization Over the Permutahedron","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Eiji Takimoto, Kohei Hatano, Nir Ailon","submitted_at":"2013-12-05T13:00:23Z","abstract_excerpt":"The permutahedron is the convex polytope with vertex set consisting of the vectors $(\\pi(1),\\dots, \\pi(n))$ for all permutations (bijections) $\\pi$ over $\\{1,\\dots, n\\}$. We study a bandit game in which, at each step $t$, an adversary chooses a hidden weight weight vector $s_t$, a player chooses a vertex $\\pi_t$ of the permutahedron and suffers an observed loss of $\\sum_{i=1}^n \\pi(i) s_t(i)$.\n  A previous algorithm CombBand of Cesa-Bianchi et al (2009) guarantees a regret of $O(n\\sqrt{T \\log n})$ for a time horizon of $T$. Unfortunately, CombBand requires at each step an $n$-by-$n$ matrix per"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.1530","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"},"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-18T02:48:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"voSSTMrEmTpAPdKScVo7nKYkohT1KNMgXYmjgsVyymtGRUt4oct/EmN6po8ZGVeza0aUoW+RfAoj52qxC4ZnCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T22:38:48.703510Z"},"content_sha256":"43cef34a9ee5832f62fa44ebdc50da273b698a0439fe4f2cec684d8725003558","schema_version":"1.0","event_id":"sha256:43cef34a9ee5832f62fa44ebdc50da273b698a0439fe4f2cec684d8725003558"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/T4G62TZ7C423HNMAKV52HED2OW/bundle.json","state_url":"https://pith.science/pith/T4G62TZ7C423HNMAKV52HED2OW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/T4G62TZ7C423HNMAKV52HED2OW/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-06-01T22:38:48Z","links":{"resolver":"https://pith.science/pith/T4G62TZ7C423HNMAKV52HED2OW","bundle":"https://pith.science/pith/T4G62TZ7C423HNMAKV52HED2OW/bundle.json","state":"https://pith.science/pith/T4G62TZ7C423HNMAKV52HED2OW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/T4G62TZ7C423HNMAKV52HED2OW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:T4G62TZ7C423HNMAKV52HED2OW","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":"0fe7e4be75bbe802392423ec03b0c9ebc4fcf3ac56e5d27bc192b58e02ac5ca5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2013-12-05T13:00:23Z","title_canon_sha256":"20281e4f73db807613ccbe839409913dfb2686d9b8a024cda73732e69cc70075"},"schema_version":"1.0","source":{"id":"1312.1530","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1312.1530","created_at":"2026-05-18T02:48:17Z"},{"alias_kind":"arxiv_version","alias_value":"1312.1530v2","created_at":"2026-05-18T02:48:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.1530","created_at":"2026-05-18T02:48:17Z"},{"alias_kind":"pith_short_12","alias_value":"T4G62TZ7C423","created_at":"2026-05-18T12:27:59Z"},{"alias_kind":"pith_short_16","alias_value":"T4G62TZ7C423HNMA","created_at":"2026-05-18T12:27:59Z"},{"alias_kind":"pith_short_8","alias_value":"T4G62TZ7","created_at":"2026-05-18T12:27:59Z"}],"graph_snapshots":[{"event_id":"sha256:43cef34a9ee5832f62fa44ebdc50da273b698a0439fe4f2cec684d8725003558","target":"graph","created_at":"2026-05-18T02:48:17Z","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":"The permutahedron is the convex polytope with vertex set consisting of the vectors $(\\pi(1),\\dots, \\pi(n))$ for all permutations (bijections) $\\pi$ over $\\{1,\\dots, n\\}$. We study a bandit game in which, at each step $t$, an adversary chooses a hidden weight weight vector $s_t$, a player chooses a vertex $\\pi_t$ of the permutahedron and suffers an observed loss of $\\sum_{i=1}^n \\pi(i) s_t(i)$.\n  A previous algorithm CombBand of Cesa-Bianchi et al (2009) guarantees a regret of $O(n\\sqrt{T \\log n})$ for a time horizon of $T$. Unfortunately, CombBand requires at each step an $n$-by-$n$ matrix per","authors_text":"Eiji Takimoto, Kohei Hatano, Nir Ailon","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2013-12-05T13:00:23Z","title":"Bandit Online Optimization Over the Permutahedron"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.1530","kind":"arxiv","version":2},"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:11053355beb090298f99319acca7f371ce0b256373356db55a6fe8e8c005b456","target":"record","created_at":"2026-05-18T02:48:17Z","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":"0fe7e4be75bbe802392423ec03b0c9ebc4fcf3ac56e5d27bc192b58e02ac5ca5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2013-12-05T13:00:23Z","title_canon_sha256":"20281e4f73db807613ccbe839409913dfb2686d9b8a024cda73732e69cc70075"},"schema_version":"1.0","source":{"id":"1312.1530","kind":"arxiv","version":2}},"canonical_sha256":"9f0ded4f3f1735b3b580557ba3907a75902af25a55e67e424da993ad6a6f7645","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9f0ded4f3f1735b3b580557ba3907a75902af25a55e67e424da993ad6a6f7645","first_computed_at":"2026-05-18T02:48:17.387753Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:48:17.387753Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"JCZbqmXoYom4DseKBVhoLw5HRbW6zu6syoHuBvJbu2xhr+aBWx9fTBCynLH823hQunf1U36xRktMj/MtqNs4Bw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:48:17.388243Z","signed_message":"canonical_sha256_bytes"},"source_id":"1312.1530","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:11053355beb090298f99319acca7f371ce0b256373356db55a6fe8e8c005b456","sha256:43cef34a9ee5832f62fa44ebdc50da273b698a0439fe4f2cec684d8725003558"],"state_sha256":"a8b3484f7f7a61d581c9582fc2c88185c74f3086830d1900a4ad19d88829d347"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Hl0GCAGKAPIOcV2xFUakmhhTF9Gb7fsFkVFcGV2rxwDnoDzIgvuX6fC8XOanNMc9TKIFmiWbE14IAO+19UCvAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T22:38:48.705937Z","bundle_sha256":"e4ad10f310d61d45a239630c6b2b9eca5eab48a49ff44ac0d3f50f329d2133ca"}}