{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:JCXBDOBW5GB4IGJFLLBWHIO4P5","short_pith_number":"pith:JCXBDOBW","schema_version":"1.0","canonical_sha256":"48ae11b836e983c419255ac363a1dc7f526fc1eff559517c83df9a19a90367ee","source":{"kind":"arxiv","id":"1705.02194","version":2},"attestation_state":"computed","paper":{"title":"Online Covering with Sum of $\\ell_q$-Norm Objectives","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Viswanath Nagarajan, Xiangkun Shen","submitted_at":"2017-05-05T12:45:46Z","abstract_excerpt":"We consider fractional online covering problems with $\\ell_q$-norm objectives. The problem of interest is of the form $\\min\\{ f(x) \\,:\\, Ax\\ge 1, x\\ge 0\\}$ where $f(x)=\\sum_{e} c_e \\|x(S_e)\\|_{q_e} $ is the weighted sum of $\\ell_q$-norms and $A$ is a non-negative matrix. The rows of $A$ (i.e. covering constraints) arrive online over time. We provide an online $O(\\log d+\\log \\rho)$-competitive algorithm where $\\rho = \\frac{\\max a_{ij}}{\\min a_{ij}}$ and $d$ is the maximum of the row sparsity of $A$ and $\\max |S_e|$. This is based on the online primal-dual framework where we use the dual of the "},"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":"1705.02194","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-05-05T12:45:46Z","cross_cats_sorted":[],"title_canon_sha256":"a7b0ee5065799832794aff099140ccbcce61586bcbcb530fb29c12179daf4393","abstract_canon_sha256":"99af4ccbe74577938503b0ef72e56a98d893e7f41681d8c8dd674771c4764ea1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:44:50.977908Z","signature_b64":"AdHLEaYcMwWwS8a8cg9qds+Lq/8LXSCkCV6pzu+nGBvIQA4wZ1VjuJW6uGmrCvE0XewGtrX8o682VPVSRwWrBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"48ae11b836e983c419255ac363a1dc7f526fc1eff559517c83df9a19a90367ee","last_reissued_at":"2026-05-18T00:44:50.977243Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:44:50.977243Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Online Covering with Sum of $\\ell_q$-Norm Objectives","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Viswanath Nagarajan, Xiangkun Shen","submitted_at":"2017-05-05T12:45:46Z","abstract_excerpt":"We consider fractional online covering problems with $\\ell_q$-norm objectives. The problem of interest is of the form $\\min\\{ f(x) \\,:\\, Ax\\ge 1, x\\ge 0\\}$ where $f(x)=\\sum_{e} c_e \\|x(S_e)\\|_{q_e} $ is the weighted sum of $\\ell_q$-norms and $A$ is a non-negative matrix. The rows of $A$ (i.e. covering constraints) arrive online over time. We provide an online $O(\\log d+\\log \\rho)$-competitive algorithm where $\\rho = \\frac{\\max a_{ij}}{\\min a_{ij}}$ and $d$ is the maximum of the row sparsity of $A$ and $\\max |S_e|$. This is based on the online primal-dual framework where we use the dual of the "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.02194","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":"1705.02194","created_at":"2026-05-18T00:44:50.977361+00:00"},{"alias_kind":"arxiv_version","alias_value":"1705.02194v2","created_at":"2026-05-18T00:44:50.977361+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.02194","created_at":"2026-05-18T00:44:50.977361+00:00"},{"alias_kind":"pith_short_12","alias_value":"JCXBDOBW5GB4","created_at":"2026-05-18T12:31:21.493067+00:00"},{"alias_kind":"pith_short_16","alias_value":"JCXBDOBW5GB4IGJF","created_at":"2026-05-18T12:31:21.493067+00:00"},{"alias_kind":"pith_short_8","alias_value":"JCXBDOBW","created_at":"2026-05-18T12:31:21.493067+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/JCXBDOBW5GB4IGJFLLBWHIO4P5","json":"https://pith.science/pith/JCXBDOBW5GB4IGJFLLBWHIO4P5.json","graph_json":"https://pith.science/api/pith-number/JCXBDOBW5GB4IGJFLLBWHIO4P5/graph.json","events_json":"https://pith.science/api/pith-number/JCXBDOBW5GB4IGJFLLBWHIO4P5/events.json","paper":"https://pith.science/paper/JCXBDOBW"},"agent_actions":{"view_html":"https://pith.science/pith/JCXBDOBW5GB4IGJFLLBWHIO4P5","download_json":"https://pith.science/pith/JCXBDOBW5GB4IGJFLLBWHIO4P5.json","view_paper":"https://pith.science/paper/JCXBDOBW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1705.02194&json=true","fetch_graph":"https://pith.science/api/pith-number/JCXBDOBW5GB4IGJFLLBWHIO4P5/graph.json","fetch_events":"https://pith.science/api/pith-number/JCXBDOBW5GB4IGJFLLBWHIO4P5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JCXBDOBW5GB4IGJFLLBWHIO4P5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JCXBDOBW5GB4IGJFLLBWHIO4P5/action/storage_attestation","attest_author":"https://pith.science/pith/JCXBDOBW5GB4IGJFLLBWHIO4P5/action/author_attestation","sign_citation":"https://pith.science/pith/JCXBDOBW5GB4IGJFLLBWHIO4P5/action/citation_signature","submit_replication":"https://pith.science/pith/JCXBDOBW5GB4IGJFLLBWHIO4P5/action/replication_record"}},"created_at":"2026-05-18T00:44:50.977361+00:00","updated_at":"2026-05-18T00:44:50.977361+00:00"}