{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:7YALJ6CG2L3XRCAAXY7GMT6GZC","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":"ed8ff0b48684c28f90ed863bdf9dd03533d61bce886f130bacebeb78b8714981","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-02-06T05:33:10Z","title_canon_sha256":"cf58043e50e2bbf4ef531a55c8bbde324f1e69fbf37521cf412c2bcfa1253ae4"},"schema_version":"1.0","source":{"id":"1502.01802","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1502.01802","created_at":"2026-05-18T02:18:51Z"},{"alias_kind":"arxiv_version","alias_value":"1502.01802v3","created_at":"2026-05-18T02:18:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.01802","created_at":"2026-05-18T02:18:51Z"},{"alias_kind":"pith_short_12","alias_value":"7YALJ6CG2L3X","created_at":"2026-05-18T12:29:10Z"},{"alias_kind":"pith_short_16","alias_value":"7YALJ6CG2L3XRCAA","created_at":"2026-05-18T12:29:10Z"},{"alias_kind":"pith_short_8","alias_value":"7YALJ6CG","created_at":"2026-05-18T12:29:10Z"}],"graph_snapshots":[{"event_id":"sha256:9fcb2f62ccada91e0d8281a2b4d8af6e15626e0c9aaf3c94962387e8e406d049","target":"graph","created_at":"2026-05-18T02:18:51Z","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":"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","authors_text":"Ning Kang, T-H. Hubert Chan, Zhiyi Huang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-02-06T05:33:10Z","title":"Online Convex Covering and Packing Problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1502.01802","kind":"arxiv","version":3},"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:df05eb5da8ea15f97b7069021e9b6d123dc97659a15681d8c052e19043a22036","target":"record","created_at":"2026-05-18T02:18:51Z","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":"ed8ff0b48684c28f90ed863bdf9dd03533d61bce886f130bacebeb78b8714981","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-02-06T05:33:10Z","title_canon_sha256":"cf58043e50e2bbf4ef531a55c8bbde324f1e69fbf37521cf412c2bcfa1253ae4"},"schema_version":"1.0","source":{"id":"1502.01802","kind":"arxiv","version":3}},"canonical_sha256":"fe00b4f846d2f7788800be3e664fc6c8b80c1e8b8d1df5665526ef08b2263d3c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fe00b4f846d2f7788800be3e664fc6c8b80c1e8b8d1df5665526ef08b2263d3c","first_computed_at":"2026-05-18T02:18:51.292106Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:18:51.292106Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"wEAVrA+3xX+02zN7io59Enlv5YZgKPqmu7EerSjSgzzWQHXNhwvLMzLI5tny+efw6v6vR6E/jtyItY+LJ3eEAA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:18:51.292613Z","signed_message":"canonical_sha256_bytes"},"source_id":"1502.01802","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:df05eb5da8ea15f97b7069021e9b6d123dc97659a15681d8c052e19043a22036","sha256:9fcb2f62ccada91e0d8281a2b4d8af6e15626e0c9aaf3c94962387e8e406d049"],"state_sha256":"45e3e1d17e0da91b85a90f4f95165bea2379141e13de1423c2dc6827ca45d850"}