{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:QATMRBFYAMCCW6GYJ5BGWGAXYW","short_pith_number":"pith:QATMRBFY","schema_version":"1.0","canonical_sha256":"8026c884b803042b78d84f426b1817c5881a6478fc9b29c6202a22ad5d6bc1eb","source":{"kind":"arxiv","id":"1508.03769","version":1},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1508.03769","created_at":"2026-05-18T01:35:15.271900+00:00"},{"alias_kind":"arxiv_version","alias_value":"1508.03769v1","created_at":"2026-05-18T01:35:15.271900+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1508.03769","created_at":"2026-05-18T01:35:15.271900+00:00"},{"alias_kind":"pith_short_12","alias_value":"QATMRBFYAMCC","created_at":"2026-05-18T12:29:37.295048+00:00"},{"alias_kind":"pith_short_16","alias_value":"QATMRBFYAMCCW6GY","created_at":"2026-05-18T12:29:37.295048+00:00"},{"alias_kind":"pith_short_8","alias_value":"QATMRBFY","created_at":"2026-05-18T12:29:37.295048+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/QATMRBFYAMCCW6GYJ5BGWGAXYW","json":"https://pith.science/pith/QATMRBFYAMCCW6GYJ5BGWGAXYW.json","graph_json":"https://pith.science/api/pith-number/QATMRBFYAMCCW6GYJ5BGWGAXYW/graph.json","events_json":"https://pith.science/api/pith-number/QATMRBFYAMCCW6GYJ5BGWGAXYW/events.json","paper":"https://pith.science/paper/QATMRBFY"},"agent_actions":{"view_html":"https://pith.science/pith/QATMRBFYAMCCW6GYJ5BGWGAXYW","download_json":"https://pith.science/pith/QATMRBFYAMCCW6GYJ5BGWGAXYW.json","view_paper":"https://pith.science/paper/QATMRBFY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1508.03769&json=true","fetch_graph":"https://pith.science/api/pith-number/QATMRBFYAMCCW6GYJ5BGWGAXYW/graph.json","fetch_events":"https://pith.science/api/pith-number/QATMRBFYAMCCW6GYJ5BGWGAXYW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QATMRBFYAMCCW6GYJ5BGWGAXYW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QATMRBFYAMCCW6GYJ5BGWGAXYW/action/storage_attestation","attest_author":"https://pith.science/pith/QATMRBFYAMCCW6GYJ5BGWGAXYW/action/author_attestation","sign_citation":"https://pith.science/pith/QATMRBFYAMCCW6GYJ5BGWGAXYW/action/citation_signature","submit_replication":"https://pith.science/pith/QATMRBFYAMCCW6GYJ5BGWGAXYW/action/replication_record"}},"created_at":"2026-05-18T01:35:15.271900+00:00","updated_at":"2026-05-18T01:35:15.271900+00:00"}