{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:ODMXM2YJY4P5RCYJMM7LCA33MU","short_pith_number":"pith:ODMXM2YJ","schema_version":"1.0","canonical_sha256":"70d9766b09c71fd88b09633eb1037b653519ddf1e6fa3f97ced27e30ecbe16cc","source":{"kind":"arxiv","id":"2008.09593","version":3},"attestation_state":"computed","paper":{"title":"Hyperbolic Concentration, Anti-concentration, and Discrepancy","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.PR","authors_text":"Ruizhe Zhang, Zhao Song","submitted_at":"2020-08-21T17:39:52Z","abstract_excerpt":"Chernoff bound is a fundamental tool in theoretical computer science. It has been extensively used in randomized algorithm design and stochastic type analysis. Discrepancy theory, which deals with finding a bi-coloring of a set system such that the coloring of each set is balanced, has a huge number of applications in approximation algorithms design. Chernoff bound [Che52] implies that a random bi-coloring of any set system with $n$ sets and $n$ elements will have discrepancy $O(\\sqrt{n \\log n})$ with high probability, while the famous result by Spencer [Spe85] shows that there exists an $O(\\s"},"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":"2008.09593","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2020-08-21T17:39:52Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"183d9db0a0fca6e202882a9321ac28cf45c699c28c0e49c5c37db4527f9838f4","abstract_canon_sha256":"e6aa8ca4a299a15bfa76f13eb385cf61252d83c6f65a7f630f8dd02fa1e4c5c8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:40:06.228364Z","signature_b64":"gdIqWnyqLXDvSNWEubRtALjCqwl9UzyIAcCpEf/dcris40n4B8q87XLnWglSZmPM/juEw0tkJbAKAbAAwvnYBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"70d9766b09c71fd88b09633eb1037b653519ddf1e6fa3f97ced27e30ecbe16cc","last_reissued_at":"2026-07-05T04:40:06.227759Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:40:06.227759Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Hyperbolic Concentration, Anti-concentration, and Discrepancy","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.PR","authors_text":"Ruizhe Zhang, Zhao Song","submitted_at":"2020-08-21T17:39:52Z","abstract_excerpt":"Chernoff bound is a fundamental tool in theoretical computer science. It has been extensively used in randomized algorithm design and stochastic type analysis. Discrepancy theory, which deals with finding a bi-coloring of a set system such that the coloring of each set is balanced, has a huge number of applications in approximation algorithms design. Chernoff bound [Che52] implies that a random bi-coloring of any set system with $n$ sets and $n$ elements will have discrepancy $O(\\sqrt{n \\log n})$ with high probability, while the famous result by Spencer [Spe85] shows that there exists an $O(\\s"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2008.09593","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2008.09593/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2008.09593","created_at":"2026-07-05T04:40:06.227817+00:00"},{"alias_kind":"arxiv_version","alias_value":"2008.09593v3","created_at":"2026-07-05T04:40:06.227817+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2008.09593","created_at":"2026-07-05T04:40:06.227817+00:00"},{"alias_kind":"pith_short_12","alias_value":"ODMXM2YJY4P5","created_at":"2026-07-05T04:40:06.227817+00:00"},{"alias_kind":"pith_short_16","alias_value":"ODMXM2YJY4P5RCYJ","created_at":"2026-07-05T04:40:06.227817+00:00"},{"alias_kind":"pith_short_8","alias_value":"ODMXM2YJ","created_at":"2026-07-05T04:40:06.227817+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/ODMXM2YJY4P5RCYJMM7LCA33MU","json":"https://pith.science/pith/ODMXM2YJY4P5RCYJMM7LCA33MU.json","graph_json":"https://pith.science/api/pith-number/ODMXM2YJY4P5RCYJMM7LCA33MU/graph.json","events_json":"https://pith.science/api/pith-number/ODMXM2YJY4P5RCYJMM7LCA33MU/events.json","paper":"https://pith.science/paper/ODMXM2YJ"},"agent_actions":{"view_html":"https://pith.science/pith/ODMXM2YJY4P5RCYJMM7LCA33MU","download_json":"https://pith.science/pith/ODMXM2YJY4P5RCYJMM7LCA33MU.json","view_paper":"https://pith.science/paper/ODMXM2YJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2008.09593&json=true","fetch_graph":"https://pith.science/api/pith-number/ODMXM2YJY4P5RCYJMM7LCA33MU/graph.json","fetch_events":"https://pith.science/api/pith-number/ODMXM2YJY4P5RCYJMM7LCA33MU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ODMXM2YJY4P5RCYJMM7LCA33MU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ODMXM2YJY4P5RCYJMM7LCA33MU/action/storage_attestation","attest_author":"https://pith.science/pith/ODMXM2YJY4P5RCYJMM7LCA33MU/action/author_attestation","sign_citation":"https://pith.science/pith/ODMXM2YJY4P5RCYJMM7LCA33MU/action/citation_signature","submit_replication":"https://pith.science/pith/ODMXM2YJY4P5RCYJMM7LCA33MU/action/replication_record"}},"created_at":"2026-07-05T04:40:06.227817+00:00","updated_at":"2026-07-05T04:40:06.227817+00:00"}