{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:MZV333JHUVHLJR36QEW5NYDS2D","short_pith_number":"pith:MZV333JH","schema_version":"1.0","canonical_sha256":"666bbded27a54eb4c77e812dd6e072d0d18405ea0f506fb9ca7f7b4c6b8a67cd","source":{"kind":"arxiv","id":"1311.7589","version":2},"attestation_state":"computed","paper":{"title":"Online Algorithms with Advice for Bin Packing and Scheduling Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Adi Ros\\'en, Marc P. Renault, Rob van Stee","submitted_at":"2013-11-29T15:02:30Z","abstract_excerpt":"We consider the setting of online computation with advice, and study the bin packing problem and a number of scheduling problems. We show that it is possible, for any of these problems, to arbitrarily approach a competitive ratio of $1$ with only a constant number of bits of advice per request. For the bin packing problem, we give an online algorithm with advice that is $(1+\\varepsilon)$-competitive and uses $O\\left(\\frac{1}{\\varepsilon}\\log \\frac{1}{\\varepsilon} \\right)$ bits of advice per request. For scheduling on $m$ identical machines, with the objective function of any of makespan, machi"},"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":"1311.7589","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-11-29T15:02:30Z","cross_cats_sorted":[],"title_canon_sha256":"4958d179ec6dfc2130f9a530e45bc4f713adc9f72ec553b7ffc442af5d4fb46f","abstract_canon_sha256":"9f705791951f53812608ff79f570588b1103db29d4106f2ff251611e7508f077"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:35:52.349280Z","signature_b64":"PFAfLEY2kTE1PRANnul/g7Rnr02fnGEPBlSs2qoMYX6NJmTNsTu+Nc9hUAaNoYqT5R9jp9AEig+LerJ6eRulAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"666bbded27a54eb4c77e812dd6e072d0d18405ea0f506fb9ca7f7b4c6b8a67cd","last_reissued_at":"2026-05-18T01:35:52.348575Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:35:52.348575Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Online Algorithms with Advice for Bin Packing and Scheduling Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Adi Ros\\'en, Marc P. Renault, Rob van Stee","submitted_at":"2013-11-29T15:02:30Z","abstract_excerpt":"We consider the setting of online computation with advice, and study the bin packing problem and a number of scheduling problems. We show that it is possible, for any of these problems, to arbitrarily approach a competitive ratio of $1$ with only a constant number of bits of advice per request. For the bin packing problem, we give an online algorithm with advice that is $(1+\\varepsilon)$-competitive and uses $O\\left(\\frac{1}{\\varepsilon}\\log \\frac{1}{\\varepsilon} \\right)$ bits of advice per request. For scheduling on $m$ identical machines, with the objective function of any of makespan, machi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1311.7589","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":"1311.7589","created_at":"2026-05-18T01:35:52.348699+00:00"},{"alias_kind":"arxiv_version","alias_value":"1311.7589v2","created_at":"2026-05-18T01:35:52.348699+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1311.7589","created_at":"2026-05-18T01:35:52.348699+00:00"},{"alias_kind":"pith_short_12","alias_value":"MZV333JHUVHL","created_at":"2026-05-18T12:27:52.871228+00:00"},{"alias_kind":"pith_short_16","alias_value":"MZV333JHUVHLJR36","created_at":"2026-05-18T12:27:52.871228+00:00"},{"alias_kind":"pith_short_8","alias_value":"MZV333JH","created_at":"2026-05-18T12:27:52.871228+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/MZV333JHUVHLJR36QEW5NYDS2D","json":"https://pith.science/pith/MZV333JHUVHLJR36QEW5NYDS2D.json","graph_json":"https://pith.science/api/pith-number/MZV333JHUVHLJR36QEW5NYDS2D/graph.json","events_json":"https://pith.science/api/pith-number/MZV333JHUVHLJR36QEW5NYDS2D/events.json","paper":"https://pith.science/paper/MZV333JH"},"agent_actions":{"view_html":"https://pith.science/pith/MZV333JHUVHLJR36QEW5NYDS2D","download_json":"https://pith.science/pith/MZV333JHUVHLJR36QEW5NYDS2D.json","view_paper":"https://pith.science/paper/MZV333JH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1311.7589&json=true","fetch_graph":"https://pith.science/api/pith-number/MZV333JHUVHLJR36QEW5NYDS2D/graph.json","fetch_events":"https://pith.science/api/pith-number/MZV333JHUVHLJR36QEW5NYDS2D/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MZV333JHUVHLJR36QEW5NYDS2D/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MZV333JHUVHLJR36QEW5NYDS2D/action/storage_attestation","attest_author":"https://pith.science/pith/MZV333JHUVHLJR36QEW5NYDS2D/action/author_attestation","sign_citation":"https://pith.science/pith/MZV333JHUVHLJR36QEW5NYDS2D/action/citation_signature","submit_replication":"https://pith.science/pith/MZV333JHUVHLJR36QEW5NYDS2D/action/replication_record"}},"created_at":"2026-05-18T01:35:52.348699+00:00","updated_at":"2026-05-18T01:35:52.348699+00:00"}