{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:BWRSMEQDXEKD4N77QOKCV3SFHI","short_pith_number":"pith:BWRSMEQD","schema_version":"1.0","canonical_sha256":"0da3261203b9143e37ff83942aee453a259ebf92454b7b4fce8280184b1c8067","source":{"kind":"arxiv","id":"1207.5701","version":1},"attestation_state":"computed","paper":{"title":"Improved lower bounds on book crossing numbers of complete 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-07-24T13:51:52Z","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 k-page crossing number nu_k(G) of a graph G is the minimum number of crossings in a k-page drawing of G. In this paper we investigate the k-page crossing numbers of complete graphs K_n. We use semidefinite programming techniques to give improved lower "},"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":"1207.5701","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-07-24T13:51:52Z","cross_cats_sorted":[],"title_canon_sha256":"cd296112d03f72e0644c5ceec4ef748c58d91aca9dae68106ce811b5876a8ebb","abstract_canon_sha256":"1279108de1a923affbb4b9af7b004f004caf04159a877f4572910588f54b6126"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:37:59.046461Z","signature_b64":"P5bhK7gMBUXObQZy4tjVYhzFHq5b4dS6v9C7nBMxNpfCXfKinjqbDiEomEdNh1nc9t8Z/YOn1AzLYre8TVnBCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0da3261203b9143e37ff83942aee453a259ebf92454b7b4fce8280184b1c8067","last_reissued_at":"2026-05-18T02:37:59.046020Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:37:59.046020Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Improved lower bounds on book crossing numbers of complete 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-07-24T13:51:52Z","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 k-page crossing number nu_k(G) of a graph G is the minimum number of crossings in a k-page drawing of G. In this paper we investigate the k-page crossing numbers of complete graphs K_n. We use semidefinite programming techniques to give improved lower "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1207.5701","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":"1207.5701","created_at":"2026-05-18T02:37:59.046098+00:00"},{"alias_kind":"arxiv_version","alias_value":"1207.5701v1","created_at":"2026-05-18T02:37:59.046098+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.5701","created_at":"2026-05-18T02:37:59.046098+00:00"},{"alias_kind":"pith_short_12","alias_value":"BWRSMEQDXEKD","created_at":"2026-05-18T12:27:01.376967+00:00"},{"alias_kind":"pith_short_16","alias_value":"BWRSMEQDXEKD4N77","created_at":"2026-05-18T12:27:01.376967+00:00"},{"alias_kind":"pith_short_8","alias_value":"BWRSMEQD","created_at":"2026-05-18T12:27:01.376967+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/BWRSMEQDXEKD4N77QOKCV3SFHI","json":"https://pith.science/pith/BWRSMEQDXEKD4N77QOKCV3SFHI.json","graph_json":"https://pith.science/api/pith-number/BWRSMEQDXEKD4N77QOKCV3SFHI/graph.json","events_json":"https://pith.science/api/pith-number/BWRSMEQDXEKD4N77QOKCV3SFHI/events.json","paper":"https://pith.science/paper/BWRSMEQD"},"agent_actions":{"view_html":"https://pith.science/pith/BWRSMEQDXEKD4N77QOKCV3SFHI","download_json":"https://pith.science/pith/BWRSMEQDXEKD4N77QOKCV3SFHI.json","view_paper":"https://pith.science/paper/BWRSMEQD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1207.5701&json=true","fetch_graph":"https://pith.science/api/pith-number/BWRSMEQDXEKD4N77QOKCV3SFHI/graph.json","fetch_events":"https://pith.science/api/pith-number/BWRSMEQDXEKD4N77QOKCV3SFHI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BWRSMEQDXEKD4N77QOKCV3SFHI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BWRSMEQDXEKD4N77QOKCV3SFHI/action/storage_attestation","attest_author":"https://pith.science/pith/BWRSMEQDXEKD4N77QOKCV3SFHI/action/author_attestation","sign_citation":"https://pith.science/pith/BWRSMEQDXEKD4N77QOKCV3SFHI/action/citation_signature","submit_replication":"https://pith.science/pith/BWRSMEQDXEKD4N77QOKCV3SFHI/action/replication_record"}},"created_at":"2026-05-18T02:37:59.046098+00:00","updated_at":"2026-05-18T02:37:59.046098+00:00"}