{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:D7FTSBKBZZ72UV33YCUH2YWKRB","short_pith_number":"pith:D7FTSBKB","schema_version":"1.0","canonical_sha256":"1fcb390541ce7faa577bc0a87d62ca885a6b1b95534c600e0651940318a90428","source":{"kind":"arxiv","id":"1101.1169","version":1},"attestation_state":"computed","paper":{"title":"Almost Settling the Hardness of Noncommutative Determinant","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Alistair Sinclair, Prahladh Harsha, Srikanth Srinivasan, Steve Chien","submitted_at":"2011-01-06T09:14:42Z","abstract_excerpt":"In this paper, we study the complexity of computing the determinant of a matrix over a non-commutative algebra. In particular, we ask the question, \"over which algebras, is the determinant easier to compute than the permanent?\" Towards resolving this question, we show the following hardness and easiness of noncommutative determinant computation.\n  * [Hardness] Computing the determinant of an n \\times n matrix whose entries are themselves 2 \\times 2 matrices over a field is as hard as computing the permanent over the field. This extends the recent result of Arvind and Srinivasan, who proved a s"},"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.1169","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2011-01-06T09:14:42Z","cross_cats_sorted":[],"title_canon_sha256":"529d59c7f06b5bd738182eab2ab6b9994f842808b0d7d611b001563774149c6b","abstract_canon_sha256":"00d47c299cad518ab817d58831585b73a1ae3f37800dd8b0c62fe3d15f2a8558"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:03:59.839427Z","signature_b64":"GYBUJdraASZevWRnq4TN476KqB2i4SwOz2K9Rmx4eUDUmc6SySj+BdqxDLae0e35YViFGOm/jUm+nI6TNrrWBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1fcb390541ce7faa577bc0a87d62ca885a6b1b95534c600e0651940318a90428","last_reissued_at":"2026-05-18T00:03:59.838764Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:03:59.838764Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Almost Settling the Hardness of Noncommutative Determinant","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Alistair Sinclair, Prahladh Harsha, Srikanth Srinivasan, Steve Chien","submitted_at":"2011-01-06T09:14:42Z","abstract_excerpt":"In this paper, we study the complexity of computing the determinant of a matrix over a non-commutative algebra. In particular, we ask the question, \"over which algebras, is the determinant easier to compute than the permanent?\" Towards resolving this question, we show the following hardness and easiness of noncommutative determinant computation.\n  * [Hardness] Computing the determinant of an n \\times n matrix whose entries are themselves 2 \\times 2 matrices over a field is as hard as computing the permanent over the field. This extends the recent result of Arvind and Srinivasan, who proved a s"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1101.1169","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.1169","created_at":"2026-05-18T00:03:59.838875+00:00"},{"alias_kind":"arxiv_version","alias_value":"1101.1169v1","created_at":"2026-05-18T00:03:59.838875+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1101.1169","created_at":"2026-05-18T00:03:59.838875+00:00"},{"alias_kind":"pith_short_12","alias_value":"D7FTSBKBZZ72","created_at":"2026-05-18T12:26:26.731475+00:00"},{"alias_kind":"pith_short_16","alias_value":"D7FTSBKBZZ72UV33","created_at":"2026-05-18T12:26:26.731475+00:00"},{"alias_kind":"pith_short_8","alias_value":"D7FTSBKB","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/D7FTSBKBZZ72UV33YCUH2YWKRB","json":"https://pith.science/pith/D7FTSBKBZZ72UV33YCUH2YWKRB.json","graph_json":"https://pith.science/api/pith-number/D7FTSBKBZZ72UV33YCUH2YWKRB/graph.json","events_json":"https://pith.science/api/pith-number/D7FTSBKBZZ72UV33YCUH2YWKRB/events.json","paper":"https://pith.science/paper/D7FTSBKB"},"agent_actions":{"view_html":"https://pith.science/pith/D7FTSBKBZZ72UV33YCUH2YWKRB","download_json":"https://pith.science/pith/D7FTSBKBZZ72UV33YCUH2YWKRB.json","view_paper":"https://pith.science/paper/D7FTSBKB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1101.1169&json=true","fetch_graph":"https://pith.science/api/pith-number/D7FTSBKBZZ72UV33YCUH2YWKRB/graph.json","fetch_events":"https://pith.science/api/pith-number/D7FTSBKBZZ72UV33YCUH2YWKRB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/D7FTSBKBZZ72UV33YCUH2YWKRB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/D7FTSBKBZZ72UV33YCUH2YWKRB/action/storage_attestation","attest_author":"https://pith.science/pith/D7FTSBKBZZ72UV33YCUH2YWKRB/action/author_attestation","sign_citation":"https://pith.science/pith/D7FTSBKBZZ72UV33YCUH2YWKRB/action/citation_signature","submit_replication":"https://pith.science/pith/D7FTSBKBZZ72UV33YCUH2YWKRB/action/replication_record"}},"created_at":"2026-05-18T00:03:59.838875+00:00","updated_at":"2026-05-18T00:03:59.838875+00:00"}