{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:CVFMLGG3ZYGN6LMFQKUTOOIZY4","short_pith_number":"pith:CVFMLGG3","schema_version":"1.0","canonical_sha256":"154ac598dbce0cdf2d8582a9373919c7144130501de426af04dfde0763b8a9e1","source":{"kind":"arxiv","id":"1111.1799","version":2},"attestation_state":"computed","paper":{"title":"The complexity of the $q$-analog of the $n$-cube","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Murali K. Srinivasan","submitted_at":"2011-11-08T04:41:07Z","abstract_excerpt":"We present a positive, combinatorial, good formula for the complexity (= number of spanning trees) of the $q$-analog of the $n$-cube. Our method also yields the explicit block diagonalization of the commutant of the $GL(n,F_q)$ action on the $q$-analog of the Boolean algebra."},"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":"1111.1799","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-11-08T04:41:07Z","cross_cats_sorted":[],"title_canon_sha256":"721e10baa0a5362335684eb1f846f0bd0182753e729ae912d84eb7533b50e3ea","abstract_canon_sha256":"defd24561626d53b19ee67e46280303e9e3532ebc8ed7276c37fcd957fa40c80"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:08:23.607773Z","signature_b64":"ol968g/Cu0ulidY9aczt2JefRVvfskunXtGpAgbvLUN7MIF4PHwP5F02xKoJdd25SjWNPxs7UEiKtraBGQAiDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"154ac598dbce0cdf2d8582a9373919c7144130501de426af04dfde0763b8a9e1","last_reissued_at":"2026-05-18T04:08:23.607284Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:08:23.607284Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The complexity of the $q$-analog of the $n$-cube","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Murali K. Srinivasan","submitted_at":"2011-11-08T04:41:07Z","abstract_excerpt":"We present a positive, combinatorial, good formula for the complexity (= number of spanning trees) of the $q$-analog of the $n$-cube. Our method also yields the explicit block diagonalization of the commutant of the $GL(n,F_q)$ action on the $q$-analog of the Boolean algebra."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1111.1799","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":"1111.1799","created_at":"2026-05-18T04:08:23.607361+00:00"},{"alias_kind":"arxiv_version","alias_value":"1111.1799v2","created_at":"2026-05-18T04:08:23.607361+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1111.1799","created_at":"2026-05-18T04:08:23.607361+00:00"},{"alias_kind":"pith_short_12","alias_value":"CVFMLGG3ZYGN","created_at":"2026-05-18T12:26:26.731475+00:00"},{"alias_kind":"pith_short_16","alias_value":"CVFMLGG3ZYGN6LMF","created_at":"2026-05-18T12:26:26.731475+00:00"},{"alias_kind":"pith_short_8","alias_value":"CVFMLGG3","created_at":"2026-05-18T12:26:26.731475+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/CVFMLGG3ZYGN6LMFQKUTOOIZY4","json":"https://pith.science/pith/CVFMLGG3ZYGN6LMFQKUTOOIZY4.json","graph_json":"https://pith.science/api/pith-number/CVFMLGG3ZYGN6LMFQKUTOOIZY4/graph.json","events_json":"https://pith.science/api/pith-number/CVFMLGG3ZYGN6LMFQKUTOOIZY4/events.json","paper":"https://pith.science/paper/CVFMLGG3"},"agent_actions":{"view_html":"https://pith.science/pith/CVFMLGG3ZYGN6LMFQKUTOOIZY4","download_json":"https://pith.science/pith/CVFMLGG3ZYGN6LMFQKUTOOIZY4.json","view_paper":"https://pith.science/paper/CVFMLGG3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1111.1799&json=true","fetch_graph":"https://pith.science/api/pith-number/CVFMLGG3ZYGN6LMFQKUTOOIZY4/graph.json","fetch_events":"https://pith.science/api/pith-number/CVFMLGG3ZYGN6LMFQKUTOOIZY4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CVFMLGG3ZYGN6LMFQKUTOOIZY4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CVFMLGG3ZYGN6LMFQKUTOOIZY4/action/storage_attestation","attest_author":"https://pith.science/pith/CVFMLGG3ZYGN6LMFQKUTOOIZY4/action/author_attestation","sign_citation":"https://pith.science/pith/CVFMLGG3ZYGN6LMFQKUTOOIZY4/action/citation_signature","submit_replication":"https://pith.science/pith/CVFMLGG3ZYGN6LMFQKUTOOIZY4/action/replication_record"}},"created_at":"2026-05-18T04:08:23.607361+00:00","updated_at":"2026-05-18T04:08:23.607361+00:00"}