{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:VHYE3CGSFG6Z5QQY5JTMINT7OM","short_pith_number":"pith:VHYE3CGS","canonical_record":{"source":{"id":"2505.24490","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-05-30T11:43:14Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"6e1e33ee2c7ec36609f3ccd6b7634a795be7f779096df7c0cbfa088a39e28d73","abstract_canon_sha256":"3f2a9482d0f968576a3f90d987d74fc533b63bf695eb02a1d6d8e265c3e2d388"},"schema_version":"1.0"},"canonical_sha256":"a9f04d88d229bd9ec218ea66c4367f7313119289584ce35d17ec2b37160f0088","source":{"kind":"arxiv","id":"2505.24490","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2505.24490","created_at":"2026-07-05T11:12:50Z"},{"alias_kind":"arxiv_version","alias_value":"2505.24490v1","created_at":"2026-07-05T11:12:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.24490","created_at":"2026-07-05T11:12:50Z"},{"alias_kind":"pith_short_12","alias_value":"VHYE3CGSFG6Z","created_at":"2026-07-05T11:12:50Z"},{"alias_kind":"pith_short_16","alias_value":"VHYE3CGSFG6Z5QQY","created_at":"2026-07-05T11:12:50Z"},{"alias_kind":"pith_short_8","alias_value":"VHYE3CGS","created_at":"2026-07-05T11:12:50Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:VHYE3CGSFG6Z5QQY5JTMINT7OM","target":"record","payload":{"canonical_record":{"source":{"id":"2505.24490","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-05-30T11:43:14Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"6e1e33ee2c7ec36609f3ccd6b7634a795be7f779096df7c0cbfa088a39e28d73","abstract_canon_sha256":"3f2a9482d0f968576a3f90d987d74fc533b63bf695eb02a1d6d8e265c3e2d388"},"schema_version":"1.0"},"canonical_sha256":"a9f04d88d229bd9ec218ea66c4367f7313119289584ce35d17ec2b37160f0088","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:12:50.969579Z","signature_b64":"39nveGbeYjdmYOngARu8RejEfR/vxOHRUKy+6UWZW75yXPwvL0pVnnWGJS0BauKoUxiW/ADPkMCds3REss0XDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a9f04d88d229bd9ec218ea66c4367f7313119289584ce35d17ec2b37160f0088","last_reissued_at":"2026-07-05T11:12:50.969047Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:12:50.969047Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2505.24490","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-07-05T11:12:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"O5rg07v/GvDQP+ODnYXs80blh0HoPuVOuomNfWEaGzB00XnXvC9rMbpkvKbNKpnN14SVYyr9t5PWqQY024PMAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T12:34:07.494907Z"},"content_sha256":"51067d58a379906d550d9b2b4ab52e2e907786e2cab6da7f80ab2dbaa2d223ec","schema_version":"1.0","event_id":"sha256:51067d58a379906d550d9b2b4ab52e2e907786e2cab6da7f80ab2dbaa2d223ec"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:VHYE3CGSFG6Z5QQY5JTMINT7OM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the maximum number of edges of outer k-planar graphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Maximilian Pfister","submitted_at":"2025-05-30T11:43:14Z","abstract_excerpt":"We study the maximum number of straight-line segments connecting $n$ points in convex position in the plane, so that each segment intersects at most $k$ others. This question can also be framed as the maximum number of edges of an outer $k$-planar graph on $n$ vertices. We outline several approaches to tackle the problem with the best approach yielding an upper bound of $(\\sqrt{2}+\\varepsilon)\\sqrt{k}n$ edges (with $\\varepsilon \\rightarrow 0$ for sufficiently large $k$). We further investigate the case where the points are arbitrarily bicolored and segments always connect two different colors "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.24490","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2505.24490/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T11:12:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wCjJFuFnBp5fjJeFg8GiJJ2CEmYgbUvJJJtG+DQaurknTecqnFDfvFZ4JB5gXGEPCy2CqG50i+xUrUVE0w0wAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T12:34:07.505704Z"},"content_sha256":"72c8cfe5ccd48911dd4895e7ba7ecdeae905e8064b6e4b666ec97eb617057302","schema_version":"1.0","event_id":"sha256:72c8cfe5ccd48911dd4895e7ba7ecdeae905e8064b6e4b666ec97eb617057302"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VHYE3CGSFG6Z5QQY5JTMINT7OM/bundle.json","state_url":"https://pith.science/pith/VHYE3CGSFG6Z5QQY5JTMINT7OM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VHYE3CGSFG6Z5QQY5JTMINT7OM/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-08-08T12:34:07Z","links":{"resolver":"https://pith.science/pith/VHYE3CGSFG6Z5QQY5JTMINT7OM","bundle":"https://pith.science/pith/VHYE3CGSFG6Z5QQY5JTMINT7OM/bundle.json","state":"https://pith.science/pith/VHYE3CGSFG6Z5QQY5JTMINT7OM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VHYE3CGSFG6Z5QQY5JTMINT7OM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:VHYE3CGSFG6Z5QQY5JTMINT7OM","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":"3f2a9482d0f968576a3f90d987d74fc533b63bf695eb02a1d6d8e265c3e2d388","cross_cats_sorted":["cs.DM"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-05-30T11:43:14Z","title_canon_sha256":"6e1e33ee2c7ec36609f3ccd6b7634a795be7f779096df7c0cbfa088a39e28d73"},"schema_version":"1.0","source":{"id":"2505.24490","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2505.24490","created_at":"2026-07-05T11:12:50Z"},{"alias_kind":"arxiv_version","alias_value":"2505.24490v1","created_at":"2026-07-05T11:12:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.24490","created_at":"2026-07-05T11:12:50Z"},{"alias_kind":"pith_short_12","alias_value":"VHYE3CGSFG6Z","created_at":"2026-07-05T11:12:50Z"},{"alias_kind":"pith_short_16","alias_value":"VHYE3CGSFG6Z5QQY","created_at":"2026-07-05T11:12:50Z"},{"alias_kind":"pith_short_8","alias_value":"VHYE3CGS","created_at":"2026-07-05T11:12:50Z"}],"graph_snapshots":[{"event_id":"sha256:72c8cfe5ccd48911dd4895e7ba7ecdeae905e8064b6e4b666ec97eb617057302","target":"graph","created_at":"2026-07-05T11:12:50Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2505.24490/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We study the maximum number of straight-line segments connecting $n$ points in convex position in the plane, so that each segment intersects at most $k$ others. This question can also be framed as the maximum number of edges of an outer $k$-planar graph on $n$ vertices. We outline several approaches to tackle the problem with the best approach yielding an upper bound of $(\\sqrt{2}+\\varepsilon)\\sqrt{k}n$ edges (with $\\varepsilon \\rightarrow 0$ for sufficiently large $k$). We further investigate the case where the points are arbitrarily bicolored and segments always connect two different colors ","authors_text":"Maximilian Pfister","cross_cats":["cs.DM"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-05-30T11:43:14Z","title":"On the maximum number of edges of outer k-planar graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.24490","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:51067d58a379906d550d9b2b4ab52e2e907786e2cab6da7f80ab2dbaa2d223ec","target":"record","created_at":"2026-07-05T11:12:50Z","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":"3f2a9482d0f968576a3f90d987d74fc533b63bf695eb02a1d6d8e265c3e2d388","cross_cats_sorted":["cs.DM"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-05-30T11:43:14Z","title_canon_sha256":"6e1e33ee2c7ec36609f3ccd6b7634a795be7f779096df7c0cbfa088a39e28d73"},"schema_version":"1.0","source":{"id":"2505.24490","kind":"arxiv","version":1}},"canonical_sha256":"a9f04d88d229bd9ec218ea66c4367f7313119289584ce35d17ec2b37160f0088","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a9f04d88d229bd9ec218ea66c4367f7313119289584ce35d17ec2b37160f0088","first_computed_at":"2026-07-05T11:12:50.969047Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:12:50.969047Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"39nveGbeYjdmYOngARu8RejEfR/vxOHRUKy+6UWZW75yXPwvL0pVnnWGJS0BauKoUxiW/ADPkMCds3REss0XDQ==","signature_status":"signed_v1","signed_at":"2026-07-05T11:12:50.969579Z","signed_message":"canonical_sha256_bytes"},"source_id":"2505.24490","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:51067d58a379906d550d9b2b4ab52e2e907786e2cab6da7f80ab2dbaa2d223ec","sha256:72c8cfe5ccd48911dd4895e7ba7ecdeae905e8064b6e4b666ec97eb617057302"],"state_sha256":"c546299a906f03aeadb9c7243be66032c8d0cbe0d00ff40f22f19bac523ca514"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dMQPvWXPV24iMMXFpbqKwDSbvUwVDMDVun+Yx9KZXOukvN8i5JwJDxdx7ynZWyVInVI7XHvBkrOqcIMwwyL9Dw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-08T12:34:07.523471Z","bundle_sha256":"1864f7a757445a5e32a1f6db27aca041ac9ee2832bd87d3e6000787dd4244a72"}}