{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:FTMH47TSVBCXCK7MHUQL2PGWDK","short_pith_number":"pith:FTMH47TS","schema_version":"1.0","canonical_sha256":"2cd87e7e72a845712bec3d20bd3cd61a8e6ea34addc27e91450c36dff8063fc1","source":{"kind":"arxiv","id":"1611.00507","version":1},"attestation_state":"computed","paper":{"title":"Worst Case Competitive Analysis of Online Algorithms for Conic Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.DS","authors_text":"Maryam Fazel, Reza Eghbali","submitted_at":"2016-11-02T08:55:04Z","abstract_excerpt":"Online optimization covers problems such as online resource allocation, online bipartite matching, adwords (a central problem in e-commerce and advertising), and adwords with separable concave returns. We analyze the worst case competitive ratio of two primal-dual algorithms for a class of online convex (conic) optimization problems that contains the previous examples as special cases defined on the positive orthant. We derive a sufficient condition on the objective function that guarantees a constant worst case competitive ratio (greater than or equal to $\\frac{1}{2}$) for monotone objective "},"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":"1611.00507","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-11-02T08:55:04Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"07d017004f616d05472cc051356015c9254f2e3748afa907ade4fcbb7a768e44","abstract_canon_sha256":"689d0cb8e156ea7c09a8c39a0cecd8233fe5a1be8a0a9d0e134ddbb25a626c14"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:00:32.609657Z","signature_b64":"Zodj70RAddEFfDiQiXiCx/zcL7ta2vcl7+3vKKyNJfDcieqpZxAm8NOi4BhQ1sclIMudkEoIrDjfuRn0tH/hCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2cd87e7e72a845712bec3d20bd3cd61a8e6ea34addc27e91450c36dff8063fc1","last_reissued_at":"2026-05-18T01:00:32.608965Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:00:32.608965Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Worst Case Competitive Analysis of Online Algorithms for Conic Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.DS","authors_text":"Maryam Fazel, Reza Eghbali","submitted_at":"2016-11-02T08:55:04Z","abstract_excerpt":"Online optimization covers problems such as online resource allocation, online bipartite matching, adwords (a central problem in e-commerce and advertising), and adwords with separable concave returns. We analyze the worst case competitive ratio of two primal-dual algorithms for a class of online convex (conic) optimization problems that contains the previous examples as special cases defined on the positive orthant. We derive a sufficient condition on the objective function that guarantees a constant worst case competitive ratio (greater than or equal to $\\frac{1}{2}$) for monotone objective "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.00507","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":"1611.00507","created_at":"2026-05-18T01:00:32.609066+00:00"},{"alias_kind":"arxiv_version","alias_value":"1611.00507v1","created_at":"2026-05-18T01:00:32.609066+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.00507","created_at":"2026-05-18T01:00:32.609066+00:00"},{"alias_kind":"pith_short_12","alias_value":"FTMH47TSVBCX","created_at":"2026-05-18T12:30:15.759754+00:00"},{"alias_kind":"pith_short_16","alias_value":"FTMH47TSVBCXCK7M","created_at":"2026-05-18T12:30:15.759754+00:00"},{"alias_kind":"pith_short_8","alias_value":"FTMH47TS","created_at":"2026-05-18T12:30:15.759754+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"1907.00312","citing_title":"Competitive Algorithms for Online Budget-Constrained Continuous DR-Submodular Problems","ref_index":7,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/FTMH47TSVBCXCK7MHUQL2PGWDK","json":"https://pith.science/pith/FTMH47TSVBCXCK7MHUQL2PGWDK.json","graph_json":"https://pith.science/api/pith-number/FTMH47TSVBCXCK7MHUQL2PGWDK/graph.json","events_json":"https://pith.science/api/pith-number/FTMH47TSVBCXCK7MHUQL2PGWDK/events.json","paper":"https://pith.science/paper/FTMH47TS"},"agent_actions":{"view_html":"https://pith.science/pith/FTMH47TSVBCXCK7MHUQL2PGWDK","download_json":"https://pith.science/pith/FTMH47TSVBCXCK7MHUQL2PGWDK.json","view_paper":"https://pith.science/paper/FTMH47TS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1611.00507&json=true","fetch_graph":"https://pith.science/api/pith-number/FTMH47TSVBCXCK7MHUQL2PGWDK/graph.json","fetch_events":"https://pith.science/api/pith-number/FTMH47TSVBCXCK7MHUQL2PGWDK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FTMH47TSVBCXCK7MHUQL2PGWDK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FTMH47TSVBCXCK7MHUQL2PGWDK/action/storage_attestation","attest_author":"https://pith.science/pith/FTMH47TSVBCXCK7MHUQL2PGWDK/action/author_attestation","sign_citation":"https://pith.science/pith/FTMH47TSVBCXCK7MHUQL2PGWDK/action/citation_signature","submit_replication":"https://pith.science/pith/FTMH47TSVBCXCK7MHUQL2PGWDK/action/replication_record"}},"created_at":"2026-05-18T01:00:32.609066+00:00","updated_at":"2026-05-18T01:00:32.609066+00:00"}