{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:2APP2GZCRASYH3K5RIX7I36ODH","short_pith_number":"pith:2APP2GZC","canonical_record":{"source":{"id":"1211.2260","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-11-09T22:13:10Z","cross_cats_sorted":[],"title_canon_sha256":"46a7f55e89355fc6158ffd92629792cc9a37e72a199b10b9da2af9650df4399f","abstract_canon_sha256":"94d2d04490a51f25ee4943fd32a5ac54e3b6f638ece451cf1b0492cdefc2e62d"},"schema_version":"1.0"},"canonical_sha256":"d01efd1b22882583ed5d8a2ff46fce19cd2148f96253117ff2a059716afb1dbf","source":{"kind":"arxiv","id":"1211.2260","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1211.2260","created_at":"2026-05-18T03:41:03Z"},{"alias_kind":"arxiv_version","alias_value":"1211.2260v1","created_at":"2026-05-18T03:41:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1211.2260","created_at":"2026-05-18T03:41:03Z"},{"alias_kind":"pith_short_12","alias_value":"2APP2GZCRASY","created_at":"2026-05-18T12:26:50Z"},{"alias_kind":"pith_short_16","alias_value":"2APP2GZCRASYH3K5","created_at":"2026-05-18T12:26:50Z"},{"alias_kind":"pith_short_8","alias_value":"2APP2GZC","created_at":"2026-05-18T12:26:50Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:2APP2GZCRASYH3K5RIX7I36ODH","target":"record","payload":{"canonical_record":{"source":{"id":"1211.2260","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-11-09T22:13:10Z","cross_cats_sorted":[],"title_canon_sha256":"46a7f55e89355fc6158ffd92629792cc9a37e72a199b10b9da2af9650df4399f","abstract_canon_sha256":"94d2d04490a51f25ee4943fd32a5ac54e3b6f638ece451cf1b0492cdefc2e62d"},"schema_version":"1.0"},"canonical_sha256":"d01efd1b22882583ed5d8a2ff46fce19cd2148f96253117ff2a059716afb1dbf","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:41:03.966997Z","signature_b64":"9mjHbGL6GuduDVs/NHY+ZwGAOd1urfQlNyTw2SDwpfvdHOOQPrEJgpOjpQogbW+Ovv/I20dCeDmkcHtwuR2gBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d01efd1b22882583ed5d8a2ff46fce19cd2148f96253117ff2a059716afb1dbf","last_reissued_at":"2026-05-18T03:41:03.966277Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:41:03.966277Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1211.2260","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-18T03:41:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Emz7Cmkhe5TF62wXz415X9z0h7VhLVmNooQliVnPpgBnvQbzKJzBxVEn9jaorX2qB1HXbGBQwQgVXXCgs+pNBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-09T22:03:03.053157Z"},"content_sha256":"3365349d0b58003f3c1233504d9ce621645144d10ade8b0d8b4b3d16f2e844bc","schema_version":"1.0","event_id":"sha256:3365349d0b58003f3c1233504d9ce621645144d10ade8b0d8b4b3d16f2e844bc"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:2APP2GZCRASYH3K5RIX7I36ODH","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"No-Regret Algorithms for Unconstrained Online Convex Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"H. Brendan McMahan, Matthew Streeter","submitted_at":"2012-11-09T22:13:10Z","abstract_excerpt":"Some of the most compelling applications of online convex optimization, including online prediction and classification, are unconstrained: the natural feasible set is R^n. Existing algorithms fail to achieve sub-linear regret in this setting unless constraints on the comparator point x^* are known in advance. We present algorithms that, without such prior knowledge, offer near-optimal regret bounds with respect to any choice of x^*. In particular, regret with respect to x^* = 0 is constant. We then prove lower bounds showing that our guarantees are near-optimal in this setting."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1211.2260","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-18T03:41:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CmxDZXqAL5Qs7ULFGfzHXvJ1KC8HcNX544RmC/LEEQ6IRSOZ6hszve7v/iDa4udYn1piRafWm4GVqBrffc+0BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-09T22:03:03.053653Z"},"content_sha256":"a88ed6895bafd13829d74cf5b88420d3050977a40137624ca2d210648b4e24a5","schema_version":"1.0","event_id":"sha256:a88ed6895bafd13829d74cf5b88420d3050977a40137624ca2d210648b4e24a5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2APP2GZCRASYH3K5RIX7I36ODH/bundle.json","state_url":"https://pith.science/pith/2APP2GZCRASYH3K5RIX7I36ODH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2APP2GZCRASYH3K5RIX7I36ODH/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-08-09T22:03:03Z","links":{"resolver":"https://pith.science/pith/2APP2GZCRASYH3K5RIX7I36ODH","bundle":"https://pith.science/pith/2APP2GZCRASYH3K5RIX7I36ODH/bundle.json","state":"https://pith.science/pith/2APP2GZCRASYH3K5RIX7I36ODH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2APP2GZCRASYH3K5RIX7I36ODH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:2APP2GZCRASYH3K5RIX7I36ODH","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":"94d2d04490a51f25ee4943fd32a5ac54e3b6f638ece451cf1b0492cdefc2e62d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-11-09T22:13:10Z","title_canon_sha256":"46a7f55e89355fc6158ffd92629792cc9a37e72a199b10b9da2af9650df4399f"},"schema_version":"1.0","source":{"id":"1211.2260","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1211.2260","created_at":"2026-05-18T03:41:03Z"},{"alias_kind":"arxiv_version","alias_value":"1211.2260v1","created_at":"2026-05-18T03:41:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1211.2260","created_at":"2026-05-18T03:41:03Z"},{"alias_kind":"pith_short_12","alias_value":"2APP2GZCRASY","created_at":"2026-05-18T12:26:50Z"},{"alias_kind":"pith_short_16","alias_value":"2APP2GZCRASYH3K5","created_at":"2026-05-18T12:26:50Z"},{"alias_kind":"pith_short_8","alias_value":"2APP2GZC","created_at":"2026-05-18T12:26:50Z"}],"graph_snapshots":[{"event_id":"sha256:a88ed6895bafd13829d74cf5b88420d3050977a40137624ca2d210648b4e24a5","target":"graph","created_at":"2026-05-18T03:41:03Z","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":"Some of the most compelling applications of online convex optimization, including online prediction and classification, are unconstrained: the natural feasible set is R^n. Existing algorithms fail to achieve sub-linear regret in this setting unless constraints on the comparator point x^* are known in advance. We present algorithms that, without such prior knowledge, offer near-optimal regret bounds with respect to any choice of x^*. In particular, regret with respect to x^* = 0 is constant. We then prove lower bounds showing that our guarantees are near-optimal in this setting.","authors_text":"H. Brendan McMahan, Matthew Streeter","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-11-09T22:13:10Z","title":"No-Regret Algorithms for Unconstrained Online Convex Optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1211.2260","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:3365349d0b58003f3c1233504d9ce621645144d10ade8b0d8b4b3d16f2e844bc","target":"record","created_at":"2026-05-18T03:41:03Z","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":"94d2d04490a51f25ee4943fd32a5ac54e3b6f638ece451cf1b0492cdefc2e62d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-11-09T22:13:10Z","title_canon_sha256":"46a7f55e89355fc6158ffd92629792cc9a37e72a199b10b9da2af9650df4399f"},"schema_version":"1.0","source":{"id":"1211.2260","kind":"arxiv","version":1}},"canonical_sha256":"d01efd1b22882583ed5d8a2ff46fce19cd2148f96253117ff2a059716afb1dbf","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d01efd1b22882583ed5d8a2ff46fce19cd2148f96253117ff2a059716afb1dbf","first_computed_at":"2026-05-18T03:41:03.966277Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:41:03.966277Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"9mjHbGL6GuduDVs/NHY+ZwGAOd1urfQlNyTw2SDwpfvdHOOQPrEJgpOjpQogbW+Ovv/I20dCeDmkcHtwuR2gBg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:41:03.966997Z","signed_message":"canonical_sha256_bytes"},"source_id":"1211.2260","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3365349d0b58003f3c1233504d9ce621645144d10ade8b0d8b4b3d16f2e844bc","sha256:a88ed6895bafd13829d74cf5b88420d3050977a40137624ca2d210648b4e24a5"],"state_sha256":"e752dfacc8c848e20150fa1b42a4cca12354b960af93ec058c97f5dde70efad5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HRo3bZJRaWowZzkkJ8wYrGSbUVbLlUstDik2+EHX1iandzn2rOeXRPlPZyFe1TZ7juLRfYlPtyRKYaeA7f5QDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-09T22:03:03.057544Z","bundle_sha256":"be6715ba7e4c21e1bcfc4289161f8aee3f68835b4b10e4cb805d78d942ab4039"}}