{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:XLAMIM73EZTETFJ7AT6JHFG4CY","short_pith_number":"pith:XLAMIM73","canonical_record":{"source":{"id":"1211.4433","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2012-11-19T14:19:38Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"2f0cc6526d6f888140ecca7080b677517bb5a385e8e0f6ad0b56812da354f50e","abstract_canon_sha256":"6f16cc777b7af5b619149408a3119da301e9164d7235390dd6a3294abb258f4a"},"schema_version":"1.0"},"canonical_sha256":"bac0c433fb266649953f04fc9394dc1606e05f83a5d760987355005b87d9ad3f","source":{"kind":"arxiv","id":"1211.4433","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1211.4433","created_at":"2026-05-18T03:40:26Z"},{"alias_kind":"arxiv_version","alias_value":"1211.4433v1","created_at":"2026-05-18T03:40:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1211.4433","created_at":"2026-05-18T03:40:26Z"},{"alias_kind":"pith_short_12","alias_value":"XLAMIM73EZTE","created_at":"2026-05-18T12:27:27Z"},{"alias_kind":"pith_short_16","alias_value":"XLAMIM73EZTETFJ7","created_at":"2026-05-18T12:27:27Z"},{"alias_kind":"pith_short_8","alias_value":"XLAMIM73","created_at":"2026-05-18T12:27:27Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:XLAMIM73EZTETFJ7AT6JHFG4CY","target":"record","payload":{"canonical_record":{"source":{"id":"1211.4433","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2012-11-19T14:19:38Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"2f0cc6526d6f888140ecca7080b677517bb5a385e8e0f6ad0b56812da354f50e","abstract_canon_sha256":"6f16cc777b7af5b619149408a3119da301e9164d7235390dd6a3294abb258f4a"},"schema_version":"1.0"},"canonical_sha256":"bac0c433fb266649953f04fc9394dc1606e05f83a5d760987355005b87d9ad3f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:40:26.944133Z","signature_b64":"h022NtRVZsAMMiYFEa8Dhjzs9nIKDExdRhODL7WXrTQ3aehB+EvzBMNA+ywT100aPeb85t4Pdwfk7InrmaljAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bac0c433fb266649953f04fc9394dc1606e05f83a5d760987355005b87d9ad3f","last_reissued_at":"2026-05-18T03:40:26.943520Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:40:26.943520Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1211.4433","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-18T03:40:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IsE0YB37Ac7iqUariPsPT4u5KYrUZnLjdvCYNpoKUjX7z2pRlq3DwUZ7YDoeX6o1PiCtL+ol32DIsmux+RszAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T21:26:29.265350Z"},"content_sha256":"ace5115015cf964c6eb28973a8bacd6303ccf78266d243548508c8e6e6e9c995","schema_version":"1.0","event_id":"sha256:ace5115015cf964c6eb28973a8bacd6303ccf78266d243548508c8e6e6e9c995"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:XLAMIM73EZTETFJ7AT6JHFG4CY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An upper bound for the crossing number of bubble-sort graph Bn","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Baigong Zheng, Xirong Xu, Yuansheng Yang","submitted_at":"2012-11-19T14:19:38Z","abstract_excerpt":"The crossing number of a graph G is the minimum number of pairwise intersections of edges in a drawing of G. Motivated by the recent work [Faria, L., Figueiredo, C.M.H. de, Sykora, O., Vrt'o, I.: An improved upper bound on the crossing number of the hypercube. J. Graph Theory 59, 145-161 (2008)], we give an upper bound of the crossing number of n-dimensional bubble-sort graph Bn."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1211.4433","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-18T03:40:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"j+lOYCR0+b8DLWd9gIPAMrPNrLqvsMC17P1o+A30w+6J/RzGSjXgy87x1xOyMQIvpTvq7fPoVeY7V/28HBc8Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T21:26:29.265703Z"},"content_sha256":"d74192c518c90f5121f4b89da2222df584dd14cccce04270a7f1a3f42217a3b2","schema_version":"1.0","event_id":"sha256:d74192c518c90f5121f4b89da2222df584dd14cccce04270a7f1a3f42217a3b2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XLAMIM73EZTETFJ7AT6JHFG4CY/bundle.json","state_url":"https://pith.science/pith/XLAMIM73EZTETFJ7AT6JHFG4CY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XLAMIM73EZTETFJ7AT6JHFG4CY/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-01T21:26:29Z","links":{"resolver":"https://pith.science/pith/XLAMIM73EZTETFJ7AT6JHFG4CY","bundle":"https://pith.science/pith/XLAMIM73EZTETFJ7AT6JHFG4CY/bundle.json","state":"https://pith.science/pith/XLAMIM73EZTETFJ7AT6JHFG4CY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XLAMIM73EZTETFJ7AT6JHFG4CY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:XLAMIM73EZTETFJ7AT6JHFG4CY","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":"6f16cc777b7af5b619149408a3119da301e9164d7235390dd6a3294abb258f4a","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2012-11-19T14:19:38Z","title_canon_sha256":"2f0cc6526d6f888140ecca7080b677517bb5a385e8e0f6ad0b56812da354f50e"},"schema_version":"1.0","source":{"id":"1211.4433","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1211.4433","created_at":"2026-05-18T03:40:26Z"},{"alias_kind":"arxiv_version","alias_value":"1211.4433v1","created_at":"2026-05-18T03:40:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1211.4433","created_at":"2026-05-18T03:40:26Z"},{"alias_kind":"pith_short_12","alias_value":"XLAMIM73EZTE","created_at":"2026-05-18T12:27:27Z"},{"alias_kind":"pith_short_16","alias_value":"XLAMIM73EZTETFJ7","created_at":"2026-05-18T12:27:27Z"},{"alias_kind":"pith_short_8","alias_value":"XLAMIM73","created_at":"2026-05-18T12:27:27Z"}],"graph_snapshots":[{"event_id":"sha256:d74192c518c90f5121f4b89da2222df584dd14cccce04270a7f1a3f42217a3b2","target":"graph","created_at":"2026-05-18T03:40:26Z","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":"The crossing number of a graph G is the minimum number of pairwise intersections of edges in a drawing of G. Motivated by the recent work [Faria, L., Figueiredo, C.M.H. de, Sykora, O., Vrt'o, I.: An improved upper bound on the crossing number of the hypercube. J. Graph Theory 59, 145-161 (2008)], we give an upper bound of the crossing number of n-dimensional bubble-sort graph Bn.","authors_text":"Baigong Zheng, Xirong Xu, Yuansheng Yang","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2012-11-19T14:19:38Z","title":"An upper bound for the crossing number of bubble-sort graph Bn"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1211.4433","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:ace5115015cf964c6eb28973a8bacd6303ccf78266d243548508c8e6e6e9c995","target":"record","created_at":"2026-05-18T03:40:26Z","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":"6f16cc777b7af5b619149408a3119da301e9164d7235390dd6a3294abb258f4a","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2012-11-19T14:19:38Z","title_canon_sha256":"2f0cc6526d6f888140ecca7080b677517bb5a385e8e0f6ad0b56812da354f50e"},"schema_version":"1.0","source":{"id":"1211.4433","kind":"arxiv","version":1}},"canonical_sha256":"bac0c433fb266649953f04fc9394dc1606e05f83a5d760987355005b87d9ad3f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"bac0c433fb266649953f04fc9394dc1606e05f83a5d760987355005b87d9ad3f","first_computed_at":"2026-05-18T03:40:26.943520Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:40:26.943520Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"h022NtRVZsAMMiYFEa8Dhjzs9nIKDExdRhODL7WXrTQ3aehB+EvzBMNA+ywT100aPeb85t4Pdwfk7InrmaljAg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:40:26.944133Z","signed_message":"canonical_sha256_bytes"},"source_id":"1211.4433","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ace5115015cf964c6eb28973a8bacd6303ccf78266d243548508c8e6e6e9c995","sha256:d74192c518c90f5121f4b89da2222df584dd14cccce04270a7f1a3f42217a3b2"],"state_sha256":"5c5bc48744957cea657181e7febca7eaf19782bfdfd84369f91fce85c0bb37b7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"m5LtuOE9Kl+mjnowSw7ox+yH/gbdU+St3Icv6fi/PcNiwOMXR7b8d1k7Xkwmy+XbQZ8Bpb+bZ5zVyKKxkQycDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T21:26:29.267646Z","bundle_sha256":"8295a4c74d9aa6f3f96f10e32bb3920f1018297a13ff2460c06e4bd31db48bb2"}}