{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:A56HQOZL3KALKGXH3EKO5OB7CA","short_pith_number":"pith:A56HQOZL","canonical_record":{"source":{"id":"1102.3515","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-02-17T07:51:24Z","cross_cats_sorted":["cs.CG"],"title_canon_sha256":"e9bf6206abdabfa2e61da1de3babe9bdfc528ad19d98c86be3edf8e917753b4b","abstract_canon_sha256":"8cdd3dde4f2af611f964bc6143ce35809ed2b42f1c027bf8f9e63c11ace22056"},"schema_version":"1.0"},"canonical_sha256":"077c783b2bda80b51ae7d914eeb83f1002b8c2598c2f51229ebdf2ee02a2cd06","source":{"kind":"arxiv","id":"1102.3515","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1102.3515","created_at":"2026-05-18T01:09:25Z"},{"alias_kind":"arxiv_version","alias_value":"1102.3515v1","created_at":"2026-05-18T01:09:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1102.3515","created_at":"2026-05-18T01:09:25Z"},{"alias_kind":"pith_short_12","alias_value":"A56HQOZL3KAL","created_at":"2026-05-18T12:26:24Z"},{"alias_kind":"pith_short_16","alias_value":"A56HQOZL3KALKGXH","created_at":"2026-05-18T12:26:24Z"},{"alias_kind":"pith_short_8","alias_value":"A56HQOZL","created_at":"2026-05-18T12:26:24Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:A56HQOZL3KALKGXH3EKO5OB7CA","target":"record","payload":{"canonical_record":{"source":{"id":"1102.3515","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-02-17T07:51:24Z","cross_cats_sorted":["cs.CG"],"title_canon_sha256":"e9bf6206abdabfa2e61da1de3babe9bdfc528ad19d98c86be3edf8e917753b4b","abstract_canon_sha256":"8cdd3dde4f2af611f964bc6143ce35809ed2b42f1c027bf8f9e63c11ace22056"},"schema_version":"1.0"},"canonical_sha256":"077c783b2bda80b51ae7d914eeb83f1002b8c2598c2f51229ebdf2ee02a2cd06","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:09:25.746898Z","signature_b64":"vM1naRpzs9FzTSJ4X2zhk5riQDsrOCGYGEaSMrVNUPHeMUE8rPj2D5pZzBzYVD3MXFLpnCGwBRQgdaw4bPiqBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"077c783b2bda80b51ae7d914eeb83f1002b8c2598c2f51229ebdf2ee02a2cd06","last_reissued_at":"2026-05-18T01:09:25.746417Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:09:25.746417Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1102.3515","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-18T01:09:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aw+2cGpxF9Q7IewmzqfDGtquGW4yPXUPGe9SWdXR5nY9sLrvfM62H1FEG7v4gRouk8By629Chn5YAVsubdODDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T10:07:30.972253Z"},"content_sha256":"ff60417ac2e00b743650a660c9221ea6a5dc998ccbe14f243c47d9d04bbe434f","schema_version":"1.0","event_id":"sha256:ff60417ac2e00b743650a660c9221ea6a5dc998ccbe14f243c47d9d04bbe434f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:A56HQOZL3KALKGXH3EKO5OB7CA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On Gromov's Method of Selecting Heavily Covered Points","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG"],"primary_cat":"math.CO","authors_text":"Ji\\v{r}\\'i Matou\\v{s}ek, Uli Wagner","submitted_at":"2011-02-17T07:51:24Z","abstract_excerpt":"A result of Boros and F\\\"uredi ($d=2$) and of B\\'ar\\'any (arbitrary $d$) asserts that for every $d$ there exists $c_d>0$ such that for every $n$-point set $P\\subset \\R^d$, some point of $\\R^d$ is covered by at least $c_d{n\\choose d+1}$ of the $d$-simplices spanned by the points of $P$. The largest possible value of $c_d$ has been the subject of ongoing research. Recently Gromov improved the existing lower bounds considerably by introducing a new, topological proof method. We provide an exposition of the combinatorial component of Gromov's approach, in terms accessible to combinatorialists and "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1102.3515","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"},"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-18T01:09:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MddbUcfwkpICobHTK4v10JmoaFmfK97KmCRmyPIY0tWonYDnPK41DmBaTiCELCnoh1ZFzhguyVnj7XUgRPglCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T10:07:30.972625Z"},"content_sha256":"a672b2ce8f68a8dddd758ca446734e0fb1bbda1e20b5269b3c6f6e54d8cc1a95","schema_version":"1.0","event_id":"sha256:a672b2ce8f68a8dddd758ca446734e0fb1bbda1e20b5269b3c6f6e54d8cc1a95"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/A56HQOZL3KALKGXH3EKO5OB7CA/bundle.json","state_url":"https://pith.science/pith/A56HQOZL3KALKGXH3EKO5OB7CA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/A56HQOZL3KALKGXH3EKO5OB7CA/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-06-01T10:07:30Z","links":{"resolver":"https://pith.science/pith/A56HQOZL3KALKGXH3EKO5OB7CA","bundle":"https://pith.science/pith/A56HQOZL3KALKGXH3EKO5OB7CA/bundle.json","state":"https://pith.science/pith/A56HQOZL3KALKGXH3EKO5OB7CA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/A56HQOZL3KALKGXH3EKO5OB7CA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:A56HQOZL3KALKGXH3EKO5OB7CA","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":"8cdd3dde4f2af611f964bc6143ce35809ed2b42f1c027bf8f9e63c11ace22056","cross_cats_sorted":["cs.CG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-02-17T07:51:24Z","title_canon_sha256":"e9bf6206abdabfa2e61da1de3babe9bdfc528ad19d98c86be3edf8e917753b4b"},"schema_version":"1.0","source":{"id":"1102.3515","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1102.3515","created_at":"2026-05-18T01:09:25Z"},{"alias_kind":"arxiv_version","alias_value":"1102.3515v1","created_at":"2026-05-18T01:09:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1102.3515","created_at":"2026-05-18T01:09:25Z"},{"alias_kind":"pith_short_12","alias_value":"A56HQOZL3KAL","created_at":"2026-05-18T12:26:24Z"},{"alias_kind":"pith_short_16","alias_value":"A56HQOZL3KALKGXH","created_at":"2026-05-18T12:26:24Z"},{"alias_kind":"pith_short_8","alias_value":"A56HQOZL","created_at":"2026-05-18T12:26:24Z"}],"graph_snapshots":[{"event_id":"sha256:a672b2ce8f68a8dddd758ca446734e0fb1bbda1e20b5269b3c6f6e54d8cc1a95","target":"graph","created_at":"2026-05-18T01:09: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"},"paper":{"abstract_excerpt":"A result of Boros and F\\\"uredi ($d=2$) and of B\\'ar\\'any (arbitrary $d$) asserts that for every $d$ there exists $c_d>0$ such that for every $n$-point set $P\\subset \\R^d$, some point of $\\R^d$ is covered by at least $c_d{n\\choose d+1}$ of the $d$-simplices spanned by the points of $P$. The largest possible value of $c_d$ has been the subject of ongoing research. Recently Gromov improved the existing lower bounds considerably by introducing a new, topological proof method. We provide an exposition of the combinatorial component of Gromov's approach, in terms accessible to combinatorialists and ","authors_text":"Ji\\v{r}\\'i Matou\\v{s}ek, Uli Wagner","cross_cats":["cs.CG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-02-17T07:51:24Z","title":"On Gromov's Method of Selecting Heavily Covered Points"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1102.3515","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:ff60417ac2e00b743650a660c9221ea6a5dc998ccbe14f243c47d9d04bbe434f","target":"record","created_at":"2026-05-18T01:09: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":"8cdd3dde4f2af611f964bc6143ce35809ed2b42f1c027bf8f9e63c11ace22056","cross_cats_sorted":["cs.CG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-02-17T07:51:24Z","title_canon_sha256":"e9bf6206abdabfa2e61da1de3babe9bdfc528ad19d98c86be3edf8e917753b4b"},"schema_version":"1.0","source":{"id":"1102.3515","kind":"arxiv","version":1}},"canonical_sha256":"077c783b2bda80b51ae7d914eeb83f1002b8c2598c2f51229ebdf2ee02a2cd06","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"077c783b2bda80b51ae7d914eeb83f1002b8c2598c2f51229ebdf2ee02a2cd06","first_computed_at":"2026-05-18T01:09:25.746417Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:09:25.746417Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"vM1naRpzs9FzTSJ4X2zhk5riQDsrOCGYGEaSMrVNUPHeMUE8rPj2D5pZzBzYVD3MXFLpnCGwBRQgdaw4bPiqBA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:09:25.746898Z","signed_message":"canonical_sha256_bytes"},"source_id":"1102.3515","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ff60417ac2e00b743650a660c9221ea6a5dc998ccbe14f243c47d9d04bbe434f","sha256:a672b2ce8f68a8dddd758ca446734e0fb1bbda1e20b5269b3c6f6e54d8cc1a95"],"state_sha256":"b583761c637fd3ac1277301ba72770dd0dae463ddf25d6d7300e3bc186f36098"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vs/BMNIr/1q1cOlxwfqWLlEX2jbxFir1/XnKRNwoXXoWF+QypaPQwTF9+ug4wncJayCCT65TeL6uEYJSOv+zBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T10:07:30.974669Z","bundle_sha256":"dba41fc892c75c1682df1fe217f8fa9f1285f72fba93d83dedec3627fe20f45d"}}