{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:SOUCOK3FNDUI2GR6C3R2XPHFIZ","short_pith_number":"pith:SOUCOK3F","schema_version":"1.0","canonical_sha256":"93a8272b6568e88d1a3e16e3abbce54653ae2bcd87f10103928bf4542e189ddf","source":{"kind":"arxiv","id":"1308.0206","version":6},"attestation_state":"computed","paper":{"title":"A 64-dimensional two-distance counterexample to Borsuk's conjecture","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.MG","authors_text":"Thomas Jenrich","submitted_at":"2013-08-01T13:59:12Z","abstract_excerpt":"In 1933 Karol Borsuk asked whether each bounded set in the n-dimensional Euclidean space can be divided into n+1 parts of smaller diameter. The diameter of a set is defined as the supremum (least upper bound) of the distances of contained points. Implicitly, the whole set is assumed to contain at least two points.\n  The hypothesis that the answer to that question is positive became famous under the name Borsuk's conjecture. Beginning with Jeff Kahn and Gil Kalai, from 1993 to 2003 several authors have proved that in certain (almost all) high dimensions such a division is not generally possible"},"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":"1308.0206","kind":"arxiv","version":6},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.MG","submitted_at":"2013-08-01T13:59:12Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"08c5c914410c0d7e76090e271ae8a954c19c0034672291a32159d76089473c1c","abstract_canon_sha256":"b7c6695649068bc98b22d8b5593821b01a420028eba3388b0317feb25f72013a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:44:54.836040Z","signature_b64":"i8BeiooKxKOqqZyD4/uXJXDRgS3UoJcnQH59Vg517Pawb9T35/EHP3PBusL+xE6uXWM3QygAF7ELVI84RSAzCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"93a8272b6568e88d1a3e16e3abbce54653ae2bcd87f10103928bf4542e189ddf","last_reissued_at":"2026-05-18T02:44:54.835469Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:44:54.835469Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A 64-dimensional two-distance counterexample to Borsuk's conjecture","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.MG","authors_text":"Thomas Jenrich","submitted_at":"2013-08-01T13:59:12Z","abstract_excerpt":"In 1933 Karol Borsuk asked whether each bounded set in the n-dimensional Euclidean space can be divided into n+1 parts of smaller diameter. The diameter of a set is defined as the supremum (least upper bound) of the distances of contained points. Implicitly, the whole set is assumed to contain at least two points.\n  The hypothesis that the answer to that question is positive became famous under the name Borsuk's conjecture. Beginning with Jeff Kahn and Gil Kalai, from 1993 to 2003 several authors have proved that in certain (almost all) high dimensions such a division is not generally possible"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1308.0206","kind":"arxiv","version":6},"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":"1308.0206","created_at":"2026-05-18T02:44:54.835575+00:00"},{"alias_kind":"arxiv_version","alias_value":"1308.0206v6","created_at":"2026-05-18T02:44:54.835575+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1308.0206","created_at":"2026-05-18T02:44:54.835575+00:00"},{"alias_kind":"pith_short_12","alias_value":"SOUCOK3FNDUI","created_at":"2026-05-18T12:27:59.945178+00:00"},{"alias_kind":"pith_short_16","alias_value":"SOUCOK3FNDUI2GR6","created_at":"2026-05-18T12:27:59.945178+00:00"},{"alias_kind":"pith_short_8","alias_value":"SOUCOK3F","created_at":"2026-05-18T12:27:59.945178+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"1907.09942","citing_title":"The Gromov--Hausdorff Distance between Simplexes and Two-Distance Spaces","ref_index":11,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/SOUCOK3FNDUI2GR6C3R2XPHFIZ","json":"https://pith.science/pith/SOUCOK3FNDUI2GR6C3R2XPHFIZ.json","graph_json":"https://pith.science/api/pith-number/SOUCOK3FNDUI2GR6C3R2XPHFIZ/graph.json","events_json":"https://pith.science/api/pith-number/SOUCOK3FNDUI2GR6C3R2XPHFIZ/events.json","paper":"https://pith.science/paper/SOUCOK3F"},"agent_actions":{"view_html":"https://pith.science/pith/SOUCOK3FNDUI2GR6C3R2XPHFIZ","download_json":"https://pith.science/pith/SOUCOK3FNDUI2GR6C3R2XPHFIZ.json","view_paper":"https://pith.science/paper/SOUCOK3F","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1308.0206&json=true","fetch_graph":"https://pith.science/api/pith-number/SOUCOK3FNDUI2GR6C3R2XPHFIZ/graph.json","fetch_events":"https://pith.science/api/pith-number/SOUCOK3FNDUI2GR6C3R2XPHFIZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SOUCOK3FNDUI2GR6C3R2XPHFIZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SOUCOK3FNDUI2GR6C3R2XPHFIZ/action/storage_attestation","attest_author":"https://pith.science/pith/SOUCOK3FNDUI2GR6C3R2XPHFIZ/action/author_attestation","sign_citation":"https://pith.science/pith/SOUCOK3FNDUI2GR6C3R2XPHFIZ/action/citation_signature","submit_replication":"https://pith.science/pith/SOUCOK3FNDUI2GR6C3R2XPHFIZ/action/replication_record"}},"created_at":"2026-05-18T02:44:54.835575+00:00","updated_at":"2026-05-18T02:44:54.835575+00:00"}