{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:UH2NRC4AXO3GJPETWKHT5U4CFO","short_pith_number":"pith:UH2NRC4A","canonical_record":{"source":{"id":"1711.01194","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-11-03T14:53:28Z","cross_cats_sorted":[],"title_canon_sha256":"3ffd101d57eb111e89acea1f2def6837cc97041bb65f65d13a59c2c031e35cd8","abstract_canon_sha256":"4015aa0f9a7ed855ced9ffad527369bab60f92bae33228a1a1abb563cc737b62"},"schema_version":"1.0"},"canonical_sha256":"a1f4d88b80bbb664bc93b28f3ed3822babfa044d0830cb01496ce60b69203e46","source":{"kind":"arxiv","id":"1711.01194","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.01194","created_at":"2026-05-18T00:31:23Z"},{"alias_kind":"arxiv_version","alias_value":"1711.01194v1","created_at":"2026-05-18T00:31:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.01194","created_at":"2026-05-18T00:31:23Z"},{"alias_kind":"pith_short_12","alias_value":"UH2NRC4AXO3G","created_at":"2026-05-18T12:31:46Z"},{"alias_kind":"pith_short_16","alias_value":"UH2NRC4AXO3GJPET","created_at":"2026-05-18T12:31:46Z"},{"alias_kind":"pith_short_8","alias_value":"UH2NRC4A","created_at":"2026-05-18T12:31:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:UH2NRC4AXO3GJPETWKHT5U4CFO","target":"record","payload":{"canonical_record":{"source":{"id":"1711.01194","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-11-03T14:53:28Z","cross_cats_sorted":[],"title_canon_sha256":"3ffd101d57eb111e89acea1f2def6837cc97041bb65f65d13a59c2c031e35cd8","abstract_canon_sha256":"4015aa0f9a7ed855ced9ffad527369bab60f92bae33228a1a1abb563cc737b62"},"schema_version":"1.0"},"canonical_sha256":"a1f4d88b80bbb664bc93b28f3ed3822babfa044d0830cb01496ce60b69203e46","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:31:23.209367Z","signature_b64":"NvgjLw+XhwuUDs3PGRzhsPqifiM3Sv5hDjbt8A6PuhXSG8VCa4YGDPR1nBzbhAiAS3pAv3JnMNk3TcrghuwOAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a1f4d88b80bbb664bc93b28f3ed3822babfa044d0830cb01496ce60b69203e46","last_reissued_at":"2026-05-18T00:31:23.208788Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:31:23.208788Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1711.01194","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-18T00:31:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QIpi7BwpmZfMQBZMUkZ3WyUGPfNlxmcYS57gtX5aIlhoitgmYKpIPsB2+lfzFwyOa/rF6yYtVhj+FV8BygJBBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T19:12:44.258198Z"},"content_sha256":"2d59187b45e3bbe08878be5918662f318f108498082d8162e36636d730faab2c","schema_version":"1.0","event_id":"sha256:2d59187b45e3bbe08878be5918662f318f108498082d8162e36636d730faab2c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:UH2NRC4AXO3GJPETWKHT5U4CFO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"New Bounds on the Biplanar Crossing Number of Low-dimensional Hypercubes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Gregory Clark, Gwen Spencer","submitted_at":"2017-11-03T14:53:28Z","abstract_excerpt":"In this note we provide an improved upper bound on the biplanar crossing number of the 8-dimensional hypercube. The $k$-planar crossing number of a graph $cr_k(G)$ is the number of crossings required when every edge of $G$ must be drawn in one of $k$ distinct planes. It was shown in Czabarka et al. that $cr_2(Q_8) \\leq 256$ which we improve to $cr_2(Q_8) \\leq 128$. Our approach highlights the relationship between symmetric drawings and the study of $k$-planar crossing numbers. We conclude with several open questions concerning this relationship."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.01194","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-18T00:31:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XYczY3VIwJB2GYGGjyE4Yczffx746u3G8Y4xrEKSIji6T3YvockTwxax47KVidhk7+eTkukH/Ig5ZpbvQ9a3Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T19:12:44.258595Z"},"content_sha256":"6134558b906e16f30ffa2e947687ab45f7bfffbdbd4ba2f58df5c1a0ac41710c","schema_version":"1.0","event_id":"sha256:6134558b906e16f30ffa2e947687ab45f7bfffbdbd4ba2f58df5c1a0ac41710c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UH2NRC4AXO3GJPETWKHT5U4CFO/bundle.json","state_url":"https://pith.science/pith/UH2NRC4AXO3GJPETWKHT5U4CFO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UH2NRC4AXO3GJPETWKHT5U4CFO/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-05-28T19:12:44Z","links":{"resolver":"https://pith.science/pith/UH2NRC4AXO3GJPETWKHT5U4CFO","bundle":"https://pith.science/pith/UH2NRC4AXO3GJPETWKHT5U4CFO/bundle.json","state":"https://pith.science/pith/UH2NRC4AXO3GJPETWKHT5U4CFO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UH2NRC4AXO3GJPETWKHT5U4CFO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:UH2NRC4AXO3GJPETWKHT5U4CFO","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":"4015aa0f9a7ed855ced9ffad527369bab60f92bae33228a1a1abb563cc737b62","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-11-03T14:53:28Z","title_canon_sha256":"3ffd101d57eb111e89acea1f2def6837cc97041bb65f65d13a59c2c031e35cd8"},"schema_version":"1.0","source":{"id":"1711.01194","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.01194","created_at":"2026-05-18T00:31:23Z"},{"alias_kind":"arxiv_version","alias_value":"1711.01194v1","created_at":"2026-05-18T00:31:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.01194","created_at":"2026-05-18T00:31:23Z"},{"alias_kind":"pith_short_12","alias_value":"UH2NRC4AXO3G","created_at":"2026-05-18T12:31:46Z"},{"alias_kind":"pith_short_16","alias_value":"UH2NRC4AXO3GJPET","created_at":"2026-05-18T12:31:46Z"},{"alias_kind":"pith_short_8","alias_value":"UH2NRC4A","created_at":"2026-05-18T12:31:46Z"}],"graph_snapshots":[{"event_id":"sha256:6134558b906e16f30ffa2e947687ab45f7bfffbdbd4ba2f58df5c1a0ac41710c","target":"graph","created_at":"2026-05-18T00:31:23Z","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":"In this note we provide an improved upper bound on the biplanar crossing number of the 8-dimensional hypercube. The $k$-planar crossing number of a graph $cr_k(G)$ is the number of crossings required when every edge of $G$ must be drawn in one of $k$ distinct planes. It was shown in Czabarka et al. that $cr_2(Q_8) \\leq 256$ which we improve to $cr_2(Q_8) \\leq 128$. Our approach highlights the relationship between symmetric drawings and the study of $k$-planar crossing numbers. We conclude with several open questions concerning this relationship.","authors_text":"Gregory Clark, Gwen Spencer","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-11-03T14:53:28Z","title":"New Bounds on the Biplanar Crossing Number of Low-dimensional Hypercubes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.01194","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:2d59187b45e3bbe08878be5918662f318f108498082d8162e36636d730faab2c","target":"record","created_at":"2026-05-18T00:31:23Z","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":"4015aa0f9a7ed855ced9ffad527369bab60f92bae33228a1a1abb563cc737b62","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-11-03T14:53:28Z","title_canon_sha256":"3ffd101d57eb111e89acea1f2def6837cc97041bb65f65d13a59c2c031e35cd8"},"schema_version":"1.0","source":{"id":"1711.01194","kind":"arxiv","version":1}},"canonical_sha256":"a1f4d88b80bbb664bc93b28f3ed3822babfa044d0830cb01496ce60b69203e46","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a1f4d88b80bbb664bc93b28f3ed3822babfa044d0830cb01496ce60b69203e46","first_computed_at":"2026-05-18T00:31:23.208788Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:31:23.208788Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"NvgjLw+XhwuUDs3PGRzhsPqifiM3Sv5hDjbt8A6PuhXSG8VCa4YGDPR1nBzbhAiAS3pAv3JnMNk3TcrghuwOAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:31:23.209367Z","signed_message":"canonical_sha256_bytes"},"source_id":"1711.01194","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2d59187b45e3bbe08878be5918662f318f108498082d8162e36636d730faab2c","sha256:6134558b906e16f30ffa2e947687ab45f7bfffbdbd4ba2f58df5c1a0ac41710c"],"state_sha256":"65f6b14aa43870e1d5a1adbc06a729dcf037fc4bd73acd8910cff78deb02db56"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nftCbnxoO0UYQ40rjl9fKzCnZRVwM4+2aWCsFExGAxT1TPADiukmTyCtzvZ9faeo4aaiQ9mdvnCPO5S0czvGDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T19:12:44.260845Z","bundle_sha256":"ea7e16adfefca37066ceb925d95ddd2f471de57175db3154c1c6a37b6f1ec249"}}