{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:ZDYPJWLIN3K3BJI2D4LE5C2JSL","short_pith_number":"pith:ZDYPJWLI","canonical_record":{"source":{"id":"1602.05394","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-02-17T12:57:08Z","cross_cats_sorted":["cs.LG","math.OC","math.ST","stat.TH"],"title_canon_sha256":"5ae37f13279118fd9288cbf3cb92d0ce941d22b3296161afb61c8807d2ec1b35","abstract_canon_sha256":"b71f4a1e0898493aab818af73808a628e74b1c5aad61495e61117effe7623306"},"schema_version":"1.0"},"canonical_sha256":"c8f0f4d9686ed5b0a51a1f164e8b4992d318b7ec88595e5f4ae30da9223a2bd7","source":{"kind":"arxiv","id":"1602.05394","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.05394","created_at":"2026-05-18T01:12:43Z"},{"alias_kind":"arxiv_version","alias_value":"1602.05394v2","created_at":"2026-05-18T01:12:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.05394","created_at":"2026-05-18T01:12:43Z"},{"alias_kind":"pith_short_12","alias_value":"ZDYPJWLIN3K3","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_16","alias_value":"ZDYPJWLIN3K3BJI2","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_8","alias_value":"ZDYPJWLI","created_at":"2026-05-18T12:30:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:ZDYPJWLIN3K3BJI2D4LE5C2JSL","target":"record","payload":{"canonical_record":{"source":{"id":"1602.05394","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-02-17T12:57:08Z","cross_cats_sorted":["cs.LG","math.OC","math.ST","stat.TH"],"title_canon_sha256":"5ae37f13279118fd9288cbf3cb92d0ce941d22b3296161afb61c8807d2ec1b35","abstract_canon_sha256":"b71f4a1e0898493aab818af73808a628e74b1c5aad61495e61117effe7623306"},"schema_version":"1.0"},"canonical_sha256":"c8f0f4d9686ed5b0a51a1f164e8b4992d318b7ec88595e5f4ae30da9223a2bd7","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:12:43.201419Z","signature_b64":"E+2Cjh5u9xafuN5GkFIGqEjAVAw5FK7a8vG1hsWK5o41f3hpLdT91Z6Ed4Qv8fJiILggNng9TB0BphTgNE8tAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c8f0f4d9686ed5b0a51a1f164e8b4992d318b7ec88595e5f4ae30da9223a2bd7","last_reissued_at":"2026-05-18T01:12:43.201087Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:12:43.201087Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1602.05394","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-18T01:12:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"U07YlDR0j73mwYp0qZEuWojtGI0ft5AzsnbqYZLEGxuxIa5k1kOWcqzzdoyJPOcvYHgMOrE2FJVuZKwNlu/MDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T13:50:44.548453Z"},"content_sha256":"cacac494b88c236e13079661628eae09d2627edd1ed8c17f3bb5375357028ca0","schema_version":"1.0","event_id":"sha256:cacac494b88c236e13079661628eae09d2627edd1ed8c17f3bb5375357028ca0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:ZDYPJWLIN3K3BJI2D4LE5C2JSL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Online optimization and regret guarantees for non-additive long-term constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","math.OC","math.ST","stat.TH"],"primary_cat":"stat.ML","authors_text":"Cedric Archambeau, Dominik Csiba, Jim Huang, Rodolphe Jenatton","submitted_at":"2016-02-17T12:57:08Z","abstract_excerpt":"We consider online optimization in the 1-lookahead setting, where the objective does not decompose additively over the rounds of the online game. The resulting formulation enables us to deal with non-stationary and/or long-term constraints , which arise, for example, in online display advertising problems. We propose an on-line primal-dual algorithm for which we obtain dynamic cumulative regret guarantees. They depend on the convexity and the smoothness of the non-additive penalty, as well as terms capturing the smoothness with which the residuals of the non-stationary and long-term constraint"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.05394","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-18T01:12:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DcecWRDP/OvDwZBzvDPyylf2y3oe11Dju5O6TnbGQYVUwg1hgJrJx3MfTWuAxj3AWrMEy2MJbcMT+37L/wrXBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T13:50:44.548821Z"},"content_sha256":"e28fc6428c0386e82a4ea56aa38a2e8bf3621d8046b03ef6627e0c3deea92bf9","schema_version":"1.0","event_id":"sha256:e28fc6428c0386e82a4ea56aa38a2e8bf3621d8046b03ef6627e0c3deea92bf9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZDYPJWLIN3K3BJI2D4LE5C2JSL/bundle.json","state_url":"https://pith.science/pith/ZDYPJWLIN3K3BJI2D4LE5C2JSL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZDYPJWLIN3K3BJI2D4LE5C2JSL/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-26T13:50:44Z","links":{"resolver":"https://pith.science/pith/ZDYPJWLIN3K3BJI2D4LE5C2JSL","bundle":"https://pith.science/pith/ZDYPJWLIN3K3BJI2D4LE5C2JSL/bundle.json","state":"https://pith.science/pith/ZDYPJWLIN3K3BJI2D4LE5C2JSL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZDYPJWLIN3K3BJI2D4LE5C2JSL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:ZDYPJWLIN3K3BJI2D4LE5C2JSL","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":"b71f4a1e0898493aab818af73808a628e74b1c5aad61495e61117effe7623306","cross_cats_sorted":["cs.LG","math.OC","math.ST","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-02-17T12:57:08Z","title_canon_sha256":"5ae37f13279118fd9288cbf3cb92d0ce941d22b3296161afb61c8807d2ec1b35"},"schema_version":"1.0","source":{"id":"1602.05394","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.05394","created_at":"2026-05-18T01:12:43Z"},{"alias_kind":"arxiv_version","alias_value":"1602.05394v2","created_at":"2026-05-18T01:12:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.05394","created_at":"2026-05-18T01:12:43Z"},{"alias_kind":"pith_short_12","alias_value":"ZDYPJWLIN3K3","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_16","alias_value":"ZDYPJWLIN3K3BJI2","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_8","alias_value":"ZDYPJWLI","created_at":"2026-05-18T12:30:53Z"}],"graph_snapshots":[{"event_id":"sha256:e28fc6428c0386e82a4ea56aa38a2e8bf3621d8046b03ef6627e0c3deea92bf9","target":"graph","created_at":"2026-05-18T01:12:43Z","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 consider online optimization in the 1-lookahead setting, where the objective does not decompose additively over the rounds of the online game. The resulting formulation enables us to deal with non-stationary and/or long-term constraints , which arise, for example, in online display advertising problems. We propose an on-line primal-dual algorithm for which we obtain dynamic cumulative regret guarantees. They depend on the convexity and the smoothness of the non-additive penalty, as well as terms capturing the smoothness with which the residuals of the non-stationary and long-term constraint","authors_text":"Cedric Archambeau, Dominik Csiba, Jim Huang, Rodolphe Jenatton","cross_cats":["cs.LG","math.OC","math.ST","stat.TH"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-02-17T12:57:08Z","title":"Online optimization and regret guarantees for non-additive long-term constraints"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.05394","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:cacac494b88c236e13079661628eae09d2627edd1ed8c17f3bb5375357028ca0","target":"record","created_at":"2026-05-18T01:12:43Z","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":"b71f4a1e0898493aab818af73808a628e74b1c5aad61495e61117effe7623306","cross_cats_sorted":["cs.LG","math.OC","math.ST","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-02-17T12:57:08Z","title_canon_sha256":"5ae37f13279118fd9288cbf3cb92d0ce941d22b3296161afb61c8807d2ec1b35"},"schema_version":"1.0","source":{"id":"1602.05394","kind":"arxiv","version":2}},"canonical_sha256":"c8f0f4d9686ed5b0a51a1f164e8b4992d318b7ec88595e5f4ae30da9223a2bd7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c8f0f4d9686ed5b0a51a1f164e8b4992d318b7ec88595e5f4ae30da9223a2bd7","first_computed_at":"2026-05-18T01:12:43.201087Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:12:43.201087Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"E+2Cjh5u9xafuN5GkFIGqEjAVAw5FK7a8vG1hsWK5o41f3hpLdT91Z6Ed4Qv8fJiILggNng9TB0BphTgNE8tAg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:12:43.201419Z","signed_message":"canonical_sha256_bytes"},"source_id":"1602.05394","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cacac494b88c236e13079661628eae09d2627edd1ed8c17f3bb5375357028ca0","sha256:e28fc6428c0386e82a4ea56aa38a2e8bf3621d8046b03ef6627e0c3deea92bf9"],"state_sha256":"0eba192d4cf4fa8ff21f3320c559516d803d3b22541b3778923803bf726946b1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+vr+MrpFHY34zn3XhUoB3Mfj/gNhZ5nR/vT283SKI1rCKfHqtLb1k+VHzmT+EMtupPWy3S4/I9my3OGkvx8YAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T13:50:44.551478Z","bundle_sha256":"516686b3c8baf8a878e0a2dce36e36f4e16170e1bf098a32df615406399ed2c0"}}