{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:SZXEQ5PNIENSW3EJIIJPQNEVRV","short_pith_number":"pith:SZXEQ5PN","canonical_record":{"source":{"id":"1708.07653","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2017-08-25T08:55:57Z","cross_cats_sorted":[],"title_canon_sha256":"6578a357f907416a5a83e6b0456b9f5fc840989bcfb0846c1aa33b78751ab873","abstract_canon_sha256":"e731fd6b819fabf7e010e85b2c9416acd23fe2a448f130e6956abac37c29f7bd"},"schema_version":"1.0"},"canonical_sha256":"966e4875ed411b2b6c894212f834958d5e2d33e0b5420721cc63fc8fb85af485","source":{"kind":"arxiv","id":"1708.07653","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.07653","created_at":"2026-05-17T23:52:29Z"},{"alias_kind":"arxiv_version","alias_value":"1708.07653v4","created_at":"2026-05-17T23:52:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.07653","created_at":"2026-05-17T23:52:29Z"},{"alias_kind":"pith_short_12","alias_value":"SZXEQ5PNIENS","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_16","alias_value":"SZXEQ5PNIENSW3EJ","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_8","alias_value":"SZXEQ5PN","created_at":"2026-05-18T12:31:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:SZXEQ5PNIENSW3EJIIJPQNEVRV","target":"record","payload":{"canonical_record":{"source":{"id":"1708.07653","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2017-08-25T08:55:57Z","cross_cats_sorted":[],"title_canon_sha256":"6578a357f907416a5a83e6b0456b9f5fc840989bcfb0846c1aa33b78751ab873","abstract_canon_sha256":"e731fd6b819fabf7e010e85b2c9416acd23fe2a448f130e6956abac37c29f7bd"},"schema_version":"1.0"},"canonical_sha256":"966e4875ed411b2b6c894212f834958d5e2d33e0b5420721cc63fc8fb85af485","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:52:29.455512Z","signature_b64":"rJpg//rB0LovkXaznpHZlNcTZ3F4yC3YHJ8D5Z5rhaE66UBhvTP87nnu6wacziVSTd6a443IljCtg/hF7nuLBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"966e4875ed411b2b6c894212f834958d5e2d33e0b5420721cc63fc8fb85af485","last_reissued_at":"2026-05-17T23:52:29.454954Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:52:29.454954Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1708.07653","source_version":4,"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-17T23:52:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qxWueG6BdM6wC+oA4aAGDcmspaOCavCg/jObCM39x8TWD5TEeRCsXQ8KcqhfY93WWE/IOf2yyerJfAaqny2zCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T23:27:46.308865Z"},"content_sha256":"15b573e2443d0bf7396fe595b49ff5df6128d55be3a32376a92e0f78cee19931","schema_version":"1.0","event_id":"sha256:15b573e2443d0bf7396fe595b49ff5df6128d55be3a32376a92e0f78cee19931"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:SZXEQ5PNIENSW3EJIIJPQNEVRV","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Gap-planar Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Csaba D. T\\'oth, Fabrizio Montecchiani, Ignaz Rutter, Jean-Francois Baffier, Jinhee Chun, Kord Eickmeyer, Luca Grilli, Matias Korman, Peter Eades, Sang Won Bae, Seok-Hee Hong","submitted_at":"2017-08-25T08:55:57Z","abstract_excerpt":"We introduce the family of $k$-gap-planar graphs for $k \\geq 0$, i.e., graphs that have a drawing in which each crossing is assigned to one of the two involved edges and each edge is assigned at most $k$ of its crossings. This definition is motivated by applications in edge casing, as a $k$-gap-planar graph can be drawn crossing-free after introducing at most $k$ local gaps per edge. We present results on the maximum density of $k$-gap-planar graphs, their relationship to other classes of beyond-planar graphs, characterization of $k$-gap-planar complete graphs, and the computational complexity"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.07653","kind":"arxiv","version":4},"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-17T23:52:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pa8fzgzZG8ZaeNuUIM7v7wPEePvFj5nroSPVNhhSMOn+rJ/Ix3Mi0Lwin/gZZYvzQhv+OkVB9hnntC0jZ7ahDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T23:27:46.309205Z"},"content_sha256":"82631de233294f0c7d18ee217c0b198f0be1687d2aafcb95076f97867883791a","schema_version":"1.0","event_id":"sha256:82631de233294f0c7d18ee217c0b198f0be1687d2aafcb95076f97867883791a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SZXEQ5PNIENSW3EJIIJPQNEVRV/bundle.json","state_url":"https://pith.science/pith/SZXEQ5PNIENSW3EJIIJPQNEVRV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SZXEQ5PNIENSW3EJIIJPQNEVRV/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-02T23:27:46Z","links":{"resolver":"https://pith.science/pith/SZXEQ5PNIENSW3EJIIJPQNEVRV","bundle":"https://pith.science/pith/SZXEQ5PNIENSW3EJIIJPQNEVRV/bundle.json","state":"https://pith.science/pith/SZXEQ5PNIENSW3EJIIJPQNEVRV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SZXEQ5PNIENSW3EJIIJPQNEVRV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:SZXEQ5PNIENSW3EJIIJPQNEVRV","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":"e731fd6b819fabf7e010e85b2c9416acd23fe2a448f130e6956abac37c29f7bd","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2017-08-25T08:55:57Z","title_canon_sha256":"6578a357f907416a5a83e6b0456b9f5fc840989bcfb0846c1aa33b78751ab873"},"schema_version":"1.0","source":{"id":"1708.07653","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.07653","created_at":"2026-05-17T23:52:29Z"},{"alias_kind":"arxiv_version","alias_value":"1708.07653v4","created_at":"2026-05-17T23:52:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.07653","created_at":"2026-05-17T23:52:29Z"},{"alias_kind":"pith_short_12","alias_value":"SZXEQ5PNIENS","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_16","alias_value":"SZXEQ5PNIENSW3EJ","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_8","alias_value":"SZXEQ5PN","created_at":"2026-05-18T12:31:43Z"}],"graph_snapshots":[{"event_id":"sha256:82631de233294f0c7d18ee217c0b198f0be1687d2aafcb95076f97867883791a","target":"graph","created_at":"2026-05-17T23:52:29Z","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":"We introduce the family of $k$-gap-planar graphs for $k \\geq 0$, i.e., graphs that have a drawing in which each crossing is assigned to one of the two involved edges and each edge is assigned at most $k$ of its crossings. This definition is motivated by applications in edge casing, as a $k$-gap-planar graph can be drawn crossing-free after introducing at most $k$ local gaps per edge. We present results on the maximum density of $k$-gap-planar graphs, their relationship to other classes of beyond-planar graphs, characterization of $k$-gap-planar complete graphs, and the computational complexity","authors_text":"Csaba D. T\\'oth, Fabrizio Montecchiani, Ignaz Rutter, Jean-Francois Baffier, Jinhee Chun, Kord Eickmeyer, Luca Grilli, Matias Korman, Peter Eades, Sang Won Bae, Seok-Hee Hong","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2017-08-25T08:55:57Z","title":"Gap-planar Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.07653","kind":"arxiv","version":4},"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:15b573e2443d0bf7396fe595b49ff5df6128d55be3a32376a92e0f78cee19931","target":"record","created_at":"2026-05-17T23:52:29Z","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":"e731fd6b819fabf7e010e85b2c9416acd23fe2a448f130e6956abac37c29f7bd","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2017-08-25T08:55:57Z","title_canon_sha256":"6578a357f907416a5a83e6b0456b9f5fc840989bcfb0846c1aa33b78751ab873"},"schema_version":"1.0","source":{"id":"1708.07653","kind":"arxiv","version":4}},"canonical_sha256":"966e4875ed411b2b6c894212f834958d5e2d33e0b5420721cc63fc8fb85af485","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"966e4875ed411b2b6c894212f834958d5e2d33e0b5420721cc63fc8fb85af485","first_computed_at":"2026-05-17T23:52:29.454954Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:52:29.454954Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"rJpg//rB0LovkXaznpHZlNcTZ3F4yC3YHJ8D5Z5rhaE66UBhvTP87nnu6wacziVSTd6a443IljCtg/hF7nuLBw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:52:29.455512Z","signed_message":"canonical_sha256_bytes"},"source_id":"1708.07653","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:15b573e2443d0bf7396fe595b49ff5df6128d55be3a32376a92e0f78cee19931","sha256:82631de233294f0c7d18ee217c0b198f0be1687d2aafcb95076f97867883791a"],"state_sha256":"48cfd286dd71688829ce7775e21509625536184dd869496a94144c6ac0192ef3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8Xo+hFYle0JI9d2Mub0Pz38dxiMWKeODxkYiMC6+GMXsQW2ONfAfXQ08MPLTJZo2V1dUXyNCyKmFH17ehJG/Dg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T23:27:46.311178Z","bundle_sha256":"19d8dde193ab1aec443cb58ef9cd822c5aee971381c1f3553bc40ab7ac9d08ab"}}