{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:XLAMIM73EZTETFJ7AT6JHFG4CY","short_pith_number":"pith:XLAMIM73","schema_version":"1.0","canonical_sha256":"bac0c433fb266649953f04fc9394dc1606e05f83a5d760987355005b87d9ad3f","source":{"kind":"arxiv","id":"1211.4433","version":1},"attestation_state":"computed","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."},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1211.4433","created_at":"2026-05-18T03:40:26.943592+00:00"},{"alias_kind":"arxiv_version","alias_value":"1211.4433v1","created_at":"2026-05-18T03:40:26.943592+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1211.4433","created_at":"2026-05-18T03:40:26.943592+00:00"},{"alias_kind":"pith_short_12","alias_value":"XLAMIM73EZTE","created_at":"2026-05-18T12:27:27.928770+00:00"},{"alias_kind":"pith_short_16","alias_value":"XLAMIM73EZTETFJ7","created_at":"2026-05-18T12:27:27.928770+00:00"},{"alias_kind":"pith_short_8","alias_value":"XLAMIM73","created_at":"2026-05-18T12:27:27.928770+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/XLAMIM73EZTETFJ7AT6JHFG4CY","json":"https://pith.science/pith/XLAMIM73EZTETFJ7AT6JHFG4CY.json","graph_json":"https://pith.science/api/pith-number/XLAMIM73EZTETFJ7AT6JHFG4CY/graph.json","events_json":"https://pith.science/api/pith-number/XLAMIM73EZTETFJ7AT6JHFG4CY/events.json","paper":"https://pith.science/paper/XLAMIM73"},"agent_actions":{"view_html":"https://pith.science/pith/XLAMIM73EZTETFJ7AT6JHFG4CY","download_json":"https://pith.science/pith/XLAMIM73EZTETFJ7AT6JHFG4CY.json","view_paper":"https://pith.science/paper/XLAMIM73","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1211.4433&json=true","fetch_graph":"https://pith.science/api/pith-number/XLAMIM73EZTETFJ7AT6JHFG4CY/graph.json","fetch_events":"https://pith.science/api/pith-number/XLAMIM73EZTETFJ7AT6JHFG4CY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XLAMIM73EZTETFJ7AT6JHFG4CY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XLAMIM73EZTETFJ7AT6JHFG4CY/action/storage_attestation","attest_author":"https://pith.science/pith/XLAMIM73EZTETFJ7AT6JHFG4CY/action/author_attestation","sign_citation":"https://pith.science/pith/XLAMIM73EZTETFJ7AT6JHFG4CY/action/citation_signature","submit_replication":"https://pith.science/pith/XLAMIM73EZTETFJ7AT6JHFG4CY/action/replication_record"}},"created_at":"2026-05-18T03:40:26.943592+00:00","updated_at":"2026-05-18T03:40:26.943592+00:00"}