{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:3R5GY4NMRE7GPWC3I3KJIVAKLA","short_pith_number":"pith:3R5GY4NM","canonical_record":{"source":{"id":"1711.10652","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-11-29T02:49:24Z","cross_cats_sorted":[],"title_canon_sha256":"9d496ec40cb5dd05eb44a264420eb83d4e87927a2132c03323a2a38c741d2bc0","abstract_canon_sha256":"002604e2eda1d53a8ec5a514110b48b64b3ee18e3334ccd84c1182161133382e"},"schema_version":"1.0"},"canonical_sha256":"dc7a6c71ac893e67d85b46d494540a5830fcbfc0c274ee8b3ecc4daa6a361cd8","source":{"kind":"arxiv","id":"1711.10652","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.10652","created_at":"2026-05-18T00:29:17Z"},{"alias_kind":"arxiv_version","alias_value":"1711.10652v1","created_at":"2026-05-18T00:29:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.10652","created_at":"2026-05-18T00:29:17Z"},{"alias_kind":"pith_short_12","alias_value":"3R5GY4NMRE7G","created_at":"2026-05-18T12:30:58Z"},{"alias_kind":"pith_short_16","alias_value":"3R5GY4NMRE7GPWC3","created_at":"2026-05-18T12:30:58Z"},{"alias_kind":"pith_short_8","alias_value":"3R5GY4NM","created_at":"2026-05-18T12:30:58Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:3R5GY4NMRE7GPWC3I3KJIVAKLA","target":"record","payload":{"canonical_record":{"source":{"id":"1711.10652","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-11-29T02:49:24Z","cross_cats_sorted":[],"title_canon_sha256":"9d496ec40cb5dd05eb44a264420eb83d4e87927a2132c03323a2a38c741d2bc0","abstract_canon_sha256":"002604e2eda1d53a8ec5a514110b48b64b3ee18e3334ccd84c1182161133382e"},"schema_version":"1.0"},"canonical_sha256":"dc7a6c71ac893e67d85b46d494540a5830fcbfc0c274ee8b3ecc4daa6a361cd8","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:29:17.400167Z","signature_b64":"L92jU6qIP17OxsijZ40otk2R4c02BVW24JBkmEhoT4u91DRVEeqohaQwvJiPJcse6jzZF2XZSds/l2NalKALAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dc7a6c71ac893e67d85b46d494540a5830fcbfc0c274ee8b3ecc4daa6a361cd8","last_reissued_at":"2026-05-18T00:29:17.399467Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:29:17.399467Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1711.10652","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:29:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QCH0x4FpAR3vO85lVrlUpsR9JwB1qcKF25IUrAJxF9J2nalgvBGhcL/6RltJ+IKhGEInBeWs7LPA2HJsB3QrAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T03:01:13.721559Z"},"content_sha256":"64c24eb9121bb7e04d9b0bd64b96c0398813f37f51e9e0fe76de14e7f4cd88e5","schema_version":"1.0","event_id":"sha256:64c24eb9121bb7e04d9b0bd64b96c0398813f37f51e9e0fe76de14e7f4cd88e5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:3R5GY4NMRE7GPWC3I3KJIVAKLA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Online Knapsack Problem under Expected Capacity Constraint","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Rahul Vaze","submitted_at":"2017-11-29T02:49:24Z","abstract_excerpt":"Online knapsack problem is considered, where items arrive in a sequential fashion that have two attributes; value and weight. Each arriving item has to be accepted or rejected on its arrival irrevocably. The objective is to maximize the sum of the value of the accepted items such that the sum of their weights is below a budget/capacity. Conventionally a hard budget/capacity constraint is considered, for which variety of results are available. In modern applications, e.g., in wireless networks, data centres, cloud computing, etc., enforcing the capacity constraint in expectation is sufficient. "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.10652","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:29:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MFGXm8x+FiT7kogfH5P1N50fapGNs4kQ7OI58o00XCQRYiGGzQsWQXOfOHYt1FEhdTbaIogSQQRVoHYcP9vrBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T03:01:13.721908Z"},"content_sha256":"92864c0d04d5a82664eaaed7a6573c414f43839bf6cc525acd532b42c4da099e","schema_version":"1.0","event_id":"sha256:92864c0d04d5a82664eaaed7a6573c414f43839bf6cc525acd532b42c4da099e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3R5GY4NMRE7GPWC3I3KJIVAKLA/bundle.json","state_url":"https://pith.science/pith/3R5GY4NMRE7GPWC3I3KJIVAKLA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3R5GY4NMRE7GPWC3I3KJIVAKLA/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-06-26T03:01:13Z","links":{"resolver":"https://pith.science/pith/3R5GY4NMRE7GPWC3I3KJIVAKLA","bundle":"https://pith.science/pith/3R5GY4NMRE7GPWC3I3KJIVAKLA/bundle.json","state":"https://pith.science/pith/3R5GY4NMRE7GPWC3I3KJIVAKLA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3R5GY4NMRE7GPWC3I3KJIVAKLA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:3R5GY4NMRE7GPWC3I3KJIVAKLA","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":"002604e2eda1d53a8ec5a514110b48b64b3ee18e3334ccd84c1182161133382e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-11-29T02:49:24Z","title_canon_sha256":"9d496ec40cb5dd05eb44a264420eb83d4e87927a2132c03323a2a38c741d2bc0"},"schema_version":"1.0","source":{"id":"1711.10652","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.10652","created_at":"2026-05-18T00:29:17Z"},{"alias_kind":"arxiv_version","alias_value":"1711.10652v1","created_at":"2026-05-18T00:29:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.10652","created_at":"2026-05-18T00:29:17Z"},{"alias_kind":"pith_short_12","alias_value":"3R5GY4NMRE7G","created_at":"2026-05-18T12:30:58Z"},{"alias_kind":"pith_short_16","alias_value":"3R5GY4NMRE7GPWC3","created_at":"2026-05-18T12:30:58Z"},{"alias_kind":"pith_short_8","alias_value":"3R5GY4NM","created_at":"2026-05-18T12:30:58Z"}],"graph_snapshots":[{"event_id":"sha256:92864c0d04d5a82664eaaed7a6573c414f43839bf6cc525acd532b42c4da099e","target":"graph","created_at":"2026-05-18T00:29:17Z","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":"Online knapsack problem is considered, where items arrive in a sequential fashion that have two attributes; value and weight. Each arriving item has to be accepted or rejected on its arrival irrevocably. The objective is to maximize the sum of the value of the accepted items such that the sum of their weights is below a budget/capacity. Conventionally a hard budget/capacity constraint is considered, for which variety of results are available. In modern applications, e.g., in wireless networks, data centres, cloud computing, etc., enforcing the capacity constraint in expectation is sufficient. ","authors_text":"Rahul Vaze","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-11-29T02:49:24Z","title":"Online Knapsack Problem under Expected Capacity Constraint"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.10652","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:64c24eb9121bb7e04d9b0bd64b96c0398813f37f51e9e0fe76de14e7f4cd88e5","target":"record","created_at":"2026-05-18T00:29:17Z","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":"002604e2eda1d53a8ec5a514110b48b64b3ee18e3334ccd84c1182161133382e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-11-29T02:49:24Z","title_canon_sha256":"9d496ec40cb5dd05eb44a264420eb83d4e87927a2132c03323a2a38c741d2bc0"},"schema_version":"1.0","source":{"id":"1711.10652","kind":"arxiv","version":1}},"canonical_sha256":"dc7a6c71ac893e67d85b46d494540a5830fcbfc0c274ee8b3ecc4daa6a361cd8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"dc7a6c71ac893e67d85b46d494540a5830fcbfc0c274ee8b3ecc4daa6a361cd8","first_computed_at":"2026-05-18T00:29:17.399467Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:29:17.399467Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"L92jU6qIP17OxsijZ40otk2R4c02BVW24JBkmEhoT4u91DRVEeqohaQwvJiPJcse6jzZF2XZSds/l2NalKALAA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:29:17.400167Z","signed_message":"canonical_sha256_bytes"},"source_id":"1711.10652","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:64c24eb9121bb7e04d9b0bd64b96c0398813f37f51e9e0fe76de14e7f4cd88e5","sha256:92864c0d04d5a82664eaaed7a6573c414f43839bf6cc525acd532b42c4da099e"],"state_sha256":"9af8274225855a2c15969af28d0c2ff12a26c0b5e24009316928d5d2cb86be23"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wbG2X7Sz7EWu46CU1gc4BSefgdYb0fYZ5/5DvdPoMGoDnYTGB91pnj8wsxHoJYNaWthg+goYwZEF0FQrzMLyBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-26T03:01:13.723879Z","bundle_sha256":"7040a252665cfbf4d5103777f55b650d6dc508e384d43055672be3b311aaf5c0"}}