{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:I6E2MTYO7H3GHEMN3PBGOVVXBK","short_pith_number":"pith:I6E2MTYO","schema_version":"1.0","canonical_sha256":"4789a64f0ef9f663918ddbc26756b70ab71dee9196650cf06a645f912aae7fdc","source":{"kind":"arxiv","id":"1703.07251","version":1},"attestation_state":"computed","paper":{"title":"Linear combinations of Rademacher random variables","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Harrie Hendriks, Martien C.A. van Zuijlen","submitted_at":"2017-03-21T14:53:56Z","abstract_excerpt":"For a fixed unit vector $a=(a_1,a_2,\\ldots,a_n)\\in S^{n-1}$, we consider the $2^n$ sign vectors $\\varepsilon=(\\varepsilon^1,\\varepsilon^2,\\ldots,\\varepsilon^n)\\in \\{+1,-1\\}^n$ and the corresponding scalar products $\\varepsilon\\cdot a=\\sum_{i=1}^n \\varepsilon^ia_i$. In this paper we will solve for $n=1,2,\\ldots,9$ an old conjecture stating that of the $2^n$ sums of the form $\\sum\\pm a_i$ it is impossible that there are more with $|\\sum_{i=1}^n \\pm a_i|>1$ than there are with $|\\sum_{i=1}^n \\pm a_i|\\leq1$. Although the problem has been solved completely in case the $a_i$'s are equal, the more ge"},"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":"1703.07251","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-03-21T14:53:56Z","cross_cats_sorted":[],"title_canon_sha256":"92c8807686ecf55a87a269ed8a119c3ebbdc2aa1262495445a45721417d71533","abstract_canon_sha256":"869a97d91cc80c60dd3eacf093760f11ac7a290fc8f806fec80ff8bb5a77e8e8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:48:10.870155Z","signature_b64":"BL3rPoOt96PMsz5HcEbgHF0hqWcugqjEthiqtpXczi19tMcO3kHzIDbAyEzRp4UZx3yrlZHiDwbWf81a1Cs7Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4789a64f0ef9f663918ddbc26756b70ab71dee9196650cf06a645f912aae7fdc","last_reissued_at":"2026-05-18T00:48:10.869513Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:48:10.869513Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Linear combinations of Rademacher random variables","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Harrie Hendriks, Martien C.A. van Zuijlen","submitted_at":"2017-03-21T14:53:56Z","abstract_excerpt":"For a fixed unit vector $a=(a_1,a_2,\\ldots,a_n)\\in S^{n-1}$, we consider the $2^n$ sign vectors $\\varepsilon=(\\varepsilon^1,\\varepsilon^2,\\ldots,\\varepsilon^n)\\in \\{+1,-1\\}^n$ and the corresponding scalar products $\\varepsilon\\cdot a=\\sum_{i=1}^n \\varepsilon^ia_i$. In this paper we will solve for $n=1,2,\\ldots,9$ an old conjecture stating that of the $2^n$ sums of the form $\\sum\\pm a_i$ it is impossible that there are more with $|\\sum_{i=1}^n \\pm a_i|>1$ than there are with $|\\sum_{i=1}^n \\pm a_i|\\leq1$. Although the problem has been solved completely in case the $a_i$'s are equal, the more ge"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.07251","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":"1703.07251","created_at":"2026-05-18T00:48:10.869607+00:00"},{"alias_kind":"arxiv_version","alias_value":"1703.07251v1","created_at":"2026-05-18T00:48:10.869607+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.07251","created_at":"2026-05-18T00:48:10.869607+00:00"},{"alias_kind":"pith_short_12","alias_value":"I6E2MTYO7H3G","created_at":"2026-05-18T12:31:21.493067+00:00"},{"alias_kind":"pith_short_16","alias_value":"I6E2MTYO7H3GHEMN","created_at":"2026-05-18T12:31:21.493067+00:00"},{"alias_kind":"pith_short_8","alias_value":"I6E2MTYO","created_at":"2026-05-18T12:31:21.493067+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/I6E2MTYO7H3GHEMN3PBGOVVXBK","json":"https://pith.science/pith/I6E2MTYO7H3GHEMN3PBGOVVXBK.json","graph_json":"https://pith.science/api/pith-number/I6E2MTYO7H3GHEMN3PBGOVVXBK/graph.json","events_json":"https://pith.science/api/pith-number/I6E2MTYO7H3GHEMN3PBGOVVXBK/events.json","paper":"https://pith.science/paper/I6E2MTYO"},"agent_actions":{"view_html":"https://pith.science/pith/I6E2MTYO7H3GHEMN3PBGOVVXBK","download_json":"https://pith.science/pith/I6E2MTYO7H3GHEMN3PBGOVVXBK.json","view_paper":"https://pith.science/paper/I6E2MTYO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1703.07251&json=true","fetch_graph":"https://pith.science/api/pith-number/I6E2MTYO7H3GHEMN3PBGOVVXBK/graph.json","fetch_events":"https://pith.science/api/pith-number/I6E2MTYO7H3GHEMN3PBGOVVXBK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/I6E2MTYO7H3GHEMN3PBGOVVXBK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/I6E2MTYO7H3GHEMN3PBGOVVXBK/action/storage_attestation","attest_author":"https://pith.science/pith/I6E2MTYO7H3GHEMN3PBGOVVXBK/action/author_attestation","sign_citation":"https://pith.science/pith/I6E2MTYO7H3GHEMN3PBGOVVXBK/action/citation_signature","submit_replication":"https://pith.science/pith/I6E2MTYO7H3GHEMN3PBGOVVXBK/action/replication_record"}},"created_at":"2026-05-18T00:48:10.869607+00:00","updated_at":"2026-05-18T00:48:10.869607+00:00"}