{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:CO5RA7PT3V4AHRXTYB4FQRVQNJ","short_pith_number":"pith:CO5RA7PT","canonical_record":{"source":{"id":"1602.04995","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2016-02-16T11:45:25Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"39de28c4f3fe23d519a0ddd249437b7ad9add93aa7b0bc6f01d958d8f6d81237","abstract_canon_sha256":"2a1fdd12118935a13ad75c17c36aa3c7828972c4016ed86ea1dc3836412fb40f"},"schema_version":"1.0"},"canonical_sha256":"13bb107df3dd7803c6f3c0785846b06a7737a31bc2193526d8edb694b73d4ab7","source":{"kind":"arxiv","id":"1602.04995","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.04995","created_at":"2026-05-18T01:07:20Z"},{"alias_kind":"arxiv_version","alias_value":"1602.04995v3","created_at":"2026-05-18T01:07:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.04995","created_at":"2026-05-18T01:07:20Z"},{"alias_kind":"pith_short_12","alias_value":"CO5RA7PT3V4A","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_16","alias_value":"CO5RA7PT3V4AHRXT","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_8","alias_value":"CO5RA7PT","created_at":"2026-05-18T12:30:09Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:CO5RA7PT3V4AHRXTYB4FQRVQNJ","target":"record","payload":{"canonical_record":{"source":{"id":"1602.04995","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2016-02-16T11:45:25Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"39de28c4f3fe23d519a0ddd249437b7ad9add93aa7b0bc6f01d958d8f6d81237","abstract_canon_sha256":"2a1fdd12118935a13ad75c17c36aa3c7828972c4016ed86ea1dc3836412fb40f"},"schema_version":"1.0"},"canonical_sha256":"13bb107df3dd7803c6f3c0785846b06a7737a31bc2193526d8edb694b73d4ab7","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:07:20.861935Z","signature_b64":"30+SXrv2uB81CLGGO01B8MtMOly+8Xwf5gdzFJfKeLNDeQvWMl5TxG4pPltXfFCyFNpdgN3lS06ciYLyju+wDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"13bb107df3dd7803c6f3c0785846b06a7737a31bc2193526d8edb694b73d4ab7","last_reissued_at":"2026-05-18T01:07:20.861462Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:07:20.861462Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1602.04995","source_version":3,"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-18T01:07:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"a/pbSpPCBMX6u2Zi1wpwTz+OUZaFwXVFO/TPeLXrvFvSZBQ5/9oiZHbHC+TMRcJCtnPq8I5o28/jJj9KuLDGAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T15:00:05.502981Z"},"content_sha256":"c2f5e3b719704e618ba2929d48893a8c8eeb42856caebc331561f46cadf9eac1","schema_version":"1.0","event_id":"sha256:c2f5e3b719704e618ba2929d48893a8c8eeb42856caebc331561f46cadf9eac1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:CO5RA7PT3V4AHRXTYB4FQRVQNJ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the Density of non-Simple 3-Planar Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CG","authors_text":"Chrysanthi N. Raftopoulou, Michael A. Bekos, Michael Kaufmann","submitted_at":"2016-02-16T11:45:25Z","abstract_excerpt":"A \\emph{$k$-planar graph} is a graph that can be drawn in the plane such that every edge is crossed at most $k$ times. For $k \\leq 4$, Pach and T\\'oth proved a bound of $(k+3)(n-2)$ on the total number of edges of a $k$-planar graph, which is tight for $k=1,2$. For $k=3$, the bound of $6n-12$ has been improved to $\\frac{11}{2}n-11$ and has been shown to be optimal up to an additive constant for simple graphs. In this paper, we prove that the bound of $\\frac{11}{2}n-11$ edges also holds for non-simple $3$-planar graphs that admit drawings in which non-homotopic parallel edges and self-loops are"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.04995","kind":"arxiv","version":3},"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-18T01:07:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5F4JUdj7zfZwzdkp9XgdEClw0rYv7m4Qj9weVrwCm7tqKxkR2UNQErCcHy+JUc6pViW6/FCfF71K928Rg9lDCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T15:00:05.503330Z"},"content_sha256":"7a93319d68a962bd60e329653ffb19efce24710c1bcc223a019349612970f41c","schema_version":"1.0","event_id":"sha256:7a93319d68a962bd60e329653ffb19efce24710c1bcc223a019349612970f41c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CO5RA7PT3V4AHRXTYB4FQRVQNJ/bundle.json","state_url":"https://pith.science/pith/CO5RA7PT3V4AHRXTYB4FQRVQNJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CO5RA7PT3V4AHRXTYB4FQRVQNJ/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-05-28T15:00:05Z","links":{"resolver":"https://pith.science/pith/CO5RA7PT3V4AHRXTYB4FQRVQNJ","bundle":"https://pith.science/pith/CO5RA7PT3V4AHRXTYB4FQRVQNJ/bundle.json","state":"https://pith.science/pith/CO5RA7PT3V4AHRXTYB4FQRVQNJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CO5RA7PT3V4AHRXTYB4FQRVQNJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:CO5RA7PT3V4AHRXTYB4FQRVQNJ","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":"2a1fdd12118935a13ad75c17c36aa3c7828972c4016ed86ea1dc3836412fb40f","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2016-02-16T11:45:25Z","title_canon_sha256":"39de28c4f3fe23d519a0ddd249437b7ad9add93aa7b0bc6f01d958d8f6d81237"},"schema_version":"1.0","source":{"id":"1602.04995","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.04995","created_at":"2026-05-18T01:07:20Z"},{"alias_kind":"arxiv_version","alias_value":"1602.04995v3","created_at":"2026-05-18T01:07:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.04995","created_at":"2026-05-18T01:07:20Z"},{"alias_kind":"pith_short_12","alias_value":"CO5RA7PT3V4A","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_16","alias_value":"CO5RA7PT3V4AHRXT","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_8","alias_value":"CO5RA7PT","created_at":"2026-05-18T12:30:09Z"}],"graph_snapshots":[{"event_id":"sha256:7a93319d68a962bd60e329653ffb19efce24710c1bcc223a019349612970f41c","target":"graph","created_at":"2026-05-18T01:07:20Z","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 \\emph{$k$-planar graph} is a graph that can be drawn in the plane such that every edge is crossed at most $k$ times. For $k \\leq 4$, Pach and T\\'oth proved a bound of $(k+3)(n-2)$ on the total number of edges of a $k$-planar graph, which is tight for $k=1,2$. For $k=3$, the bound of $6n-12$ has been improved to $\\frac{11}{2}n-11$ and has been shown to be optimal up to an additive constant for simple graphs. In this paper, we prove that the bound of $\\frac{11}{2}n-11$ edges also holds for non-simple $3$-planar graphs that admit drawings in which non-homotopic parallel edges and self-loops are","authors_text":"Chrysanthi N. Raftopoulou, Michael A. Bekos, Michael Kaufmann","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2016-02-16T11:45:25Z","title":"On the Density of non-Simple 3-Planar Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.04995","kind":"arxiv","version":3},"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:c2f5e3b719704e618ba2929d48893a8c8eeb42856caebc331561f46cadf9eac1","target":"record","created_at":"2026-05-18T01:07:20Z","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":"2a1fdd12118935a13ad75c17c36aa3c7828972c4016ed86ea1dc3836412fb40f","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2016-02-16T11:45:25Z","title_canon_sha256":"39de28c4f3fe23d519a0ddd249437b7ad9add93aa7b0bc6f01d958d8f6d81237"},"schema_version":"1.0","source":{"id":"1602.04995","kind":"arxiv","version":3}},"canonical_sha256":"13bb107df3dd7803c6f3c0785846b06a7737a31bc2193526d8edb694b73d4ab7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"13bb107df3dd7803c6f3c0785846b06a7737a31bc2193526d8edb694b73d4ab7","first_computed_at":"2026-05-18T01:07:20.861462Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:07:20.861462Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"30+SXrv2uB81CLGGO01B8MtMOly+8Xwf5gdzFJfKeLNDeQvWMl5TxG4pPltXfFCyFNpdgN3lS06ciYLyju+wDg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:07:20.861935Z","signed_message":"canonical_sha256_bytes"},"source_id":"1602.04995","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c2f5e3b719704e618ba2929d48893a8c8eeb42856caebc331561f46cadf9eac1","sha256:7a93319d68a962bd60e329653ffb19efce24710c1bcc223a019349612970f41c"],"state_sha256":"7d0c33876c00de58868ed6af75e8f183ef0cd2fd9ce900a56325576defa49b95"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YpMOhYrpMeimIm6tNgcjUrW5c/DmYBlegj4eUZLc+mPfBz4ZAu2w0tvMvRQ7X8r6xHApP8C+yp8Hg+SYVw7qBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T15:00:05.505166Z","bundle_sha256":"12998f0d5df6df57a97163362364fe4c85e4efd1c1136282221ed50f9883fb63"}}