{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:SSB2UN5B3G34F64OEA6LAA2RBI","short_pith_number":"pith:SSB2UN5B","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"},"canonical_sha256":"9483aa37a1d9b7c2fb8e203cb003510a26ce05e2393532f7cbc3800a39fb8544","source":{"kind":"arxiv","id":"2605.19068","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.19068","created_at":"2026-05-20T01:05:25Z"},{"alias_kind":"arxiv_version","alias_value":"2605.19068v1","created_at":"2026-05-20T01:05:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.19068","created_at":"2026-05-20T01:05:25Z"},{"alias_kind":"pith_short_12","alias_value":"SSB2UN5B3G34","created_at":"2026-05-20T01:05:25Z"},{"alias_kind":"pith_short_16","alias_value":"SSB2UN5B3G34F64O","created_at":"2026-05-20T01:05:25Z"},{"alias_kind":"pith_short_8","alias_value":"SSB2UN5B","created_at":"2026-05-20T01:05:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:SSB2UN5B3G34F64OEA6LAA2RBI","target":"record","payload":{"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"},"canonical_sha256":"9483aa37a1d9b7c2fb8e203cb003510a26ce05e2393532f7cbc3800a39fb8544","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"},"source_kind":"arxiv","source_id":"2605.19068","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-20T01:05:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZaW8tt7SvizwrVAPVD02ZnAde2v9ObSHN4JDDYgHr+IygsR/ENfGnENkkjKqwi2FmX9bW2SDIiNn8tpxHb5ODw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T10:58:35.659622Z"},"content_sha256":"b9702b892bd8daee89138b68a518a435ca8e1ac5e9995baef1ecd86f5843af50","schema_version":"1.0","event_id":"sha256:b9702b892bd8daee89138b68a518a435ca8e1ac5e9995baef1ecd86f5843af50"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:SSB2UN5B3G34F64OEA6LAA2RBI","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-20T01:05:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uDyReEqycwQ9Mry/L9vTRJcLOVP0mwc6gqObCcqbSbhVEr68vXiHykfdHJSpIzALbBz2ySCRdWL7Xcdg1LPbCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T10:58:35.660297Z"},"content_sha256":"dc120326a8eccbe5bfa0dc7e6206b3739c67b45876556f040219d9ca599ff2bc","schema_version":"1.0","event_id":"sha256:dc120326a8eccbe5bfa0dc7e6206b3739c67b45876556f040219d9ca599ff2bc"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SSB2UN5B3G34F64OEA6LAA2RBI/bundle.json","state_url":"https://pith.science/pith/SSB2UN5B3G34F64OEA6LAA2RBI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SSB2UN5B3G34F64OEA6LAA2RBI/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-27T10:58:35Z","links":{"resolver":"https://pith.science/pith/SSB2UN5B3G34F64OEA6LAA2RBI","bundle":"https://pith.science/pith/SSB2UN5B3G34F64OEA6LAA2RBI/bundle.json","state":"https://pith.science/pith/SSB2UN5B3G34F64OEA6LAA2RBI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SSB2UN5B3G34F64OEA6LAA2RBI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:SSB2UN5B3G34F64OEA6LAA2RBI","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"e02089bc957980d1389333996ad20884325de7864c917ea2998134066c6e39d3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.MG","submitted_at":"2026-05-18T19:50:27Z","title_canon_sha256":"e2ef5c12c8efb880794de3cc680e6c1b8ca5277fe702e5a7b355f59a839c8da9"},"schema_version":"1.0","source":{"id":"2605.19068","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.19068","created_at":"2026-05-20T01:05:25Z"},{"alias_kind":"arxiv_version","alias_value":"2605.19068v1","created_at":"2026-05-20T01:05:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.19068","created_at":"2026-05-20T01:05:25Z"},{"alias_kind":"pith_short_12","alias_value":"SSB2UN5B3G34","created_at":"2026-05-20T01:05:25Z"},{"alias_kind":"pith_short_16","alias_value":"SSB2UN5B3G34F64O","created_at":"2026-05-20T01:05:25Z"},{"alias_kind":"pith_short_8","alias_value":"SSB2UN5B","created_at":"2026-05-20T01:05:25Z"}],"graph_snapshots":[{"event_id":"sha256:dc120326a8eccbe5bfa0dc7e6206b3739c67b45876556f040219d9ca599ff2bc","target":"graph","created_at":"2026-05-20T01:05:25Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2605.19068/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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$.","authors_text":"Alexander Tolmachev, Vsevolod Voronov","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.MG","submitted_at":"2026-05-18T19:50:27Z","title":"Reducing the upper bound for the Borsuk number in $\\mathbb{R}^4$ to 8"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.19068","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:b9702b892bd8daee89138b68a518a435ca8e1ac5e9995baef1ecd86f5843af50","target":"record","created_at":"2026-05-20T01:05:25Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"e02089bc957980d1389333996ad20884325de7864c917ea2998134066c6e39d3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.MG","submitted_at":"2026-05-18T19:50:27Z","title_canon_sha256":"e2ef5c12c8efb880794de3cc680e6c1b8ca5277fe702e5a7b355f59a839c8da9"},"schema_version":"1.0","source":{"id":"2605.19068","kind":"arxiv","version":1}},"canonical_sha256":"9483aa37a1d9b7c2fb8e203cb003510a26ce05e2393532f7cbc3800a39fb8544","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9483aa37a1d9b7c2fb8e203cb003510a26ce05e2393532f7cbc3800a39fb8544","first_computed_at":"2026-05-20T01:05:25.807580Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-20T01:05:25.807580Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"qwdKJTrO5OWw08ZT3c3qNJH0fvjfqwPWzOrgCnYyr634P38G+UPNDbahJ9OSweDuLajxrV3cLNvQFIuahY/RAw==","signature_status":"signed_v1","signed_at":"2026-05-20T01:05:25.808356Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.19068","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b9702b892bd8daee89138b68a518a435ca8e1ac5e9995baef1ecd86f5843af50","sha256:dc120326a8eccbe5bfa0dc7e6206b3739c67b45876556f040219d9ca599ff2bc"],"state_sha256":"7b962573487c2f056f28ffa89c507358f0c6d7a7ec1182b28ce01d54a9955c14"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hseGm89/jMcakwiWmvifHMuqnl7tNw6BtCabmwBy1kHqoFtlVbpeGDWLeojm2zSIkob9uS+YEz7alAAJ/D6+Dg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T10:58:35.664179Z","bundle_sha256":"c145791d42ec2b5ca14edb6a31ab1390d14d2142ce0a53ac7ffb0502474841ad"}}