{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:7YALJ6CG2L3XRCAAXY7GMT6GZC","short_pith_number":"pith:7YALJ6CG","schema_version":"1.0","canonical_sha256":"fe00b4f846d2f7788800be3e664fc6c8b80c1e8b8d1df5665526ef08b2263d3c","source":{"kind":"arxiv","id":"1502.01802","version":3},"attestation_state":"computed","paper":{"title":"Online Convex Covering and Packing Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Ning Kang, T-H. Hubert Chan, Zhiyi Huang","submitted_at":"2015-02-06T05:33:10Z","abstract_excerpt":"We study the online convex covering problem and online convex packing problem. The (offline) convex covering problem is modeled by the following convex program: $\\min_{x \\in R_+^n} f(x) \\ \\text{s.t}\\ A x \\ge 1$, where $f : R_+^n \\mapsto R_+$ is a monotone and convex cost function, and $A$ is an $m \\times n$ matrix with non-negative entries. Each row of the constraint matrix $A$ corresponds to a covering constraint. In the online problem, each row of $A$ comes online and the algorithm must maintain a feasible assignment $x$ and may only increase $x$ over time. The (offline) convex packing probl"},"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":"1502.01802","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-02-06T05:33:10Z","cross_cats_sorted":[],"title_canon_sha256":"cf58043e50e2bbf4ef531a55c8bbde324f1e69fbf37521cf412c2bcfa1253ae4","abstract_canon_sha256":"ed8ff0b48684c28f90ed863bdf9dd03533d61bce886f130bacebeb78b8714981"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:18:51.292613Z","signature_b64":"wEAVrA+3xX+02zN7io59Enlv5YZgKPqmu7EerSjSgzzWQHXNhwvLMzLI5tny+efw6v6vR6E/jtyItY+LJ3eEAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fe00b4f846d2f7788800be3e664fc6c8b80c1e8b8d1df5665526ef08b2263d3c","last_reissued_at":"2026-05-18T02:18:51.292106Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:18:51.292106Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Online Convex Covering and Packing Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Ning Kang, T-H. Hubert Chan, Zhiyi Huang","submitted_at":"2015-02-06T05:33:10Z","abstract_excerpt":"We study the online convex covering problem and online convex packing problem. The (offline) convex covering problem is modeled by the following convex program: $\\min_{x \\in R_+^n} f(x) \\ \\text{s.t}\\ A x \\ge 1$, where $f : R_+^n \\mapsto R_+$ is a monotone and convex cost function, and $A$ is an $m \\times n$ matrix with non-negative entries. Each row of the constraint matrix $A$ corresponds to a covering constraint. In the online problem, each row of $A$ comes online and the algorithm must maintain a feasible assignment $x$ and may only increase $x$ over time. The (offline) convex packing probl"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1502.01802","kind":"arxiv","version":3},"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":"1502.01802","created_at":"2026-05-18T02:18:51.292187+00:00"},{"alias_kind":"arxiv_version","alias_value":"1502.01802v3","created_at":"2026-05-18T02:18:51.292187+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.01802","created_at":"2026-05-18T02:18:51.292187+00:00"},{"alias_kind":"pith_short_12","alias_value":"7YALJ6CG2L3X","created_at":"2026-05-18T12:29:10.953037+00:00"},{"alias_kind":"pith_short_16","alias_value":"7YALJ6CG2L3XRCAA","created_at":"2026-05-18T12:29:10.953037+00:00"},{"alias_kind":"pith_short_8","alias_value":"7YALJ6CG","created_at":"2026-05-18T12:29:10.953037+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/7YALJ6CG2L3XRCAAXY7GMT6GZC","json":"https://pith.science/pith/7YALJ6CG2L3XRCAAXY7GMT6GZC.json","graph_json":"https://pith.science/api/pith-number/7YALJ6CG2L3XRCAAXY7GMT6GZC/graph.json","events_json":"https://pith.science/api/pith-number/7YALJ6CG2L3XRCAAXY7GMT6GZC/events.json","paper":"https://pith.science/paper/7YALJ6CG"},"agent_actions":{"view_html":"https://pith.science/pith/7YALJ6CG2L3XRCAAXY7GMT6GZC","download_json":"https://pith.science/pith/7YALJ6CG2L3XRCAAXY7GMT6GZC.json","view_paper":"https://pith.science/paper/7YALJ6CG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1502.01802&json=true","fetch_graph":"https://pith.science/api/pith-number/7YALJ6CG2L3XRCAAXY7GMT6GZC/graph.json","fetch_events":"https://pith.science/api/pith-number/7YALJ6CG2L3XRCAAXY7GMT6GZC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7YALJ6CG2L3XRCAAXY7GMT6GZC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7YALJ6CG2L3XRCAAXY7GMT6GZC/action/storage_attestation","attest_author":"https://pith.science/pith/7YALJ6CG2L3XRCAAXY7GMT6GZC/action/author_attestation","sign_citation":"https://pith.science/pith/7YALJ6CG2L3XRCAAXY7GMT6GZC/action/citation_signature","submit_replication":"https://pith.science/pith/7YALJ6CG2L3XRCAAXY7GMT6GZC/action/replication_record"}},"created_at":"2026-05-18T02:18:51.292187+00:00","updated_at":"2026-05-18T02:18:51.292187+00:00"}