{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:343YV6B6Q4LXBMVSX55XCX2GMC","short_pith_number":"pith:343YV6B6","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"},"canonical_sha256":"df378af83e871770b2b2bf7b715f46609118f54102b743358a14b80ed66e24e4","source":{"kind":"arxiv","id":"1104.1481","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1104.1481","created_at":"2026-05-18T04:24:44Z"},{"alias_kind":"arxiv_version","alias_value":"1104.1481v1","created_at":"2026-05-18T04:24:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1104.1481","created_at":"2026-05-18T04:24:44Z"},{"alias_kind":"pith_short_12","alias_value":"343YV6B6Q4LX","created_at":"2026-05-18T12:26:18Z"},{"alias_kind":"pith_short_16","alias_value":"343YV6B6Q4LXBMVS","created_at":"2026-05-18T12:26:18Z"},{"alias_kind":"pith_short_8","alias_value":"343YV6B6","created_at":"2026-05-18T12:26:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:343YV6B6Q4LXBMVSX55XCX2GMC","target":"record","payload":{"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"},"canonical_sha256":"df378af83e871770b2b2bf7b715f46609118f54102b743358a14b80ed66e24e4","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"},"source_kind":"arxiv","source_id":"1104.1481","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T04:24:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0e8QLfHhN7uNVoPJq6SMl6ZxaBUr+uk5Etw5GlVOjV7BF1AntSV9TsbRKTkQ21o5BJ9AxIen5GsKRgPR7uXYBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T05:40:46.595761Z"},"content_sha256":"e84fd7c08330e45b65b91ed24891feb9fd38dcf32f803766bd8fcc88e23ed2fb","schema_version":"1.0","event_id":"sha256:e84fd7c08330e45b65b91ed24891feb9fd38dcf32f803766bd8fcc88e23ed2fb"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:343YV6B6Q4LXBMVSX55XCX2GMC","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T04:24:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DB7ybfYB36TOz4Est8tWo1aYjwQ5zjhBJRHx3nBZ903iXtldNqHMNeM0z2yyw6rzx4obdcERFNSSS1Bf4/6tBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T05:40:46.596471Z"},"content_sha256":"90a2bb9cd711550159c8dec17a8b6cb6a7429b5eed8ac7f13c5d9ae7155496f3","schema_version":"1.0","event_id":"sha256:90a2bb9cd711550159c8dec17a8b6cb6a7429b5eed8ac7f13c5d9ae7155496f3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/343YV6B6Q4LXBMVSX55XCX2GMC/bundle.json","state_url":"https://pith.science/pith/343YV6B6Q4LXBMVSX55XCX2GMC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/343YV6B6Q4LXBMVSX55XCX2GMC/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-11T05:40:46Z","links":{"resolver":"https://pith.science/pith/343YV6B6Q4LXBMVSX55XCX2GMC","bundle":"https://pith.science/pith/343YV6B6Q4LXBMVSX55XCX2GMC/bundle.json","state":"https://pith.science/pith/343YV6B6Q4LXBMVSX55XCX2GMC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/343YV6B6Q4LXBMVSX55XCX2GMC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:343YV6B6Q4LXBMVSX55XCX2GMC","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"f3acdb463b586475cdd056a38da8a34d1ade6aec8c7fd082b12b0ba9c06ed1ed","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-04-08T05:01:16Z","title_canon_sha256":"9e59392c38a366e51f8c285f7c9590fa8678a8f06aa9f5ccaf7072dbc4c63236"},"schema_version":"1.0","source":{"id":"1104.1481","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1104.1481","created_at":"2026-05-18T04:24:44Z"},{"alias_kind":"arxiv_version","alias_value":"1104.1481v1","created_at":"2026-05-18T04:24:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1104.1481","created_at":"2026-05-18T04:24:44Z"},{"alias_kind":"pith_short_12","alias_value":"343YV6B6Q4LX","created_at":"2026-05-18T12:26:18Z"},{"alias_kind":"pith_short_16","alias_value":"343YV6B6Q4LXBMVS","created_at":"2026-05-18T12:26:18Z"},{"alias_kind":"pith_short_8","alias_value":"343YV6B6","created_at":"2026-05-18T12:26:18Z"}],"graph_snapshots":[{"event_id":"sha256:90a2bb9cd711550159c8dec17a8b6cb6a7429b5eed8ac7f13c5d9ae7155496f3","target":"graph","created_at":"2026-05-18T04:24:44Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Murali K. Srinivasan","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-04-08T05:01:16Z","title":"Counting spanning trees of the hypercube and its $q$-analogs by explicit block diagonalization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1104.1481","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:e84fd7c08330e45b65b91ed24891feb9fd38dcf32f803766bd8fcc88e23ed2fb","target":"record","created_at":"2026-05-18T04:24:44Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"f3acdb463b586475cdd056a38da8a34d1ade6aec8c7fd082b12b0ba9c06ed1ed","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-04-08T05:01:16Z","title_canon_sha256":"9e59392c38a366e51f8c285f7c9590fa8678a8f06aa9f5ccaf7072dbc4c63236"},"schema_version":"1.0","source":{"id":"1104.1481","kind":"arxiv","version":1}},"canonical_sha256":"df378af83e871770b2b2bf7b715f46609118f54102b743358a14b80ed66e24e4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"df378af83e871770b2b2bf7b715f46609118f54102b743358a14b80ed66e24e4","first_computed_at":"2026-05-18T04:24:44.965063Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:24:44.965063Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"2N+2uG/zjxXHvp88a5cv1Q+t8gxWPnUQMzC8dMEQRUukvhN/0HhWta5cPnmCUKapfuwWq5cZBdfYb6nc/uMCCw==","signature_status":"signed_v1","signed_at":"2026-05-18T04:24:44.965529Z","signed_message":"canonical_sha256_bytes"},"source_id":"1104.1481","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e84fd7c08330e45b65b91ed24891feb9fd38dcf32f803766bd8fcc88e23ed2fb","sha256:90a2bb9cd711550159c8dec17a8b6cb6a7429b5eed8ac7f13c5d9ae7155496f3"],"state_sha256":"6c3d6d4b9a04e958a2c0084d86a41119b885a6bcfbfcf4d48a4876f3c3f923f0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xNgh1DUWyg9gs0+3a9iOWZqbDI1LL/DAmPl66zKpUGQhIQ8hngRujFT1E0V7lN2WHjMA4OtApvCQ6br3u22jBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T05:40:46.601161Z","bundle_sha256":"d854527a6cc68c8ba8547c2b4632fd136da5271ea2c3c89ef0d63d4841ba6457"}}