{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:XKSFSTYAZBIPIAXV2F3F3FJ5DD","short_pith_number":"pith:XKSFSTYA","schema_version":"1.0","canonical_sha256":"baa4594f00c850f402f5d1765d953d18cb636ebf4a804dcaf6efbd4c1f4b273a","source":{"kind":"arxiv","id":"1706.06922","version":1},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1706.06922","created_at":"2026-05-18T00:41:56.487447+00:00"},{"alias_kind":"arxiv_version","alias_value":"1706.06922v1","created_at":"2026-05-18T00:41:56.487447+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.06922","created_at":"2026-05-18T00:41:56.487447+00:00"},{"alias_kind":"pith_short_12","alias_value":"XKSFSTYAZBIP","created_at":"2026-05-18T12:31:56.362134+00:00"},{"alias_kind":"pith_short_16","alias_value":"XKSFSTYAZBIPIAXV","created_at":"2026-05-18T12:31:56.362134+00:00"},{"alias_kind":"pith_short_8","alias_value":"XKSFSTYA","created_at":"2026-05-18T12:31:56.362134+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/XKSFSTYAZBIPIAXV2F3F3FJ5DD","json":"https://pith.science/pith/XKSFSTYAZBIPIAXV2F3F3FJ5DD.json","graph_json":"https://pith.science/api/pith-number/XKSFSTYAZBIPIAXV2F3F3FJ5DD/graph.json","events_json":"https://pith.science/api/pith-number/XKSFSTYAZBIPIAXV2F3F3FJ5DD/events.json","paper":"https://pith.science/paper/XKSFSTYA"},"agent_actions":{"view_html":"https://pith.science/pith/XKSFSTYAZBIPIAXV2F3F3FJ5DD","download_json":"https://pith.science/pith/XKSFSTYAZBIPIAXV2F3F3FJ5DD.json","view_paper":"https://pith.science/paper/XKSFSTYA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1706.06922&json=true","fetch_graph":"https://pith.science/api/pith-number/XKSFSTYAZBIPIAXV2F3F3FJ5DD/graph.json","fetch_events":"https://pith.science/api/pith-number/XKSFSTYAZBIPIAXV2F3F3FJ5DD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XKSFSTYAZBIPIAXV2F3F3FJ5DD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XKSFSTYAZBIPIAXV2F3F3FJ5DD/action/storage_attestation","attest_author":"https://pith.science/pith/XKSFSTYAZBIPIAXV2F3F3FJ5DD/action/author_attestation","sign_citation":"https://pith.science/pith/XKSFSTYAZBIPIAXV2F3F3FJ5DD/action/citation_signature","submit_replication":"https://pith.science/pith/XKSFSTYAZBIPIAXV2F3F3FJ5DD/action/replication_record"}},"created_at":"2026-05-18T00:41:56.487447+00:00","updated_at":"2026-05-18T00:41:56.487447+00:00"}