{"success":true,"data":{"author":"Google Research","bucketAccessType":"public","bucketListable":true,"bucketName":"gresearch","bucketPrefix":"cube_unfoldings","category":"Mathematics","cloudProvider":"gcp","createdAt":"2026-11-16T13:08:20.533Z","description":"Complete counts of the edge unfoldings (nets) of the n-dimensional hypercube for n = 2 through 10, computed by Google Research and used to extend OEIS sequence A091159. Following Peter Turney's 'Unfolding the Tesseract' correspondence, each unfolding is a pair (T, P) of a tree T on 2n vertices and a perfect matching P in the complement of T, counted up to automorphisms of T; trees are generated with nauty (gentreeg) by McKay and Piperno. The results folder holds one text file per dimension, n.cnt.txt, where each line is a decimal count followed by the tree in sparse6 graph format; summing the counts gives the total, e.g. 261 nets of the 4-cube (tesseract), 9,694 for n=5, 2,642,657,228 for n=8 and 26,941,775,019,280 for n=10. Star trees have no unfoldings and are listed with count zero. Measured 2026-11-16: 10 files, 29 MB in total, the largest 10.cnt.txt at 25 MB. Read the graphs with networkx.from_sparse6_bytes or nauty's showg. The C++ generator is in the google-research repository under cube_unfoldings. Datasets in the google-research repository are released under CC BY 4.0; cite Google Research and OEIS A091159.","displayTitle":"Enumeration of All Unfoldings of the n-Dimensional Hypercube (n = 2 to 10, OEIS A091159)","fuseMountBrowsable":true,"id":"49924186-cbf7-5fe0-ae61-18224290837e","license":"CC-BY-4.0","licenseEvidenceUrl":"https://github.com/google-research/google-research/blob/master/README.md","objectCountEstimate":1,"probeStatus":"ok","referenceUrl":"https://github.com/google-research/google-research/tree/master/cube_unfoldings","region":"us","schemaCard":{"accessHints":[{"language":"python-gcsfs","snippet":"import gcsfs\nfs = gcsfs.GCSFileSystem(token='anon')\nfs.ls('gresearch/cube_unfoldings/', detail=False)[:10]"},{"language":"python-storage","snippet":"from google.cloud import storage\nclient = storage.Client.create_anonymous_client()\nlist(client.bucket('gresearch').list_blobs(prefix='cube_unfoldings/', max_results=10))"}],"caveats":["Files are binary — use a domain-specific parser rather than text I/O."],"format":"binary","generatedAt":"2026-11-16T13:08:25.827Z","layout":{"example":"cube_unfoldings/results/10.cnt.txt","pattern":"{prefix}/{seg1}/{filename}"},"mountPath":"/mnt/gcs-archive/data","sampleHeaders":[{"bytes":"12456455 :S_`abccbb`hi`_lmnmmm\n60694330 :S_`abcdb_ghijki_noon\n7222605 :S_`abaaa`_hi_kl_no_q\n44576606 :S_`abcdefff`_klmnopm\n11672914 :S_`abc_efgh_jkjjj_pp\n231310804 :S_`abcd`fghgf_lmnop_\n186733 :S_`abcaea_hij_______\n60473982 :S_`abccbf_hijkimniph\n232193209 :S_`abcdec_hijklihopq\n115482946 :S_`abcb`fgfi`k_mnopo\n12367830 :S_`abaa`_ghihglllg__\n226775178 :S_`abcb`fg`i`_lmnl_q\n63580457 :S_`abcddb_hijkjinh__\n6483261 :S_`abcbafah_jkljnnnn\n491190 :S_`abb`eff_ijiiiii_q\n23223250 :S_`abcdccbbb`_lmnol_\n3627371 :S_`aaa`e`","encoding":"utf8","key":"cube_unfoldings/results/10.cnt.txt","truncatedAt":512},{"bytes":"0 :Ccf\n1 :Cdf\n","encoding":"utf8","key":"cube_unfoldings/results/2.cnt.txt","truncatedAt":512}],"sampleObjects":["cube_unfoldings/results/10.cnt.txt","cube_unfoldings/results/2.cnt.txt","cube_unfoldings/results/3.cnt.txt","cube_unfoldings/results/4.cnt.txt","cube_unfoldings/results/5.cnt.txt"],"sidecars":[{"bytes":"# Results\n\nFor each n ∈ {2, 3, 4, 5, 6, 7, 8, 9} we provide a file `n.cnt.txt` which\ncontains in each line a decimal number and a graph given in\n[sparse6 format](https://users.cecs.anu.edu.au/~bdm/data/formats.txt) separated\nby a space.\n\n```\n[number] [graph6 string]\n```\n\nFor example\n\n```\n11704 :M`ESYOl]sLZt\n```\n\nThe graph is a tree on 2*n vertices and the number counts the perfect matchings\nin the complement of the tree up to transformations of the automorphism group of\nthe tree. In other words the number tells us how many different unfoldings of\nthe hypercube in dimension n exists, which correspond to a certain tree. Some\ntrees in the files don't have any corresponding unfoldings, namely the stars.\nThey are nonetheless listed here with a count of zero.\n\nTo get the number of hypercube unfoldings we can add up all the numbers.\n\ndimension | number of unfoldings\n--------: | -------------------:\n2         | 1\n3         | 11\n4         | 261\n5         | 9694\n6         | 502110\n7         | 33064966\n8         | 2642657228\n9         | 248639631948\n10        | 26941775019280\n","encoding":"utf8","key":"cube_unfoldings/results/README.md","name":"README.md","size":1084,"truncated":false}],"sourceObjectKey":"cube_unfoldings/results/10.cnt.txt","starterCell":"from google.cloud import storage\nclient = storage.Client.create_anonymous_client()\nbucket = client.bucket('gresearch')\nblob = bucket.blob('cube_unfoldings/results/10.cnt.txt')\nwith blob.open(\"rb\") as fh:\n    print(fh.read(64))","starterSamplePath":"results/10.cnt.txt","totalObjects":"1 top-level prefixes"},"summary":"Complete counts of the edge unfoldings (nets) of the n-dimensional hypercube for n = 2 through 10, computed by Google Research and used to extend OEIS sequence A091159.","title":"Enumeration of All Unfoldings of the n-Dimensional Hypercube (n = 2 to 10, OEIS A091159)","updatedAt":"2026-11-16T17:14:17.274Z","visibility":"public","websiteUrl":"https://oeis.org/A091159"}}