{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:7EWEI3HMQW6JJ56Z3EENLYAZIQ","short_pith_number":"pith:7EWEI3HM","schema_version":"1.0","canonical_sha256":"f92c446cec85bc94f7d9d908d5e019442cd8a07914774bd6691114f7672f9505","source":{"kind":"arxiv","id":"1307.2806","version":1},"attestation_state":"computed","paper":{"title":"Packing a Knapsack of Unknown Capacity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Max Klimm, Nicole Megow, Sebastian Stiller, Yann Disser","submitted_at":"2013-07-10T14:40:38Z","abstract_excerpt":"We study the problem of packing a knapsack without knowing its capacity. Whenever we attempt to pack an item that does not fit, the item is discarded; if the item fits, we have to include it in the packing. We show that there is always a policy that packs a value within factor 2 of the optimum packing, irrespective of the actual capacity. If all items have unit density, we achieve a factor equal to the golden ratio. Both factors are shown to be best possible. In fact, we obtain the above factors using packing policies that are universal in the sense that they fix a particular order of the item"},"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":"1307.2806","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-07-10T14:40:38Z","cross_cats_sorted":[],"title_canon_sha256":"ddc98dc32c08ad65fdb6f3f924ffb3970c79b7f2857101775a77d1e6cb3f01a4","abstract_canon_sha256":"6d9ffe00f10218b43330b52098b53f2652ea4211195b55be39701d03f37f4455"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:18:50.393691Z","signature_b64":"pEFNBrL2BG02+wwyyaPatH26MXaZc/IrOl4Zl0MnJMg0L2B1rrYDk0UwYwx1dGia6kk7qhXjs5kkS8iMuhBDCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f92c446cec85bc94f7d9d908d5e019442cd8a07914774bd6691114f7672f9505","last_reissued_at":"2026-05-18T03:18:50.392958Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:18:50.392958Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Packing a Knapsack of Unknown Capacity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Max Klimm, Nicole Megow, Sebastian Stiller, Yann Disser","submitted_at":"2013-07-10T14:40:38Z","abstract_excerpt":"We study the problem of packing a knapsack without knowing its capacity. Whenever we attempt to pack an item that does not fit, the item is discarded; if the item fits, we have to include it in the packing. We show that there is always a policy that packs a value within factor 2 of the optimum packing, irrespective of the actual capacity. If all items have unit density, we achieve a factor equal to the golden ratio. Both factors are shown to be best possible. In fact, we obtain the above factors using packing policies that are universal in the sense that they fix a particular order of the item"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1307.2806","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":"1307.2806","created_at":"2026-05-18T03:18:50.393085+00:00"},{"alias_kind":"arxiv_version","alias_value":"1307.2806v1","created_at":"2026-05-18T03:18:50.393085+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1307.2806","created_at":"2026-05-18T03:18:50.393085+00:00"},{"alias_kind":"pith_short_12","alias_value":"7EWEI3HMQW6J","created_at":"2026-05-18T12:27:36.564083+00:00"},{"alias_kind":"pith_short_16","alias_value":"7EWEI3HMQW6JJ56Z","created_at":"2026-05-18T12:27:36.564083+00:00"},{"alias_kind":"pith_short_8","alias_value":"7EWEI3HM","created_at":"2026-05-18T12:27:36.564083+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/7EWEI3HMQW6JJ56Z3EENLYAZIQ","json":"https://pith.science/pith/7EWEI3HMQW6JJ56Z3EENLYAZIQ.json","graph_json":"https://pith.science/api/pith-number/7EWEI3HMQW6JJ56Z3EENLYAZIQ/graph.json","events_json":"https://pith.science/api/pith-number/7EWEI3HMQW6JJ56Z3EENLYAZIQ/events.json","paper":"https://pith.science/paper/7EWEI3HM"},"agent_actions":{"view_html":"https://pith.science/pith/7EWEI3HMQW6JJ56Z3EENLYAZIQ","download_json":"https://pith.science/pith/7EWEI3HMQW6JJ56Z3EENLYAZIQ.json","view_paper":"https://pith.science/paper/7EWEI3HM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1307.2806&json=true","fetch_graph":"https://pith.science/api/pith-number/7EWEI3HMQW6JJ56Z3EENLYAZIQ/graph.json","fetch_events":"https://pith.science/api/pith-number/7EWEI3HMQW6JJ56Z3EENLYAZIQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7EWEI3HMQW6JJ56Z3EENLYAZIQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7EWEI3HMQW6JJ56Z3EENLYAZIQ/action/storage_attestation","attest_author":"https://pith.science/pith/7EWEI3HMQW6JJ56Z3EENLYAZIQ/action/author_attestation","sign_citation":"https://pith.science/pith/7EWEI3HMQW6JJ56Z3EENLYAZIQ/action/citation_signature","submit_replication":"https://pith.science/pith/7EWEI3HMQW6JJ56Z3EENLYAZIQ/action/replication_record"}},"created_at":"2026-05-18T03:18:50.393085+00:00","updated_at":"2026-05-18T03:18:50.393085+00:00"}