{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:5GVALUTOOTSOPQIIFF3U4EHUSJ","short_pith_number":"pith:5GVALUTO","schema_version":"1.0","canonical_sha256":"e9aa05d26e74e4e7c10829774e10f492672ddb35203b95a44b3d1574ccefacf4","source":{"kind":"arxiv","id":"1102.3483","version":2},"attestation_state":"computed","paper":{"title":"The crossing number of cubes with small order","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Guoqing Wang, Haoli Wang, Yuansheng Yang","submitted_at":"2011-02-17T03:10:57Z","abstract_excerpt":"The {\\it crossing number} of a graph $G$ is the minimum number of pairwise intersections of edges in a drawing of $G$. In this paper, we give the exact values of crossing numbers for some variations of hypercube with order at most four, including crossed cube, locally twisted cube and M\\\"{o}bius cube."},"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":"1102.3483","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-02-17T03:10:57Z","cross_cats_sorted":[],"title_canon_sha256":"1b9ef9cbc317dd8cd9e8748730fadd3b2a6b2fd08c63cd7a38578087e31da625","abstract_canon_sha256":"71509857ef917333901a80dbd867150e3d868829b98df528ee9b0e546236a17d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:11:22.305662Z","signature_b64":"du5OR6REMV884bi/MYcQbbYgTVMFeNZXzAAVeOIIBHASK3lZg8YWg+2CUtyvPQv9iBWpgG9eGrhKU1rY4IYiAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e9aa05d26e74e4e7c10829774e10f492672ddb35203b95a44b3d1574ccefacf4","last_reissued_at":"2026-05-18T03:11:22.305051Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:11:22.305051Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The crossing number of cubes with small order","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Guoqing Wang, Haoli Wang, Yuansheng Yang","submitted_at":"2011-02-17T03:10:57Z","abstract_excerpt":"The {\\it crossing number} of a graph $G$ is the minimum number of pairwise intersections of edges in a drawing of $G$. In this paper, we give the exact values of crossing numbers for some variations of hypercube with order at most four, including crossed cube, locally twisted cube and M\\\"{o}bius cube."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1102.3483","kind":"arxiv","version":2},"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":"1102.3483","created_at":"2026-05-18T03:11:22.305142+00:00"},{"alias_kind":"arxiv_version","alias_value":"1102.3483v2","created_at":"2026-05-18T03:11:22.305142+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1102.3483","created_at":"2026-05-18T03:11:22.305142+00:00"},{"alias_kind":"pith_short_12","alias_value":"5GVALUTOOTSO","created_at":"2026-05-18T12:26:20.644004+00:00"},{"alias_kind":"pith_short_16","alias_value":"5GVALUTOOTSOPQII","created_at":"2026-05-18T12:26:20.644004+00:00"},{"alias_kind":"pith_short_8","alias_value":"5GVALUTO","created_at":"2026-05-18T12:26:20.644004+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/5GVALUTOOTSOPQIIFF3U4EHUSJ","json":"https://pith.science/pith/5GVALUTOOTSOPQIIFF3U4EHUSJ.json","graph_json":"https://pith.science/api/pith-number/5GVALUTOOTSOPQIIFF3U4EHUSJ/graph.json","events_json":"https://pith.science/api/pith-number/5GVALUTOOTSOPQIIFF3U4EHUSJ/events.json","paper":"https://pith.science/paper/5GVALUTO"},"agent_actions":{"view_html":"https://pith.science/pith/5GVALUTOOTSOPQIIFF3U4EHUSJ","download_json":"https://pith.science/pith/5GVALUTOOTSOPQIIFF3U4EHUSJ.json","view_paper":"https://pith.science/paper/5GVALUTO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1102.3483&json=true","fetch_graph":"https://pith.science/api/pith-number/5GVALUTOOTSOPQIIFF3U4EHUSJ/graph.json","fetch_events":"https://pith.science/api/pith-number/5GVALUTOOTSOPQIIFF3U4EHUSJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5GVALUTOOTSOPQIIFF3U4EHUSJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5GVALUTOOTSOPQIIFF3U4EHUSJ/action/storage_attestation","attest_author":"https://pith.science/pith/5GVALUTOOTSOPQIIFF3U4EHUSJ/action/author_attestation","sign_citation":"https://pith.science/pith/5GVALUTOOTSOPQIIFF3U4EHUSJ/action/citation_signature","submit_replication":"https://pith.science/pith/5GVALUTOOTSOPQIIFF3U4EHUSJ/action/replication_record"}},"created_at":"2026-05-18T03:11:22.305142+00:00","updated_at":"2026-05-18T03:11:22.305142+00:00"}