{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:A2KYCGC3M3OCHS3M55R2TJRW6X","short_pith_number":"pith:A2KYCGC3","schema_version":"1.0","canonical_sha256":"069581185b66dc23cb6cef63a9a636f5cc1738cb5094ef0b3b22f93fccbf6bb3","source":{"kind":"arxiv","id":"1110.4824","version":1},"attestation_state":"computed","paper":{"title":"Improved lower bounds for the 2-page crossing numbers of K_{m,n} and K_n via semidefinite programming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"math.CO","authors_text":"Dmitrii V. Pasechnik, Etienne de Klerk","submitted_at":"2011-10-21T15:27:27Z","abstract_excerpt":"It has been long conjectured that the crossing numbers of the complete bipartite graph K_{m,n} and of the complete graph K_n equal Z(m,n) (the value conjectured by Zarankiewicz, who came up with a drawing reaching this value) and Z(n) :=Z(n,n-2)/4, respectively.\n  In a 2-page drawing of a graph, the vertices are drawn on a straight line (the spine), and each edge is contained in one of the half-planes of the spine. The 2-page crossing number v_2(G) of a graph G is the minimum number of crossings in a 2-page drawing of G. Somewhat surprisingly, there are 2-page drawings of K_{m,n} (respectively"},"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":"1110.4824","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-10-21T15:27:27Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"675b6b9f4029e45e08f4bc7bab721da1647c9ee90acff08b11c48e61cd689214","abstract_canon_sha256":"90cc194b91bfa456581fd5c7bed4061b2dc9c98448bbffd91630a27a9b99b4f1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:50:21.991653Z","signature_b64":"511s4Lq76G2+U05kYX/j/UoIjaBUWqKcD0hkZ2B+uHWO9Y2IJBMhGPX9/pY/sddI5mmhpQzNmI6yQGKXurupDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"069581185b66dc23cb6cef63a9a636f5cc1738cb5094ef0b3b22f93fccbf6bb3","last_reissued_at":"2026-05-18T03:50:21.990822Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:50:21.990822Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Improved lower bounds for the 2-page crossing numbers of K_{m,n} and K_n via semidefinite programming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"math.CO","authors_text":"Dmitrii V. Pasechnik, Etienne de Klerk","submitted_at":"2011-10-21T15:27:27Z","abstract_excerpt":"It has been long conjectured that the crossing numbers of the complete bipartite graph K_{m,n} and of the complete graph K_n equal Z(m,n) (the value conjectured by Zarankiewicz, who came up with a drawing reaching this value) and Z(n) :=Z(n,n-2)/4, respectively.\n  In a 2-page drawing of a graph, the vertices are drawn on a straight line (the spine), and each edge is contained in one of the half-planes of the spine. The 2-page crossing number v_2(G) of a graph G is the minimum number of crossings in a 2-page drawing of G. Somewhat surprisingly, there are 2-page drawings of K_{m,n} (respectively"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1110.4824","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":"1110.4824","created_at":"2026-05-18T03:50:21.990962+00:00"},{"alias_kind":"arxiv_version","alias_value":"1110.4824v1","created_at":"2026-05-18T03:50:21.990962+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1110.4824","created_at":"2026-05-18T03:50:21.990962+00:00"},{"alias_kind":"pith_short_12","alias_value":"A2KYCGC3M3OC","created_at":"2026-05-18T12:26:22.705136+00:00"},{"alias_kind":"pith_short_16","alias_value":"A2KYCGC3M3OCHS3M","created_at":"2026-05-18T12:26:22.705136+00:00"},{"alias_kind":"pith_short_8","alias_value":"A2KYCGC3","created_at":"2026-05-18T12:26:22.705136+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/A2KYCGC3M3OCHS3M55R2TJRW6X","json":"https://pith.science/pith/A2KYCGC3M3OCHS3M55R2TJRW6X.json","graph_json":"https://pith.science/api/pith-number/A2KYCGC3M3OCHS3M55R2TJRW6X/graph.json","events_json":"https://pith.science/api/pith-number/A2KYCGC3M3OCHS3M55R2TJRW6X/events.json","paper":"https://pith.science/paper/A2KYCGC3"},"agent_actions":{"view_html":"https://pith.science/pith/A2KYCGC3M3OCHS3M55R2TJRW6X","download_json":"https://pith.science/pith/A2KYCGC3M3OCHS3M55R2TJRW6X.json","view_paper":"https://pith.science/paper/A2KYCGC3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1110.4824&json=true","fetch_graph":"https://pith.science/api/pith-number/A2KYCGC3M3OCHS3M55R2TJRW6X/graph.json","fetch_events":"https://pith.science/api/pith-number/A2KYCGC3M3OCHS3M55R2TJRW6X/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/A2KYCGC3M3OCHS3M55R2TJRW6X/action/timestamp_anchor","attest_storage":"https://pith.science/pith/A2KYCGC3M3OCHS3M55R2TJRW6X/action/storage_attestation","attest_author":"https://pith.science/pith/A2KYCGC3M3OCHS3M55R2TJRW6X/action/author_attestation","sign_citation":"https://pith.science/pith/A2KYCGC3M3OCHS3M55R2TJRW6X/action/citation_signature","submit_replication":"https://pith.science/pith/A2KYCGC3M3OCHS3M55R2TJRW6X/action/replication_record"}},"created_at":"2026-05-18T03:50:21.990962+00:00","updated_at":"2026-05-18T03:50:21.990962+00:00"}