{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:6LHG7MIZUEDKNYGJHCJIRZWRID","short_pith_number":"pith:6LHG7MIZ","canonical_record":{"source":{"id":"1212.4016","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-12-17T15:05:06Z","cross_cats_sorted":[],"title_canon_sha256":"0afc8933dfd4005591490396a4817e73b867051863081286231920cd9242bf1b","abstract_canon_sha256":"f68ae5999c45ab2754008a0a1a2e897944701fe3acc70be429f6cd602937c3eb"},"schema_version":"1.0"},"canonical_sha256":"f2ce6fb119a106a6e0c9389288e6d140d03e604888f16ac14345773c84354f7b","source":{"kind":"arxiv","id":"1212.4016","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1212.4016","created_at":"2026-05-18T03:04:06Z"},{"alias_kind":"arxiv_version","alias_value":"1212.4016v2","created_at":"2026-05-18T03:04:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1212.4016","created_at":"2026-05-18T03:04:06Z"},{"alias_kind":"pith_short_12","alias_value":"6LHG7MIZUEDK","created_at":"2026-05-18T12:26:56Z"},{"alias_kind":"pith_short_16","alias_value":"6LHG7MIZUEDKNYGJ","created_at":"2026-05-18T12:26:56Z"},{"alias_kind":"pith_short_8","alias_value":"6LHG7MIZ","created_at":"2026-05-18T12:26:56Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:6LHG7MIZUEDKNYGJHCJIRZWRID","target":"record","payload":{"canonical_record":{"source":{"id":"1212.4016","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-12-17T15:05:06Z","cross_cats_sorted":[],"title_canon_sha256":"0afc8933dfd4005591490396a4817e73b867051863081286231920cd9242bf1b","abstract_canon_sha256":"f68ae5999c45ab2754008a0a1a2e897944701fe3acc70be429f6cd602937c3eb"},"schema_version":"1.0"},"canonical_sha256":"f2ce6fb119a106a6e0c9389288e6d140d03e604888f16ac14345773c84354f7b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:04:06.727588Z","signature_b64":"/bEgb/Igom2QKfrZQd1vfky4SyWa5XvD6CytTG/t6QiUTCXLiqUs3LNsgLGYWxl+ujTY5s2moHLPfzCdvto/Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f2ce6fb119a106a6e0c9389288e6d140d03e604888f16ac14345773c84354f7b","last_reissued_at":"2026-05-18T03:04:06.727053Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:04:06.727053Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1212.4016","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-05-18T03:04:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TYAizSX1HK5E9dSHg3vX0/cupLz12ARXHn4WFOMPTVxFpWJj2RV7CfBKKFhJEOm2ujpEIs9eOD/iSjVVyGx5AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T13:10:12.486369Z"},"content_sha256":"78c9de19813d83183fcf23d5d5e4799b249d4196c10fc570c53b4b02d87197d5","schema_version":"1.0","event_id":"sha256:78c9de19813d83183fcf23d5d5e4799b249d4196c10fc570c53b4b02d87197d5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:6LHG7MIZUEDKNYGJHCJIRZWRID","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Online Bin Packing with Advice","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Alejandro L\\'opez-Ortiz, Joan Boyar, Kim S. Larsen, Shahin Kamali","submitted_at":"2012-12-17T15:05:06Z","abstract_excerpt":"We consider the online bin packing problem under the advice complexity model where the 'online constraint' is relaxed and an algorithm receives partial information about the future requests. We provide tight upper and lower bounds for the amount of advice an algorithm needs to achieve an optimal packing. We also introduce an algorithm that, when provided with log n + o(log n) bits of advice, achieves a competitive ratio of 3/2 for the general problem. This algorithm is simple and is expected to find real-world applications. We introduce another algorithm that receives 2n + o(n) bits of advice "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1212.4016","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"},"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-18T03:04:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CaqiCXVB3APbssPYFGmL4h8amSmnW8GdZIZRRXtBwjbqc5R1cPAIOa+GdFJ14H5ToFLpfiroNAjS2QhBBUFCCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T13:10:12.486723Z"},"content_sha256":"c1fe98f25767e14a6bd6c585a5a0b7ae7ef6b42a9b619c474213daf181a4442d","schema_version":"1.0","event_id":"sha256:c1fe98f25767e14a6bd6c585a5a0b7ae7ef6b42a9b619c474213daf181a4442d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6LHG7MIZUEDKNYGJHCJIRZWRID/bundle.json","state_url":"https://pith.science/pith/6LHG7MIZUEDKNYGJHCJIRZWRID/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6LHG7MIZUEDKNYGJHCJIRZWRID/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-22T13:10:12Z","links":{"resolver":"https://pith.science/pith/6LHG7MIZUEDKNYGJHCJIRZWRID","bundle":"https://pith.science/pith/6LHG7MIZUEDKNYGJHCJIRZWRID/bundle.json","state":"https://pith.science/pith/6LHG7MIZUEDKNYGJHCJIRZWRID/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6LHG7MIZUEDKNYGJHCJIRZWRID/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:6LHG7MIZUEDKNYGJHCJIRZWRID","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":"f68ae5999c45ab2754008a0a1a2e897944701fe3acc70be429f6cd602937c3eb","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-12-17T15:05:06Z","title_canon_sha256":"0afc8933dfd4005591490396a4817e73b867051863081286231920cd9242bf1b"},"schema_version":"1.0","source":{"id":"1212.4016","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1212.4016","created_at":"2026-05-18T03:04:06Z"},{"alias_kind":"arxiv_version","alias_value":"1212.4016v2","created_at":"2026-05-18T03:04:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1212.4016","created_at":"2026-05-18T03:04:06Z"},{"alias_kind":"pith_short_12","alias_value":"6LHG7MIZUEDK","created_at":"2026-05-18T12:26:56Z"},{"alias_kind":"pith_short_16","alias_value":"6LHG7MIZUEDKNYGJ","created_at":"2026-05-18T12:26:56Z"},{"alias_kind":"pith_short_8","alias_value":"6LHG7MIZ","created_at":"2026-05-18T12:26:56Z"}],"graph_snapshots":[{"event_id":"sha256:c1fe98f25767e14a6bd6c585a5a0b7ae7ef6b42a9b619c474213daf181a4442d","target":"graph","created_at":"2026-05-18T03:04:06Z","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 consider the online bin packing problem under the advice complexity model where the 'online constraint' is relaxed and an algorithm receives partial information about the future requests. We provide tight upper and lower bounds for the amount of advice an algorithm needs to achieve an optimal packing. We also introduce an algorithm that, when provided with log n + o(log n) bits of advice, achieves a competitive ratio of 3/2 for the general problem. This algorithm is simple and is expected to find real-world applications. We introduce another algorithm that receives 2n + o(n) bits of advice ","authors_text":"Alejandro L\\'opez-Ortiz, Joan Boyar, Kim S. Larsen, Shahin Kamali","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-12-17T15:05:06Z","title":"Online Bin Packing with Advice"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1212.4016","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:78c9de19813d83183fcf23d5d5e4799b249d4196c10fc570c53b4b02d87197d5","target":"record","created_at":"2026-05-18T03:04:06Z","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":"f68ae5999c45ab2754008a0a1a2e897944701fe3acc70be429f6cd602937c3eb","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-12-17T15:05:06Z","title_canon_sha256":"0afc8933dfd4005591490396a4817e73b867051863081286231920cd9242bf1b"},"schema_version":"1.0","source":{"id":"1212.4016","kind":"arxiv","version":2}},"canonical_sha256":"f2ce6fb119a106a6e0c9389288e6d140d03e604888f16ac14345773c84354f7b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f2ce6fb119a106a6e0c9389288e6d140d03e604888f16ac14345773c84354f7b","first_computed_at":"2026-05-18T03:04:06.727053Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:04:06.727053Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"/bEgb/Igom2QKfrZQd1vfky4SyWa5XvD6CytTG/t6QiUTCXLiqUs3LNsgLGYWxl+ujTY5s2moHLPfzCdvto/Ag==","signature_status":"signed_v1","signed_at":"2026-05-18T03:04:06.727588Z","signed_message":"canonical_sha256_bytes"},"source_id":"1212.4016","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:78c9de19813d83183fcf23d5d5e4799b249d4196c10fc570c53b4b02d87197d5","sha256:c1fe98f25767e14a6bd6c585a5a0b7ae7ef6b42a9b619c474213daf181a4442d"],"state_sha256":"757eb2fc9d6bdc236889835fa03fa6b98952e0248a03d677b78c40c3fbe47b4b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"D5V30qp6E5zRyp3qRSYT4FyVX0wP8bttkahjDRjth+i/NFaEOkDKYL66lZ887YY1algTCqdhWiIAoft+PmsPBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-22T13:10:12.488705Z","bundle_sha256":"23ac1bcfe20cb710fa069c9a67a798a5f87d3d1c3b194d757d2b1d43798c1ff8"}}