{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:L27FR5XMOJHVKCD2QIKT57IUXH","short_pith_number":"pith:L27FR5XM","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"},"canonical_sha256":"5ebe58f6ec724f55087a82153efd14b9f1e4c10e5b92b1ac8b513d9038f5a6e2","source":{"kind":"arxiv","id":"1711.02078","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.02078","created_at":"2026-05-18T00:15:46Z"},{"alias_kind":"arxiv_version","alias_value":"1711.02078v3","created_at":"2026-05-18T00:15:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.02078","created_at":"2026-05-18T00:15:46Z"},{"alias_kind":"pith_short_12","alias_value":"L27FR5XMOJHV","created_at":"2026-05-18T12:31:28Z"},{"alias_kind":"pith_short_16","alias_value":"L27FR5XMOJHVKCD2","created_at":"2026-05-18T12:31:28Z"},{"alias_kind":"pith_short_8","alias_value":"L27FR5XM","created_at":"2026-05-18T12:31:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:L27FR5XMOJHVKCD2QIKT57IUXH","target":"record","payload":{"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"},"canonical_sha256":"5ebe58f6ec724f55087a82153efd14b9f1e4c10e5b92b1ac8b513d9038f5a6e2","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"},"source_kind":"arxiv","source_id":"1711.02078","source_version":3,"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:15:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hrx4CNKlbLmhvbE7Belak+CSVszvcUGq5XDOx54+hFkhawNniDafoyF7tmoF9r0wbSk37kwjFLnKw/KOhi/nCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T05:43:47.249867Z"},"content_sha256":"8419d1b7142823dc6dc5c6fa302ed1b6ad85d58f6717d88eb7bb5001fbdef727","schema_version":"1.0","event_id":"sha256:8419d1b7142823dc6dc5c6fa302ed1b6ad85d58f6717d88eb7bb5001fbdef727"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:L27FR5XMOJHVKCD2QIKT57IUXH","target":"graph","payload":{"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"},"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:15:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dDkGA74OWsWZTO6+n1MfiB5DRYsZedAFg2TLF4fu58/qJXptCeRJbfc7GZMQIGXpCOjM97nRQZFp0MM0TMKTCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T05:43:47.250242Z"},"content_sha256":"545d0af3135be3bc3bc2ae2425bbae6a87bd2d9a5c313d02b01e904df5662f3a","schema_version":"1.0","event_id":"sha256:545d0af3135be3bc3bc2ae2425bbae6a87bd2d9a5c313d02b01e904df5662f3a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/L27FR5XMOJHVKCD2QIKT57IUXH/bundle.json","state_url":"https://pith.science/pith/L27FR5XMOJHVKCD2QIKT57IUXH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/L27FR5XMOJHVKCD2QIKT57IUXH/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-03T05:43:47Z","links":{"resolver":"https://pith.science/pith/L27FR5XMOJHVKCD2QIKT57IUXH","bundle":"https://pith.science/pith/L27FR5XMOJHVKCD2QIKT57IUXH/bundle.json","state":"https://pith.science/pith/L27FR5XMOJHVKCD2QIKT57IUXH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/L27FR5XMOJHVKCD2QIKT57IUXH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:L27FR5XMOJHVKCD2QIKT57IUXH","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":"34f81f23655438d0219fb4e15d4c98b52ebc0c017c767f442f7b410a4dc854dc","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-11-06T18:49:46Z","title_canon_sha256":"a79c3a38c0c4b609b8449dc594dd8208bb5f51f2994a20cc46474cacaa44178c"},"schema_version":"1.0","source":{"id":"1711.02078","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.02078","created_at":"2026-05-18T00:15:46Z"},{"alias_kind":"arxiv_version","alias_value":"1711.02078v3","created_at":"2026-05-18T00:15:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.02078","created_at":"2026-05-18T00:15:46Z"},{"alias_kind":"pith_short_12","alias_value":"L27FR5XMOJHV","created_at":"2026-05-18T12:31:28Z"},{"alias_kind":"pith_short_16","alias_value":"L27FR5XMOJHVKCD2","created_at":"2026-05-18T12:31:28Z"},{"alias_kind":"pith_short_8","alias_value":"L27FR5XM","created_at":"2026-05-18T12:31:28Z"}],"graph_snapshots":[{"event_id":"sha256:545d0af3135be3bc3bc2ae2425bbae6a87bd2d9a5c313d02b01e904df5662f3a","target":"graph","created_at":"2026-05-18T00:15:46Z","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":"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","authors_text":"Amit Kumar, Anupam Gupta, David Wajc, Guru Guruganesh","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-11-06T18:49:46Z","title":"Fully-Dynamic Bin Packing with Limited Repacking"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.02078","kind":"arxiv","version":3},"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:8419d1b7142823dc6dc5c6fa302ed1b6ad85d58f6717d88eb7bb5001fbdef727","target":"record","created_at":"2026-05-18T00:15:46Z","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":"34f81f23655438d0219fb4e15d4c98b52ebc0c017c767f442f7b410a4dc854dc","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-11-06T18:49:46Z","title_canon_sha256":"a79c3a38c0c4b609b8449dc594dd8208bb5f51f2994a20cc46474cacaa44178c"},"schema_version":"1.0","source":{"id":"1711.02078","kind":"arxiv","version":3}},"canonical_sha256":"5ebe58f6ec724f55087a82153efd14b9f1e4c10e5b92b1ac8b513d9038f5a6e2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5ebe58f6ec724f55087a82153efd14b9f1e4c10e5b92b1ac8b513d9038f5a6e2","first_computed_at":"2026-05-18T00:15:46.955988Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:15:46.955988Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"eDGLdTwRTRYGk9Q3D2D1kcBwpDrX41IJlNDwJ/qzWcjp8JVNjgy7PkwCa+QWalZSAtwK/9RF79nq2mBpPvM7Cw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:15:46.956507Z","signed_message":"canonical_sha256_bytes"},"source_id":"1711.02078","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8419d1b7142823dc6dc5c6fa302ed1b6ad85d58f6717d88eb7bb5001fbdef727","sha256:545d0af3135be3bc3bc2ae2425bbae6a87bd2d9a5c313d02b01e904df5662f3a"],"state_sha256":"a593839e0b525ff914f49ee3b6af29867760915c14f6e893429cab6efe3dddf7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sURCbaN4U9vZm84ZYVz4ONPyLr4/yRNO9AoXwjQmSPgjTO2zLC25pOjtQY/TQugwRVj1d/UHI27mz8dYnQFQBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T05:43:47.252210Z","bundle_sha256":"82624feafaeba6f0199f6dc45c43798762728fd59b296a1b4359c47bca20a254"}}