{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:UCESTBHPS5GLIVWVNWDXASZODT","short_pith_number":"pith:UCESTBHP","schema_version":"1.0","canonical_sha256":"a0892984ef974cb456d56d87704b2e1cee4a89c9ef86695da60fa14891c1cf1b","source":{"kind":"arxiv","id":"1610.05221","version":3},"attestation_state":"computed","paper":{"title":"Balancing sums of random vectors","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.PR","authors_text":"Alex Scott, Bhargav Narayanan, Juhan Aru, Ramarathnam Venkatesan","submitted_at":"2016-10-17T17:27:33Z","abstract_excerpt":"We study a higher-dimensional 'balls-into-bins' problem. An infinite sequence of i.i.d. random vectors is revealed to us one vector at a time, and we are required to partition these vectors into a fixed number of bins in such a way as to keep the sums of the vectors in the different bins close together; how close can we keep these sums almost surely? This question, our primary focus in this paper, is closely related to the classical problem of partitioning a sequence of vectors into balanced subsequences, in addition to having applications to some problems in computer science."},"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":"1610.05221","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2016-10-17T17:27:33Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"0a009ca000f2beed9e8d325161259790fa5b979849f0b35d0b89e754b4bb2f67","abstract_canon_sha256":"eac0ddd9fb9e72c93bb581faf801f722b8dc917ed3b64bc1c8c442c687e24087"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:21:35.512531Z","signature_b64":"FqaTEgVqmWP9h0vij1FvHLzv2qnp1zy5TlZfqIsjjnrQhJrOAs7wm+JDeTwyRe2UiK95k328EbTMDhobg3iwAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a0892984ef974cb456d56d87704b2e1cee4a89c9ef86695da60fa14891c1cf1b","last_reissued_at":"2026-05-18T00:21:35.511824Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:21:35.511824Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Balancing sums of random vectors","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.PR","authors_text":"Alex Scott, Bhargav Narayanan, Juhan Aru, Ramarathnam Venkatesan","submitted_at":"2016-10-17T17:27:33Z","abstract_excerpt":"We study a higher-dimensional 'balls-into-bins' problem. An infinite sequence of i.i.d. random vectors is revealed to us one vector at a time, and we are required to partition these vectors into a fixed number of bins in such a way as to keep the sums of the vectors in the different bins close together; how close can we keep these sums almost surely? This question, our primary focus in this paper, is closely related to the classical problem of partitioning a sequence of vectors into balanced subsequences, in addition to having applications to some problems in computer science."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.05221","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":"1610.05221","created_at":"2026-05-18T00:21:35.511921+00:00"},{"alias_kind":"arxiv_version","alias_value":"1610.05221v3","created_at":"2026-05-18T00:21:35.511921+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.05221","created_at":"2026-05-18T00:21:35.511921+00:00"},{"alias_kind":"pith_short_12","alias_value":"UCESTBHPS5GL","created_at":"2026-05-18T12:30:46.583412+00:00"},{"alias_kind":"pith_short_16","alias_value":"UCESTBHPS5GLIVWV","created_at":"2026-05-18T12:30:46.583412+00:00"},{"alias_kind":"pith_short_8","alias_value":"UCESTBHP","created_at":"2026-05-18T12:30:46.583412+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/UCESTBHPS5GLIVWVNWDXASZODT","json":"https://pith.science/pith/UCESTBHPS5GLIVWVNWDXASZODT.json","graph_json":"https://pith.science/api/pith-number/UCESTBHPS5GLIVWVNWDXASZODT/graph.json","events_json":"https://pith.science/api/pith-number/UCESTBHPS5GLIVWVNWDXASZODT/events.json","paper":"https://pith.science/paper/UCESTBHP"},"agent_actions":{"view_html":"https://pith.science/pith/UCESTBHPS5GLIVWVNWDXASZODT","download_json":"https://pith.science/pith/UCESTBHPS5GLIVWVNWDXASZODT.json","view_paper":"https://pith.science/paper/UCESTBHP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1610.05221&json=true","fetch_graph":"https://pith.science/api/pith-number/UCESTBHPS5GLIVWVNWDXASZODT/graph.json","fetch_events":"https://pith.science/api/pith-number/UCESTBHPS5GLIVWVNWDXASZODT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UCESTBHPS5GLIVWVNWDXASZODT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UCESTBHPS5GLIVWVNWDXASZODT/action/storage_attestation","attest_author":"https://pith.science/pith/UCESTBHPS5GLIVWVNWDXASZODT/action/author_attestation","sign_citation":"https://pith.science/pith/UCESTBHPS5GLIVWVNWDXASZODT/action/citation_signature","submit_replication":"https://pith.science/pith/UCESTBHPS5GLIVWVNWDXASZODT/action/replication_record"}},"created_at":"2026-05-18T00:21:35.511921+00:00","updated_at":"2026-05-18T00:21:35.511921+00:00"}