{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:YEQGHSI6MAACCOVB2YG37SCZH5","short_pith_number":"pith:YEQGHSI6","schema_version":"1.0","canonical_sha256":"c12063c91e6000213aa1d60dbfc8593f7eb6495c303f1a4246104bd074ac177a","source":{"kind":"arxiv","id":"1412.3507","version":1},"attestation_state":"computed","paper":{"title":"Online Covering with Convex Objectives and Applications","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.DS","authors_text":"Debmalya Panigrahi, Ilan Reuven Cohen, Yossi Azar","submitted_at":"2014-12-11T00:35:03Z","abstract_excerpt":"We give an algorithmic framework for minimizing general convex objectives (that are differentiable and monotone non-decreasing) over a set of covering constraints that arrive online. This substantially extends previous work on online covering for linear objectives (Alon {\\em et al.}, STOC 2003) and online covering with offline packing constraints (Azar {\\em et al.}, SODA 2013). To the best of our knowledge, this is the first result in online optimization for generic non-linear objectives; special cases of such objectives have previously been considered, particularly for energy minimization.\n  "},"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":"1412.3507","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-12-11T00:35:03Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"1cd7d2b1d972f2b2458800f3a68b7808c3a818d22929181e858681c7005d2b3e","abstract_canon_sha256":"83b10360651279c51931369edab1d196eb9f2f1130aa9542e7ee85d0dead2800"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:31:36.410873Z","signature_b64":"hjFnq9JV+ETtffERcL8i9zgyGP6O/HPyPmLMgLI+2LCyjqz/nXaLaposOBPqJ2n7pmUbXeZHggfAldbkV9vlDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c12063c91e6000213aa1d60dbfc8593f7eb6495c303f1a4246104bd074ac177a","last_reissued_at":"2026-05-18T02:31:36.410364Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:31:36.410364Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Online Covering with Convex Objectives and Applications","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.DS","authors_text":"Debmalya Panigrahi, Ilan Reuven Cohen, Yossi Azar","submitted_at":"2014-12-11T00:35:03Z","abstract_excerpt":"We give an algorithmic framework for minimizing general convex objectives (that are differentiable and monotone non-decreasing) over a set of covering constraints that arrive online. This substantially extends previous work on online covering for linear objectives (Alon {\\em et al.}, STOC 2003) and online covering with offline packing constraints (Azar {\\em et al.}, SODA 2013). To the best of our knowledge, this is the first result in online optimization for generic non-linear objectives; special cases of such objectives have previously been considered, particularly for energy minimization.\n  "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.3507","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":"1412.3507","created_at":"2026-05-18T02:31:36.410440+00:00"},{"alias_kind":"arxiv_version","alias_value":"1412.3507v1","created_at":"2026-05-18T02:31:36.410440+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.3507","created_at":"2026-05-18T02:31:36.410440+00:00"},{"alias_kind":"pith_short_12","alias_value":"YEQGHSI6MAAC","created_at":"2026-05-18T12:28:57.508820+00:00"},{"alias_kind":"pith_short_16","alias_value":"YEQGHSI6MAACCOVB","created_at":"2026-05-18T12:28:57.508820+00:00"},{"alias_kind":"pith_short_8","alias_value":"YEQGHSI6","created_at":"2026-05-18T12:28:57.508820+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/YEQGHSI6MAACCOVB2YG37SCZH5","json":"https://pith.science/pith/YEQGHSI6MAACCOVB2YG37SCZH5.json","graph_json":"https://pith.science/api/pith-number/YEQGHSI6MAACCOVB2YG37SCZH5/graph.json","events_json":"https://pith.science/api/pith-number/YEQGHSI6MAACCOVB2YG37SCZH5/events.json","paper":"https://pith.science/paper/YEQGHSI6"},"agent_actions":{"view_html":"https://pith.science/pith/YEQGHSI6MAACCOVB2YG37SCZH5","download_json":"https://pith.science/pith/YEQGHSI6MAACCOVB2YG37SCZH5.json","view_paper":"https://pith.science/paper/YEQGHSI6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1412.3507&json=true","fetch_graph":"https://pith.science/api/pith-number/YEQGHSI6MAACCOVB2YG37SCZH5/graph.json","fetch_events":"https://pith.science/api/pith-number/YEQGHSI6MAACCOVB2YG37SCZH5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YEQGHSI6MAACCOVB2YG37SCZH5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YEQGHSI6MAACCOVB2YG37SCZH5/action/storage_attestation","attest_author":"https://pith.science/pith/YEQGHSI6MAACCOVB2YG37SCZH5/action/author_attestation","sign_citation":"https://pith.science/pith/YEQGHSI6MAACCOVB2YG37SCZH5/action/citation_signature","submit_replication":"https://pith.science/pith/YEQGHSI6MAACCOVB2YG37SCZH5/action/replication_record"}},"created_at":"2026-05-18T02:31:36.410440+00:00","updated_at":"2026-05-18T02:31:36.410440+00:00"}