{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:FTMH47TSVBCXCK7MHUQL2PGWDK","short_pith_number":"pith:FTMH47TS","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"},"canonical_sha256":"2cd87e7e72a845712bec3d20bd3cd61a8e6ea34addc27e91450c36dff8063fc1","source":{"kind":"arxiv","id":"1611.00507","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.00507","created_at":"2026-05-18T01:00:32Z"},{"alias_kind":"arxiv_version","alias_value":"1611.00507v1","created_at":"2026-05-18T01:00:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.00507","created_at":"2026-05-18T01:00:32Z"},{"alias_kind":"pith_short_12","alias_value":"FTMH47TSVBCX","created_at":"2026-05-18T12:30:15Z"},{"alias_kind":"pith_short_16","alias_value":"FTMH47TSVBCXCK7M","created_at":"2026-05-18T12:30:15Z"},{"alias_kind":"pith_short_8","alias_value":"FTMH47TS","created_at":"2026-05-18T12:30:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:FTMH47TSVBCXCK7MHUQL2PGWDK","target":"record","payload":{"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"},"canonical_sha256":"2cd87e7e72a845712bec3d20bd3cd61a8e6ea34addc27e91450c36dff8063fc1","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"},"source_kind":"arxiv","source_id":"1611.00507","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:00:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AJt1XqX/wgATDx0sLNoVZs7T75aNNSIXKwnCRqnVqE0v+7jvnQ5MfcjDoDFUBNsiz5bBT4n+XC6J08fJ+lZ2AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T17:19:22.583371Z"},"content_sha256":"7b67636ce9811d38222a6af13cb9a26b828632a4a2242d839cd786b8a9e32514","schema_version":"1.0","event_id":"sha256:7b67636ce9811d38222a6af13cb9a26b828632a4a2242d839cd786b8a9e32514"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:FTMH47TSVBCXCK7MHUQL2PGWDK","target":"graph","payload":{"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"},"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:00:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"63QabHSkW0GtkUsLlA2N0yY+iqEs5r3crvefBLNkVwgztLdJ84kttWvT3FCms6f8LQzpqM+CzQKS/x+XZXsfDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T17:19:22.583849Z"},"content_sha256":"b38c32c199512409cbd72746a331a43b53371c69a2bc6dbfbcbe92a4adcfbbd2","schema_version":"1.0","event_id":"sha256:b38c32c199512409cbd72746a331a43b53371c69a2bc6dbfbcbe92a4adcfbbd2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FTMH47TSVBCXCK7MHUQL2PGWDK/bundle.json","state_url":"https://pith.science/pith/FTMH47TSVBCXCK7MHUQL2PGWDK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FTMH47TSVBCXCK7MHUQL2PGWDK/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-05-31T17:19:22Z","links":{"resolver":"https://pith.science/pith/FTMH47TSVBCXCK7MHUQL2PGWDK","bundle":"https://pith.science/pith/FTMH47TSVBCXCK7MHUQL2PGWDK/bundle.json","state":"https://pith.science/pith/FTMH47TSVBCXCK7MHUQL2PGWDK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FTMH47TSVBCXCK7MHUQL2PGWDK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:FTMH47TSVBCXCK7MHUQL2PGWDK","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":"689d0cb8e156ea7c09a8c39a0cecd8233fe5a1be8a0a9d0e134ddbb25a626c14","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-11-02T08:55:04Z","title_canon_sha256":"07d017004f616d05472cc051356015c9254f2e3748afa907ade4fcbb7a768e44"},"schema_version":"1.0","source":{"id":"1611.00507","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.00507","created_at":"2026-05-18T01:00:32Z"},{"alias_kind":"arxiv_version","alias_value":"1611.00507v1","created_at":"2026-05-18T01:00:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.00507","created_at":"2026-05-18T01:00:32Z"},{"alias_kind":"pith_short_12","alias_value":"FTMH47TSVBCX","created_at":"2026-05-18T12:30:15Z"},{"alias_kind":"pith_short_16","alias_value":"FTMH47TSVBCXCK7M","created_at":"2026-05-18T12:30:15Z"},{"alias_kind":"pith_short_8","alias_value":"FTMH47TS","created_at":"2026-05-18T12:30:15Z"}],"graph_snapshots":[{"event_id":"sha256:b38c32c199512409cbd72746a331a43b53371c69a2bc6dbfbcbe92a4adcfbbd2","target":"graph","created_at":"2026-05-18T01:00:32Z","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":"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 ","authors_text":"Maryam Fazel, Reza Eghbali","cross_cats":["math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-11-02T08:55:04Z","title":"Worst Case Competitive Analysis of Online Algorithms for Conic Optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.00507","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:7b67636ce9811d38222a6af13cb9a26b828632a4a2242d839cd786b8a9e32514","target":"record","created_at":"2026-05-18T01:00:32Z","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":"689d0cb8e156ea7c09a8c39a0cecd8233fe5a1be8a0a9d0e134ddbb25a626c14","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-11-02T08:55:04Z","title_canon_sha256":"07d017004f616d05472cc051356015c9254f2e3748afa907ade4fcbb7a768e44"},"schema_version":"1.0","source":{"id":"1611.00507","kind":"arxiv","version":1}},"canonical_sha256":"2cd87e7e72a845712bec3d20bd3cd61a8e6ea34addc27e91450c36dff8063fc1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2cd87e7e72a845712bec3d20bd3cd61a8e6ea34addc27e91450c36dff8063fc1","first_computed_at":"2026-05-18T01:00:32.608965Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:00:32.608965Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Zodj70RAddEFfDiQiXiCx/zcL7ta2vcl7+3vKKyNJfDcieqpZxAm8NOi4BhQ1sclIMudkEoIrDjfuRn0tH/hCg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:00:32.609657Z","signed_message":"canonical_sha256_bytes"},"source_id":"1611.00507","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7b67636ce9811d38222a6af13cb9a26b828632a4a2242d839cd786b8a9e32514","sha256:b38c32c199512409cbd72746a331a43b53371c69a2bc6dbfbcbe92a4adcfbbd2"],"state_sha256":"670bfc77db2773d8ef49daa3225e7d5f464a4a14e1d5ef86f8dabcf87f9d7b35"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Mlkala/C7YGSmYhd1F+FRTDBk/UfAOpKAaNrYmEU+4iUCj6PtXR+p662AEVVBZ/qMrxhnZrueWz4QQza0RoDAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T17:19:22.588129Z","bundle_sha256":"8285d8e96869afd02fc07af60f2f0c4a80ad3ab381bee9ed4a1607b1082b4ad9"}}