{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:XKSFSTYAZBIPIAXV2F3F3FJ5DD","short_pith_number":"pith:XKSFSTYA","canonical_record":{"source":{"id":"1706.06922","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2017-06-21T14:17:33Z","cross_cats_sorted":[],"title_canon_sha256":"87e842b10a0f6d4a20fa9c799a768ec9329f095b86af471ec0459b45b987d05c","abstract_canon_sha256":"f2ea29ffffdb7468c71255af421278e68f9a546fda6ad37d99e0aa68ab42f8d0"},"schema_version":"1.0"},"canonical_sha256":"baa4594f00c850f402f5d1765d953d18cb636ebf4a804dcaf6efbd4c1f4b273a","source":{"kind":"arxiv","id":"1706.06922","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1706.06922","created_at":"2026-05-18T00:41:56Z"},{"alias_kind":"arxiv_version","alias_value":"1706.06922v1","created_at":"2026-05-18T00:41:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.06922","created_at":"2026-05-18T00:41:56Z"},{"alias_kind":"pith_short_12","alias_value":"XKSFSTYAZBIP","created_at":"2026-05-18T12:31:56Z"},{"alias_kind":"pith_short_16","alias_value":"XKSFSTYAZBIPIAXV","created_at":"2026-05-18T12:31:56Z"},{"alias_kind":"pith_short_8","alias_value":"XKSFSTYA","created_at":"2026-05-18T12:31:56Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:XKSFSTYAZBIPIAXV2F3F3FJ5DD","target":"record","payload":{"canonical_record":{"source":{"id":"1706.06922","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2017-06-21T14:17:33Z","cross_cats_sorted":[],"title_canon_sha256":"87e842b10a0f6d4a20fa9c799a768ec9329f095b86af471ec0459b45b987d05c","abstract_canon_sha256":"f2ea29ffffdb7468c71255af421278e68f9a546fda6ad37d99e0aa68ab42f8d0"},"schema_version":"1.0"},"canonical_sha256":"baa4594f00c850f402f5d1765d953d18cb636ebf4a804dcaf6efbd4c1f4b273a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:41:56.487804Z","signature_b64":"cErvv4fAq+89FnN7U5ubIM4DXJCQHKIQ0Gyz2UxajHdTyGWYugObadGOW3BvBDHstB8FoXkDin0TzvuOCVYkDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"baa4594f00c850f402f5d1765d953d18cb636ebf4a804dcaf6efbd4c1f4b273a","last_reissued_at":"2026-05-18T00:41:56.487380Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:41:56.487380Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1706.06922","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-18T00:41:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VibyxV4VgiEcHpmlC+XeibKhPEMZw/fhxg++pAsGVHp4AZXbVHcxf7KcAFCc0T6w6z2L/V44iwW8iRX3xf30AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T20:37:28.912242Z"},"content_sha256":"ead28ed16e3bfad1581709201a788ad2dde1250692de6bb1bcf6fb6d048101f1","schema_version":"1.0","event_id":"sha256:ead28ed16e3bfad1581709201a788ad2dde1250692de6bb1bcf6fb6d048101f1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:XKSFSTYAZBIPIAXV2F3F3FJ5DD","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Online Submodular Maximization Problem with Vector Packing Constraint","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Shaofeng H.-C. Jiang, T-H. Hubert Chan, Xiaowei Wu, Zhihao Gavin Tang","submitted_at":"2017-06-21T14:17:33Z","abstract_excerpt":"We consider the online vector packing problem in which we have a $d$ dimensional knapsack and items $u$ with weight vectors $\\mathbf{w}_u \\in \\mathbb{R}_+^d$ arrive online in an arbitrary order. Upon the arrival of an item, the algorithm must decide immediately whether to discard or accept the item into the knapsack. When item $u$ is accepted, $\\mathbf{w}_u(i)$ units of capacity on dimension $i$ will be taken up, for each $i\\in[d]$. To satisfy the knapsack constraint, an accepted item can be later disposed of with no cost, but discarded or disposed of items cannot be recovered. The objective i"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.06922","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-18T00:41:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bgBLq9DXG1CnMdPMzYE/1/zEaU5a1p+zhfPvbLGa+l72iOvBHfmXnZBiVjP5+u1oc35BWzrageDG+nS+eb8vDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T20:37:28.912881Z"},"content_sha256":"346155c5ca89c92a16f6ca2fb531337d4b98821ffada3c35663dbf29cbfbec58","schema_version":"1.0","event_id":"sha256:346155c5ca89c92a16f6ca2fb531337d4b98821ffada3c35663dbf29cbfbec58"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XKSFSTYAZBIPIAXV2F3F3FJ5DD/bundle.json","state_url":"https://pith.science/pith/XKSFSTYAZBIPIAXV2F3F3FJ5DD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XKSFSTYAZBIPIAXV2F3F3FJ5DD/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-26T20:37:28Z","links":{"resolver":"https://pith.science/pith/XKSFSTYAZBIPIAXV2F3F3FJ5DD","bundle":"https://pith.science/pith/XKSFSTYAZBIPIAXV2F3F3FJ5DD/bundle.json","state":"https://pith.science/pith/XKSFSTYAZBIPIAXV2F3F3FJ5DD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XKSFSTYAZBIPIAXV2F3F3FJ5DD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:XKSFSTYAZBIPIAXV2F3F3FJ5DD","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":"f2ea29ffffdb7468c71255af421278e68f9a546fda6ad37d99e0aa68ab42f8d0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2017-06-21T14:17:33Z","title_canon_sha256":"87e842b10a0f6d4a20fa9c799a768ec9329f095b86af471ec0459b45b987d05c"},"schema_version":"1.0","source":{"id":"1706.06922","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1706.06922","created_at":"2026-05-18T00:41:56Z"},{"alias_kind":"arxiv_version","alias_value":"1706.06922v1","created_at":"2026-05-18T00:41:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.06922","created_at":"2026-05-18T00:41:56Z"},{"alias_kind":"pith_short_12","alias_value":"XKSFSTYAZBIP","created_at":"2026-05-18T12:31:56Z"},{"alias_kind":"pith_short_16","alias_value":"XKSFSTYAZBIPIAXV","created_at":"2026-05-18T12:31:56Z"},{"alias_kind":"pith_short_8","alias_value":"XKSFSTYA","created_at":"2026-05-18T12:31:56Z"}],"graph_snapshots":[{"event_id":"sha256:346155c5ca89c92a16f6ca2fb531337d4b98821ffada3c35663dbf29cbfbec58","target":"graph","created_at":"2026-05-18T00:41:56Z","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 the online vector packing problem in which we have a $d$ dimensional knapsack and items $u$ with weight vectors $\\mathbf{w}_u \\in \\mathbb{R}_+^d$ arrive online in an arbitrary order. Upon the arrival of an item, the algorithm must decide immediately whether to discard or accept the item into the knapsack. When item $u$ is accepted, $\\mathbf{w}_u(i)$ units of capacity on dimension $i$ will be taken up, for each $i\\in[d]$. To satisfy the knapsack constraint, an accepted item can be later disposed of with no cost, but discarded or disposed of items cannot be recovered. The objective i","authors_text":"Shaofeng H.-C. Jiang, T-H. Hubert Chan, Xiaowei Wu, Zhihao Gavin Tang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2017-06-21T14:17:33Z","title":"Online Submodular Maximization Problem with Vector Packing Constraint"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.06922","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:ead28ed16e3bfad1581709201a788ad2dde1250692de6bb1bcf6fb6d048101f1","target":"record","created_at":"2026-05-18T00:41:56Z","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":"f2ea29ffffdb7468c71255af421278e68f9a546fda6ad37d99e0aa68ab42f8d0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2017-06-21T14:17:33Z","title_canon_sha256":"87e842b10a0f6d4a20fa9c799a768ec9329f095b86af471ec0459b45b987d05c"},"schema_version":"1.0","source":{"id":"1706.06922","kind":"arxiv","version":1}},"canonical_sha256":"baa4594f00c850f402f5d1765d953d18cb636ebf4a804dcaf6efbd4c1f4b273a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"baa4594f00c850f402f5d1765d953d18cb636ebf4a804dcaf6efbd4c1f4b273a","first_computed_at":"2026-05-18T00:41:56.487380Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:41:56.487380Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"cErvv4fAq+89FnN7U5ubIM4DXJCQHKIQ0Gyz2UxajHdTyGWYugObadGOW3BvBDHstB8FoXkDin0TzvuOCVYkDg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:41:56.487804Z","signed_message":"canonical_sha256_bytes"},"source_id":"1706.06922","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ead28ed16e3bfad1581709201a788ad2dde1250692de6bb1bcf6fb6d048101f1","sha256:346155c5ca89c92a16f6ca2fb531337d4b98821ffada3c35663dbf29cbfbec58"],"state_sha256":"bf453ccde3aa9f4c921de6421a476a9f07d380ede8326e438a08682a4dfff391"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tibnmOkWmCXJdEaRawrG3GWnge2QzLBz83YZ0P4mYy3S8Tuw5Lw88I/jeM05nDHWsbsoISVF7y3UB7pj1mzNDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T20:37:28.915624Z","bundle_sha256":"94d76231a1ae6b49e067257c4df0048d351c47f936db28d12646423c1ae65dfc"}}