{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:L27FR5XMOJHVKCD2QIKT57IUXH","short_pith_number":"pith:L27FR5XM","schema_version":"1.0","canonical_sha256":"5ebe58f6ec724f55087a82153efd14b9f1e4c10e5b92b1ac8b513d9038f5a6e2","source":{"kind":"arxiv","id":"1711.02078","version":3},"attestation_state":"computed","paper":{"title":"Fully-Dynamic Bin Packing with Limited Repacking","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Amit Kumar, Anupam Gupta, David Wajc, Guru Guruganesh","submitted_at":"2017-11-06T18:49:46Z","abstract_excerpt":"We study the classic Bin Packing problem in a fully-dynamic setting, where new items can arrive and old items may depart. We want algorithms with low asymptotic competitive ratio \\emph{while repacking items sparingly} between updates. Formally, each item $i$ has a \\emph{movement cost} $c_i\\geq 0$, and we want to use $\\alpha \\cdot OPT$ bins and incur a movement cost $\\gamma\\cdot c_i$, either in the worst case, or in an amortized sense, for $\\alpha, \\gamma$ as small as possible. We call $\\gamma$ the \\emph{recourse} of the algorithm. This is motivated by cloud storage applications, where fully-dy"},"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":"1711.02078","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-11-06T18:49:46Z","cross_cats_sorted":[],"title_canon_sha256":"a79c3a38c0c4b609b8449dc594dd8208bb5f51f2994a20cc46474cacaa44178c","abstract_canon_sha256":"34f81f23655438d0219fb4e15d4c98b52ebc0c017c767f442f7b410a4dc854dc"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:15:46.956507Z","signature_b64":"eDGLdTwRTRYGk9Q3D2D1kcBwpDrX41IJlNDwJ/qzWcjp8JVNjgy7PkwCa+QWalZSAtwK/9RF79nq2mBpPvM7Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5ebe58f6ec724f55087a82153efd14b9f1e4c10e5b92b1ac8b513d9038f5a6e2","last_reissued_at":"2026-05-18T00:15:46.955988Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:15:46.955988Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fully-Dynamic Bin Packing with Limited Repacking","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Amit Kumar, Anupam Gupta, David Wajc, Guru Guruganesh","submitted_at":"2017-11-06T18:49:46Z","abstract_excerpt":"We study the classic Bin Packing problem in a fully-dynamic setting, where new items can arrive and old items may depart. We want algorithms with low asymptotic competitive ratio \\emph{while repacking items sparingly} between updates. Formally, each item $i$ has a \\emph{movement cost} $c_i\\geq 0$, and we want to use $\\alpha \\cdot OPT$ bins and incur a movement cost $\\gamma\\cdot c_i$, either in the worst case, or in an amortized sense, for $\\alpha, \\gamma$ as small as possible. We call $\\gamma$ the \\emph{recourse} of the algorithm. This is motivated by cloud storage applications, where fully-dy"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.02078","kind":"arxiv","version":3},"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":"1711.02078","created_at":"2026-05-18T00:15:46.956072+00:00"},{"alias_kind":"arxiv_version","alias_value":"1711.02078v3","created_at":"2026-05-18T00:15:46.956072+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.02078","created_at":"2026-05-18T00:15:46.956072+00:00"},{"alias_kind":"pith_short_12","alias_value":"L27FR5XMOJHV","created_at":"2026-05-18T12:31:28.150371+00:00"},{"alias_kind":"pith_short_16","alias_value":"L27FR5XMOJHVKCD2","created_at":"2026-05-18T12:31:28.150371+00:00"},{"alias_kind":"pith_short_8","alias_value":"L27FR5XM","created_at":"2026-05-18T12:31:28.150371+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/L27FR5XMOJHVKCD2QIKT57IUXH","json":"https://pith.science/pith/L27FR5XMOJHVKCD2QIKT57IUXH.json","graph_json":"https://pith.science/api/pith-number/L27FR5XMOJHVKCD2QIKT57IUXH/graph.json","events_json":"https://pith.science/api/pith-number/L27FR5XMOJHVKCD2QIKT57IUXH/events.json","paper":"https://pith.science/paper/L27FR5XM"},"agent_actions":{"view_html":"https://pith.science/pith/L27FR5XMOJHVKCD2QIKT57IUXH","download_json":"https://pith.science/pith/L27FR5XMOJHVKCD2QIKT57IUXH.json","view_paper":"https://pith.science/paper/L27FR5XM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1711.02078&json=true","fetch_graph":"https://pith.science/api/pith-number/L27FR5XMOJHVKCD2QIKT57IUXH/graph.json","fetch_events":"https://pith.science/api/pith-number/L27FR5XMOJHVKCD2QIKT57IUXH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/L27FR5XMOJHVKCD2QIKT57IUXH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/L27FR5XMOJHVKCD2QIKT57IUXH/action/storage_attestation","attest_author":"https://pith.science/pith/L27FR5XMOJHVKCD2QIKT57IUXH/action/author_attestation","sign_citation":"https://pith.science/pith/L27FR5XMOJHVKCD2QIKT57IUXH/action/citation_signature","submit_replication":"https://pith.science/pith/L27FR5XMOJHVKCD2QIKT57IUXH/action/replication_record"}},"created_at":"2026-05-18T00:15:46.956072+00:00","updated_at":"2026-05-18T00:15:46.956072+00:00"}