{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:PNSBJAMVNSPGAQMMA3UZ22FSTU","short_pith_number":"pith:PNSBJAMV","schema_version":"1.0","canonical_sha256":"7b641481956c9e60418c06e99d68b29d1bc550aed0e9e49407952948b946b6ac","source":{"kind":"arxiv","id":"1708.01079","version":1},"attestation_state":"computed","paper":{"title":"The Gram-Schmidt Walk: A Cure for the Banaszczyk Blues","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.DS","authors_text":"Daniel Dadush, Nikhil Bansal, Shachar Lovett, Shashwat Garg","submitted_at":"2017-08-03T09:49:42Z","abstract_excerpt":"An important result in discrepancy due to Banaszczyk states that for any set of $n$ vectors in $\\mathbb{R}^m$ of $\\ell_2$ norm at most $1$ and any convex body $K$ in $\\mathbb{R}^m$ of Gaussian measure at least half, there exists a $\\pm 1$ combination of these vectors which lies in $5K$. This result implies the best known bounds for several problems in discrepancy. Banaszczyk's proof of this result is non-constructive and a major open problem has been to give an efficient algorithm to find such a $\\pm 1$ combination of the vectors.\n  In this paper, we resolve this question and give an efficient"},"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.01079","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-08-03T09:49:42Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"c2848e4b26a02bd50c6d067a058274315b52b763e493e7ce7421d6e440abac4b","abstract_canon_sha256":"18281cc5c89098357fd138262a2046d3f87e036744781f5981d4f10b40943778"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:38:40.672387Z","signature_b64":"UDuDnTmLjNdtKrd01JhphC+6j3fpiQ3k48Lo7XRx0NpqhUsV7PoA3+snNoQ2/lVzWkVI4Ci/20ml5oN+vh8MDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7b641481956c9e60418c06e99d68b29d1bc550aed0e9e49407952948b946b6ac","last_reissued_at":"2026-05-18T00:38:40.671861Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:38:40.671861Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Gram-Schmidt Walk: A Cure for the Banaszczyk Blues","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.DS","authors_text":"Daniel Dadush, Nikhil Bansal, Shachar Lovett, Shashwat Garg","submitted_at":"2017-08-03T09:49:42Z","abstract_excerpt":"An important result in discrepancy due to Banaszczyk states that for any set of $n$ vectors in $\\mathbb{R}^m$ of $\\ell_2$ norm at most $1$ and any convex body $K$ in $\\mathbb{R}^m$ of Gaussian measure at least half, there exists a $\\pm 1$ combination of these vectors which lies in $5K$. This result implies the best known bounds for several problems in discrepancy. Banaszczyk's proof of this result is non-constructive and a major open problem has been to give an efficient algorithm to find such a $\\pm 1$ combination of the vectors.\n  In this paper, we resolve this question and give an efficient"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.01079","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.01079","created_at":"2026-05-18T00:38:40.671940+00:00"},{"alias_kind":"arxiv_version","alias_value":"1708.01079v1","created_at":"2026-05-18T00:38:40.671940+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.01079","created_at":"2026-05-18T00:38:40.671940+00:00"},{"alias_kind":"pith_short_12","alias_value":"PNSBJAMVNSPG","created_at":"2026-05-18T12:31:37.085036+00:00"},{"alias_kind":"pith_short_16","alias_value":"PNSBJAMVNSPGAQMM","created_at":"2026-05-18T12:31:37.085036+00:00"},{"alias_kind":"pith_short_8","alias_value":"PNSBJAMV","created_at":"2026-05-18T12:31:37.085036+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/PNSBJAMVNSPGAQMMA3UZ22FSTU","json":"https://pith.science/pith/PNSBJAMVNSPGAQMMA3UZ22FSTU.json","graph_json":"https://pith.science/api/pith-number/PNSBJAMVNSPGAQMMA3UZ22FSTU/graph.json","events_json":"https://pith.science/api/pith-number/PNSBJAMVNSPGAQMMA3UZ22FSTU/events.json","paper":"https://pith.science/paper/PNSBJAMV"},"agent_actions":{"view_html":"https://pith.science/pith/PNSBJAMVNSPGAQMMA3UZ22FSTU","download_json":"https://pith.science/pith/PNSBJAMVNSPGAQMMA3UZ22FSTU.json","view_paper":"https://pith.science/paper/PNSBJAMV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1708.01079&json=true","fetch_graph":"https://pith.science/api/pith-number/PNSBJAMVNSPGAQMMA3UZ22FSTU/graph.json","fetch_events":"https://pith.science/api/pith-number/PNSBJAMVNSPGAQMMA3UZ22FSTU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PNSBJAMVNSPGAQMMA3UZ22FSTU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PNSBJAMVNSPGAQMMA3UZ22FSTU/action/storage_attestation","attest_author":"https://pith.science/pith/PNSBJAMVNSPGAQMMA3UZ22FSTU/action/author_attestation","sign_citation":"https://pith.science/pith/PNSBJAMVNSPGAQMMA3UZ22FSTU/action/citation_signature","submit_replication":"https://pith.science/pith/PNSBJAMVNSPGAQMMA3UZ22FSTU/action/replication_record"}},"created_at":"2026-05-18T00:38:40.671940+00:00","updated_at":"2026-05-18T00:38:40.671940+00:00"}