{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:MZV333JHUVHLJR36QEW5NYDS2D","short_pith_number":"pith:MZV333JH","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"},"canonical_sha256":"666bbded27a54eb4c77e812dd6e072d0d18405ea0f506fb9ca7f7b4c6b8a67cd","source":{"kind":"arxiv","id":"1311.7589","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1311.7589","created_at":"2026-05-18T01:35:52Z"},{"alias_kind":"arxiv_version","alias_value":"1311.7589v2","created_at":"2026-05-18T01:35:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1311.7589","created_at":"2026-05-18T01:35:52Z"},{"alias_kind":"pith_short_12","alias_value":"MZV333JHUVHL","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_16","alias_value":"MZV333JHUVHLJR36","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_8","alias_value":"MZV333JH","created_at":"2026-05-18T12:27:52Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:MZV333JHUVHLJR36QEW5NYDS2D","target":"record","payload":{"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"},"canonical_sha256":"666bbded27a54eb4c77e812dd6e072d0d18405ea0f506fb9ca7f7b4c6b8a67cd","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"},"source_kind":"arxiv","source_id":"1311.7589","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-18T01:35:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oRlU4knrITxRN2+9bSpxM7JtksO8vWxS+HXetgu4zotV0JB3JgFePKSzwp/JC66ECIVGnLh+PbuNiDCPZT/ABA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T14:53:19.435024Z"},"content_sha256":"5b97d51421a31a3a6a475d88fbfbc3325aec33e2c19e4b4229ec8e15b8cd5b63","schema_version":"1.0","event_id":"sha256:5b97d51421a31a3a6a475d88fbfbc3325aec33e2c19e4b4229ec8e15b8cd5b63"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:MZV333JHUVHLJR36QEW5NYDS2D","target":"graph","payload":{"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"},"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-18T01:35:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gVNVMOIOwRgU0inZ2zpAVbRcu9T8esxEE2ZbZt/yxv29/PViNd8jbaTWImpOwC/iZWmoHDahtMAhW4oG0vK3AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T14:53:19.435383Z"},"content_sha256":"5f2c8af4685b8834efa389a81f7641c6ff2a177311642f845331f8f7b62f414e","schema_version":"1.0","event_id":"sha256:5f2c8af4685b8834efa389a81f7641c6ff2a177311642f845331f8f7b62f414e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MZV333JHUVHLJR36QEW5NYDS2D/bundle.json","state_url":"https://pith.science/pith/MZV333JHUVHLJR36QEW5NYDS2D/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MZV333JHUVHLJR36QEW5NYDS2D/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-23T14:53:19Z","links":{"resolver":"https://pith.science/pith/MZV333JHUVHLJR36QEW5NYDS2D","bundle":"https://pith.science/pith/MZV333JHUVHLJR36QEW5NYDS2D/bundle.json","state":"https://pith.science/pith/MZV333JHUVHLJR36QEW5NYDS2D/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MZV333JHUVHLJR36QEW5NYDS2D/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:MZV333JHUVHLJR36QEW5NYDS2D","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":"9f705791951f53812608ff79f570588b1103db29d4106f2ff251611e7508f077","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-11-29T15:02:30Z","title_canon_sha256":"4958d179ec6dfc2130f9a530e45bc4f713adc9f72ec553b7ffc442af5d4fb46f"},"schema_version":"1.0","source":{"id":"1311.7589","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1311.7589","created_at":"2026-05-18T01:35:52Z"},{"alias_kind":"arxiv_version","alias_value":"1311.7589v2","created_at":"2026-05-18T01:35:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1311.7589","created_at":"2026-05-18T01:35:52Z"},{"alias_kind":"pith_short_12","alias_value":"MZV333JHUVHL","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_16","alias_value":"MZV333JHUVHLJR36","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_8","alias_value":"MZV333JH","created_at":"2026-05-18T12:27:52Z"}],"graph_snapshots":[{"event_id":"sha256:5f2c8af4685b8834efa389a81f7641c6ff2a177311642f845331f8f7b62f414e","target":"graph","created_at":"2026-05-18T01:35:52Z","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 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","authors_text":"Adi Ros\\'en, Marc P. Renault, Rob van Stee","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-11-29T15:02:30Z","title":"Online Algorithms with Advice for Bin Packing and Scheduling Problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1311.7589","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:5b97d51421a31a3a6a475d88fbfbc3325aec33e2c19e4b4229ec8e15b8cd5b63","target":"record","created_at":"2026-05-18T01:35:52Z","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":"9f705791951f53812608ff79f570588b1103db29d4106f2ff251611e7508f077","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-11-29T15:02:30Z","title_canon_sha256":"4958d179ec6dfc2130f9a530e45bc4f713adc9f72ec553b7ffc442af5d4fb46f"},"schema_version":"1.0","source":{"id":"1311.7589","kind":"arxiv","version":2}},"canonical_sha256":"666bbded27a54eb4c77e812dd6e072d0d18405ea0f506fb9ca7f7b4c6b8a67cd","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"666bbded27a54eb4c77e812dd6e072d0d18405ea0f506fb9ca7f7b4c6b8a67cd","first_computed_at":"2026-05-18T01:35:52.348575Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:35:52.348575Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"PFAfLEY2kTE1PRANnul/g7Rnr02fnGEPBlSs2qoMYX6NJmTNsTu+Nc9hUAaNoYqT5R9jp9AEig+LerJ6eRulAg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:35:52.349280Z","signed_message":"canonical_sha256_bytes"},"source_id":"1311.7589","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5b97d51421a31a3a6a475d88fbfbc3325aec33e2c19e4b4229ec8e15b8cd5b63","sha256:5f2c8af4685b8834efa389a81f7641c6ff2a177311642f845331f8f7b62f414e"],"state_sha256":"0bb4721557513323ad6fe72f2ae23d76ea631939da23547e09a835828d06bdd8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sH30ACMyg2nT4ihQtBsAPBNu4OFbgiekqznvDIzO8yx1jDDnfZE4US2t5srSPOsku7yGf+1MsH4szmyWHe0ABA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-23T14:53:19.437655Z","bundle_sha256":"2b7d47bcb98cd962db265c865b78a2bb2493567da84ace911c4af8fe3655bee3"}}