{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:ZLX5YXRMMCUFTTLGEESTRQ7CUX","short_pith_number":"pith:ZLX5YXRM","canonical_record":{"source":{"id":"1503.04990","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-03-17T10:49:36Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"07070796b4690bd0396b4ad2c2c32a107a89ac5bee01d23a3e06a64aaca9531a","abstract_canon_sha256":"c2f8dfd423790a076f82b4eae545716cf4f4b4a2673b32e4076611276a2b910c"},"schema_version":"1.0"},"canonical_sha256":"caefdc5e2c60a859cd66212538c3e2a5d66a1426bf90c38df59dc03b5185ef4f","source":{"kind":"arxiv","id":"1503.04990","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1503.04990","created_at":"2026-05-18T02:20:02Z"},{"alias_kind":"arxiv_version","alias_value":"1503.04990v2","created_at":"2026-05-18T02:20:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.04990","created_at":"2026-05-18T02:20:02Z"},{"alias_kind":"pith_short_12","alias_value":"ZLX5YXRMMCUF","created_at":"2026-05-18T12:29:52Z"},{"alias_kind":"pith_short_16","alias_value":"ZLX5YXRMMCUFTTLG","created_at":"2026-05-18T12:29:52Z"},{"alias_kind":"pith_short_8","alias_value":"ZLX5YXRM","created_at":"2026-05-18T12:29:52Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:ZLX5YXRMMCUFTTLGEESTRQ7CUX","target":"record","payload":{"canonical_record":{"source":{"id":"1503.04990","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-03-17T10:49:36Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"07070796b4690bd0396b4ad2c2c32a107a89ac5bee01d23a3e06a64aaca9531a","abstract_canon_sha256":"c2f8dfd423790a076f82b4eae545716cf4f4b4a2673b32e4076611276a2b910c"},"schema_version":"1.0"},"canonical_sha256":"caefdc5e2c60a859cd66212538c3e2a5d66a1426bf90c38df59dc03b5185ef4f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:20:02.573265Z","signature_b64":"KqBVZgyK5CnHWI3DiyJ6yOXePi4fZ9leurMX+HGn0HdCg66+hmJb+QySmN4XMXw15Q9bbMG6lIuwiouAulsTCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"caefdc5e2c60a859cd66212538c3e2a5d66a1426bf90c38df59dc03b5185ef4f","last_reissued_at":"2026-05-18T02:20:02.572594Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:20:02.572594Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1503.04990","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:20:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IDK/DAVzI6U0XIB9uobTt9fPuGvjlxJAhuA/VjJ4Wbz/gaZIny78yNmaaHseScJUydsJFt8iBB+5Zazi8DOxCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T06:26:29.822533Z"},"content_sha256":"6a7ff0cb7f70bf636557e0f274266c24cef67b8466feefe8a9036fc972b86c02","schema_version":"1.0","event_id":"sha256:6a7ff0cb7f70bf636557e0f274266c24cef67b8466feefe8a9036fc972b86c02"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:ZLX5YXRMMCUFTTLGEESTRQ7CUX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The Book Thickness of 1-Planar Graphs is Constant","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DS","authors_text":"Chrysanthi N. Raftopoulou, Michael A. Bekos, Michael Kaufmann, Till Bruckdorfer","submitted_at":"2015-03-17T10:49:36Z","abstract_excerpt":"In a book embedding, the vertices of a graph are placed on the spine of a book and the edges are assigned to pages, so that edges on the same page do not cross. In this paper, we prove that every $1$-planar graph (that is, a graph that can be drawn on the plane such that no edge is crossed more than once) admits an embedding in a book with constant number of pages. To the best of our knowledge, the best non-trivial previous upper-bound is $O(\\sqrt{n})$, where $n$ is the number of vertices of the graph."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.04990","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:20:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0ftmjbtjvEcYVpi3MrVbBKjW2ofKXFq96leEA7lMcggziscTQFICgCmGlLqZbecbQ2WPQynsTg9zb7zzJ7YVBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T06:26:29.822903Z"},"content_sha256":"8a77a8088286e3134fd5ab64d52e11f8e8871738bddd598c80a010fe3e96830e","schema_version":"1.0","event_id":"sha256:8a77a8088286e3134fd5ab64d52e11f8e8871738bddd598c80a010fe3e96830e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZLX5YXRMMCUFTTLGEESTRQ7CUX/bundle.json","state_url":"https://pith.science/pith/ZLX5YXRMMCUFTTLGEESTRQ7CUX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZLX5YXRMMCUFTTLGEESTRQ7CUX/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-28T06:26:29Z","links":{"resolver":"https://pith.science/pith/ZLX5YXRMMCUFTTLGEESTRQ7CUX","bundle":"https://pith.science/pith/ZLX5YXRMMCUFTTLGEESTRQ7CUX/bundle.json","state":"https://pith.science/pith/ZLX5YXRMMCUFTTLGEESTRQ7CUX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZLX5YXRMMCUFTTLGEESTRQ7CUX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:ZLX5YXRMMCUFTTLGEESTRQ7CUX","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":"c2f8dfd423790a076f82b4eae545716cf4f4b4a2673b32e4076611276a2b910c","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-03-17T10:49:36Z","title_canon_sha256":"07070796b4690bd0396b4ad2c2c32a107a89ac5bee01d23a3e06a64aaca9531a"},"schema_version":"1.0","source":{"id":"1503.04990","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1503.04990","created_at":"2026-05-18T02:20:02Z"},{"alias_kind":"arxiv_version","alias_value":"1503.04990v2","created_at":"2026-05-18T02:20:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.04990","created_at":"2026-05-18T02:20:02Z"},{"alias_kind":"pith_short_12","alias_value":"ZLX5YXRMMCUF","created_at":"2026-05-18T12:29:52Z"},{"alias_kind":"pith_short_16","alias_value":"ZLX5YXRMMCUFTTLG","created_at":"2026-05-18T12:29:52Z"},{"alias_kind":"pith_short_8","alias_value":"ZLX5YXRM","created_at":"2026-05-18T12:29:52Z"}],"graph_snapshots":[{"event_id":"sha256:8a77a8088286e3134fd5ab64d52e11f8e8871738bddd598c80a010fe3e96830e","target":"graph","created_at":"2026-05-18T02:20:02Z","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":"In a book embedding, the vertices of a graph are placed on the spine of a book and the edges are assigned to pages, so that edges on the same page do not cross. In this paper, we prove that every $1$-planar graph (that is, a graph that can be drawn on the plane such that no edge is crossed more than once) admits an embedding in a book with constant number of pages. To the best of our knowledge, the best non-trivial previous upper-bound is $O(\\sqrt{n})$, where $n$ is the number of vertices of the graph.","authors_text":"Chrysanthi N. Raftopoulou, Michael A. Bekos, Michael Kaufmann, Till Bruckdorfer","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-03-17T10:49:36Z","title":"The Book Thickness of 1-Planar Graphs is Constant"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.04990","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:6a7ff0cb7f70bf636557e0f274266c24cef67b8466feefe8a9036fc972b86c02","target":"record","created_at":"2026-05-18T02:20:02Z","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":"c2f8dfd423790a076f82b4eae545716cf4f4b4a2673b32e4076611276a2b910c","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-03-17T10:49:36Z","title_canon_sha256":"07070796b4690bd0396b4ad2c2c32a107a89ac5bee01d23a3e06a64aaca9531a"},"schema_version":"1.0","source":{"id":"1503.04990","kind":"arxiv","version":2}},"canonical_sha256":"caefdc5e2c60a859cd66212538c3e2a5d66a1426bf90c38df59dc03b5185ef4f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"caefdc5e2c60a859cd66212538c3e2a5d66a1426bf90c38df59dc03b5185ef4f","first_computed_at":"2026-05-18T02:20:02.572594Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:20:02.572594Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"KqBVZgyK5CnHWI3DiyJ6yOXePi4fZ9leurMX+HGn0HdCg66+hmJb+QySmN4XMXw15Q9bbMG6lIuwiouAulsTCw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:20:02.573265Z","signed_message":"canonical_sha256_bytes"},"source_id":"1503.04990","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6a7ff0cb7f70bf636557e0f274266c24cef67b8466feefe8a9036fc972b86c02","sha256:8a77a8088286e3134fd5ab64d52e11f8e8871738bddd598c80a010fe3e96830e"],"state_sha256":"b92b168764b3b67d4f6987c7841e3622047496077b0246506ee1a55e3b04dc18"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nE3QlWICXsBJWrWgTzAbXwT7WYQH5XgVnXyXnmsbVxLZ7hiV/yURYUj7IM9+AvHJ44TwUEaWi3GsvBsbGjn0DA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T06:26:29.825303Z","bundle_sha256":"f74f816e0ceaa37cce43030b1555fe96ef05af51888f82e245f087cfde619641"}}