{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:SSB2UN5B3G34F64OEA6LAA2RBI","short_pith_number":"pith:SSB2UN5B","schema_version":"1.0","canonical_sha256":"9483aa37a1d9b7c2fb8e203cb003510a26ce05e2393532f7cbc3800a39fb8544","source":{"kind":"arxiv","id":"2605.19068","version":1},"attestation_state":"computed","paper":{"title":"Reducing the upper bound for the Borsuk number in $\\mathbb{R}^4$ to 8","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.MG","authors_text":"Alexander Tolmachev, Vsevolod Voronov","submitted_at":"2026-05-18T19:50:27Z","abstract_excerpt":"The Borsuk number $b(n)$ of $n$-dimensional Euclidean space $\\mathbb{R}^n$ is the smallest integer such that any set $F \\subset \\mathbb{R}^n$ of unit diameter can be partitioned into $b(n)$ subsets of strictly smaller diameter. For $n=4$, the best known upper bound $b(4) \\leq 9$ follows from a construction by M. Lassak (1982). In the present paper, we construct partitions of several variants of the truncated Lassak cover into 8 parts of diameter less than 1, thereby showing that $b(4) \\leq 8$."},"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.19068","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.MG","submitted_at":"2026-05-18T19:50:27Z","cross_cats_sorted":[],"title_canon_sha256":"e2ef5c12c8efb880794de3cc680e6c1b8ca5277fe702e5a7b355f59a839c8da9","abstract_canon_sha256":"e02089bc957980d1389333996ad20884325de7864c917ea2998134066c6e39d3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-20T01:05:25.808356Z","signature_b64":"qwdKJTrO5OWw08ZT3c3qNJH0fvjfqwPWzOrgCnYyr634P38G+UPNDbahJ9OSweDuLajxrV3cLNvQFIuahY/RAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9483aa37a1d9b7c2fb8e203cb003510a26ce05e2393532f7cbc3800a39fb8544","last_reissued_at":"2026-05-20T01:05:25.807580Z","signature_status":"signed_v1","first_computed_at":"2026-05-20T01:05:25.807580Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Reducing the upper bound for the Borsuk number in $\\mathbb{R}^4$ to 8","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.MG","authors_text":"Alexander Tolmachev, Vsevolod Voronov","submitted_at":"2026-05-18T19:50:27Z","abstract_excerpt":"The Borsuk number $b(n)$ of $n$-dimensional Euclidean space $\\mathbb{R}^n$ is the smallest integer such that any set $F \\subset \\mathbb{R}^n$ of unit diameter can be partitioned into $b(n)$ subsets of strictly smaller diameter. For $n=4$, the best known upper bound $b(4) \\leq 9$ follows from a construction by M. Lassak (1982). In the present paper, we construct partitions of several variants of the truncated Lassak cover into 8 parts of diameter less than 1, thereby showing that $b(4) \\leq 8$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.19068","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.19068/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.19068","created_at":"2026-05-20T01:05:25.807706+00:00"},{"alias_kind":"arxiv_version","alias_value":"2605.19068v1","created_at":"2026-05-20T01:05:25.807706+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.19068","created_at":"2026-05-20T01:05:25.807706+00:00"},{"alias_kind":"pith_short_12","alias_value":"SSB2UN5B3G34","created_at":"2026-05-20T01:05:25.807706+00:00"},{"alias_kind":"pith_short_16","alias_value":"SSB2UN5B3G34F64O","created_at":"2026-05-20T01:05:25.807706+00:00"},{"alias_kind":"pith_short_8","alias_value":"SSB2UN5B","created_at":"2026-05-20T01:05:25.807706+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/SSB2UN5B3G34F64OEA6LAA2RBI","json":"https://pith.science/pith/SSB2UN5B3G34F64OEA6LAA2RBI.json","graph_json":"https://pith.science/api/pith-number/SSB2UN5B3G34F64OEA6LAA2RBI/graph.json","events_json":"https://pith.science/api/pith-number/SSB2UN5B3G34F64OEA6LAA2RBI/events.json","paper":"https://pith.science/paper/SSB2UN5B"},"agent_actions":{"view_html":"https://pith.science/pith/SSB2UN5B3G34F64OEA6LAA2RBI","download_json":"https://pith.science/pith/SSB2UN5B3G34F64OEA6LAA2RBI.json","view_paper":"https://pith.science/paper/SSB2UN5B","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2605.19068&json=true","fetch_graph":"https://pith.science/api/pith-number/SSB2UN5B3G34F64OEA6LAA2RBI/graph.json","fetch_events":"https://pith.science/api/pith-number/SSB2UN5B3G34F64OEA6LAA2RBI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SSB2UN5B3G34F64OEA6LAA2RBI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SSB2UN5B3G34F64OEA6LAA2RBI/action/storage_attestation","attest_author":"https://pith.science/pith/SSB2UN5B3G34F64OEA6LAA2RBI/action/author_attestation","sign_citation":"https://pith.science/pith/SSB2UN5B3G34F64OEA6LAA2RBI/action/citation_signature","submit_replication":"https://pith.science/pith/SSB2UN5B3G34F64OEA6LAA2RBI/action/replication_record"}},"created_at":"2026-05-20T01:05:25.807706+00:00","updated_at":"2026-05-20T01:05:25.807706+00:00"}