{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:CZ4OPOEBZ7TBTHOCFYNKRG5CPB","short_pith_number":"pith:CZ4OPOEB","canonical_record":{"source":{"id":"2511.22283","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2025-11-27T10:09:07Z","cross_cats_sorted":[],"title_canon_sha256":"d0c93111fbbe08d3ed3a7436fad6f3e2292d39e18e3b1af4a4d798c4e9dbf6fe","abstract_canon_sha256":"8029a2acab25b54d517aa37c8c6c2079d494d95317ab1bd34ea93e797c2e5c94"},"schema_version":"1.0"},"canonical_sha256":"1678e7b881cfe6199dc22e1aa89ba2787edf9cedce34894ea303566bff301ce5","source":{"kind":"arxiv","id":"2511.22283","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2511.22283","created_at":"2026-06-19T16:12:49Z"},{"alias_kind":"arxiv_version","alias_value":"2511.22283v2","created_at":"2026-06-19T16:12:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2511.22283","created_at":"2026-06-19T16:12:49Z"},{"alias_kind":"pith_short_12","alias_value":"CZ4OPOEBZ7TB","created_at":"2026-06-19T16:12:49Z"},{"alias_kind":"pith_short_16","alias_value":"CZ4OPOEBZ7TBTHOC","created_at":"2026-06-19T16:12:49Z"},{"alias_kind":"pith_short_8","alias_value":"CZ4OPOEB","created_at":"2026-06-19T16:12:49Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:CZ4OPOEBZ7TBTHOCFYNKRG5CPB","target":"record","payload":{"canonical_record":{"source":{"id":"2511.22283","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2025-11-27T10:09:07Z","cross_cats_sorted":[],"title_canon_sha256":"d0c93111fbbe08d3ed3a7436fad6f3e2292d39e18e3b1af4a4d798c4e9dbf6fe","abstract_canon_sha256":"8029a2acab25b54d517aa37c8c6c2079d494d95317ab1bd34ea93e797c2e5c94"},"schema_version":"1.0"},"canonical_sha256":"1678e7b881cfe6199dc22e1aa89ba2787edf9cedce34894ea303566bff301ce5","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-19T16:12:49.262442Z","signature_b64":"yEsvc1H5a0h9JQG0AuAj7VROdlbXgyJMpTmsIhIx46JJIZYCjh6OqrTUAZACIx2LbHmHeIpQuDvXnYLkIBSvCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1678e7b881cfe6199dc22e1aa89ba2787edf9cedce34894ea303566bff301ce5","last_reissued_at":"2026-06-19T16:12:49.261990Z","signature_status":"signed_v1","first_computed_at":"2026-06-19T16:12:49.261990Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2511.22283","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-06-19T16:12:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HO05n1BXKQCDHErwbhri416YlGSrIqJOimQg5ZFwx3aNArYNxhp4sRfu9VuNShsi0wB8F3Lc6gt9j7A821lpBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-30T19:24:16.740681Z"},"content_sha256":"d1c2fb4d7dcdf8b53ccafe6370dd8ce8d7c46e54f39562428035a9e93b67325b","schema_version":"1.0","event_id":"sha256:d1c2fb4d7dcdf8b53ccafe6370dd8ce8d7c46e54f39562428035a9e93b67325b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:CZ4OPOEBZ7TBTHOCFYNKRG5CPB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The Hidden Cost of Approximation in Online Mirror Descent","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Ofir Schlisselberg, Tomer Koren, Uri Sherman, Yishay Mansour","submitted_at":"2025-11-27T10:09:07Z","abstract_excerpt":"Online mirror descent (OMD) is a fundamental algorithmic paradigm that underlies many algorithms in optimization, machine learning and sequential decision-making. The OMD iterates are defined as solutions to optimization subproblems which, oftentimes, can be solved only approximately, leading to an inexact version of the algorithm. Nonetheless, existing OMD analyses typically assume an idealized error free setting, thereby limiting our understanding of performance guarantees that should be expected in practice. In this work we initiate a systematic study into inexact OMD, and uncover an intric"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2511.22283","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2511.22283/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-06-19T16:12:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZMadpEX/me3mGVC9NtVHq870HRJCQynqc+uuYLjzB83ztNMw69bWWgpbV/6SCKaeQIPnbIk/jsq555CIOw5BCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-30T19:24:16.741065Z"},"content_sha256":"a8f947edb2f032207d823f857e8413a1654ce0553232b052c2a24de9494bb227","schema_version":"1.0","event_id":"sha256:a8f947edb2f032207d823f857e8413a1654ce0553232b052c2a24de9494bb227"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CZ4OPOEBZ7TBTHOCFYNKRG5CPB/bundle.json","state_url":"https://pith.science/pith/CZ4OPOEBZ7TBTHOCFYNKRG5CPB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CZ4OPOEBZ7TBTHOCFYNKRG5CPB/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-30T19:24:16Z","links":{"resolver":"https://pith.science/pith/CZ4OPOEBZ7TBTHOCFYNKRG5CPB","bundle":"https://pith.science/pith/CZ4OPOEBZ7TBTHOCFYNKRG5CPB/bundle.json","state":"https://pith.science/pith/CZ4OPOEBZ7TBTHOCFYNKRG5CPB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CZ4OPOEBZ7TBTHOCFYNKRG5CPB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:CZ4OPOEBZ7TBTHOCFYNKRG5CPB","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":"8029a2acab25b54d517aa37c8c6c2079d494d95317ab1bd34ea93e797c2e5c94","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2025-11-27T10:09:07Z","title_canon_sha256":"d0c93111fbbe08d3ed3a7436fad6f3e2292d39e18e3b1af4a4d798c4e9dbf6fe"},"schema_version":"1.0","source":{"id":"2511.22283","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2511.22283","created_at":"2026-06-19T16:12:49Z"},{"alias_kind":"arxiv_version","alias_value":"2511.22283v2","created_at":"2026-06-19T16:12:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2511.22283","created_at":"2026-06-19T16:12:49Z"},{"alias_kind":"pith_short_12","alias_value":"CZ4OPOEBZ7TB","created_at":"2026-06-19T16:12:49Z"},{"alias_kind":"pith_short_16","alias_value":"CZ4OPOEBZ7TBTHOC","created_at":"2026-06-19T16:12:49Z"},{"alias_kind":"pith_short_8","alias_value":"CZ4OPOEB","created_at":"2026-06-19T16:12:49Z"}],"graph_snapshots":[{"event_id":"sha256:a8f947edb2f032207d823f857e8413a1654ce0553232b052c2a24de9494bb227","target":"graph","created_at":"2026-06-19T16:12:49Z","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/2511.22283/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Online mirror descent (OMD) is a fundamental algorithmic paradigm that underlies many algorithms in optimization, machine learning and sequential decision-making. The OMD iterates are defined as solutions to optimization subproblems which, oftentimes, can be solved only approximately, leading to an inexact version of the algorithm. Nonetheless, existing OMD analyses typically assume an idealized error free setting, thereby limiting our understanding of performance guarantees that should be expected in practice. In this work we initiate a systematic study into inexact OMD, and uncover an intric","authors_text":"Ofir Schlisselberg, Tomer Koren, Uri Sherman, Yishay Mansour","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2025-11-27T10:09:07Z","title":"The Hidden Cost of Approximation in Online Mirror Descent"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2511.22283","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:d1c2fb4d7dcdf8b53ccafe6370dd8ce8d7c46e54f39562428035a9e93b67325b","target":"record","created_at":"2026-06-19T16:12:49Z","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":"8029a2acab25b54d517aa37c8c6c2079d494d95317ab1bd34ea93e797c2e5c94","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2025-11-27T10:09:07Z","title_canon_sha256":"d0c93111fbbe08d3ed3a7436fad6f3e2292d39e18e3b1af4a4d798c4e9dbf6fe"},"schema_version":"1.0","source":{"id":"2511.22283","kind":"arxiv","version":2}},"canonical_sha256":"1678e7b881cfe6199dc22e1aa89ba2787edf9cedce34894ea303566bff301ce5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1678e7b881cfe6199dc22e1aa89ba2787edf9cedce34894ea303566bff301ce5","first_computed_at":"2026-06-19T16:12:49.261990Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-19T16:12:49.261990Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"yEsvc1H5a0h9JQG0AuAj7VROdlbXgyJMpTmsIhIx46JJIZYCjh6OqrTUAZACIx2LbHmHeIpQuDvXnYLkIBSvCw==","signature_status":"signed_v1","signed_at":"2026-06-19T16:12:49.262442Z","signed_message":"canonical_sha256_bytes"},"source_id":"2511.22283","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d1c2fb4d7dcdf8b53ccafe6370dd8ce8d7c46e54f39562428035a9e93b67325b","sha256:a8f947edb2f032207d823f857e8413a1654ce0553232b052c2a24de9494bb227"],"state_sha256":"c29e5f5ff0652ac692d3fb1f7e2c7156c2c91eb449953d61479a62067768ad2f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dhx63/u8wr3E9IFezsBFC41+GhaCc/TxXajw9kaU321FtmrIicRA1UiGku34NLKg93cGTD3yb7q3AfJp1XEZAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-30T19:24:16.743260Z","bundle_sha256":"0a6042461ee7b05462ebd260c64b4f680ca26a0b3cbb3900910c1999602b39bb"}}