{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:4VMVHM6LS2UPFQ4PCMNISP4JVE","short_pith_number":"pith:4VMVHM6L","schema_version":"1.0","canonical_sha256":"e55953b3cb96a8f2c38f131a893f89a90cb58a873ba21ffe123276582e791ba7","source":{"kind":"arxiv","id":"1101.3386","version":1},"attestation_state":"computed","paper":{"title":"The crossing number of folded hypercubes","license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Guoqing Wang, Haoli Wang, Wenping Zheng, Yan Zhou, Yuansheng Yang","submitted_at":"2011-01-18T05:52:00Z","abstract_excerpt":"The {\\it crossing number} of a graph $G$ is the minimum number of pairwise intersections of edges in a drawing of $G$. The {\\it $n$-dimensional folded hypercube} $FQ_n$ is a graph obtained from $n$-dimensional hypercube by adding all complementary edges. In this paper, we obtain upper and lower bounds of the crossing number of $FQ_n$."},"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":"1101.3386","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","primary_cat":"math.CO","submitted_at":"2011-01-18T05:52:00Z","cross_cats_sorted":[],"title_canon_sha256":"9f952b942cf6340659fe9b3964ae4dc56861003014d4a98a9690a34f67e191b3","abstract_canon_sha256":"15ebbe3e7e4ea96ea7fd5ec58abfb8b568a0769f47efeffe51f120cc11340632"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:22:51.818368Z","signature_b64":"hsbIt8AoD/XR5eu544iO22NaBq1c+JvHFFFwrKAVtz8++uQ3QjDjhS4dzlvpm95HJnQ7CovNsYqUmZMP+gbPDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e55953b3cb96a8f2c38f131a893f89a90cb58a873ba21ffe123276582e791ba7","last_reissued_at":"2026-05-18T02:22:51.817866Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:22:51.817866Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The crossing number of folded hypercubes","license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Guoqing Wang, Haoli Wang, Wenping Zheng, Yan Zhou, Yuansheng Yang","submitted_at":"2011-01-18T05:52:00Z","abstract_excerpt":"The {\\it crossing number} of a graph $G$ is the minimum number of pairwise intersections of edges in a drawing of $G$. The {\\it $n$-dimensional folded hypercube} $FQ_n$ is a graph obtained from $n$-dimensional hypercube by adding all complementary edges. In this paper, we obtain upper and lower bounds of the crossing number of $FQ_n$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1101.3386","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":"1101.3386","created_at":"2026-05-18T02:22:51.817927+00:00"},{"alias_kind":"arxiv_version","alias_value":"1101.3386v1","created_at":"2026-05-18T02:22:51.817927+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1101.3386","created_at":"2026-05-18T02:22:51.817927+00:00"},{"alias_kind":"pith_short_12","alias_value":"4VMVHM6LS2UP","created_at":"2026-05-18T12:26:20.644004+00:00"},{"alias_kind":"pith_short_16","alias_value":"4VMVHM6LS2UPFQ4P","created_at":"2026-05-18T12:26:20.644004+00:00"},{"alias_kind":"pith_short_8","alias_value":"4VMVHM6L","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/4VMVHM6LS2UPFQ4PCMNISP4JVE","json":"https://pith.science/pith/4VMVHM6LS2UPFQ4PCMNISP4JVE.json","graph_json":"https://pith.science/api/pith-number/4VMVHM6LS2UPFQ4PCMNISP4JVE/graph.json","events_json":"https://pith.science/api/pith-number/4VMVHM6LS2UPFQ4PCMNISP4JVE/events.json","paper":"https://pith.science/paper/4VMVHM6L"},"agent_actions":{"view_html":"https://pith.science/pith/4VMVHM6LS2UPFQ4PCMNISP4JVE","download_json":"https://pith.science/pith/4VMVHM6LS2UPFQ4PCMNISP4JVE.json","view_paper":"https://pith.science/paper/4VMVHM6L","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1101.3386&json=true","fetch_graph":"https://pith.science/api/pith-number/4VMVHM6LS2UPFQ4PCMNISP4JVE/graph.json","fetch_events":"https://pith.science/api/pith-number/4VMVHM6LS2UPFQ4PCMNISP4JVE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4VMVHM6LS2UPFQ4PCMNISP4JVE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4VMVHM6LS2UPFQ4PCMNISP4JVE/action/storage_attestation","attest_author":"https://pith.science/pith/4VMVHM6LS2UPFQ4PCMNISP4JVE/action/author_attestation","sign_citation":"https://pith.science/pith/4VMVHM6LS2UPFQ4PCMNISP4JVE/action/citation_signature","submit_replication":"https://pith.science/pith/4VMVHM6LS2UPFQ4PCMNISP4JVE/action/replication_record"}},"created_at":"2026-05-18T02:22:51.817927+00:00","updated_at":"2026-05-18T02:22:51.817927+00:00"}