{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:ARIU65RCD5LGC2UQOGOB4GS65K","short_pith_number":"pith:ARIU65RC","canonical_record":{"source":{"id":"1207.5672","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-07-24T12:11:36Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"7d1a15e51c073f2a29ec7454c843f433f2c50ff180a2096dfbf74b47f199e67a","abstract_canon_sha256":"f28a37752abbc03219b718deae53f904e6c16a552cca78a872fc1f1edacea92c"},"schema_version":"1.0"},"canonical_sha256":"04514f76221f56616a90719c1e1a5eea856d675295aeda0b61c52592855cbbfc","source":{"kind":"arxiv","id":"1207.5672","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1207.5672","created_at":"2026-05-18T02:21:08Z"},{"alias_kind":"arxiv_version","alias_value":"1207.5672v1","created_at":"2026-05-18T02:21:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.5672","created_at":"2026-05-18T02:21:08Z"},{"alias_kind":"pith_short_12","alias_value":"ARIU65RCD5LG","created_at":"2026-05-18T12:26:58Z"},{"alias_kind":"pith_short_16","alias_value":"ARIU65RCD5LGC2UQ","created_at":"2026-05-18T12:26:58Z"},{"alias_kind":"pith_short_8","alias_value":"ARIU65RC","created_at":"2026-05-18T12:26:58Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:ARIU65RCD5LGC2UQOGOB4GS65K","target":"record","payload":{"canonical_record":{"source":{"id":"1207.5672","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-07-24T12:11:36Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"7d1a15e51c073f2a29ec7454c843f433f2c50ff180a2096dfbf74b47f199e67a","abstract_canon_sha256":"f28a37752abbc03219b718deae53f904e6c16a552cca78a872fc1f1edacea92c"},"schema_version":"1.0"},"canonical_sha256":"04514f76221f56616a90719c1e1a5eea856d675295aeda0b61c52592855cbbfc","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:21:08.060652Z","signature_b64":"Xa73TyYXnbQS2d7mtAmSRLaKsOkU0razra86RuTs8hnqOzeC9fpd9g8eJYjao+TuZMyW5CmWzRpNpnqPKKUmAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"04514f76221f56616a90719c1e1a5eea856d675295aeda0b61c52592855cbbfc","last_reissued_at":"2026-05-18T02:21:08.060164Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:21:08.060164Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1207.5672","source_version":1,"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-18T02:21:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"q3Xie8KPCE+eftKu0EUAqbITaGNonYsKMQWZxae2vYtz+a1UCwpd5u49487IC45evLMUOWBlr6qs2u+sX0rQCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T08:38:00.766517Z"},"content_sha256":"fcfae8c3c68f629ed89a1c3314f4f4ae2be358181f2b1a311d3de140e4f027da","schema_version":"1.0","event_id":"sha256:fcfae8c3c68f629ed89a1c3314f4f4ae2be358181f2b1a311d3de140e4f027da"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:ARIU65RCD5LGC2UQOGOB4GS65K","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Bin Packing/Covering with Delivery: Some variations, theoretical results and efficient offline algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.DS","authors_text":"Gyorgy Dosa, Zsolt Tuza","submitted_at":"2012-07-24T12:11:36Z","abstract_excerpt":"In the recent paper \\cite{BDT10} we introduced a new problem that we call Bin Packing/Covering with Delivery, or BP/CD for short. Mainly we mean under this expression that we look for not only a good, but a \"good and fast\" packing or covering. In that paper we mainly dealt with only one possible online BP/CD model, and proposed a new method that we call the Evolution of Algorithms. In case of such methods a neighborhood structure is defined among algorithms, and using a metaheuristic (for example simulated annealing) in some sense the best algorithm is chosen to solve the problem. Now we turn "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1207.5672","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"},"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-18T02:21:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4DYMjTP5z82aIEP2qs4ObyzOrS+W0Ww6kAyMvXtBB500R+CsOqT2H9YP2VZ2WYxhUb4taEJ6p38wmG8N8+6hBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T08:38:00.766892Z"},"content_sha256":"0f5168d863053155e7d55cb94947e6c003ed2b8af9e84bf242ca6b5cd59007ad","schema_version":"1.0","event_id":"sha256:0f5168d863053155e7d55cb94947e6c003ed2b8af9e84bf242ca6b5cd59007ad"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ARIU65RCD5LGC2UQOGOB4GS65K/bundle.json","state_url":"https://pith.science/pith/ARIU65RCD5LGC2UQOGOB4GS65K/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ARIU65RCD5LGC2UQOGOB4GS65K/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-05-30T08:38:00Z","links":{"resolver":"https://pith.science/pith/ARIU65RCD5LGC2UQOGOB4GS65K","bundle":"https://pith.science/pith/ARIU65RCD5LGC2UQOGOB4GS65K/bundle.json","state":"https://pith.science/pith/ARIU65RCD5LGC2UQOGOB4GS65K/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ARIU65RCD5LGC2UQOGOB4GS65K/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:ARIU65RCD5LGC2UQOGOB4GS65K","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":"f28a37752abbc03219b718deae53f904e6c16a552cca78a872fc1f1edacea92c","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-07-24T12:11:36Z","title_canon_sha256":"7d1a15e51c073f2a29ec7454c843f433f2c50ff180a2096dfbf74b47f199e67a"},"schema_version":"1.0","source":{"id":"1207.5672","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1207.5672","created_at":"2026-05-18T02:21:08Z"},{"alias_kind":"arxiv_version","alias_value":"1207.5672v1","created_at":"2026-05-18T02:21:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.5672","created_at":"2026-05-18T02:21:08Z"},{"alias_kind":"pith_short_12","alias_value":"ARIU65RCD5LG","created_at":"2026-05-18T12:26:58Z"},{"alias_kind":"pith_short_16","alias_value":"ARIU65RCD5LGC2UQ","created_at":"2026-05-18T12:26:58Z"},{"alias_kind":"pith_short_8","alias_value":"ARIU65RC","created_at":"2026-05-18T12:26:58Z"}],"graph_snapshots":[{"event_id":"sha256:0f5168d863053155e7d55cb94947e6c003ed2b8af9e84bf242ca6b5cd59007ad","target":"graph","created_at":"2026-05-18T02:21:08Z","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":"In the recent paper \\cite{BDT10} we introduced a new problem that we call Bin Packing/Covering with Delivery, or BP/CD for short. Mainly we mean under this expression that we look for not only a good, but a \"good and fast\" packing or covering. In that paper we mainly dealt with only one possible online BP/CD model, and proposed a new method that we call the Evolution of Algorithms. In case of such methods a neighborhood structure is defined among algorithms, and using a metaheuristic (for example simulated annealing) in some sense the best algorithm is chosen to solve the problem. Now we turn ","authors_text":"Gyorgy Dosa, Zsolt Tuza","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-07-24T12:11:36Z","title":"Bin Packing/Covering with Delivery: Some variations, theoretical results and efficient offline algorithms"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1207.5672","kind":"arxiv","version":1},"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:fcfae8c3c68f629ed89a1c3314f4f4ae2be358181f2b1a311d3de140e4f027da","target":"record","created_at":"2026-05-18T02:21:08Z","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":"f28a37752abbc03219b718deae53f904e6c16a552cca78a872fc1f1edacea92c","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-07-24T12:11:36Z","title_canon_sha256":"7d1a15e51c073f2a29ec7454c843f433f2c50ff180a2096dfbf74b47f199e67a"},"schema_version":"1.0","source":{"id":"1207.5672","kind":"arxiv","version":1}},"canonical_sha256":"04514f76221f56616a90719c1e1a5eea856d675295aeda0b61c52592855cbbfc","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"04514f76221f56616a90719c1e1a5eea856d675295aeda0b61c52592855cbbfc","first_computed_at":"2026-05-18T02:21:08.060164Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:21:08.060164Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Xa73TyYXnbQS2d7mtAmSRLaKsOkU0razra86RuTs8hnqOzeC9fpd9g8eJYjao+TuZMyW5CmWzRpNpnqPKKUmAA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:21:08.060652Z","signed_message":"canonical_sha256_bytes"},"source_id":"1207.5672","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fcfae8c3c68f629ed89a1c3314f4f4ae2be358181f2b1a311d3de140e4f027da","sha256:0f5168d863053155e7d55cb94947e6c003ed2b8af9e84bf242ca6b5cd59007ad"],"state_sha256":"333c40e8ae2ee6bf012ba8c11df263165db3d7bed259b3c8e269952ac405a653"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TKVMxW5nHwqkDXyxat7IqZvt8fnzq0U3EAudCW9BbBx3xMWRhsRrjz2frnrO4ak+f/QEDrGT8PUBcKH+aVy+AQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T08:38:00.768910Z","bundle_sha256":"573b461bb3de0fda9f54e0975e8add26afa0f5b2646fab92ef0d423ca4e02936"}}