{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:TXMFJOX3FJ5YXIZ3NT452CTBDK","short_pith_number":"pith:TXMFJOX3","schema_version":"1.0","canonical_sha256":"9dd854bafb2a7b8ba33b6cf9dd0a611a9f375ab4e666305a5d9e6b3c475b7035","source":{"kind":"arxiv","id":"2605.29166","version":1},"attestation_state":"computed","paper":{"title":"A finite victory over de Bruijn-Erd\\H{o}s in interval discrepancy","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Chris Wells, Jared DeLeo, Owen Henderschedt","submitted_at":"2026-05-27T23:06:21Z","abstract_excerpt":"We study a finite form of the classical interval discrepancy problem. Starting from the unit interval, one repeatedly splits an existing interval into two until $n$ intervals have been produced. The discrepancy of such a process is the maximum, over all intermediate stages, of the ratio between the longest interval and the shortest interval. A theorem of de Bruijn and Erd\\H{o}s from 1949 shows that this ratio must approach $2$ as $n\\to\\infty$, and they give a sharp construction achieving this bound. For fixed $n$, their construction gives the upper bound $\\text{disc}(n)\\leq 2-\\frac{3}{2n}+O(1/"},"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":"2605.29166","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"math.CO","submitted_at":"2026-05-27T23:06:21Z","cross_cats_sorted":[],"title_canon_sha256":"11e0cf27689429b3c8cc7f59ac4f03a57dca4cc7228bdb4a27ca7eef386eaae1","abstract_canon_sha256":"739414fe2d0f7c9ad1f58afe71ae96b26db61638f083c3baebb95418fb3a1f5a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-29T01:05:22.068420Z","signature_b64":"q60RsRtdQPP7/yNBCgXpqidUwsFao+N3jEhIN6hbEbKpdbpV5etCl6ovrSLmuvMy9cb4Cspco1Or2NI9iKGDDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9dd854bafb2a7b8ba33b6cf9dd0a611a9f375ab4e666305a5d9e6b3c475b7035","last_reissued_at":"2026-05-29T01:05:22.067492Z","signature_status":"signed_v1","first_computed_at":"2026-05-29T01:05:22.067492Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A finite victory over de Bruijn-Erd\\H{o}s in interval discrepancy","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Chris Wells, Jared DeLeo, Owen Henderschedt","submitted_at":"2026-05-27T23:06:21Z","abstract_excerpt":"We study a finite form of the classical interval discrepancy problem. Starting from the unit interval, one repeatedly splits an existing interval into two until $n$ intervals have been produced. The discrepancy of such a process is the maximum, over all intermediate stages, of the ratio between the longest interval and the shortest interval. A theorem of de Bruijn and Erd\\H{o}s from 1949 shows that this ratio must approach $2$ as $n\\to\\infty$, and they give a sharp construction achieving this bound. For fixed $n$, their construction gives the upper bound $\\text{disc}(n)\\leq 2-\\frac{3}{2n}+O(1/"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.29166","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2605.29166/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":"2605.29166","created_at":"2026-05-29T01:05:22.067646+00:00"},{"alias_kind":"arxiv_version","alias_value":"2605.29166v1","created_at":"2026-05-29T01:05:22.067646+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.29166","created_at":"2026-05-29T01:05:22.067646+00:00"},{"alias_kind":"pith_short_12","alias_value":"TXMFJOX3FJ5Y","created_at":"2026-05-29T01:05:22.067646+00:00"},{"alias_kind":"pith_short_16","alias_value":"TXMFJOX3FJ5YXIZ3","created_at":"2026-05-29T01:05:22.067646+00:00"},{"alias_kind":"pith_short_8","alias_value":"TXMFJOX3","created_at":"2026-05-29T01:05:22.067646+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/TXMFJOX3FJ5YXIZ3NT452CTBDK","json":"https://pith.science/pith/TXMFJOX3FJ5YXIZ3NT452CTBDK.json","graph_json":"https://pith.science/api/pith-number/TXMFJOX3FJ5YXIZ3NT452CTBDK/graph.json","events_json":"https://pith.science/api/pith-number/TXMFJOX3FJ5YXIZ3NT452CTBDK/events.json","paper":"https://pith.science/paper/TXMFJOX3"},"agent_actions":{"view_html":"https://pith.science/pith/TXMFJOX3FJ5YXIZ3NT452CTBDK","download_json":"https://pith.science/pith/TXMFJOX3FJ5YXIZ3NT452CTBDK.json","view_paper":"https://pith.science/paper/TXMFJOX3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2605.29166&json=true","fetch_graph":"https://pith.science/api/pith-number/TXMFJOX3FJ5YXIZ3NT452CTBDK/graph.json","fetch_events":"https://pith.science/api/pith-number/TXMFJOX3FJ5YXIZ3NT452CTBDK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TXMFJOX3FJ5YXIZ3NT452CTBDK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TXMFJOX3FJ5YXIZ3NT452CTBDK/action/storage_attestation","attest_author":"https://pith.science/pith/TXMFJOX3FJ5YXIZ3NT452CTBDK/action/author_attestation","sign_citation":"https://pith.science/pith/TXMFJOX3FJ5YXIZ3NT452CTBDK/action/citation_signature","submit_replication":"https://pith.science/pith/TXMFJOX3FJ5YXIZ3NT452CTBDK/action/replication_record"}},"created_at":"2026-05-29T01:05:22.067646+00:00","updated_at":"2026-05-29T01:05:22.067646+00:00"}