{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:SHJGSM6HEJ6HI3H5IY2JWHZU6Q","short_pith_number":"pith:SHJGSM6H","canonical_record":{"source":{"id":"1410.0407","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.MG","submitted_at":"2014-10-01T22:57:28Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"d99059805936f1d66029f46314cff67961374d5087fcc5efa64963d5ccce6ec8","abstract_canon_sha256":"bd44d449b1b3d9c230663db85cd67bb63781696f698f1184f0d39abfb87ade89"},"schema_version":"1.0"},"canonical_sha256":"91d26933c7227c746cfd46349b1f34f4273e0753f41c89d06c5614a15530bd31","source":{"kind":"arxiv","id":"1410.0407","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1410.0407","created_at":"2026-05-18T00:42:52Z"},{"alias_kind":"arxiv_version","alias_value":"1410.0407v2","created_at":"2026-05-18T00:42:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.0407","created_at":"2026-05-18T00:42:52Z"},{"alias_kind":"pith_short_12","alias_value":"SHJGSM6HEJ6H","created_at":"2026-05-18T12:28:49Z"},{"alias_kind":"pith_short_16","alias_value":"SHJGSM6HEJ6HI3H5","created_at":"2026-05-18T12:28:49Z"},{"alias_kind":"pith_short_8","alias_value":"SHJGSM6H","created_at":"2026-05-18T12:28:49Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:SHJGSM6HEJ6HI3H5IY2JWHZU6Q","target":"record","payload":{"canonical_record":{"source":{"id":"1410.0407","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.MG","submitted_at":"2014-10-01T22:57:28Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"d99059805936f1d66029f46314cff67961374d5087fcc5efa64963d5ccce6ec8","abstract_canon_sha256":"bd44d449b1b3d9c230663db85cd67bb63781696f698f1184f0d39abfb87ade89"},"schema_version":"1.0"},"canonical_sha256":"91d26933c7227c746cfd46349b1f34f4273e0753f41c89d06c5614a15530bd31","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:42:52.053208Z","signature_b64":"pHyDKqn6KO6byRnk2AMXnRoKsPDEn1qC60b+gMYfqy3vYR/182VH5UsYXMElFOQHYCEmA2s2ap0GNPMrMGhqAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"91d26933c7227c746cfd46349b1f34f4273e0753f41c89d06c5614a15530bd31","last_reissued_at":"2026-05-18T00:42:52.052498Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:42:52.052498Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1410.0407","source_version":2,"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-18T00:42:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6R6opf9q7gNlqB6AbtY9s4rn5RzCYX1euc5ebv3C5B0Ne9U4Pzg5KqaX5gqpttb4oi8Z8A2+mWjLIl1dz+V6DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T05:52:08.459352Z"},"content_sha256":"9291e3514435efbe80f96de237c5ca61d9b4e817f9721380d001e64587225c84","schema_version":"1.0","event_id":"sha256:9291e3514435efbe80f96de237c5ca61d9b4e817f9721380d001e64587225c84"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:SHJGSM6HEJ6HI3H5IY2JWHZU6Q","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On three measures of non-convexity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.MG","authors_text":"Jan Kyn\\v{c}l, Josef Cibulka, Miroslav Korbel\\'a\\v{r}, Pavel Valtr, Rudolf Stola\\v{r}, Viola M\\'esz\\'aros","submitted_at":"2014-10-01T22:57:28Z","abstract_excerpt":"The invisibility graph $I(X)$ of a set $X \\subseteq \\mathbb{R}^d$ is a (possibly infinite) graph whose vertices are the points of $X$ and two vertices are connected by an edge if and only if the straight-line segment connecting the two corresponding points is not fully contained in $X$. We consider the following three parameters of a set $X$: the clique number $\\omega(I(X))$, the chromatic number $\\chi(I(X))$ and the convexity number $\\gamma(X)$, which is the minimum number of convex subsets of $X$ that cover $X$. We settle a conjecture of Matou\\v{s}ek and Valtr claiming that for every planar "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.0407","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"},"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-18T00:42:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"y0q1xXN5W92PsIuppSwM64+2AukyfHQlS7keoHQ3Fg5LIi4Ik2tYH+UbecS7mxjXgU4Ty6UfdfrXN9yT0UvWAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T05:52:08.460049Z"},"content_sha256":"f1ec9ad3cfe21623a03859028d763959352735c62c4939df5a07acdbf0680a66","schema_version":"1.0","event_id":"sha256:f1ec9ad3cfe21623a03859028d763959352735c62c4939df5a07acdbf0680a66"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SHJGSM6HEJ6HI3H5IY2JWHZU6Q/bundle.json","state_url":"https://pith.science/pith/SHJGSM6HEJ6HI3H5IY2JWHZU6Q/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SHJGSM6HEJ6HI3H5IY2JWHZU6Q/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-11T05:52:08Z","links":{"resolver":"https://pith.science/pith/SHJGSM6HEJ6HI3H5IY2JWHZU6Q","bundle":"https://pith.science/pith/SHJGSM6HEJ6HI3H5IY2JWHZU6Q/bundle.json","state":"https://pith.science/pith/SHJGSM6HEJ6HI3H5IY2JWHZU6Q/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SHJGSM6HEJ6HI3H5IY2JWHZU6Q/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:SHJGSM6HEJ6HI3H5IY2JWHZU6Q","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":"bd44d449b1b3d9c230663db85cd67bb63781696f698f1184f0d39abfb87ade89","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.MG","submitted_at":"2014-10-01T22:57:28Z","title_canon_sha256":"d99059805936f1d66029f46314cff67961374d5087fcc5efa64963d5ccce6ec8"},"schema_version":"1.0","source":{"id":"1410.0407","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1410.0407","created_at":"2026-05-18T00:42:52Z"},{"alias_kind":"arxiv_version","alias_value":"1410.0407v2","created_at":"2026-05-18T00:42:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.0407","created_at":"2026-05-18T00:42:52Z"},{"alias_kind":"pith_short_12","alias_value":"SHJGSM6HEJ6H","created_at":"2026-05-18T12:28:49Z"},{"alias_kind":"pith_short_16","alias_value":"SHJGSM6HEJ6HI3H5","created_at":"2026-05-18T12:28:49Z"},{"alias_kind":"pith_short_8","alias_value":"SHJGSM6H","created_at":"2026-05-18T12:28:49Z"}],"graph_snapshots":[{"event_id":"sha256:f1ec9ad3cfe21623a03859028d763959352735c62c4939df5a07acdbf0680a66","target":"graph","created_at":"2026-05-18T00:42:52Z","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":"The invisibility graph $I(X)$ of a set $X \\subseteq \\mathbb{R}^d$ is a (possibly infinite) graph whose vertices are the points of $X$ and two vertices are connected by an edge if and only if the straight-line segment connecting the two corresponding points is not fully contained in $X$. We consider the following three parameters of a set $X$: the clique number $\\omega(I(X))$, the chromatic number $\\chi(I(X))$ and the convexity number $\\gamma(X)$, which is the minimum number of convex subsets of $X$ that cover $X$. We settle a conjecture of Matou\\v{s}ek and Valtr claiming that for every planar ","authors_text":"Jan Kyn\\v{c}l, Josef Cibulka, Miroslav Korbel\\'a\\v{r}, Pavel Valtr, Rudolf Stola\\v{r}, Viola M\\'esz\\'aros","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.MG","submitted_at":"2014-10-01T22:57:28Z","title":"On three measures of non-convexity"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.0407","kind":"arxiv","version":2},"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:9291e3514435efbe80f96de237c5ca61d9b4e817f9721380d001e64587225c84","target":"record","created_at":"2026-05-18T00:42:52Z","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":"bd44d449b1b3d9c230663db85cd67bb63781696f698f1184f0d39abfb87ade89","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.MG","submitted_at":"2014-10-01T22:57:28Z","title_canon_sha256":"d99059805936f1d66029f46314cff67961374d5087fcc5efa64963d5ccce6ec8"},"schema_version":"1.0","source":{"id":"1410.0407","kind":"arxiv","version":2}},"canonical_sha256":"91d26933c7227c746cfd46349b1f34f4273e0753f41c89d06c5614a15530bd31","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"91d26933c7227c746cfd46349b1f34f4273e0753f41c89d06c5614a15530bd31","first_computed_at":"2026-05-18T00:42:52.052498Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:42:52.052498Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"pHyDKqn6KO6byRnk2AMXnRoKsPDEn1qC60b+gMYfqy3vYR/182VH5UsYXMElFOQHYCEmA2s2ap0GNPMrMGhqAw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:42:52.053208Z","signed_message":"canonical_sha256_bytes"},"source_id":"1410.0407","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9291e3514435efbe80f96de237c5ca61d9b4e817f9721380d001e64587225c84","sha256:f1ec9ad3cfe21623a03859028d763959352735c62c4939df5a07acdbf0680a66"],"state_sha256":"c21a936394d29552e229b8ea8194bd3195a95858406abb2912e4305994b6fa6b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1nFGKc9kihZxlLluQLTEGlgxay5Hgrp+0d+tnLnSFPnHf7CZHILYFA/G+VdBR0jd9AOU/r5IrPu1jbzEpoLIAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T05:52:08.464065Z","bundle_sha256":"00ff260f5ff4d41e1c881ae4093d62f7cb716da3e2feb51d81c91c517fd0c021"}}