{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:A2KYCGC3M3OCHS3M55R2TJRW6X","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"90cc194b91bfa456581fd5c7bed4061b2dc9c98448bbffd91630a27a9b99b4f1","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-10-21T15:27:27Z","title_canon_sha256":"675b6b9f4029e45e08f4bc7bab721da1647c9ee90acff08b11c48e61cd689214"},"schema_version":"1.0","source":{"id":"1110.4824","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1110.4824","created_at":"2026-05-18T03:50:21Z"},{"alias_kind":"arxiv_version","alias_value":"1110.4824v1","created_at":"2026-05-18T03:50:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1110.4824","created_at":"2026-05-18T03:50:21Z"},{"alias_kind":"pith_short_12","alias_value":"A2KYCGC3M3OC","created_at":"2026-05-18T12:26:22Z"},{"alias_kind":"pith_short_16","alias_value":"A2KYCGC3M3OCHS3M","created_at":"2026-05-18T12:26:22Z"},{"alias_kind":"pith_short_8","alias_value":"A2KYCGC3","created_at":"2026-05-18T12:26:22Z"}],"graph_snapshots":[{"event_id":"sha256:c83366e33d7e48bb48dac7dd7567f6803e54b1ded324fc3786887a697da5713d","target":"graph","created_at":"2026-05-18T03:50:21Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Dmitrii V. Pasechnik, Etienne de Klerk","cross_cats":["math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-10-21T15:27:27Z","title":"Improved lower bounds for the 2-page crossing numbers of K_{m,n} and K_n via semidefinite programming"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1110.4824","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:49e2977cc88c6aad786f08ab0885c74721682bbe7d6f0c203f66c09a446e5e41","target":"record","created_at":"2026-05-18T03:50:21Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"90cc194b91bfa456581fd5c7bed4061b2dc9c98448bbffd91630a27a9b99b4f1","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-10-21T15:27:27Z","title_canon_sha256":"675b6b9f4029e45e08f4bc7bab721da1647c9ee90acff08b11c48e61cd689214"},"schema_version":"1.0","source":{"id":"1110.4824","kind":"arxiv","version":1}},"canonical_sha256":"069581185b66dc23cb6cef63a9a636f5cc1738cb5094ef0b3b22f93fccbf6bb3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"069581185b66dc23cb6cef63a9a636f5cc1738cb5094ef0b3b22f93fccbf6bb3","first_computed_at":"2026-05-18T03:50:21.990822Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:50:21.990822Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"511s4Lq76G2+U05kYX/j/UoIjaBUWqKcD0hkZ2B+uHWO9Y2IJBMhGPX9/pY/sddI5mmhpQzNmI6yQGKXurupDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:50:21.991653Z","signed_message":"canonical_sha256_bytes"},"source_id":"1110.4824","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:49e2977cc88c6aad786f08ab0885c74721682bbe7d6f0c203f66c09a446e5e41","sha256:c83366e33d7e48bb48dac7dd7567f6803e54b1ded324fc3786887a697da5713d"],"state_sha256":"1b0954fc13f733d02670cee52ccbed75453f4caadc4745b482b1ac16a66ba684"}