{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:6LHG7MIZUEDKNYGJHCJIRZWRID","short_pith_number":"pith:6LHG7MIZ","schema_version":"1.0","canonical_sha256":"f2ce6fb119a106a6e0c9389288e6d140d03e604888f16ac14345773c84354f7b","source":{"kind":"arxiv","id":"1212.4016","version":2},"attestation_state":"computed","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 "},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1212.4016","created_at":"2026-05-18T03:04:06.727140+00:00"},{"alias_kind":"arxiv_version","alias_value":"1212.4016v2","created_at":"2026-05-18T03:04:06.727140+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1212.4016","created_at":"2026-05-18T03:04:06.727140+00:00"},{"alias_kind":"pith_short_12","alias_value":"6LHG7MIZUEDK","created_at":"2026-05-18T12:26:56.085431+00:00"},{"alias_kind":"pith_short_16","alias_value":"6LHG7MIZUEDKNYGJ","created_at":"2026-05-18T12:26:56.085431+00:00"},{"alias_kind":"pith_short_8","alias_value":"6LHG7MIZ","created_at":"2026-05-18T12:26:56.085431+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/6LHG7MIZUEDKNYGJHCJIRZWRID","json":"https://pith.science/pith/6LHG7MIZUEDKNYGJHCJIRZWRID.json","graph_json":"https://pith.science/api/pith-number/6LHG7MIZUEDKNYGJHCJIRZWRID/graph.json","events_json":"https://pith.science/api/pith-number/6LHG7MIZUEDKNYGJHCJIRZWRID/events.json","paper":"https://pith.science/paper/6LHG7MIZ"},"agent_actions":{"view_html":"https://pith.science/pith/6LHG7MIZUEDKNYGJHCJIRZWRID","download_json":"https://pith.science/pith/6LHG7MIZUEDKNYGJHCJIRZWRID.json","view_paper":"https://pith.science/paper/6LHG7MIZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1212.4016&json=true","fetch_graph":"https://pith.science/api/pith-number/6LHG7MIZUEDKNYGJHCJIRZWRID/graph.json","fetch_events":"https://pith.science/api/pith-number/6LHG7MIZUEDKNYGJHCJIRZWRID/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6LHG7MIZUEDKNYGJHCJIRZWRID/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6LHG7MIZUEDKNYGJHCJIRZWRID/action/storage_attestation","attest_author":"https://pith.science/pith/6LHG7MIZUEDKNYGJHCJIRZWRID/action/author_attestation","sign_citation":"https://pith.science/pith/6LHG7MIZUEDKNYGJHCJIRZWRID/action/citation_signature","submit_replication":"https://pith.science/pith/6LHG7MIZUEDKNYGJHCJIRZWRID/action/replication_record"}},"created_at":"2026-05-18T03:04:06.727140+00:00","updated_at":"2026-05-18T03:04:06.727140+00:00"}