{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2022:33GTN27MDGTNU5WFCAUQODBQPV","short_pith_number":"pith:33GTN27M","canonical_record":{"source":{"id":"2205.08769","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2022-05-18T07:41:26Z","cross_cats_sorted":["cs.DM","math.OC"],"title_canon_sha256":"acb254b032fc5e590fe82ee1e5a1189a62be376d4cbbfaffac4cbcbb851d9409","abstract_canon_sha256":"77142bf3660e2affe5c0a8e2a74fa59801dde8c30d946c39bb76079061a85de7"},"schema_version":"1.0"},"canonical_sha256":"decd36ebec19a6da76c51029070c307d67807182724014d28b3d5648b8a3061f","source":{"kind":"arxiv","id":"2205.08769","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2205.08769","created_at":"2026-07-05T06:32:33Z"},{"alias_kind":"arxiv_version","alias_value":"2205.08769v2","created_at":"2026-07-05T06:32:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2205.08769","created_at":"2026-07-05T06:32:33Z"},{"alias_kind":"pith_short_12","alias_value":"33GTN27MDGTN","created_at":"2026-07-05T06:32:33Z"},{"alias_kind":"pith_short_16","alias_value":"33GTN27MDGTNU5WF","created_at":"2026-07-05T06:32:33Z"},{"alias_kind":"pith_short_8","alias_value":"33GTN27M","created_at":"2026-07-05T06:32:33Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2022:33GTN27MDGTNU5WFCAUQODBQPV","target":"record","payload":{"canonical_record":{"source":{"id":"2205.08769","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2022-05-18T07:41:26Z","cross_cats_sorted":["cs.DM","math.OC"],"title_canon_sha256":"acb254b032fc5e590fe82ee1e5a1189a62be376d4cbbfaffac4cbcbb851d9409","abstract_canon_sha256":"77142bf3660e2affe5c0a8e2a74fa59801dde8c30d946c39bb76079061a85de7"},"schema_version":"1.0"},"canonical_sha256":"decd36ebec19a6da76c51029070c307d67807182724014d28b3d5648b8a3061f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:32:33.159918Z","signature_b64":"BxmhNnOt0FHOvdR/0Fvff1bP6I8kdxFG3UpuV6X174QpI1b2XJX3hAAfWpnSeLCc/g8ugItsie1wh0nFe1xwBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"decd36ebec19a6da76c51029070c307d67807182724014d28b3d5648b8a3061f","last_reissued_at":"2026-07-05T06:32:33.159406Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:32:33.159406Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2205.08769","source_version":2,"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-07-05T06:32:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lzfas+3geNwhxHuonpgGBDw9etXiD54CLvpU961skpGvQje1sbRw2CUUqN4gokXf3RRWLq1Tfyx/GBQzIv1SAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-06T04:09:31.916670Z"},"content_sha256":"e2bd679541e2c9e0b9fed69b242afddcf28b35c0b23e27b12650d0cf755d8516","schema_version":"1.0","event_id":"sha256:e2bd679541e2c9e0b9fed69b242afddcf28b35c0b23e27b12650d0cf755d8516"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2022:33GTN27MDGTNU5WFCAUQODBQPV","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On data reduction for dynamic vector bin packing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.OC"],"primary_cat":"cs.DS","authors_text":"Andrey Melnikov, Oxana Tsidulko, Pavel Smirnov, Ren\\'e van Bevern","submitted_at":"2022-05-18T07:41:26Z","abstract_excerpt":"We study a dynamic vector bin packing (DVBP) problem. We show hardness for shrinking arbitrary DVBP instances to size polynomial in the number of request types or in the maximal number of requests overlapping in time. We also present a simple polynomial-time data reduction algorithm that allows to recover $(1 + {\\varepsilon})$-approximate solutions for arbitrary ${\\varepsilon} > 0$. It shrinks instances from Microsoft Azure and Huawei Cloud by an order of magnitude for ${\\varepsilon} = 0.02$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2205.08769","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2205.08769/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T06:32:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4kIoaOW+M6aFdaT19wATnbMwo59PR3M4SS7pgwCjnc0uKhK9Lbaux8iDgMn2hAI6V+JJsiaBZG5i8Pi+rdZrDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-06T04:09:31.917520Z"},"content_sha256":"9bac58b251ba239653c146faee0d461d5e64a1d8d40bcaa0021937da172af542","schema_version":"1.0","event_id":"sha256:9bac58b251ba239653c146faee0d461d5e64a1d8d40bcaa0021937da172af542"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/33GTN27MDGTNU5WFCAUQODBQPV/bundle.json","state_url":"https://pith.science/pith/33GTN27MDGTNU5WFCAUQODBQPV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/33GTN27MDGTNU5WFCAUQODBQPV/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-08-06T04:09:31Z","links":{"resolver":"https://pith.science/pith/33GTN27MDGTNU5WFCAUQODBQPV","bundle":"https://pith.science/pith/33GTN27MDGTNU5WFCAUQODBQPV/bundle.json","state":"https://pith.science/pith/33GTN27MDGTNU5WFCAUQODBQPV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/33GTN27MDGTNU5WFCAUQODBQPV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:33GTN27MDGTNU5WFCAUQODBQPV","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":"77142bf3660e2affe5c0a8e2a74fa59801dde8c30d946c39bb76079061a85de7","cross_cats_sorted":["cs.DM","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2022-05-18T07:41:26Z","title_canon_sha256":"acb254b032fc5e590fe82ee1e5a1189a62be376d4cbbfaffac4cbcbb851d9409"},"schema_version":"1.0","source":{"id":"2205.08769","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2205.08769","created_at":"2026-07-05T06:32:33Z"},{"alias_kind":"arxiv_version","alias_value":"2205.08769v2","created_at":"2026-07-05T06:32:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2205.08769","created_at":"2026-07-05T06:32:33Z"},{"alias_kind":"pith_short_12","alias_value":"33GTN27MDGTN","created_at":"2026-07-05T06:32:33Z"},{"alias_kind":"pith_short_16","alias_value":"33GTN27MDGTNU5WF","created_at":"2026-07-05T06:32:33Z"},{"alias_kind":"pith_short_8","alias_value":"33GTN27M","created_at":"2026-07-05T06:32:33Z"}],"graph_snapshots":[{"event_id":"sha256:9bac58b251ba239653c146faee0d461d5e64a1d8d40bcaa0021937da172af542","target":"graph","created_at":"2026-07-05T06:32:33Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2205.08769/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We study a dynamic vector bin packing (DVBP) problem. We show hardness for shrinking arbitrary DVBP instances to size polynomial in the number of request types or in the maximal number of requests overlapping in time. We also present a simple polynomial-time data reduction algorithm that allows to recover $(1 + {\\varepsilon})$-approximate solutions for arbitrary ${\\varepsilon} > 0$. It shrinks instances from Microsoft Azure and Huawei Cloud by an order of magnitude for ${\\varepsilon} = 0.02$.","authors_text":"Andrey Melnikov, Oxana Tsidulko, Pavel Smirnov, Ren\\'e van Bevern","cross_cats":["cs.DM","math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2022-05-18T07:41:26Z","title":"On data reduction for dynamic vector bin packing"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2205.08769","kind":"arxiv","version":2},"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:e2bd679541e2c9e0b9fed69b242afddcf28b35c0b23e27b12650d0cf755d8516","target":"record","created_at":"2026-07-05T06:32:33Z","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":"77142bf3660e2affe5c0a8e2a74fa59801dde8c30d946c39bb76079061a85de7","cross_cats_sorted":["cs.DM","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2022-05-18T07:41:26Z","title_canon_sha256":"acb254b032fc5e590fe82ee1e5a1189a62be376d4cbbfaffac4cbcbb851d9409"},"schema_version":"1.0","source":{"id":"2205.08769","kind":"arxiv","version":2}},"canonical_sha256":"decd36ebec19a6da76c51029070c307d67807182724014d28b3d5648b8a3061f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"decd36ebec19a6da76c51029070c307d67807182724014d28b3d5648b8a3061f","first_computed_at":"2026-07-05T06:32:33.159406Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T06:32:33.159406Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"BxmhNnOt0FHOvdR/0Fvff1bP6I8kdxFG3UpuV6X174QpI1b2XJX3hAAfWpnSeLCc/g8ugItsie1wh0nFe1xwBw==","signature_status":"signed_v1","signed_at":"2026-07-05T06:32:33.159918Z","signed_message":"canonical_sha256_bytes"},"source_id":"2205.08769","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e2bd679541e2c9e0b9fed69b242afddcf28b35c0b23e27b12650d0cf755d8516","sha256:9bac58b251ba239653c146faee0d461d5e64a1d8d40bcaa0021937da172af542"],"state_sha256":"c5ea4295dad88d0a42d6eb15988491a0f73aabbea2114c850d9f60d45631547a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zKwOEFdhF1FrFYuL07Q2Pszpac22NII4afjnn0I3AUyceTirzZnVGroLh/KiZvLlZNDC6MOEkyzjJ9SV7rxcBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-06T04:09:31.925666Z","bundle_sha256":"0e14f1c50c2df2ba33f8877bf1d1cdeb8cdcfe31a46e2f16b84029efe86165d8"}}