{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:O4TMRNJWCGFLNQWYPIESISYBYZ","short_pith_number":"pith:O4TMRNJW","schema_version":"1.0","canonical_sha256":"7726c8b536118ab6c2d87a09244b01c64313ec4f6bf4090d42dce181c8ec1ccf","source":{"kind":"arxiv","id":"1704.00350","version":3},"attestation_state":"computed","paper":{"title":"Tomaszewski's Problem on Randomly Signed Sums: Breaking the 3/8 Barrier","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.PR"],"primary_cat":"math.CO","authors_text":"Ravi B. Boppana, Ron Holzman","submitted_at":"2017-04-02T19:08:49Z","abstract_excerpt":"Let $v_1$, $v_2$, ..., $v_n$ be real numbers whose squares add up to 1. Consider the $2^n$ signed sums of the form $S = \\sum \\pm v_i$. Holzman and Kleitman (1992) proved that at least 3/8 of these sums satisfy $|S| \\le 1$. This 3/8 bound seems to be the best their method can achieve. Using a different method, we improve the bound to 13/32, thus breaking the 3/8 barrier."},"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":"1704.00350","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-04-02T19:08:49Z","cross_cats_sorted":["math.PR"],"title_canon_sha256":"2de8f9d5aee3ef23a0ff1b94f582b19e495ee7141866d1acc6b54ebc8b09b11e","abstract_canon_sha256":"03e01ccc6947d8ba5732f444f9109d2b3c78bb8d8ef572e8d22d44805b6c9ded"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:36:19.294625Z","signature_b64":"T0HzBIJBzp2t3nGzZuvnNPjjjQ673VLMrUyhQiXf+bcnA+ouVi8ikMZLPM3duYv2+RkhO+TEJSNppI01JNHWCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7726c8b536118ab6c2d87a09244b01c64313ec4f6bf4090d42dce181c8ec1ccf","last_reissued_at":"2026-05-18T00:36:19.293941Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:36:19.293941Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Tomaszewski's Problem on Randomly Signed Sums: Breaking the 3/8 Barrier","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.PR"],"primary_cat":"math.CO","authors_text":"Ravi B. Boppana, Ron Holzman","submitted_at":"2017-04-02T19:08:49Z","abstract_excerpt":"Let $v_1$, $v_2$, ..., $v_n$ be real numbers whose squares add up to 1. Consider the $2^n$ signed sums of the form $S = \\sum \\pm v_i$. Holzman and Kleitman (1992) proved that at least 3/8 of these sums satisfy $|S| \\le 1$. This 3/8 bound seems to be the best their method can achieve. Using a different method, we improve the bound to 13/32, thus breaking the 3/8 barrier."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.00350","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":"1704.00350","created_at":"2026-05-18T00:36:19.294050+00:00"},{"alias_kind":"arxiv_version","alias_value":"1704.00350v3","created_at":"2026-05-18T00:36:19.294050+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.00350","created_at":"2026-05-18T00:36:19.294050+00:00"},{"alias_kind":"pith_short_12","alias_value":"O4TMRNJWCGFL","created_at":"2026-05-18T12:31:34.259226+00:00"},{"alias_kind":"pith_short_16","alias_value":"O4TMRNJWCGFLNQWY","created_at":"2026-05-18T12:31:34.259226+00:00"},{"alias_kind":"pith_short_8","alias_value":"O4TMRNJW","created_at":"2026-05-18T12:31:34.259226+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/O4TMRNJWCGFLNQWYPIESISYBYZ","json":"https://pith.science/pith/O4TMRNJWCGFLNQWYPIESISYBYZ.json","graph_json":"https://pith.science/api/pith-number/O4TMRNJWCGFLNQWYPIESISYBYZ/graph.json","events_json":"https://pith.science/api/pith-number/O4TMRNJWCGFLNQWYPIESISYBYZ/events.json","paper":"https://pith.science/paper/O4TMRNJW"},"agent_actions":{"view_html":"https://pith.science/pith/O4TMRNJWCGFLNQWYPIESISYBYZ","download_json":"https://pith.science/pith/O4TMRNJWCGFLNQWYPIESISYBYZ.json","view_paper":"https://pith.science/paper/O4TMRNJW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1704.00350&json=true","fetch_graph":"https://pith.science/api/pith-number/O4TMRNJWCGFLNQWYPIESISYBYZ/graph.json","fetch_events":"https://pith.science/api/pith-number/O4TMRNJWCGFLNQWYPIESISYBYZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/O4TMRNJWCGFLNQWYPIESISYBYZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/O4TMRNJWCGFLNQWYPIESISYBYZ/action/storage_attestation","attest_author":"https://pith.science/pith/O4TMRNJWCGFLNQWYPIESISYBYZ/action/author_attestation","sign_citation":"https://pith.science/pith/O4TMRNJWCGFLNQWYPIESISYBYZ/action/citation_signature","submit_replication":"https://pith.science/pith/O4TMRNJWCGFLNQWYPIESISYBYZ/action/replication_record"}},"created_at":"2026-05-18T00:36:19.294050+00:00","updated_at":"2026-05-18T00:36:19.294050+00:00"}