{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:QQ6WLJ52Q5Q4DVBMPLOLYBTQPI","short_pith_number":"pith:QQ6WLJ52","canonical_record":{"source":{"id":"1405.4019","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-05-15T21:23:41Z","cross_cats_sorted":[],"title_canon_sha256":"a216119e667135fae3c6d860bef596dc51ee188be4a30d9a3f5daf251ce30ba5","abstract_canon_sha256":"c1ba7a7dbfa6dadc7eed290b2a6ace29fac664d31de8c6d76ea70b0778b89bec"},"schema_version":"1.0"},"canonical_sha256":"843d65a7ba8761c1d42c7adcbc06707a081a3f59740496fc5716c2c924aa46e7","source":{"kind":"arxiv","id":"1405.4019","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1405.4019","created_at":"2026-05-18T02:17:21Z"},{"alias_kind":"arxiv_version","alias_value":"1405.4019v2","created_at":"2026-05-18T02:17:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1405.4019","created_at":"2026-05-18T02:17:21Z"},{"alias_kind":"pith_short_12","alias_value":"QQ6WLJ52Q5Q4","created_at":"2026-05-18T12:28:46Z"},{"alias_kind":"pith_short_16","alias_value":"QQ6WLJ52Q5Q4DVBM","created_at":"2026-05-18T12:28:46Z"},{"alias_kind":"pith_short_8","alias_value":"QQ6WLJ52","created_at":"2026-05-18T12:28:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:QQ6WLJ52Q5Q4DVBMPLOLYBTQPI","target":"record","payload":{"canonical_record":{"source":{"id":"1405.4019","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-05-15T21:23:41Z","cross_cats_sorted":[],"title_canon_sha256":"a216119e667135fae3c6d860bef596dc51ee188be4a30d9a3f5daf251ce30ba5","abstract_canon_sha256":"c1ba7a7dbfa6dadc7eed290b2a6ace29fac664d31de8c6d76ea70b0778b89bec"},"schema_version":"1.0"},"canonical_sha256":"843d65a7ba8761c1d42c7adcbc06707a081a3f59740496fc5716c2c924aa46e7","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:17:21.996677Z","signature_b64":"YJg1b13lKzY8QOguvgjRqHGUEVgV/ip6RkqkDmQPgoVSU87rNL5wBot3W+sgNg1pEwvNH8OaUuS6sFK/Rp+ACw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"843d65a7ba8761c1d42c7adcbc06707a081a3f59740496fc5716c2c924aa46e7","last_reissued_at":"2026-05-18T02:17:21.995883Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:17:21.995883Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1405.4019","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-18T02:17:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2lBoF2ErHTm3MJcrrnsGorVrQa9i7bZhIg3+FhclQdF1Vi9SLyps6Jef42swQk1aQ/YPGIz3OWzIvmeyViwTCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-21T12:48:22.252743Z"},"content_sha256":"2672ce64960f6516eec84061a60395788c71e442e923aa62dd1a067950551fd5","schema_version":"1.0","event_id":"sha256:2672ce64960f6516eec84061a60395788c71e442e923aa62dd1a067950551fd5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:QQ6WLJ52Q5Q4DVBMPLOLYBTQPI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On Convex Geometric Graphs with no $k+1$ Pairwise Disjoint Edges","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Chaya Keller, Micha A. Perles","submitted_at":"2014-05-15T21:23:41Z","abstract_excerpt":"A well-known result of Kupitz from 1982 asserts that the maximal number of edges in a convex geometric graph (CGG) on $n$ vertices that does not contain $k+1$ pairwise disjoint edges is $kn$ (provided $n>2k$). For $k=1$ and $k=n/2-1$, the extremal examples are completely characterized. For all other values of $k$, the structure of the extremal examples is far from known: their total number is unknown, and only a few classes of examples were presented, that are almost symmetric, consisting roughly of the $kn$ \"longest possible\" edges of $CK(n)$, the complete CGG of order $n$.\n  In order to unde"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1405.4019","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-18T02:17:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"s9wZX/6yrbaf/zUxowG3uDbMdU7PwaFP4YFmhhPTq5tHM5E9H2MMg00b1/rd0RVMP5163dcPZTS+FBu2+ZRRAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-21T12:48:22.253091Z"},"content_sha256":"e6b353f6009dec485a859cebde037cbaf7dc33cc628ba9b21187b183ce38f390","schema_version":"1.0","event_id":"sha256:e6b353f6009dec485a859cebde037cbaf7dc33cc628ba9b21187b183ce38f390"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QQ6WLJ52Q5Q4DVBMPLOLYBTQPI/bundle.json","state_url":"https://pith.science/pith/QQ6WLJ52Q5Q4DVBMPLOLYBTQPI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QQ6WLJ52Q5Q4DVBMPLOLYBTQPI/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-21T12:48:22Z","links":{"resolver":"https://pith.science/pith/QQ6WLJ52Q5Q4DVBMPLOLYBTQPI","bundle":"https://pith.science/pith/QQ6WLJ52Q5Q4DVBMPLOLYBTQPI/bundle.json","state":"https://pith.science/pith/QQ6WLJ52Q5Q4DVBMPLOLYBTQPI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QQ6WLJ52Q5Q4DVBMPLOLYBTQPI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:QQ6WLJ52Q5Q4DVBMPLOLYBTQPI","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":"c1ba7a7dbfa6dadc7eed290b2a6ace29fac664d31de8c6d76ea70b0778b89bec","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-05-15T21:23:41Z","title_canon_sha256":"a216119e667135fae3c6d860bef596dc51ee188be4a30d9a3f5daf251ce30ba5"},"schema_version":"1.0","source":{"id":"1405.4019","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1405.4019","created_at":"2026-05-18T02:17:21Z"},{"alias_kind":"arxiv_version","alias_value":"1405.4019v2","created_at":"2026-05-18T02:17:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1405.4019","created_at":"2026-05-18T02:17:21Z"},{"alias_kind":"pith_short_12","alias_value":"QQ6WLJ52Q5Q4","created_at":"2026-05-18T12:28:46Z"},{"alias_kind":"pith_short_16","alias_value":"QQ6WLJ52Q5Q4DVBM","created_at":"2026-05-18T12:28:46Z"},{"alias_kind":"pith_short_8","alias_value":"QQ6WLJ52","created_at":"2026-05-18T12:28:46Z"}],"graph_snapshots":[{"event_id":"sha256:e6b353f6009dec485a859cebde037cbaf7dc33cc628ba9b21187b183ce38f390","target":"graph","created_at":"2026-05-18T02:17:21Z","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 well-known result of Kupitz from 1982 asserts that the maximal number of edges in a convex geometric graph (CGG) on $n$ vertices that does not contain $k+1$ pairwise disjoint edges is $kn$ (provided $n>2k$). For $k=1$ and $k=n/2-1$, the extremal examples are completely characterized. For all other values of $k$, the structure of the extremal examples is far from known: their total number is unknown, and only a few classes of examples were presented, that are almost symmetric, consisting roughly of the $kn$ \"longest possible\" edges of $CK(n)$, the complete CGG of order $n$.\n  In order to unde","authors_text":"Chaya Keller, Micha A. Perles","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-05-15T21:23:41Z","title":"On Convex Geometric Graphs with no $k+1$ Pairwise Disjoint Edges"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1405.4019","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:2672ce64960f6516eec84061a60395788c71e442e923aa62dd1a067950551fd5","target":"record","created_at":"2026-05-18T02:17:21Z","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":"c1ba7a7dbfa6dadc7eed290b2a6ace29fac664d31de8c6d76ea70b0778b89bec","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-05-15T21:23:41Z","title_canon_sha256":"a216119e667135fae3c6d860bef596dc51ee188be4a30d9a3f5daf251ce30ba5"},"schema_version":"1.0","source":{"id":"1405.4019","kind":"arxiv","version":2}},"canonical_sha256":"843d65a7ba8761c1d42c7adcbc06707a081a3f59740496fc5716c2c924aa46e7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"843d65a7ba8761c1d42c7adcbc06707a081a3f59740496fc5716c2c924aa46e7","first_computed_at":"2026-05-18T02:17:21.995883Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:17:21.995883Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"YJg1b13lKzY8QOguvgjRqHGUEVgV/ip6RkqkDmQPgoVSU87rNL5wBot3W+sgNg1pEwvNH8OaUuS6sFK/Rp+ACw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:17:21.996677Z","signed_message":"canonical_sha256_bytes"},"source_id":"1405.4019","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2672ce64960f6516eec84061a60395788c71e442e923aa62dd1a067950551fd5","sha256:e6b353f6009dec485a859cebde037cbaf7dc33cc628ba9b21187b183ce38f390"],"state_sha256":"3757251b02e794ccbb734c5dc613bfb8f0b7881ec93ff6203e2c170f8a4cd71d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NhJ43LI4bk4a3UEfxNYLkHuRQi9TgqvYXhWVUcR0HwpHffE0YCv7xBt9BaVFyiueCXY4HHmH/YamCA4F2q33Bg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-21T12:48:22.255019Z","bundle_sha256":"f826ab0289143a548704d2a42417b21a8eae76190f6a0d1315f9de4c17eda7c8"}}