{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:PNHVT6YJ2GAJM2FVEH4RBHLNB7","short_pith_number":"pith:PNHVT6YJ","schema_version":"1.0","canonical_sha256":"7b4f59fb09d1809668b521f9109d6d0fc4abcd18622dcd755d99d348c644d2cd","source":{"kind":"arxiv","id":"1007.1260","version":3},"attestation_state":"computed","paper":{"title":"A Dense Hierarchy of Sublinear Time Approximation Schemes for Bin Packing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CC","authors_text":"Bin Fu, Richard Beigel","submitted_at":"2010-07-07T23:22:53Z","abstract_excerpt":"The bin packing problem is to find the minimum number of bins of size one to pack a list of items with sizes $a_1,..., a_n$ in $(0,1]$. Using uniform sampling, which selects a random element from the input list each time, we develop a randomized $O({n(\\log n)(\\log\\log n)\\over \\sum_{i=1}^n a_i}+({1\\over \\epsilon})^{O({1\\over\\epsilon})})$ time $(1+\\epsilon)$-approximation scheme for the bin packing problem. We show that every randomized algorithm with uniform random sampling needs $\\Omega({n\\over \\sum_{i=1}^n a_i})$ time to give an $(1+\\epsilon)$-approximation. For each function $s(n): N\\rightar"},"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":"1007.1260","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2010-07-07T23:22:53Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"ce0054e52ddd7c3f101ab7f2643852770a1d65a417160d27acf6fb33105e0652","abstract_canon_sha256":"39e0d5925c5dd436856eb403a4943b1f46e057a42cb2ff9deef9ecfe4d1f62fd"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:27:58.152107Z","signature_b64":"8yAqkjhiPUgnTzsgmNzGoTSUkb9/vQ/fQ62a64qMRJDlK9GoIpbttYTsdQu4McHvVlGsN+ci/Bw7zu2n3YmqCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7b4f59fb09d1809668b521f9109d6d0fc4abcd18622dcd755d99d348c644d2cd","last_reissued_at":"2026-05-18T04:27:58.151473Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:27:58.151473Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Dense Hierarchy of Sublinear Time Approximation Schemes for Bin Packing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CC","authors_text":"Bin Fu, Richard Beigel","submitted_at":"2010-07-07T23:22:53Z","abstract_excerpt":"The bin packing problem is to find the minimum number of bins of size one to pack a list of items with sizes $a_1,..., a_n$ in $(0,1]$. Using uniform sampling, which selects a random element from the input list each time, we develop a randomized $O({n(\\log n)(\\log\\log n)\\over \\sum_{i=1}^n a_i}+({1\\over \\epsilon})^{O({1\\over\\epsilon})})$ time $(1+\\epsilon)$-approximation scheme for the bin packing problem. We show that every randomized algorithm with uniform random sampling needs $\\Omega({n\\over \\sum_{i=1}^n a_i})$ time to give an $(1+\\epsilon)$-approximation. For each function $s(n): N\\rightar"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1007.1260","kind":"arxiv","version":3},"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":"1007.1260","created_at":"2026-05-18T04:27:58.151591+00:00"},{"alias_kind":"arxiv_version","alias_value":"1007.1260v3","created_at":"2026-05-18T04:27:58.151591+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1007.1260","created_at":"2026-05-18T04:27:58.151591+00:00"},{"alias_kind":"pith_short_12","alias_value":"PNHVT6YJ2GAJ","created_at":"2026-05-18T12:26:12.377268+00:00"},{"alias_kind":"pith_short_16","alias_value":"PNHVT6YJ2GAJM2FV","created_at":"2026-05-18T12:26:12.377268+00:00"},{"alias_kind":"pith_short_8","alias_value":"PNHVT6YJ","created_at":"2026-05-18T12:26:12.377268+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/PNHVT6YJ2GAJM2FVEH4RBHLNB7","json":"https://pith.science/pith/PNHVT6YJ2GAJM2FVEH4RBHLNB7.json","graph_json":"https://pith.science/api/pith-number/PNHVT6YJ2GAJM2FVEH4RBHLNB7/graph.json","events_json":"https://pith.science/api/pith-number/PNHVT6YJ2GAJM2FVEH4RBHLNB7/events.json","paper":"https://pith.science/paper/PNHVT6YJ"},"agent_actions":{"view_html":"https://pith.science/pith/PNHVT6YJ2GAJM2FVEH4RBHLNB7","download_json":"https://pith.science/pith/PNHVT6YJ2GAJM2FVEH4RBHLNB7.json","view_paper":"https://pith.science/paper/PNHVT6YJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1007.1260&json=true","fetch_graph":"https://pith.science/api/pith-number/PNHVT6YJ2GAJM2FVEH4RBHLNB7/graph.json","fetch_events":"https://pith.science/api/pith-number/PNHVT6YJ2GAJM2FVEH4RBHLNB7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PNHVT6YJ2GAJM2FVEH4RBHLNB7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PNHVT6YJ2GAJM2FVEH4RBHLNB7/action/storage_attestation","attest_author":"https://pith.science/pith/PNHVT6YJ2GAJM2FVEH4RBHLNB7/action/author_attestation","sign_citation":"https://pith.science/pith/PNHVT6YJ2GAJM2FVEH4RBHLNB7/action/citation_signature","submit_replication":"https://pith.science/pith/PNHVT6YJ2GAJM2FVEH4RBHLNB7/action/replication_record"}},"created_at":"2026-05-18T04:27:58.151591+00:00","updated_at":"2026-05-18T04:27:58.151591+00:00"}