{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:BWRSMEQDXEKD4N77QOKCV3SFHI","short_pith_number":"pith:BWRSMEQD","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"},"canonical_sha256":"0da3261203b9143e37ff83942aee453a259ebf92454b7b4fce8280184b1c8067","source":{"kind":"arxiv","id":"1207.5701","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1207.5701","created_at":"2026-05-18T02:37:59Z"},{"alias_kind":"arxiv_version","alias_value":"1207.5701v1","created_at":"2026-05-18T02:37:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.5701","created_at":"2026-05-18T02:37:59Z"},{"alias_kind":"pith_short_12","alias_value":"BWRSMEQDXEKD","created_at":"2026-05-18T12:27:01Z"},{"alias_kind":"pith_short_16","alias_value":"BWRSMEQDXEKD4N77","created_at":"2026-05-18T12:27:01Z"},{"alias_kind":"pith_short_8","alias_value":"BWRSMEQD","created_at":"2026-05-18T12:27:01Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:BWRSMEQDXEKD4N77QOKCV3SFHI","target":"record","payload":{"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"},"canonical_sha256":"0da3261203b9143e37ff83942aee453a259ebf92454b7b4fce8280184b1c8067","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"},"source_kind":"arxiv","source_id":"1207.5701","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:37:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"z7ODkMh4ZyLVebkzjXpRKjjBdDTEvmNVJozdkVAB45dx5nbcWGMpwZDcW6Td3nqgEgPdf1GztgSlo4CQuWD+BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T11:07:51.905406Z"},"content_sha256":"beb25c9f5403f3d1757ba87381456faa97f17c19a6c72e18d9d5b2091a698ded","schema_version":"1.0","event_id":"sha256:beb25c9f5403f3d1757ba87381456faa97f17c19a6c72e18d9d5b2091a698ded"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:BWRSMEQDXEKD4N77QOKCV3SFHI","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:37:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"d7JehGhuLE+4J1xEOnlnsyBJ6vf1rE4hkJbNND8m5hc7veJ66A3okihMTITYrR04cfKtxq1KgvO5r5mqMVvGDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T11:07:51.905769Z"},"content_sha256":"5166cdb210794756f4088398edebe5395d07e2aa57a59ab308cb0919f46e8e24","schema_version":"1.0","event_id":"sha256:5166cdb210794756f4088398edebe5395d07e2aa57a59ab308cb0919f46e8e24"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BWRSMEQDXEKD4N77QOKCV3SFHI/bundle.json","state_url":"https://pith.science/pith/BWRSMEQDXEKD4N77QOKCV3SFHI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BWRSMEQDXEKD4N77QOKCV3SFHI/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-11T11:07:51Z","links":{"resolver":"https://pith.science/pith/BWRSMEQDXEKD4N77QOKCV3SFHI","bundle":"https://pith.science/pith/BWRSMEQDXEKD4N77QOKCV3SFHI/bundle.json","state":"https://pith.science/pith/BWRSMEQDXEKD4N77QOKCV3SFHI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BWRSMEQDXEKD4N77QOKCV3SFHI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:BWRSMEQDXEKD4N77QOKCV3SFHI","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":"1279108de1a923affbb4b9af7b004f004caf04159a877f4572910588f54b6126","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-07-24T13:51:52Z","title_canon_sha256":"cd296112d03f72e0644c5ceec4ef748c58d91aca9dae68106ce811b5876a8ebb"},"schema_version":"1.0","source":{"id":"1207.5701","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1207.5701","created_at":"2026-05-18T02:37:59Z"},{"alias_kind":"arxiv_version","alias_value":"1207.5701v1","created_at":"2026-05-18T02:37:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.5701","created_at":"2026-05-18T02:37:59Z"},{"alias_kind":"pith_short_12","alias_value":"BWRSMEQDXEKD","created_at":"2026-05-18T12:27:01Z"},{"alias_kind":"pith_short_16","alias_value":"BWRSMEQDXEKD4N77","created_at":"2026-05-18T12:27:01Z"},{"alias_kind":"pith_short_8","alias_value":"BWRSMEQD","created_at":"2026-05-18T12:27:01Z"}],"graph_snapshots":[{"event_id":"sha256:5166cdb210794756f4088398edebe5395d07e2aa57a59ab308cb0919f46e8e24","target":"graph","created_at":"2026-05-18T02:37:59Z","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":"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 ","authors_text":"Dmitrii V. Pasechnik, Etienne de Klerk, Gelasio Salazar","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-07-24T13:51:52Z","title":"Improved lower bounds on book crossing numbers of complete graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1207.5701","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:beb25c9f5403f3d1757ba87381456faa97f17c19a6c72e18d9d5b2091a698ded","target":"record","created_at":"2026-05-18T02:37:59Z","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":"1279108de1a923affbb4b9af7b004f004caf04159a877f4572910588f54b6126","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-07-24T13:51:52Z","title_canon_sha256":"cd296112d03f72e0644c5ceec4ef748c58d91aca9dae68106ce811b5876a8ebb"},"schema_version":"1.0","source":{"id":"1207.5701","kind":"arxiv","version":1}},"canonical_sha256":"0da3261203b9143e37ff83942aee453a259ebf92454b7b4fce8280184b1c8067","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0da3261203b9143e37ff83942aee453a259ebf92454b7b4fce8280184b1c8067","first_computed_at":"2026-05-18T02:37:59.046020Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:37:59.046020Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"P5bhK7gMBUXObQZy4tjVYhzFHq5b4dS6v9C7nBMxNpfCXfKinjqbDiEomEdNh1nc9t8Z/YOn1AzLYre8TVnBCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:37:59.046461Z","signed_message":"canonical_sha256_bytes"},"source_id":"1207.5701","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:beb25c9f5403f3d1757ba87381456faa97f17c19a6c72e18d9d5b2091a698ded","sha256:5166cdb210794756f4088398edebe5395d07e2aa57a59ab308cb0919f46e8e24"],"state_sha256":"cba94515027c31cc3c6d2d1e100171b75caa5361e30654537bf6b23d4c7fa6be"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HzRnvZPmqnVlV+5uU07jp+d7eJBUbxYug4BmYZKOG0FpYq3eGaxGLrLzAD3h5LWnqVRiZ3X8s7wk8FkNs7EdBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T11:07:51.907824Z","bundle_sha256":"51f21d5818888ac7217fca42f61855d7156eedc0add7ad15277bdab9053bbfc5"}}