{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2022:FCCEFFWJC7I2UD4KZGVGBLOXQS","short_pith_number":"pith:FCCEFFWJ","canonical_record":{"source":{"id":"2211.11219","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2022-11-21T07:29:08Z","cross_cats_sorted":[],"title_canon_sha256":"27574b1224c9868e3e91ebd9cd7add76e974f272fd091bc9a411bee24dce4826","abstract_canon_sha256":"8ce4d24edf82723c29f9c074f53ca7a054ecca3472b6f2de07c0828e0fa654dc"},"schema_version":"1.0"},"canonical_sha256":"28844296c917d1aa0f8ac9aa60add784b5a67b659693ef21c7a225a9fee9d0dc","source":{"kind":"arxiv","id":"2211.11219","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2211.11219","created_at":"2026-07-05T05:17:51Z"},{"alias_kind":"arxiv_version","alias_value":"2211.11219v1","created_at":"2026-07-05T05:17:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2211.11219","created_at":"2026-07-05T05:17:51Z"},{"alias_kind":"pith_short_12","alias_value":"FCCEFFWJC7I2","created_at":"2026-07-05T05:17:51Z"},{"alias_kind":"pith_short_16","alias_value":"FCCEFFWJC7I2UD4K","created_at":"2026-07-05T05:17:51Z"},{"alias_kind":"pith_short_8","alias_value":"FCCEFFWJ","created_at":"2026-07-05T05:17:51Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2022:FCCEFFWJC7I2UD4KZGVGBLOXQS","target":"record","payload":{"canonical_record":{"source":{"id":"2211.11219","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2022-11-21T07:29:08Z","cross_cats_sorted":[],"title_canon_sha256":"27574b1224c9868e3e91ebd9cd7add76e974f272fd091bc9a411bee24dce4826","abstract_canon_sha256":"8ce4d24edf82723c29f9c074f53ca7a054ecca3472b6f2de07c0828e0fa654dc"},"schema_version":"1.0"},"canonical_sha256":"28844296c917d1aa0f8ac9aa60add784b5a67b659693ef21c7a225a9fee9d0dc","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:17:51.365418Z","signature_b64":"S/4+b9LWj8eaZr1ZurN/xwVJ6GApIDg0hYoNu+NzrRw7AtNOcrOwAFPWNp9V5gqd7bC1N5FkmIj19oQV1ZRuBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"28844296c917d1aa0f8ac9aa60add784b5a67b659693ef21c7a225a9fee9d0dc","last_reissued_at":"2026-07-05T05:17:51.364910Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:17:51.364910Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2211.11219","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-07-05T05:17:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3H3juzhAtVtxezO3PsLXN/cnjtir6jIHgbJIszV0qtbKNSM0JRJJallZnCafzkvXrSa9g+MzH21JqiWXMKEzAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-11T16:06:18.306046Z"},"content_sha256":"7461b43e1d5bddf2896bfc8ad65a3562f3574e608947910d83af68d37b3fa458","schema_version":"1.0","event_id":"sha256:7461b43e1d5bddf2896bfc8ad65a3562f3574e608947910d83af68d37b3fa458"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2022:FCCEFFWJC7I2UD4KZGVGBLOXQS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Best of Both Worlds in Online Control: Competitive Ratio and Policy Regret","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Elad Hazan, Gautam Goel, Karan Singh, Naman Agarwal","submitted_at":"2022-11-21T07:29:08Z","abstract_excerpt":"We consider the fundamental problem of online control of a linear dynamical system from two different viewpoints: regret minimization and competitive analysis. We prove that the optimal competitive policy is well-approximated by a convex parameterized policy class, known as a disturbance-action control (DAC) policies. Using this structural result, we show that several recently proposed online control algorithms achieve the best of both worlds: sublinear regret vs. the best DAC policy selected in hindsight, and optimal competitive ratio, up to an additive correction which grows sublinearly in t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2211.11219","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2211.11219/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T05:17:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qYpX1brjCaeUBBv+S7YtarRDaf8SFul5C20I39gHzgEd3pyvhrMDHHJi2LivXdoVSEs4unp3KaYIESPbgZtsDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-11T16:06:18.306740Z"},"content_sha256":"0466b29443afde8aca0c02c4c771052c66a13c873f5e854d8dcd3550a20a9e02","schema_version":"1.0","event_id":"sha256:0466b29443afde8aca0c02c4c771052c66a13c873f5e854d8dcd3550a20a9e02"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FCCEFFWJC7I2UD4KZGVGBLOXQS/bundle.json","state_url":"https://pith.science/pith/FCCEFFWJC7I2UD4KZGVGBLOXQS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FCCEFFWJC7I2UD4KZGVGBLOXQS/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-11T16:06:18Z","links":{"resolver":"https://pith.science/pith/FCCEFFWJC7I2UD4KZGVGBLOXQS","bundle":"https://pith.science/pith/FCCEFFWJC7I2UD4KZGVGBLOXQS/bundle.json","state":"https://pith.science/pith/FCCEFFWJC7I2UD4KZGVGBLOXQS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FCCEFFWJC7I2UD4KZGVGBLOXQS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:FCCEFFWJC7I2UD4KZGVGBLOXQS","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":"8ce4d24edf82723c29f9c074f53ca7a054ecca3472b6f2de07c0828e0fa654dc","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2022-11-21T07:29:08Z","title_canon_sha256":"27574b1224c9868e3e91ebd9cd7add76e974f272fd091bc9a411bee24dce4826"},"schema_version":"1.0","source":{"id":"2211.11219","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2211.11219","created_at":"2026-07-05T05:17:51Z"},{"alias_kind":"arxiv_version","alias_value":"2211.11219v1","created_at":"2026-07-05T05:17:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2211.11219","created_at":"2026-07-05T05:17:51Z"},{"alias_kind":"pith_short_12","alias_value":"FCCEFFWJC7I2","created_at":"2026-07-05T05:17:51Z"},{"alias_kind":"pith_short_16","alias_value":"FCCEFFWJC7I2UD4K","created_at":"2026-07-05T05:17:51Z"},{"alias_kind":"pith_short_8","alias_value":"FCCEFFWJ","created_at":"2026-07-05T05:17:51Z"}],"graph_snapshots":[{"event_id":"sha256:0466b29443afde8aca0c02c4c771052c66a13c873f5e854d8dcd3550a20a9e02","target":"graph","created_at":"2026-07-05T05:17:51Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2211.11219/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We consider the fundamental problem of online control of a linear dynamical system from two different viewpoints: regret minimization and competitive analysis. We prove that the optimal competitive policy is well-approximated by a convex parameterized policy class, known as a disturbance-action control (DAC) policies. Using this structural result, we show that several recently proposed online control algorithms achieve the best of both worlds: sublinear regret vs. the best DAC policy selected in hindsight, and optimal competitive ratio, up to an additive correction which grows sublinearly in t","authors_text":"Elad Hazan, Gautam Goel, Karan Singh, Naman Agarwal","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2022-11-21T07:29:08Z","title":"Best of Both Worlds in Online Control: Competitive Ratio and Policy Regret"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2211.11219","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:7461b43e1d5bddf2896bfc8ad65a3562f3574e608947910d83af68d37b3fa458","target":"record","created_at":"2026-07-05T05:17:51Z","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":"8ce4d24edf82723c29f9c074f53ca7a054ecca3472b6f2de07c0828e0fa654dc","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2022-11-21T07:29:08Z","title_canon_sha256":"27574b1224c9868e3e91ebd9cd7add76e974f272fd091bc9a411bee24dce4826"},"schema_version":"1.0","source":{"id":"2211.11219","kind":"arxiv","version":1}},"canonical_sha256":"28844296c917d1aa0f8ac9aa60add784b5a67b659693ef21c7a225a9fee9d0dc","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"28844296c917d1aa0f8ac9aa60add784b5a67b659693ef21c7a225a9fee9d0dc","first_computed_at":"2026-07-05T05:17:51.364910Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T05:17:51.364910Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"S/4+b9LWj8eaZr1ZurN/xwVJ6GApIDg0hYoNu+NzrRw7AtNOcrOwAFPWNp9V5gqd7bC1N5FkmIj19oQV1ZRuBw==","signature_status":"signed_v1","signed_at":"2026-07-05T05:17:51.365418Z","signed_message":"canonical_sha256_bytes"},"source_id":"2211.11219","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7461b43e1d5bddf2896bfc8ad65a3562f3574e608947910d83af68d37b3fa458","sha256:0466b29443afde8aca0c02c4c771052c66a13c873f5e854d8dcd3550a20a9e02"],"state_sha256":"a1e286a262909a0cac4c0a16d9aabe67ed37b453c034c0a138a88568340805ac"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bzMU2DsOSmP5RDkL0BAXFEfS0fpUqHnw/ddWTsQeybOrWd4GwmzgVWBfHZY5pI8m5cuZVZIMhYexOJGkWV1lAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-11T16:06:18.312274Z","bundle_sha256":"ab6e78c8d86005bd7c58ef360f71bfd2c25057a04d0047e5bb824704849efd2e"}}