{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:2KIODM6CJGIKZK3MVJ4ATG3FS3","short_pith_number":"pith:2KIODM6C","canonical_record":{"source":{"id":"2408.16085","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"math.CO","submitted_at":"2024-08-28T18:28:23Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"3fc9f5c808ea0ed99352f31c292022ce6c1924e74db33122a0dbbccd5f48a872","abstract_canon_sha256":"cf4df3ff624fa5f1c8ec84455bd0528a1c8894df3e2d5b1f518be86a75a6b705"},"schema_version":"1.0"},"canonical_sha256":"d290e1b3c24990acab6caa78099b6596c5ba43b1c719632e2d6da361a8c60703","source":{"kind":"arxiv","id":"2408.16085","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2408.16085","created_at":"2026-07-05T09:00:25Z"},{"alias_kind":"arxiv_version","alias_value":"2408.16085v1","created_at":"2026-07-05T09:00:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2408.16085","created_at":"2026-07-05T09:00:25Z"},{"alias_kind":"pith_short_12","alias_value":"2KIODM6CJGIK","created_at":"2026-07-05T09:00:25Z"},{"alias_kind":"pith_short_16","alias_value":"2KIODM6CJGIKZK3M","created_at":"2026-07-05T09:00:25Z"},{"alias_kind":"pith_short_8","alias_value":"2KIODM6C","created_at":"2026-07-05T09:00:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:2KIODM6CJGIKZK3MVJ4ATG3FS3","target":"record","payload":{"canonical_record":{"source":{"id":"2408.16085","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"math.CO","submitted_at":"2024-08-28T18:28:23Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"3fc9f5c808ea0ed99352f31c292022ce6c1924e74db33122a0dbbccd5f48a872","abstract_canon_sha256":"cf4df3ff624fa5f1c8ec84455bd0528a1c8894df3e2d5b1f518be86a75a6b705"},"schema_version":"1.0"},"canonical_sha256":"d290e1b3c24990acab6caa78099b6596c5ba43b1c719632e2d6da361a8c60703","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:00:25.746908Z","signature_b64":"L4XwdQ3jMSjz95r9ddraPp2vAjKANSXjFwkNq35y8fraikfDQQhbhEW0AIz12xZMPOHWjOTL0jfCuW5CCQ6nDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d290e1b3c24990acab6caa78099b6596c5ba43b1c719632e2d6da361a8c60703","last_reissued_at":"2026-07-05T09:00:25.746392Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:00:25.746392Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2408.16085","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-05T09:00:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Kn8a62o/fyotcqiqiMayoknpKaQ8uMoE6r8oFufhcE0yf1m62HXKjPOKLgU1bIB8x3xEA6nP9fXKfPiSve+DBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-09T02:58:07.325041Z"},"content_sha256":"84113dba557bb08072617a9883609bcfb02f9aafefa5199d3c98d63811466c1e","schema_version":"1.0","event_id":"sha256:84113dba557bb08072617a9883609bcfb02f9aafefa5199d3c98d63811466c1e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:2KIODM6CJGIKZK3MVJ4ATG3FS3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On $k$-planar Graphs without Short Cycles","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Aaron B\\\"ungener, Alexandra Weinberger, Michael A. Bekos, Michael Hoffmann, Michael Kaufmann, Pat Morin, Prosenjit Bose, Saeed Odak, Vida Dujmovi\\'c","submitted_at":"2024-08-28T18:28:23Z","abstract_excerpt":"We study the impact of forbidding short cycles to the edge density of $k$-planar graphs; a $k$-planar graph is one that can be drawn in the plane with at most $k$ crossings per edge. Specifically, we consider three settings, according to which the forbidden substructures are $3$-cycles, $4$-cycles or both of them (i.e., girth $\\ge 5$). For all three settings and all $k\\in\\{1,2,3\\}$, we present lower and upper bounds on the maximum number of edges in any $k$-planar graph on $n$ vertices. Our bounds are of the form $c\\,n$, for some explicit constant $c$ that depends on $k$ and on the setting. Fo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2408.16085","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/2408.16085/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-05T09:00:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UHTQZ01Cpcb0yc+6w8qqLOeUJbYHC4hqqfW8X2Qc5Fk0UOs2buEyYWXLmKQ1wuLfZlTsRZx/CJKja9gUdi2/AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-09T02:58:07.325928Z"},"content_sha256":"990b9b606ffd69f891c9cd9a75018a45f86b90997e59f176d167b4d71a6eaa7e","schema_version":"1.0","event_id":"sha256:990b9b606ffd69f891c9cd9a75018a45f86b90997e59f176d167b4d71a6eaa7e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2KIODM6CJGIKZK3MVJ4ATG3FS3/bundle.json","state_url":"https://pith.science/pith/2KIODM6CJGIKZK3MVJ4ATG3FS3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2KIODM6CJGIKZK3MVJ4ATG3FS3/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-09T02:58:07Z","links":{"resolver":"https://pith.science/pith/2KIODM6CJGIKZK3MVJ4ATG3FS3","bundle":"https://pith.science/pith/2KIODM6CJGIKZK3MVJ4ATG3FS3/bundle.json","state":"https://pith.science/pith/2KIODM6CJGIKZK3MVJ4ATG3FS3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2KIODM6CJGIKZK3MVJ4ATG3FS3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:2KIODM6CJGIKZK3MVJ4ATG3FS3","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":"cf4df3ff624fa5f1c8ec84455bd0528a1c8894df3e2d5b1f518be86a75a6b705","cross_cats_sorted":["cs.DM"],"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"math.CO","submitted_at":"2024-08-28T18:28:23Z","title_canon_sha256":"3fc9f5c808ea0ed99352f31c292022ce6c1924e74db33122a0dbbccd5f48a872"},"schema_version":"1.0","source":{"id":"2408.16085","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2408.16085","created_at":"2026-07-05T09:00:25Z"},{"alias_kind":"arxiv_version","alias_value":"2408.16085v1","created_at":"2026-07-05T09:00:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2408.16085","created_at":"2026-07-05T09:00:25Z"},{"alias_kind":"pith_short_12","alias_value":"2KIODM6CJGIK","created_at":"2026-07-05T09:00:25Z"},{"alias_kind":"pith_short_16","alias_value":"2KIODM6CJGIKZK3M","created_at":"2026-07-05T09:00:25Z"},{"alias_kind":"pith_short_8","alias_value":"2KIODM6C","created_at":"2026-07-05T09:00:25Z"}],"graph_snapshots":[{"event_id":"sha256:990b9b606ffd69f891c9cd9a75018a45f86b90997e59f176d167b4d71a6eaa7e","target":"graph","created_at":"2026-07-05T09:00: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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2408.16085/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We study the impact of forbidding short cycles to the edge density of $k$-planar graphs; a $k$-planar graph is one that can be drawn in the plane with at most $k$ crossings per edge. Specifically, we consider three settings, according to which the forbidden substructures are $3$-cycles, $4$-cycles or both of them (i.e., girth $\\ge 5$). For all three settings and all $k\\in\\{1,2,3\\}$, we present lower and upper bounds on the maximum number of edges in any $k$-planar graph on $n$ vertices. Our bounds are of the form $c\\,n$, for some explicit constant $c$ that depends on $k$ and on the setting. Fo","authors_text":"Aaron B\\\"ungener, Alexandra Weinberger, Michael A. Bekos, Michael Hoffmann, Michael Kaufmann, Pat Morin, Prosenjit Bose, Saeed Odak, Vida Dujmovi\\'c","cross_cats":["cs.DM"],"headline":"","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"math.CO","submitted_at":"2024-08-28T18:28:23Z","title":"On $k$-planar Graphs without Short Cycles"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2408.16085","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:84113dba557bb08072617a9883609bcfb02f9aafefa5199d3c98d63811466c1e","target":"record","created_at":"2026-07-05T09:00: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":"cf4df3ff624fa5f1c8ec84455bd0528a1c8894df3e2d5b1f518be86a75a6b705","cross_cats_sorted":["cs.DM"],"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"math.CO","submitted_at":"2024-08-28T18:28:23Z","title_canon_sha256":"3fc9f5c808ea0ed99352f31c292022ce6c1924e74db33122a0dbbccd5f48a872"},"schema_version":"1.0","source":{"id":"2408.16085","kind":"arxiv","version":1}},"canonical_sha256":"d290e1b3c24990acab6caa78099b6596c5ba43b1c719632e2d6da361a8c60703","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d290e1b3c24990acab6caa78099b6596c5ba43b1c719632e2d6da361a8c60703","first_computed_at":"2026-07-05T09:00:25.746392Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T09:00:25.746392Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"L4XwdQ3jMSjz95r9ddraPp2vAjKANSXjFwkNq35y8fraikfDQQhbhEW0AIz12xZMPOHWjOTL0jfCuW5CCQ6nDg==","signature_status":"signed_v1","signed_at":"2026-07-05T09:00:25.746908Z","signed_message":"canonical_sha256_bytes"},"source_id":"2408.16085","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:84113dba557bb08072617a9883609bcfb02f9aafefa5199d3c98d63811466c1e","sha256:990b9b606ffd69f891c9cd9a75018a45f86b90997e59f176d167b4d71a6eaa7e"],"state_sha256":"c8610458e66529bc3c9b69a17a3a5a89cc40690d1aaab58661545d4c4d4f9bee"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"klgOBFz+WZj1Fuu9TuI4AH6hstfWOlgRPXbqLvk64bWLZt0gAE05DjcUgXA9b5KyHyeF9qGQ/WeqNcAlw671CQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-09T02:58:07.383794Z","bundle_sha256":"94ce2443de55d8537010d75aa63094e3dd1f6fe0fd34d69d7f84bc402636111e"}}