{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:LPMDZV3NJIOXKE4HXXGAPQITBQ","short_pith_number":"pith:LPMDZV3N","schema_version":"1.0","canonical_sha256":"5bd83cd76d4a1d751387bdcc07c1130c2ee9a2fe9aa8ba559013e9cc7d62f5a6","source":{"kind":"arxiv","id":"1108.0297","version":2},"attestation_state":"computed","paper":{"title":"A new lower bound based on Gromov's method of selecting heavily covered points","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Daniel Kral, Jean-Sebastien Sereni, Lukas Mach","submitted_at":"2011-08-01T12:36:30Z","abstract_excerpt":"Boros and Furedi (for d=2) and Barany (for abritrary d) proved that there exists a positive real number c_d such that for every set P of n points in R^d in general position, there exists a point of R^d contained in at least c_d n!/(d+1)!(n-d-1)! d-simplices with vertices at the points of P. Gromov improved the lower bound on c_d by topological means. Using methods from extremal combinatorics, we improve one of the quantities appearing in Gromov's approach and thereby provide a new stronger lower bound on c_d for arbitrary d. In particular, we improve the lower bound on c_3 from 0.06332 to more"},"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":"1108.0297","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-08-01T12:36:30Z","cross_cats_sorted":[],"title_canon_sha256":"20c4d3e1d465221c0209ddb2490adba9154bd2ddc59700c8a6d1e69a21bf487a","abstract_canon_sha256":"3376228243aec6c14abda50c59e4b76e1f9540c2b4a9509b24399bc88138dc86"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:59:38.159535Z","signature_b64":"ctGomFZM8A5kAnt3UI0Xz1dL7ft+Y9cZ8cHVLz5/Gac6KdncZxd57gwUKoO16cLoyC/QqlxoA3SscDcciHyPAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5bd83cd76d4a1d751387bdcc07c1130c2ee9a2fe9aa8ba559013e9cc7d62f5a6","last_reissued_at":"2026-05-18T03:59:38.158983Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:59:38.158983Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A new lower bound based on Gromov's method of selecting heavily covered points","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Daniel Kral, Jean-Sebastien Sereni, Lukas Mach","submitted_at":"2011-08-01T12:36:30Z","abstract_excerpt":"Boros and Furedi (for d=2) and Barany (for abritrary d) proved that there exists a positive real number c_d such that for every set P of n points in R^d in general position, there exists a point of R^d contained in at least c_d n!/(d+1)!(n-d-1)! d-simplices with vertices at the points of P. Gromov improved the lower bound on c_d by topological means. Using methods from extremal combinatorics, we improve one of the quantities appearing in Gromov's approach and thereby provide a new stronger lower bound on c_d for arbitrary d. In particular, we improve the lower bound on c_3 from 0.06332 to more"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1108.0297","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":"1108.0297","created_at":"2026-05-18T03:59:38.159069+00:00"},{"alias_kind":"arxiv_version","alias_value":"1108.0297v2","created_at":"2026-05-18T03:59:38.159069+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1108.0297","created_at":"2026-05-18T03:59:38.159069+00:00"},{"alias_kind":"pith_short_12","alias_value":"LPMDZV3NJIOX","created_at":"2026-05-18T12:26:34.985390+00:00"},{"alias_kind":"pith_short_16","alias_value":"LPMDZV3NJIOXKE4H","created_at":"2026-05-18T12:26:34.985390+00:00"},{"alias_kind":"pith_short_8","alias_value":"LPMDZV3N","created_at":"2026-05-18T12:26:34.985390+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/LPMDZV3NJIOXKE4HXXGAPQITBQ","json":"https://pith.science/pith/LPMDZV3NJIOXKE4HXXGAPQITBQ.json","graph_json":"https://pith.science/api/pith-number/LPMDZV3NJIOXKE4HXXGAPQITBQ/graph.json","events_json":"https://pith.science/api/pith-number/LPMDZV3NJIOXKE4HXXGAPQITBQ/events.json","paper":"https://pith.science/paper/LPMDZV3N"},"agent_actions":{"view_html":"https://pith.science/pith/LPMDZV3NJIOXKE4HXXGAPQITBQ","download_json":"https://pith.science/pith/LPMDZV3NJIOXKE4HXXGAPQITBQ.json","view_paper":"https://pith.science/paper/LPMDZV3N","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1108.0297&json=true","fetch_graph":"https://pith.science/api/pith-number/LPMDZV3NJIOXKE4HXXGAPQITBQ/graph.json","fetch_events":"https://pith.science/api/pith-number/LPMDZV3NJIOXKE4HXXGAPQITBQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LPMDZV3NJIOXKE4HXXGAPQITBQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LPMDZV3NJIOXKE4HXXGAPQITBQ/action/storage_attestation","attest_author":"https://pith.science/pith/LPMDZV3NJIOXKE4HXXGAPQITBQ/action/author_attestation","sign_citation":"https://pith.science/pith/LPMDZV3NJIOXKE4HXXGAPQITBQ/action/citation_signature","submit_replication":"https://pith.science/pith/LPMDZV3NJIOXKE4HXXGAPQITBQ/action/replication_record"}},"created_at":"2026-05-18T03:59:38.159069+00:00","updated_at":"2026-05-18T03:59:38.159069+00:00"}