{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:UPXWUPQDETBV3ARONCK4E46FCM","short_pith_number":"pith:UPXWUPQD","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"},"canonical_sha256":"a3ef6a3e0324c35d822e6895c273c513129ec9e969e95fe28279e6257e1e7c29","source":{"kind":"arxiv","id":"1412.8347","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1412.8347","created_at":"2026-05-18T02:30:23Z"},{"alias_kind":"arxiv_version","alias_value":"1412.8347v1","created_at":"2026-05-18T02:30:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.8347","created_at":"2026-05-18T02:30:23Z"},{"alias_kind":"pith_short_12","alias_value":"UPXWUPQDETBV","created_at":"2026-05-18T12:28:52Z"},{"alias_kind":"pith_short_16","alias_value":"UPXWUPQDETBV3ARO","created_at":"2026-05-18T12:28:52Z"},{"alias_kind":"pith_short_8","alias_value":"UPXWUPQD","created_at":"2026-05-18T12:28:52Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:UPXWUPQDETBV3ARONCK4E46FCM","target":"record","payload":{"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"},"canonical_sha256":"a3ef6a3e0324c35d822e6895c273c513129ec9e969e95fe28279e6257e1e7c29","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"},"source_kind":"arxiv","source_id":"1412.8347","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:30:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Xmahk5EELYS+Kqt0wmi3RY+OWYkVWBXNCw9zETlICEi6HQ3PIGdM3mdNkHKlkWChbkVs3GYhLQmrhZAjfv9HBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T10:26:32.493461Z"},"content_sha256":"6ba8089c0aa2a710de4749b09e70a6628d061c17cde1c7612470f2f6f9e135b0","schema_version":"1.0","event_id":"sha256:6ba8089c0aa2a710de4749b09e70a6628d061c17cde1c7612470f2f6f9e135b0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:UPXWUPQDETBV3ARONCK4E46FCM","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:30:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"H/6AeKd2Mm9lGcCsEGzjIZ+GqLH0apV9MlPqF9YgYB7MYbljLQjl+tgm/9Vlk34CqesWEmLmh4qocm0IkNw5Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T10:26:32.493799Z"},"content_sha256":"38e74d5940bf2b6e145ffdd4d26b6e73a6def704703386eaea1504243d5f5800","schema_version":"1.0","event_id":"sha256:38e74d5940bf2b6e145ffdd4d26b6e73a6def704703386eaea1504243d5f5800"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UPXWUPQDETBV3ARONCK4E46FCM/bundle.json","state_url":"https://pith.science/pith/UPXWUPQDETBV3ARONCK4E46FCM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UPXWUPQDETBV3ARONCK4E46FCM/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-28T10:26:32Z","links":{"resolver":"https://pith.science/pith/UPXWUPQDETBV3ARONCK4E46FCM","bundle":"https://pith.science/pith/UPXWUPQDETBV3ARONCK4E46FCM/bundle.json","state":"https://pith.science/pith/UPXWUPQDETBV3ARONCK4E46FCM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UPXWUPQDETBV3ARONCK4E46FCM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:UPXWUPQDETBV3ARONCK4E46FCM","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":"c9af33ff7550ee9b731c25eeff7dd84fc2c33e31c0466b5a25ca8e61d916ae0b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-12-29T14:09:31Z","title_canon_sha256":"c7fac3193eb035a919de61f316d0e64638895f9b67e7cfb6f226fe6f1c6b78f9"},"schema_version":"1.0","source":{"id":"1412.8347","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1412.8347","created_at":"2026-05-18T02:30:23Z"},{"alias_kind":"arxiv_version","alias_value":"1412.8347v1","created_at":"2026-05-18T02:30:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.8347","created_at":"2026-05-18T02:30:23Z"},{"alias_kind":"pith_short_12","alias_value":"UPXWUPQDETBV","created_at":"2026-05-18T12:28:52Z"},{"alias_kind":"pith_short_16","alias_value":"UPXWUPQDETBV3ARO","created_at":"2026-05-18T12:28:52Z"},{"alias_kind":"pith_short_8","alias_value":"UPXWUPQD","created_at":"2026-05-18T12:28:52Z"}],"graph_snapshots":[{"event_id":"sha256:38e74d5940bf2b6e145ffdd4d26b6e73a6def704703386eaea1504243d5f5800","target":"graph","created_at":"2026-05-18T02:30:23Z","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 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","authors_text":"Anupam Gupta, Joseph (Seffi) Naor, Niv Buchbinder, Shahar Chen, Viswanath Nagarajan","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-12-29T14:09:31Z","title":"Online Packing and Covering Framework with Convex Objectives"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.8347","kind":"arxiv","version":1},"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:6ba8089c0aa2a710de4749b09e70a6628d061c17cde1c7612470f2f6f9e135b0","target":"record","created_at":"2026-05-18T02:30:23Z","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":"c9af33ff7550ee9b731c25eeff7dd84fc2c33e31c0466b5a25ca8e61d916ae0b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-12-29T14:09:31Z","title_canon_sha256":"c7fac3193eb035a919de61f316d0e64638895f9b67e7cfb6f226fe6f1c6b78f9"},"schema_version":"1.0","source":{"id":"1412.8347","kind":"arxiv","version":1}},"canonical_sha256":"a3ef6a3e0324c35d822e6895c273c513129ec9e969e95fe28279e6257e1e7c29","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a3ef6a3e0324c35d822e6895c273c513129ec9e969e95fe28279e6257e1e7c29","first_computed_at":"2026-05-18T02:30:23.432611Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:30:23.432611Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"yXXN6KdIIg9YPazi2ODT5F+NGW+lk9Z22F/JciHjphIvuzyOb2Pm00ldZwcWipcFpPCr/Ygmaqf84CKraplvDw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:30:23.433106Z","signed_message":"canonical_sha256_bytes"},"source_id":"1412.8347","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6ba8089c0aa2a710de4749b09e70a6628d061c17cde1c7612470f2f6f9e135b0","sha256:38e74d5940bf2b6e145ffdd4d26b6e73a6def704703386eaea1504243d5f5800"],"state_sha256":"0e92f20e6e21b141805368a2011bcdb4754538d794d3d5bb67db0e48fe840ef0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Y/B4OKr4MKizsoaIs8jdea7OoFBlmCmJDT99uTVHbZXkEevNNhyTi2kerp6YVQK+2HvUszZl9WR+PX1k/LYPCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T10:26:32.495694Z","bundle_sha256":"d44a6878db5797ac2977fea3b0f1f9d6d0a5e61eceb0501a95b26d449c4bd2a7"}}