{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:TRB6WJK4GD2XFBGERQ7SHYRHUT","short_pith_number":"pith:TRB6WJK4","schema_version":"1.0","canonical_sha256":"9c43eb255c30f57284c48c3f23e227a4d5f30ada23449e4c75bf98efc90241cb","source":{"kind":"arxiv","id":"1210.2918","version":1},"attestation_state":"computed","paper":{"title":"Book drawings of complete bipartite graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Dmitrii V. Pasechnik, Etienne de Klerk, Gelasio Salazar","submitted_at":"2012-10-10T13:48:13Z","abstract_excerpt":"A \"book\" with k pages consists of a straight line (the \"spine\") and k half-planes (the \"pages\"), such that the boundary of each page is the spine. If a graph is drawn on a book with k pages in such a way that the vertices lie on the spine, and each edge is contained in a page, the result is a k-page book drawing (or simply a k-page drawing). The pagenumber of a graph G is the minimum k such that G admits a k-page embedding (that is, a k-page drawing with no edge crossings). The k-page crossing number nu_k(G) of G is the minimum number of crossings in a k-page drawing of G. We investigate the p"},"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":"1210.2918","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-10-10T13:48:13Z","cross_cats_sorted":[],"title_canon_sha256":"2f5c00ddbf3e52dfe92c846f5419dfca9ad56a3e3fef69a45dd31f1c7f31c9b3","abstract_canon_sha256":"7650cf89345f698e81b7bdaeb7f95a7f947d263bb5c0bc8c5f45f2d62fe62feb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:37:59.023883Z","signature_b64":"mNpGukSxFBfEJPh+Aeoz9rAdnkeqArsWHyaZZ6XaDw4YYI1hEI3duFouTjsCgU1LClltYabhBcf9nNJiaM+lAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9c43eb255c30f57284c48c3f23e227a4d5f30ada23449e4c75bf98efc90241cb","last_reissued_at":"2026-05-18T02:37:59.023507Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:37:59.023507Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Book drawings of complete bipartite graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Dmitrii V. Pasechnik, Etienne de Klerk, Gelasio Salazar","submitted_at":"2012-10-10T13:48:13Z","abstract_excerpt":"A \"book\" with k pages consists of a straight line (the \"spine\") and k half-planes (the \"pages\"), such that the boundary of each page is the spine. If a graph is drawn on a book with k pages in such a way that the vertices lie on the spine, and each edge is contained in a page, the result is a k-page book drawing (or simply a k-page drawing). The pagenumber of a graph G is the minimum k such that G admits a k-page embedding (that is, a k-page drawing with no edge crossings). The k-page crossing number nu_k(G) of G is the minimum number of crossings in a k-page drawing of G. We investigate the p"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1210.2918","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":"1210.2918","created_at":"2026-05-18T02:37:59.023561+00:00"},{"alias_kind":"arxiv_version","alias_value":"1210.2918v1","created_at":"2026-05-18T02:37:59.023561+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1210.2918","created_at":"2026-05-18T02:37:59.023561+00:00"},{"alias_kind":"pith_short_12","alias_value":"TRB6WJK4GD2X","created_at":"2026-05-18T12:27:23.164592+00:00"},{"alias_kind":"pith_short_16","alias_value":"TRB6WJK4GD2XFBGE","created_at":"2026-05-18T12:27:23.164592+00:00"},{"alias_kind":"pith_short_8","alias_value":"TRB6WJK4","created_at":"2026-05-18T12:27:23.164592+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/TRB6WJK4GD2XFBGERQ7SHYRHUT","json":"https://pith.science/pith/TRB6WJK4GD2XFBGERQ7SHYRHUT.json","graph_json":"https://pith.science/api/pith-number/TRB6WJK4GD2XFBGERQ7SHYRHUT/graph.json","events_json":"https://pith.science/api/pith-number/TRB6WJK4GD2XFBGERQ7SHYRHUT/events.json","paper":"https://pith.science/paper/TRB6WJK4"},"agent_actions":{"view_html":"https://pith.science/pith/TRB6WJK4GD2XFBGERQ7SHYRHUT","download_json":"https://pith.science/pith/TRB6WJK4GD2XFBGERQ7SHYRHUT.json","view_paper":"https://pith.science/paper/TRB6WJK4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1210.2918&json=true","fetch_graph":"https://pith.science/api/pith-number/TRB6WJK4GD2XFBGERQ7SHYRHUT/graph.json","fetch_events":"https://pith.science/api/pith-number/TRB6WJK4GD2XFBGERQ7SHYRHUT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TRB6WJK4GD2XFBGERQ7SHYRHUT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TRB6WJK4GD2XFBGERQ7SHYRHUT/action/storage_attestation","attest_author":"https://pith.science/pith/TRB6WJK4GD2XFBGERQ7SHYRHUT/action/author_attestation","sign_citation":"https://pith.science/pith/TRB6WJK4GD2XFBGERQ7SHYRHUT/action/citation_signature","submit_replication":"https://pith.science/pith/TRB6WJK4GD2XFBGERQ7SHYRHUT/action/replication_record"}},"created_at":"2026-05-18T02:37:59.023561+00:00","updated_at":"2026-05-18T02:37:59.023561+00:00"}