{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:QATMRBFYAMCCW6GYJ5BGWGAXYW","short_pith_number":"pith:QATMRBFY","canonical_record":{"source":{"id":"1508.03769","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-08-15T20:53:06Z","cross_cats_sorted":[],"title_canon_sha256":"f0677603226bfeecc43ef16795285989049d383804f0678c02a9b9092fed670b","abstract_canon_sha256":"b87f44da65aa0489afd616e462a51c7ad73954ee98fd18e7c2b2204d7ced9199"},"schema_version":"1.0"},"canonical_sha256":"8026c884b803042b78d84f426b1817c5881a6478fc9b29c6202a22ad5d6bc1eb","source":{"kind":"arxiv","id":"1508.03769","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1508.03769","created_at":"2026-05-18T01:35:15Z"},{"alias_kind":"arxiv_version","alias_value":"1508.03769v1","created_at":"2026-05-18T01:35:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1508.03769","created_at":"2026-05-18T01:35:15Z"},{"alias_kind":"pith_short_12","alias_value":"QATMRBFYAMCC","created_at":"2026-05-18T12:29:37Z"},{"alias_kind":"pith_short_16","alias_value":"QATMRBFYAMCCW6GY","created_at":"2026-05-18T12:29:37Z"},{"alias_kind":"pith_short_8","alias_value":"QATMRBFY","created_at":"2026-05-18T12:29:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:QATMRBFYAMCCW6GYJ5BGWGAXYW","target":"record","payload":{"canonical_record":{"source":{"id":"1508.03769","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-08-15T20:53:06Z","cross_cats_sorted":[],"title_canon_sha256":"f0677603226bfeecc43ef16795285989049d383804f0678c02a9b9092fed670b","abstract_canon_sha256":"b87f44da65aa0489afd616e462a51c7ad73954ee98fd18e7c2b2204d7ced9199"},"schema_version":"1.0"},"canonical_sha256":"8026c884b803042b78d84f426b1817c5881a6478fc9b29c6202a22ad5d6bc1eb","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:35:15.272371Z","signature_b64":"nh7WO6/ANObtvIRw5lP78MU4Apf4MFk1PianuhT85IFAXK0mkYQVvCwA+VVoVFeVLKOHNTIMHPoflLbkesHyCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8026c884b803042b78d84f426b1817c5881a6478fc9b29c6202a22ad5d6bc1eb","last_reissued_at":"2026-05-18T01:35:15.271835Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:35:15.271835Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1508.03769","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-18T01:35:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sFY0ddrh4rHZRk1ezzBuQwxex8ZM3fINbptgeGJNteTWtQj6S7K76ybIxCGal45WY/vdYcxDEhlIwCoPluHOBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T06:12:35.577005Z"},"content_sha256":"1817b3700f42b4f42704c7edf50bfd313dc40f887534a9da73e75228d0ca63e3","schema_version":"1.0","event_id":"sha256:1817b3700f42b4f42704c7edf50bfd313dc40f887534a9da73e75228d0ca63e3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:QATMRBFYAMCCW6GYJ5BGWGAXYW","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Tale of Two Metrics: Simultaneous Bounds on Competitiveness and Regret","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Adam Meyerson, Adam Wierman, Alan Roytman, Katrina Ligett, Lachlan L. H. Andrew, Minghong Lin, Siddharth Barman","submitted_at":"2015-08-15T20:53:06Z","abstract_excerpt":"We consider algorithms for \"smoothed online convex optimization\" problems, a variant of the class of online convex optimization problems that is strongly related to metrical task systems. Prior literature on these problems has focused on two performance metrics: regret and the competitive ratio. There exist known algorithms with sublinear regret and known algorithms with constant competitive ratios; however, no known algorithm achieves both simultaneously. We show that this is due to a fundamental incompatibility between these two metrics - no algorithm (deterministic or randomized) can achiev"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1508.03769","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-18T01:35:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8qX5+rdfw0I+gNtBjPCQHgmM03Vh/aIRlQ4f3wQVqen1nFWYw8DGqFzo+lAcvptJt/PXLVAs9jZvTzguVniKBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T06:12:35.577644Z"},"content_sha256":"d7fd926833ed5f31fd6478806213bfb1b8c8e7f51e3a4489e15e05761bb17e13","schema_version":"1.0","event_id":"sha256:d7fd926833ed5f31fd6478806213bfb1b8c8e7f51e3a4489e15e05761bb17e13"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QATMRBFYAMCCW6GYJ5BGWGAXYW/bundle.json","state_url":"https://pith.science/pith/QATMRBFYAMCCW6GYJ5BGWGAXYW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QATMRBFYAMCCW6GYJ5BGWGAXYW/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-07T06:12:35Z","links":{"resolver":"https://pith.science/pith/QATMRBFYAMCCW6GYJ5BGWGAXYW","bundle":"https://pith.science/pith/QATMRBFYAMCCW6GYJ5BGWGAXYW/bundle.json","state":"https://pith.science/pith/QATMRBFYAMCCW6GYJ5BGWGAXYW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QATMRBFYAMCCW6GYJ5BGWGAXYW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:QATMRBFYAMCCW6GYJ5BGWGAXYW","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":"b87f44da65aa0489afd616e462a51c7ad73954ee98fd18e7c2b2204d7ced9199","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-08-15T20:53:06Z","title_canon_sha256":"f0677603226bfeecc43ef16795285989049d383804f0678c02a9b9092fed670b"},"schema_version":"1.0","source":{"id":"1508.03769","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1508.03769","created_at":"2026-05-18T01:35:15Z"},{"alias_kind":"arxiv_version","alias_value":"1508.03769v1","created_at":"2026-05-18T01:35:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1508.03769","created_at":"2026-05-18T01:35:15Z"},{"alias_kind":"pith_short_12","alias_value":"QATMRBFYAMCC","created_at":"2026-05-18T12:29:37Z"},{"alias_kind":"pith_short_16","alias_value":"QATMRBFYAMCCW6GY","created_at":"2026-05-18T12:29:37Z"},{"alias_kind":"pith_short_8","alias_value":"QATMRBFY","created_at":"2026-05-18T12:29:37Z"}],"graph_snapshots":[{"event_id":"sha256:d7fd926833ed5f31fd6478806213bfb1b8c8e7f51e3a4489e15e05761bb17e13","target":"graph","created_at":"2026-05-18T01:35:15Z","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 algorithms for \"smoothed online convex optimization\" problems, a variant of the class of online convex optimization problems that is strongly related to metrical task systems. Prior literature on these problems has focused on two performance metrics: regret and the competitive ratio. There exist known algorithms with sublinear regret and known algorithms with constant competitive ratios; however, no known algorithm achieves both simultaneously. We show that this is due to a fundamental incompatibility between these two metrics - no algorithm (deterministic or randomized) can achiev","authors_text":"Adam Meyerson, Adam Wierman, Alan Roytman, Katrina Ligett, Lachlan L. H. Andrew, Minghong Lin, Siddharth Barman","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-08-15T20:53:06Z","title":"A Tale of Two Metrics: Simultaneous Bounds on Competitiveness and Regret"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1508.03769","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:1817b3700f42b4f42704c7edf50bfd313dc40f887534a9da73e75228d0ca63e3","target":"record","created_at":"2026-05-18T01:35:15Z","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":"b87f44da65aa0489afd616e462a51c7ad73954ee98fd18e7c2b2204d7ced9199","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-08-15T20:53:06Z","title_canon_sha256":"f0677603226bfeecc43ef16795285989049d383804f0678c02a9b9092fed670b"},"schema_version":"1.0","source":{"id":"1508.03769","kind":"arxiv","version":1}},"canonical_sha256":"8026c884b803042b78d84f426b1817c5881a6478fc9b29c6202a22ad5d6bc1eb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8026c884b803042b78d84f426b1817c5881a6478fc9b29c6202a22ad5d6bc1eb","first_computed_at":"2026-05-18T01:35:15.271835Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:35:15.271835Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"nh7WO6/ANObtvIRw5lP78MU4Apf4MFk1PianuhT85IFAXK0mkYQVvCwA+VVoVFeVLKOHNTIMHPoflLbkesHyCg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:35:15.272371Z","signed_message":"canonical_sha256_bytes"},"source_id":"1508.03769","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1817b3700f42b4f42704c7edf50bfd313dc40f887534a9da73e75228d0ca63e3","sha256:d7fd926833ed5f31fd6478806213bfb1b8c8e7f51e3a4489e15e05761bb17e13"],"state_sha256":"229146ed7d53f99fb890599f9a6829a6be7e93158224b08660b345da5f286bdd"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"T1YXQ4olJ/sS6x+tCDQweNmvJS2e+BXu0Zy42sawy6pndD4SGDEhNK0o2+Mvv9uUAyxwTsvHAyZtCPGpz6hKAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T06:12:35.580730Z","bundle_sha256":"a4dda00f1abb57e58ef7f5a33dd9b8e603fdf8574a35506e18e5fbc5e8247d81"}}