{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:UZZCOLFKK53XLN5JJXMPCDWJX6","short_pith_number":"pith:UZZCOLFK","schema_version":"1.0","canonical_sha256":"a672272caa577775b7a94dd8f10ec9bf8929fb17d881632d3782fa3b6b31e6a7","source":{"kind":"arxiv","id":"1802.01312","version":2},"attestation_state":"computed","paper":{"title":"Competitive Online Algorithms for Resource Allocation over the Positive Semidefinite Cone","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"math.OC","authors_text":"James Saunderson, Maryam Fazel, Reza Eghbali","submitted_at":"2018-02-05T09:43:15Z","abstract_excerpt":"We consider a new and general online resource allocation problem, where the goal is to maximize a function of a positive semidefinite (PSD) matrix with a scalar budget constraint. The problem data arrives online, and the algorithm needs to make an irrevocable decision at each step. Of particular interest are classic experiment design problems in the online setting, with the algorithm deciding whether to allocate budget to each experiment as new experiments become available sequentially.\n  We analyze two greedy primal-dual algorithms and provide bounds on their competitive ratios. Our analysis "},"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":"1802.01312","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-02-05T09:43:15Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"675469ccc15122891738db657bbe10399dfe1b7d3b73156037457031995e0568","abstract_canon_sha256":"86b761af3cef708a31ff973d53310cfe361d40f0b43c968dda55603df0e6ef2b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:49:17.809896Z","signature_b64":"00SJt4zwAFBpVaCcOrMCq5d4CpziUoHKHYlgKaYjo2srPfaqWpSLYc3t4lI/HxB88DLuhgQ2rNpnLNcu4SUlAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a672272caa577775b7a94dd8f10ec9bf8929fb17d881632d3782fa3b6b31e6a7","last_reissued_at":"2026-05-17T23:49:17.809497Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:49:17.809497Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Competitive Online Algorithms for Resource Allocation over the Positive Semidefinite Cone","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"math.OC","authors_text":"James Saunderson, Maryam Fazel, Reza Eghbali","submitted_at":"2018-02-05T09:43:15Z","abstract_excerpt":"We consider a new and general online resource allocation problem, where the goal is to maximize a function of a positive semidefinite (PSD) matrix with a scalar budget constraint. The problem data arrives online, and the algorithm needs to make an irrevocable decision at each step. Of particular interest are classic experiment design problems in the online setting, with the algorithm deciding whether to allocate budget to each experiment as new experiments become available sequentially.\n  We analyze two greedy primal-dual algorithms and provide bounds on their competitive ratios. Our analysis "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.01312","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":""},"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":"1802.01312","created_at":"2026-05-17T23:49:17.809552+00:00"},{"alias_kind":"arxiv_version","alias_value":"1802.01312v2","created_at":"2026-05-17T23:49:17.809552+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.01312","created_at":"2026-05-17T23:49:17.809552+00:00"},{"alias_kind":"pith_short_12","alias_value":"UZZCOLFKK53X","created_at":"2026-05-18T12:32:56.356000+00:00"},{"alias_kind":"pith_short_16","alias_value":"UZZCOLFKK53XLN5J","created_at":"2026-05-18T12:32:56.356000+00:00"},{"alias_kind":"pith_short_8","alias_value":"UZZCOLFK","created_at":"2026-05-18T12:32:56.356000+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/UZZCOLFKK53XLN5JJXMPCDWJX6","json":"https://pith.science/pith/UZZCOLFKK53XLN5JJXMPCDWJX6.json","graph_json":"https://pith.science/api/pith-number/UZZCOLFKK53XLN5JJXMPCDWJX6/graph.json","events_json":"https://pith.science/api/pith-number/UZZCOLFKK53XLN5JJXMPCDWJX6/events.json","paper":"https://pith.science/paper/UZZCOLFK"},"agent_actions":{"view_html":"https://pith.science/pith/UZZCOLFKK53XLN5JJXMPCDWJX6","download_json":"https://pith.science/pith/UZZCOLFKK53XLN5JJXMPCDWJX6.json","view_paper":"https://pith.science/paper/UZZCOLFK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1802.01312&json=true","fetch_graph":"https://pith.science/api/pith-number/UZZCOLFKK53XLN5JJXMPCDWJX6/graph.json","fetch_events":"https://pith.science/api/pith-number/UZZCOLFKK53XLN5JJXMPCDWJX6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UZZCOLFKK53XLN5JJXMPCDWJX6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UZZCOLFKK53XLN5JJXMPCDWJX6/action/storage_attestation","attest_author":"https://pith.science/pith/UZZCOLFKK53XLN5JJXMPCDWJX6/action/author_attestation","sign_citation":"https://pith.science/pith/UZZCOLFKK53XLN5JJXMPCDWJX6/action/citation_signature","submit_replication":"https://pith.science/pith/UZZCOLFKK53XLN5JJXMPCDWJX6/action/replication_record"}},"created_at":"2026-05-17T23:49:17.809552+00:00","updated_at":"2026-05-17T23:49:17.809552+00:00"}