{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:3C4W6U6VZWVARWRVXO2XQLOVAT","short_pith_number":"pith:3C4W6U6V","schema_version":"1.0","canonical_sha256":"d8b96f53d5cdaa08da35bbb5782dd504ecf3f9427fbf791d1908ac98c6c28bb3","source":{"kind":"arxiv","id":"1210.7043","version":1},"attestation_state":"computed","paper":{"title":"Empty Monochromatic Simplices","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG","cs.DM"],"primary_cat":"math.CO","authors_text":"Clemens Huemer, Jorge Urrutia, Oswin Aichholzer, Ruy Fabila-Monroy, Thomas Hackl","submitted_at":"2012-10-26T02:36:35Z","abstract_excerpt":"Let $S$ be a $k$-colored (finite) set of $n$ points in $\\mathbb{R}^d$, $d\\geq 3$, in general position, that is, no {$(d + 1)$} points of $S$ lie in a common $(d - 1)$}-dimensional hyperplane. We count the number of empty monochromatic $d$-simplices determined by $S$, that is, simplices which have only points from one color class of $S$ as vertices and no points of $S$ in their interior. For $3 \\leq k \\leq d$ we provide a lower bound of $\\Omega(n^{d-k+1+2^{-d}})$ and strengthen this to $\\Omega(n^{d-2/3})$ for $k=2$. On the way we provide various results on triangulations of point sets in $\\math"},"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":"1210.7043","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-10-26T02:36:35Z","cross_cats_sorted":["cs.CG","cs.DM"],"title_canon_sha256":"36e4cc35c1174db42cd2b145e218b0a02f8e856f0bc213c26c7a454b4d86e7fb","abstract_canon_sha256":"5d3b40625403b7c8f62e310a971bbf4e28d11bd2bea168bfbbbee4074c772a12"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:42:21.887697Z","signature_b64":"th1atNIICNmdCnKFvZo5nladmJ6wffXzp3ZjA4N5i5Z4Kdo2muhrnP7WWiDCbyOF1Tuvmi9GMVMmABVB8yF5BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d8b96f53d5cdaa08da35bbb5782dd504ecf3f9427fbf791d1908ac98c6c28bb3","last_reissued_at":"2026-05-18T03:42:21.886989Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:42:21.886989Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Empty Monochromatic Simplices","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG","cs.DM"],"primary_cat":"math.CO","authors_text":"Clemens Huemer, Jorge Urrutia, Oswin Aichholzer, Ruy Fabila-Monroy, Thomas Hackl","submitted_at":"2012-10-26T02:36:35Z","abstract_excerpt":"Let $S$ be a $k$-colored (finite) set of $n$ points in $\\mathbb{R}^d$, $d\\geq 3$, in general position, that is, no {$(d + 1)$} points of $S$ lie in a common $(d - 1)$}-dimensional hyperplane. We count the number of empty monochromatic $d$-simplices determined by $S$, that is, simplices which have only points from one color class of $S$ as vertices and no points of $S$ in their interior. For $3 \\leq k \\leq d$ we provide a lower bound of $\\Omega(n^{d-k+1+2^{-d}})$ and strengthen this to $\\Omega(n^{d-2/3})$ for $k=2$. On the way we provide various results on triangulations of point sets in $\\math"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1210.7043","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":""},"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":"1210.7043","created_at":"2026-05-18T03:42:21.887086+00:00"},{"alias_kind":"arxiv_version","alias_value":"1210.7043v1","created_at":"2026-05-18T03:42:21.887086+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1210.7043","created_at":"2026-05-18T03:42:21.887086+00:00"},{"alias_kind":"pith_short_12","alias_value":"3C4W6U6VZWVA","created_at":"2026-05-18T12:26:50.516681+00:00"},{"alias_kind":"pith_short_16","alias_value":"3C4W6U6VZWVARWRV","created_at":"2026-05-18T12:26:50.516681+00:00"},{"alias_kind":"pith_short_8","alias_value":"3C4W6U6V","created_at":"2026-05-18T12:26:50.516681+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/3C4W6U6VZWVARWRVXO2XQLOVAT","json":"https://pith.science/pith/3C4W6U6VZWVARWRVXO2XQLOVAT.json","graph_json":"https://pith.science/api/pith-number/3C4W6U6VZWVARWRVXO2XQLOVAT/graph.json","events_json":"https://pith.science/api/pith-number/3C4W6U6VZWVARWRVXO2XQLOVAT/events.json","paper":"https://pith.science/paper/3C4W6U6V"},"agent_actions":{"view_html":"https://pith.science/pith/3C4W6U6VZWVARWRVXO2XQLOVAT","download_json":"https://pith.science/pith/3C4W6U6VZWVARWRVXO2XQLOVAT.json","view_paper":"https://pith.science/paper/3C4W6U6V","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1210.7043&json=true","fetch_graph":"https://pith.science/api/pith-number/3C4W6U6VZWVARWRVXO2XQLOVAT/graph.json","fetch_events":"https://pith.science/api/pith-number/3C4W6U6VZWVARWRVXO2XQLOVAT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3C4W6U6VZWVARWRVXO2XQLOVAT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3C4W6U6VZWVARWRVXO2XQLOVAT/action/storage_attestation","attest_author":"https://pith.science/pith/3C4W6U6VZWVARWRVXO2XQLOVAT/action/author_attestation","sign_citation":"https://pith.science/pith/3C4W6U6VZWVARWRVXO2XQLOVAT/action/citation_signature","submit_replication":"https://pith.science/pith/3C4W6U6VZWVARWRVXO2XQLOVAT/action/replication_record"}},"created_at":"2026-05-18T03:42:21.887086+00:00","updated_at":"2026-05-18T03:42:21.887086+00:00"}