{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:343YV6B6Q4LXBMVSX55XCX2GMC","short_pith_number":"pith:343YV6B6","schema_version":"1.0","canonical_sha256":"df378af83e871770b2b2bf7b715f46609118f54102b743358a14b80ed66e24e4","source":{"kind":"arxiv","id":"1104.1481","version":1},"attestation_state":"computed","paper":{"title":"Counting spanning trees of the hypercube and its $q$-analogs by explicit block diagonalization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Murali K. Srinivasan","submitted_at":"2011-04-08T05:01:16Z","abstract_excerpt":"The number of spanning trees of a graph $G$ is called the {\\em complexity} of $G$ and is denoted $c(G)$. Let C(n) denote the {\\em (binary) hypercube} of dimension $n$. A classical result in enumerative combinatorics (based on explicit diagonalization) states that $c(C(n)) = \\prod_{k=2}^n (2k)^{n\\choose k}$.\n  In this paper we use the explicit block diagonalization methodology to derive formulas for the complexity of two $q$-analogs of C(n), the {\\em nonbinary hypercube} $\\Cq(n)$, defined for $q\\geq 2$, and the {\\em vector space analog of the hypercube} $\\Cfq(n)$, defined for prime powers $q$.\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":"1104.1481","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-04-08T05:01:16Z","cross_cats_sorted":[],"title_canon_sha256":"9e59392c38a366e51f8c285f7c9590fa8678a8f06aa9f5ccaf7072dbc4c63236","abstract_canon_sha256":"f3acdb463b586475cdd056a38da8a34d1ade6aec8c7fd082b12b0ba9c06ed1ed"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:24:44.965529Z","signature_b64":"2N+2uG/zjxXHvp88a5cv1Q+t8gxWPnUQMzC8dMEQRUukvhN/0HhWta5cPnmCUKapfuwWq5cZBdfYb6nc/uMCCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"df378af83e871770b2b2bf7b715f46609118f54102b743358a14b80ed66e24e4","last_reissued_at":"2026-05-18T04:24:44.965063Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:24:44.965063Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Counting spanning trees of the hypercube and its $q$-analogs by explicit block diagonalization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Murali K. Srinivasan","submitted_at":"2011-04-08T05:01:16Z","abstract_excerpt":"The number of spanning trees of a graph $G$ is called the {\\em complexity} of $G$ and is denoted $c(G)$. Let C(n) denote the {\\em (binary) hypercube} of dimension $n$. A classical result in enumerative combinatorics (based on explicit diagonalization) states that $c(C(n)) = \\prod_{k=2}^n (2k)^{n\\choose k}$.\n  In this paper we use the explicit block diagonalization methodology to derive formulas for the complexity of two $q$-analogs of C(n), the {\\em nonbinary hypercube} $\\Cq(n)$, defined for $q\\geq 2$, and the {\\em vector space analog of the hypercube} $\\Cfq(n)$, defined for prime powers $q$.\n"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1104.1481","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":"1104.1481","created_at":"2026-05-18T04:24:44.965147+00:00"},{"alias_kind":"arxiv_version","alias_value":"1104.1481v1","created_at":"2026-05-18T04:24:44.965147+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1104.1481","created_at":"2026-05-18T04:24:44.965147+00:00"},{"alias_kind":"pith_short_12","alias_value":"343YV6B6Q4LX","created_at":"2026-05-18T12:26:18.847500+00:00"},{"alias_kind":"pith_short_16","alias_value":"343YV6B6Q4LXBMVS","created_at":"2026-05-18T12:26:18.847500+00:00"},{"alias_kind":"pith_short_8","alias_value":"343YV6B6","created_at":"2026-05-18T12:26:18.847500+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/343YV6B6Q4LXBMVSX55XCX2GMC","json":"https://pith.science/pith/343YV6B6Q4LXBMVSX55XCX2GMC.json","graph_json":"https://pith.science/api/pith-number/343YV6B6Q4LXBMVSX55XCX2GMC/graph.json","events_json":"https://pith.science/api/pith-number/343YV6B6Q4LXBMVSX55XCX2GMC/events.json","paper":"https://pith.science/paper/343YV6B6"},"agent_actions":{"view_html":"https://pith.science/pith/343YV6B6Q4LXBMVSX55XCX2GMC","download_json":"https://pith.science/pith/343YV6B6Q4LXBMVSX55XCX2GMC.json","view_paper":"https://pith.science/paper/343YV6B6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1104.1481&json=true","fetch_graph":"https://pith.science/api/pith-number/343YV6B6Q4LXBMVSX55XCX2GMC/graph.json","fetch_events":"https://pith.science/api/pith-number/343YV6B6Q4LXBMVSX55XCX2GMC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/343YV6B6Q4LXBMVSX55XCX2GMC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/343YV6B6Q4LXBMVSX55XCX2GMC/action/storage_attestation","attest_author":"https://pith.science/pith/343YV6B6Q4LXBMVSX55XCX2GMC/action/author_attestation","sign_citation":"https://pith.science/pith/343YV6B6Q4LXBMVSX55XCX2GMC/action/citation_signature","submit_replication":"https://pith.science/pith/343YV6B6Q4LXBMVSX55XCX2GMC/action/replication_record"}},"created_at":"2026-05-18T04:24:44.965147+00:00","updated_at":"2026-05-18T04:24:44.965147+00:00"}