{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:RZLCBRKPCXQ4IWR6MH4GAQY5WX","short_pith_number":"pith:RZLCBRKP","schema_version":"1.0","canonical_sha256":"8e5620c54f15e1c45a3e61f860431db5ecbcc38b1be7a7597145875160987b01","source":{"kind":"arxiv","id":"1211.4437","version":1},"attestation_state":"computed","paper":{"title":"The crossing numbers of $K_{n,n}-nK_2$, $K_{n}\\times P_2$, $K_{n}\\times P_3$ and $K_n\\times C_4$","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Baigong Zheng, Xiaohui Lin, Xirong Xu, Yuansheng Yang","submitted_at":"2012-11-19T14:36:17Z","abstract_excerpt":"The crossing number of a graph $G$ is the minimum number of pairwise intersections of edges among all drawings of $G$. In this paper, we study the crossing number of $K_{n,n}-nK_2$, $K_n\\times P_2$, $K_n\\times P_3$ and $K_n\\times C_4$."},"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.4437","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2012-11-19T14:36:17Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"d1921453f635f8768c65c0bfda2042aa3b25dfd5412292e1ee4e520f92b8b76d","abstract_canon_sha256":"df588a4152f627f4a5e44a62b7f8f7fad111b77e984d810dfe2547e819a8e2c2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:40:26.932381Z","signature_b64":"+lutRFE279wanYs6KCavRSAKhBYN5DwjwQAn/7fDo7pFJ6fSOteL+SeKpuaWN9YPGxzVVIrDE5dGt96yy4QIAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8e5620c54f15e1c45a3e61f860431db5ecbcc38b1be7a7597145875160987b01","last_reissued_at":"2026-05-18T03:40:26.931641Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:40:26.931641Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The crossing numbers of $K_{n,n}-nK_2$, $K_{n}\\times P_2$, $K_{n}\\times P_3$ and $K_n\\times C_4$","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Baigong Zheng, Xiaohui Lin, Xirong Xu, Yuansheng Yang","submitted_at":"2012-11-19T14:36:17Z","abstract_excerpt":"The crossing number of a graph $G$ is the minimum number of pairwise intersections of edges among all drawings of $G$. In this paper, we study the crossing number of $K_{n,n}-nK_2$, $K_n\\times P_2$, $K_n\\times P_3$ and $K_n\\times C_4$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1211.4437","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.4437","created_at":"2026-05-18T03:40:26.931730+00:00"},{"alias_kind":"arxiv_version","alias_value":"1211.4437v1","created_at":"2026-05-18T03:40:26.931730+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1211.4437","created_at":"2026-05-18T03:40:26.931730+00:00"},{"alias_kind":"pith_short_12","alias_value":"RZLCBRKPCXQ4","created_at":"2026-05-18T12:27:20.899486+00:00"},{"alias_kind":"pith_short_16","alias_value":"RZLCBRKPCXQ4IWR6","created_at":"2026-05-18T12:27:20.899486+00:00"},{"alias_kind":"pith_short_8","alias_value":"RZLCBRKP","created_at":"2026-05-18T12:27:20.899486+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/RZLCBRKPCXQ4IWR6MH4GAQY5WX","json":"https://pith.science/pith/RZLCBRKPCXQ4IWR6MH4GAQY5WX.json","graph_json":"https://pith.science/api/pith-number/RZLCBRKPCXQ4IWR6MH4GAQY5WX/graph.json","events_json":"https://pith.science/api/pith-number/RZLCBRKPCXQ4IWR6MH4GAQY5WX/events.json","paper":"https://pith.science/paper/RZLCBRKP"},"agent_actions":{"view_html":"https://pith.science/pith/RZLCBRKPCXQ4IWR6MH4GAQY5WX","download_json":"https://pith.science/pith/RZLCBRKPCXQ4IWR6MH4GAQY5WX.json","view_paper":"https://pith.science/paper/RZLCBRKP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1211.4437&json=true","fetch_graph":"https://pith.science/api/pith-number/RZLCBRKPCXQ4IWR6MH4GAQY5WX/graph.json","fetch_events":"https://pith.science/api/pith-number/RZLCBRKPCXQ4IWR6MH4GAQY5WX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RZLCBRKPCXQ4IWR6MH4GAQY5WX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RZLCBRKPCXQ4IWR6MH4GAQY5WX/action/storage_attestation","attest_author":"https://pith.science/pith/RZLCBRKPCXQ4IWR6MH4GAQY5WX/action/author_attestation","sign_citation":"https://pith.science/pith/RZLCBRKPCXQ4IWR6MH4GAQY5WX/action/citation_signature","submit_replication":"https://pith.science/pith/RZLCBRKPCXQ4IWR6MH4GAQY5WX/action/replication_record"}},"created_at":"2026-05-18T03:40:26.931730+00:00","updated_at":"2026-05-18T03:40:26.931730+00:00"}