{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:UPXWUPQDETBV3ARONCK4E46FCM","short_pith_number":"pith:UPXWUPQD","schema_version":"1.0","canonical_sha256":"a3ef6a3e0324c35d822e6895c273c513129ec9e969e95fe28279e6257e1e7c29","source":{"kind":"arxiv","id":"1412.8347","version":1},"attestation_state":"computed","paper":{"title":"Online Packing and Covering Framework with Convex Objectives","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Anupam Gupta, Joseph (Seffi) Naor, Niv Buchbinder, Shahar Chen, Viswanath Nagarajan","submitted_at":"2014-12-29T14:09:31Z","abstract_excerpt":"We consider online fractional covering problems with a convex objective, where the covering constraints arrive over time. Formally, we want to solve $\\min\\,\\{f(x) \\mid Ax\\ge \\mathbf{1},\\, x\\ge 0\\},$ where the objective function $f:\\mathbb{R}^n\\rightarrow \\mathbb{R}$ is convex, and the constraint matrix $A_{m\\times n}$ is non-negative. The rows of $A$ arrive online over time, and we wish to maintain a feasible solution $x$ at all times while only increasing coordinates of $x$. We also consider \"dual\" packing problems of the form $\\max\\,\\{c^\\intercal y - g(\\mu) \\mid A^\\intercal y \\le \\mu,\\, y\\ge"},"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.8347","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-12-29T14:09:31Z","cross_cats_sorted":[],"title_canon_sha256":"c7fac3193eb035a919de61f316d0e64638895f9b67e7cfb6f226fe6f1c6b78f9","abstract_canon_sha256":"c9af33ff7550ee9b731c25eeff7dd84fc2c33e31c0466b5a25ca8e61d916ae0b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:30:23.433106Z","signature_b64":"yXXN6KdIIg9YPazi2ODT5F+NGW+lk9Z22F/JciHjphIvuzyOb2Pm00ldZwcWipcFpPCr/Ygmaqf84CKraplvDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a3ef6a3e0324c35d822e6895c273c513129ec9e969e95fe28279e6257e1e7c29","last_reissued_at":"2026-05-18T02:30:23.432611Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:30:23.432611Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Online Packing and Covering Framework with Convex Objectives","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Anupam Gupta, Joseph (Seffi) Naor, Niv Buchbinder, Shahar Chen, Viswanath Nagarajan","submitted_at":"2014-12-29T14:09:31Z","abstract_excerpt":"We consider online fractional covering problems with a convex objective, where the covering constraints arrive over time. Formally, we want to solve $\\min\\,\\{f(x) \\mid Ax\\ge \\mathbf{1},\\, x\\ge 0\\},$ where the objective function $f:\\mathbb{R}^n\\rightarrow \\mathbb{R}$ is convex, and the constraint matrix $A_{m\\times n}$ is non-negative. The rows of $A$ arrive online over time, and we wish to maintain a feasible solution $x$ at all times while only increasing coordinates of $x$. We also consider \"dual\" packing problems of the form $\\max\\,\\{c^\\intercal y - g(\\mu) \\mid A^\\intercal y \\le \\mu,\\, y\\ge"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.8347","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.8347","created_at":"2026-05-18T02:30:23.432697+00:00"},{"alias_kind":"arxiv_version","alias_value":"1412.8347v1","created_at":"2026-05-18T02:30:23.432697+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.8347","created_at":"2026-05-18T02:30:23.432697+00:00"},{"alias_kind":"pith_short_12","alias_value":"UPXWUPQDETBV","created_at":"2026-05-18T12:28:52.271510+00:00"},{"alias_kind":"pith_short_16","alias_value":"UPXWUPQDETBV3ARO","created_at":"2026-05-18T12:28:52.271510+00:00"},{"alias_kind":"pith_short_8","alias_value":"UPXWUPQD","created_at":"2026-05-18T12:28:52.271510+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/UPXWUPQDETBV3ARONCK4E46FCM","json":"https://pith.science/pith/UPXWUPQDETBV3ARONCK4E46FCM.json","graph_json":"https://pith.science/api/pith-number/UPXWUPQDETBV3ARONCK4E46FCM/graph.json","events_json":"https://pith.science/api/pith-number/UPXWUPQDETBV3ARONCK4E46FCM/events.json","paper":"https://pith.science/paper/UPXWUPQD"},"agent_actions":{"view_html":"https://pith.science/pith/UPXWUPQDETBV3ARONCK4E46FCM","download_json":"https://pith.science/pith/UPXWUPQDETBV3ARONCK4E46FCM.json","view_paper":"https://pith.science/paper/UPXWUPQD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1412.8347&json=true","fetch_graph":"https://pith.science/api/pith-number/UPXWUPQDETBV3ARONCK4E46FCM/graph.json","fetch_events":"https://pith.science/api/pith-number/UPXWUPQDETBV3ARONCK4E46FCM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UPXWUPQDETBV3ARONCK4E46FCM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UPXWUPQDETBV3ARONCK4E46FCM/action/storage_attestation","attest_author":"https://pith.science/pith/UPXWUPQDETBV3ARONCK4E46FCM/action/author_attestation","sign_citation":"https://pith.science/pith/UPXWUPQDETBV3ARONCK4E46FCM/action/citation_signature","submit_replication":"https://pith.science/pith/UPXWUPQDETBV3ARONCK4E46FCM/action/replication_record"}},"created_at":"2026-05-18T02:30:23.432697+00:00","updated_at":"2026-05-18T02:30:23.432697+00:00"}