{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:AN4EDQFPUJ3PL47KIRJCYL56DY","short_pith_number":"pith:AN4EDQFP","schema_version":"1.0","canonical_sha256":"037841c0afa276f5f3ea44522c2fbe1e0c20019f5d42d3f0cf779b9e5369211c","source":{"kind":"arxiv","id":"1801.07097","version":1},"attestation_state":"computed","paper":{"title":"Embedding 5-planar graphs in three pages","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Weihua Yang, Xiaxia Guan","submitted_at":"2018-01-22T13:53:12Z","abstract_excerpt":"A \\emph{book-embedding} of a graph $G$ is an embedding of vertices of $G$ along the spine of a book, and edges of $G$ on the pages so that no two edges on the same page intersect. the minimum number of pages in which a graph can be embedded is called the \\emph{page number}. The book-embedding of graphs may be important in several technical applications, e.g., sorting with parallel stacks, fault-tolerant processor arrays design, and layout problems with application to very large scale integration (VLSI). Bernhart and Kainen firstly considered the book-embedding of the planar graph and conjectur"},"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":"1801.07097","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-01-22T13:53:12Z","cross_cats_sorted":[],"title_canon_sha256":"fc7c57070b4f85056070924f0f33c67e662f20cf6089a1ce061a9446a49718e4","abstract_canon_sha256":"16cda382e16c21fbb4dd1e87c6a4523f2e01875236bbdf5707309dc0070a1dbf"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:25:22.278522Z","signature_b64":"PVaZUimMRMw+3qdq3ExA8moMGx8xwn82ERjk7MMJru4Y+VGOpUBZfGD/XcqduOrX2sD8O6RMFyhc9izHNQIbCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"037841c0afa276f5f3ea44522c2fbe1e0c20019f5d42d3f0cf779b9e5369211c","last_reissued_at":"2026-05-18T00:25:22.277834Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:25:22.277834Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Embedding 5-planar graphs in three pages","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Weihua Yang, Xiaxia Guan","submitted_at":"2018-01-22T13:53:12Z","abstract_excerpt":"A \\emph{book-embedding} of a graph $G$ is an embedding of vertices of $G$ along the spine of a book, and edges of $G$ on the pages so that no two edges on the same page intersect. the minimum number of pages in which a graph can be embedded is called the \\emph{page number}. The book-embedding of graphs may be important in several technical applications, e.g., sorting with parallel stacks, fault-tolerant processor arrays design, and layout problems with application to very large scale integration (VLSI). Bernhart and Kainen firstly considered the book-embedding of the planar graph and conjectur"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.07097","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":""},"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":"1801.07097","created_at":"2026-05-18T00:25:22.277957+00:00"},{"alias_kind":"arxiv_version","alias_value":"1801.07097v1","created_at":"2026-05-18T00:25:22.277957+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.07097","created_at":"2026-05-18T00:25:22.277957+00:00"},{"alias_kind":"pith_short_12","alias_value":"AN4EDQFPUJ3P","created_at":"2026-05-18T12:32:13.499390+00:00"},{"alias_kind":"pith_short_16","alias_value":"AN4EDQFPUJ3PL47K","created_at":"2026-05-18T12:32:13.499390+00:00"},{"alias_kind":"pith_short_8","alias_value":"AN4EDQFP","created_at":"2026-05-18T12:32:13.499390+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/AN4EDQFPUJ3PL47KIRJCYL56DY","json":"https://pith.science/pith/AN4EDQFPUJ3PL47KIRJCYL56DY.json","graph_json":"https://pith.science/api/pith-number/AN4EDQFPUJ3PL47KIRJCYL56DY/graph.json","events_json":"https://pith.science/api/pith-number/AN4EDQFPUJ3PL47KIRJCYL56DY/events.json","paper":"https://pith.science/paper/AN4EDQFP"},"agent_actions":{"view_html":"https://pith.science/pith/AN4EDQFPUJ3PL47KIRJCYL56DY","download_json":"https://pith.science/pith/AN4EDQFPUJ3PL47KIRJCYL56DY.json","view_paper":"https://pith.science/paper/AN4EDQFP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1801.07097&json=true","fetch_graph":"https://pith.science/api/pith-number/AN4EDQFPUJ3PL47KIRJCYL56DY/graph.json","fetch_events":"https://pith.science/api/pith-number/AN4EDQFPUJ3PL47KIRJCYL56DY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AN4EDQFPUJ3PL47KIRJCYL56DY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AN4EDQFPUJ3PL47KIRJCYL56DY/action/storage_attestation","attest_author":"https://pith.science/pith/AN4EDQFPUJ3PL47KIRJCYL56DY/action/author_attestation","sign_citation":"https://pith.science/pith/AN4EDQFPUJ3PL47KIRJCYL56DY/action/citation_signature","submit_replication":"https://pith.science/pith/AN4EDQFPUJ3PL47KIRJCYL56DY/action/replication_record"}},"created_at":"2026-05-18T00:25:22.277957+00:00","updated_at":"2026-05-18T00:25:22.277957+00:00"}