{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:S4BQH2KN246RVWC6KKP6J34NNT","short_pith_number":"pith:S4BQH2KN","schema_version":"1.0","canonical_sha256":"970303e94dd73d1ad85e529fe4ef8d6cc6271bf6ecbcff0858d6b4a3a3adf323","source":{"kind":"arxiv","id":"1708.01657","version":1},"attestation_state":"computed","paper":{"title":"A Simple PTAS for the Dual Bin Packing Problem and Advice Complexity of Its Online Version","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Allan Borodin, Amirali Salehi-Abari, Denis Pankratov","submitted_at":"2017-08-04T20:25:46Z","abstract_excerpt":"Recently, Renault (2016) studied the dual bin packing problem in the per-request advice model of online algorithms. He showed that given $O(1/\\epsilon)$ advice bits for each input item allows approximating the dual bin packing problem online to within a factor of $1+\\epsilon$. Renault asked about the advice complexity of dual bin packing in the tape-advice model of online algorithms. We make progress on this question. Let $s$ be the maximum bit size of an input item weight. We present a conceptually simple online algorithm that with total advice $O\\left(\\frac{s + \\log n}{\\epsilon^2}\\right)$ ap"},"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":"1708.01657","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-08-04T20:25:46Z","cross_cats_sorted":[],"title_canon_sha256":"0e3da29eba985088cbce9340c60bd53d1078dc5b751b466ec6f039dd613f6b90","abstract_canon_sha256":"f68c9236c55bbfb743a16cd4df714c8ac4381d9df075f7f8c5eb659c8672e63f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:38:35.275576Z","signature_b64":"mAb50gtDf+6+uC1yAHN5Cn7NSOebQO8+WOiECO42wMjLVNF/dyoxV5hwTr1hQeHYOBkooNaNroPxBTl5WVnSAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"970303e94dd73d1ad85e529fe4ef8d6cc6271bf6ecbcff0858d6b4a3a3adf323","last_reissued_at":"2026-05-18T00:38:35.274919Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:38:35.274919Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Simple PTAS for the Dual Bin Packing Problem and Advice Complexity of Its Online Version","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Allan Borodin, Amirali Salehi-Abari, Denis Pankratov","submitted_at":"2017-08-04T20:25:46Z","abstract_excerpt":"Recently, Renault (2016) studied the dual bin packing problem in the per-request advice model of online algorithms. He showed that given $O(1/\\epsilon)$ advice bits for each input item allows approximating the dual bin packing problem online to within a factor of $1+\\epsilon$. Renault asked about the advice complexity of dual bin packing in the tape-advice model of online algorithms. We make progress on this question. Let $s$ be the maximum bit size of an input item weight. We present a conceptually simple online algorithm that with total advice $O\\left(\\frac{s + \\log n}{\\epsilon^2}\\right)$ ap"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.01657","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1708.01657","created_at":"2026-05-18T00:38:35.275045+00:00"},{"alias_kind":"arxiv_version","alias_value":"1708.01657v1","created_at":"2026-05-18T00:38:35.275045+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.01657","created_at":"2026-05-18T00:38:35.275045+00:00"},{"alias_kind":"pith_short_12","alias_value":"S4BQH2KN246R","created_at":"2026-05-18T12:31:43.269735+00:00"},{"alias_kind":"pith_short_16","alias_value":"S4BQH2KN246RVWC6","created_at":"2026-05-18T12:31:43.269735+00:00"},{"alias_kind":"pith_short_8","alias_value":"S4BQH2KN","created_at":"2026-05-18T12:31:43.269735+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/S4BQH2KN246RVWC6KKP6J34NNT","json":"https://pith.science/pith/S4BQH2KN246RVWC6KKP6J34NNT.json","graph_json":"https://pith.science/api/pith-number/S4BQH2KN246RVWC6KKP6J34NNT/graph.json","events_json":"https://pith.science/api/pith-number/S4BQH2KN246RVWC6KKP6J34NNT/events.json","paper":"https://pith.science/paper/S4BQH2KN"},"agent_actions":{"view_html":"https://pith.science/pith/S4BQH2KN246RVWC6KKP6J34NNT","download_json":"https://pith.science/pith/S4BQH2KN246RVWC6KKP6J34NNT.json","view_paper":"https://pith.science/paper/S4BQH2KN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1708.01657&json=true","fetch_graph":"https://pith.science/api/pith-number/S4BQH2KN246RVWC6KKP6J34NNT/graph.json","fetch_events":"https://pith.science/api/pith-number/S4BQH2KN246RVWC6KKP6J34NNT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/S4BQH2KN246RVWC6KKP6J34NNT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/S4BQH2KN246RVWC6KKP6J34NNT/action/storage_attestation","attest_author":"https://pith.science/pith/S4BQH2KN246RVWC6KKP6J34NNT/action/author_attestation","sign_citation":"https://pith.science/pith/S4BQH2KN246RVWC6KKP6J34NNT/action/citation_signature","submit_replication":"https://pith.science/pith/S4BQH2KN246RVWC6KKP6J34NNT/action/replication_record"}},"created_at":"2026-05-18T00:38:35.275045+00:00","updated_at":"2026-05-18T00:38:35.275045+00:00"}