{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2007:77U4VRMBUW7W7FG44EILTYO54O","short_pith_number":"pith:77U4VRMB","schema_version":"1.0","canonical_sha256":"ffe9cac581a5bf6f94dce110b9e1dde38fd4be651e69866036d6d217231a2f6e","source":{"kind":"arxiv","id":"0710.4668","version":2},"attestation_state":"computed","paper":{"title":"A generalization of Tverberg's Theorem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Micha A. Perles, Moriah Sigron","submitted_at":"2007-10-25T08:44:54Z","abstract_excerpt":"The well know theorem of Tverberg states that if n > (d+1)(r-1) then one can partition any set of n points in R^d to r disjoint subsets whose convex hulls have a common point. The numbers T(d,r) = (d + 1)(r - 1) + 1 are known as Tverberg numbers. Reay asks the following question: if we add an additional parameter k (1 < k < r+1) what is the minimal number of points we need in order to guarantee that there exists an r partition of them such that any k of the r convex hulls intersect. This minimal number is denoted by T(d,r,k). Reay conjectured that T(d,r,k) = T(d,r) for all d,r and k. In this a"},"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":"0710.4668","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2007-10-25T08:44:54Z","cross_cats_sorted":[],"title_canon_sha256":"59e91e3be883d637ccb5a3f79eba028c5ce5867be90eecc7e5d7e41811753e71","abstract_canon_sha256":"3cf47deb3e65dd1772cc427db658484d581a6ae838d1130d4d050d75afcdac4c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:43:09.679243Z","signature_b64":"YlTk+1xaa3EG1fR0H8N9r10PZUuxXEnEmGcP84QAWHJstB2rNn9gZq6EZfz4ksY92oICLUk5H2BnazGjf5BaBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ffe9cac581a5bf6f94dce110b9e1dde38fd4be651e69866036d6d217231a2f6e","last_reissued_at":"2026-05-18T02:43:09.678768Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:43:09.678768Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A generalization of Tverberg's Theorem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Micha A. Perles, Moriah Sigron","submitted_at":"2007-10-25T08:44:54Z","abstract_excerpt":"The well know theorem of Tverberg states that if n > (d+1)(r-1) then one can partition any set of n points in R^d to r disjoint subsets whose convex hulls have a common point. The numbers T(d,r) = (d + 1)(r - 1) + 1 are known as Tverberg numbers. Reay asks the following question: if we add an additional parameter k (1 < k < r+1) what is the minimal number of points we need in order to guarantee that there exists an r partition of them such that any k of the r convex hulls intersect. This minimal number is denoted by T(d,r,k). Reay conjectured that T(d,r,k) = T(d,r) for all d,r and k. In this a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0710.4668","kind":"arxiv","version":2},"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":"0710.4668","created_at":"2026-05-18T02:43:09.678837+00:00"},{"alias_kind":"arxiv_version","alias_value":"0710.4668v2","created_at":"2026-05-18T02:43:09.678837+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0710.4668","created_at":"2026-05-18T02:43:09.678837+00:00"},{"alias_kind":"pith_short_12","alias_value":"77U4VRMBUW7W","created_at":"2026-05-18T12:25:55.427421+00:00"},{"alias_kind":"pith_short_16","alias_value":"77U4VRMBUW7W7FG4","created_at":"2026-05-18T12:25:55.427421+00:00"},{"alias_kind":"pith_short_8","alias_value":"77U4VRMB","created_at":"2026-05-18T12:25:55.427421+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/77U4VRMBUW7W7FG44EILTYO54O","json":"https://pith.science/pith/77U4VRMBUW7W7FG44EILTYO54O.json","graph_json":"https://pith.science/api/pith-number/77U4VRMBUW7W7FG44EILTYO54O/graph.json","events_json":"https://pith.science/api/pith-number/77U4VRMBUW7W7FG44EILTYO54O/events.json","paper":"https://pith.science/paper/77U4VRMB"},"agent_actions":{"view_html":"https://pith.science/pith/77U4VRMBUW7W7FG44EILTYO54O","download_json":"https://pith.science/pith/77U4VRMBUW7W7FG44EILTYO54O.json","view_paper":"https://pith.science/paper/77U4VRMB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0710.4668&json=true","fetch_graph":"https://pith.science/api/pith-number/77U4VRMBUW7W7FG44EILTYO54O/graph.json","fetch_events":"https://pith.science/api/pith-number/77U4VRMBUW7W7FG44EILTYO54O/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/77U4VRMBUW7W7FG44EILTYO54O/action/timestamp_anchor","attest_storage":"https://pith.science/pith/77U4VRMBUW7W7FG44EILTYO54O/action/storage_attestation","attest_author":"https://pith.science/pith/77U4VRMBUW7W7FG44EILTYO54O/action/author_attestation","sign_citation":"https://pith.science/pith/77U4VRMBUW7W7FG44EILTYO54O/action/citation_signature","submit_replication":"https://pith.science/pith/77U4VRMBUW7W7FG44EILTYO54O/action/replication_record"}},"created_at":"2026-05-18T02:43:09.678837+00:00","updated_at":"2026-05-18T02:43:09.678837+00:00"}