{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:ZLX5YXRMMCUFTTLGEESTRQ7CUX","short_pith_number":"pith:ZLX5YXRM","schema_version":"1.0","canonical_sha256":"caefdc5e2c60a859cd66212538c3e2a5d66a1426bf90c38df59dc03b5185ef4f","source":{"kind":"arxiv","id":"1503.04990","version":2},"attestation_state":"computed","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."},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1503.04990","created_at":"2026-05-18T02:20:02.572702+00:00"},{"alias_kind":"arxiv_version","alias_value":"1503.04990v2","created_at":"2026-05-18T02:20:02.572702+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.04990","created_at":"2026-05-18T02:20:02.572702+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZLX5YXRMMCUF","created_at":"2026-05-18T12:29:52.810259+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZLX5YXRMMCUFTTLG","created_at":"2026-05-18T12:29:52.810259+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZLX5YXRM","created_at":"2026-05-18T12:29:52.810259+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/ZLX5YXRMMCUFTTLGEESTRQ7CUX","json":"https://pith.science/pith/ZLX5YXRMMCUFTTLGEESTRQ7CUX.json","graph_json":"https://pith.science/api/pith-number/ZLX5YXRMMCUFTTLGEESTRQ7CUX/graph.json","events_json":"https://pith.science/api/pith-number/ZLX5YXRMMCUFTTLGEESTRQ7CUX/events.json","paper":"https://pith.science/paper/ZLX5YXRM"},"agent_actions":{"view_html":"https://pith.science/pith/ZLX5YXRMMCUFTTLGEESTRQ7CUX","download_json":"https://pith.science/pith/ZLX5YXRMMCUFTTLGEESTRQ7CUX.json","view_paper":"https://pith.science/paper/ZLX5YXRM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1503.04990&json=true","fetch_graph":"https://pith.science/api/pith-number/ZLX5YXRMMCUFTTLGEESTRQ7CUX/graph.json","fetch_events":"https://pith.science/api/pith-number/ZLX5YXRMMCUFTTLGEESTRQ7CUX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZLX5YXRMMCUFTTLGEESTRQ7CUX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZLX5YXRMMCUFTTLGEESTRQ7CUX/action/storage_attestation","attest_author":"https://pith.science/pith/ZLX5YXRMMCUFTTLGEESTRQ7CUX/action/author_attestation","sign_citation":"https://pith.science/pith/ZLX5YXRMMCUFTTLGEESTRQ7CUX/action/citation_signature","submit_replication":"https://pith.science/pith/ZLX5YXRMMCUFTTLGEESTRQ7CUX/action/replication_record"}},"created_at":"2026-05-18T02:20:02.572702+00:00","updated_at":"2026-05-18T02:20:02.572702+00:00"}