{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:XTUYICSKGUXYFQNP23K763J56K","short_pith_number":"pith:XTUYICSK","schema_version":"1.0","canonical_sha256":"bce9840a4a352f82c1afd6d5ff6d3df293fe6e20e4979d7b3ce6a1cd5c925dae","source":{"kind":"arxiv","id":"1706.04939","version":2},"attestation_state":"computed","paper":{"title":"Online Strip Packing with Polynomial Migration","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Kim-Manuel Klein, Klaus Jansen, Leon Ladewig, Maria Kosche","submitted_at":"2017-06-15T15:57:36Z","abstract_excerpt":"We consider the relaxed online strip packing problem: Rectangular items arrive online and have to be packed without rotations into a strip of fixed width such that the packing height is minimized. Thereby, repacking of previously packed items is allowed. The amount of repacking is measured by the migration factor, defined as the total size of repacked items divided by the size of the arriving item. First, we show that no algorithm with constant migration factor can produce solutions with asymptotic ratio better than 4/3. Against this background, we allow amortized migration, i.e. to save migra"},"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.04939","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-06-15T15:57:36Z","cross_cats_sorted":[],"title_canon_sha256":"cb84b4c589171a54d9c695b791665494783a68f3038b4db2e1bd8b222e9957dd","abstract_canon_sha256":"5518fa6aa53aca5fd0610c2b0dd9c35da9f55a6be152c32a79fba4a1651f53d0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:22:59.255019Z","signature_b64":"+XwTykcOwlDnnsFX6dF0Uz6B4NRrwYpHeaOmF+Xcspwnp7Hr6IrKEqYrG6N7PLHATlHEzXYCh5Wg+Y2HIb8cAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bce9840a4a352f82c1afd6d5ff6d3df293fe6e20e4979d7b3ce6a1cd5c925dae","last_reissued_at":"2026-05-18T00:22:59.254572Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:22:59.254572Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Online Strip Packing with Polynomial Migration","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Kim-Manuel Klein, Klaus Jansen, Leon Ladewig, Maria Kosche","submitted_at":"2017-06-15T15:57:36Z","abstract_excerpt":"We consider the relaxed online strip packing problem: Rectangular items arrive online and have to be packed without rotations into a strip of fixed width such that the packing height is minimized. Thereby, repacking of previously packed items is allowed. The amount of repacking is measured by the migration factor, defined as the total size of repacked items divided by the size of the arriving item. First, we show that no algorithm with constant migration factor can produce solutions with asymptotic ratio better than 4/3. Against this background, we allow amortized migration, i.e. to save migra"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.04939","kind":"arxiv","version":2},"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.04939","created_at":"2026-05-18T00:22:59.254661+00:00"},{"alias_kind":"arxiv_version","alias_value":"1706.04939v2","created_at":"2026-05-18T00:22:59.254661+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.04939","created_at":"2026-05-18T00:22:59.254661+00:00"},{"alias_kind":"pith_short_12","alias_value":"XTUYICSKGUXY","created_at":"2026-05-18T12:31:56.362134+00:00"},{"alias_kind":"pith_short_16","alias_value":"XTUYICSKGUXYFQNP","created_at":"2026-05-18T12:31:56.362134+00:00"},{"alias_kind":"pith_short_8","alias_value":"XTUYICSK","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/XTUYICSKGUXYFQNP23K763J56K","json":"https://pith.science/pith/XTUYICSKGUXYFQNP23K763J56K.json","graph_json":"https://pith.science/api/pith-number/XTUYICSKGUXYFQNP23K763J56K/graph.json","events_json":"https://pith.science/api/pith-number/XTUYICSKGUXYFQNP23K763J56K/events.json","paper":"https://pith.science/paper/XTUYICSK"},"agent_actions":{"view_html":"https://pith.science/pith/XTUYICSKGUXYFQNP23K763J56K","download_json":"https://pith.science/pith/XTUYICSKGUXYFQNP23K763J56K.json","view_paper":"https://pith.science/paper/XTUYICSK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1706.04939&json=true","fetch_graph":"https://pith.science/api/pith-number/XTUYICSKGUXYFQNP23K763J56K/graph.json","fetch_events":"https://pith.science/api/pith-number/XTUYICSKGUXYFQNP23K763J56K/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XTUYICSKGUXYFQNP23K763J56K/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XTUYICSKGUXYFQNP23K763J56K/action/storage_attestation","attest_author":"https://pith.science/pith/XTUYICSKGUXYFQNP23K763J56K/action/author_attestation","sign_citation":"https://pith.science/pith/XTUYICSKGUXYFQNP23K763J56K/action/citation_signature","submit_replication":"https://pith.science/pith/XTUYICSKGUXYFQNP23K763J56K/action/replication_record"}},"created_at":"2026-05-18T00:22:59.254661+00:00","updated_at":"2026-05-18T00:22:59.254661+00:00"}