{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:YMF6DG2BSIB7MQ2FD2WKSOQFOT","short_pith_number":"pith:YMF6DG2B","schema_version":"1.0","canonical_sha256":"c30be19b419203f643451eaca93a0574ceed774bcad0c6874c1e41ea66b3f77f","source":{"kind":"arxiv","id":"1110.1821","version":2},"attestation_state":"computed","paper":{"title":"The complexity of the fermionant, and immanants of constant width","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.str-el","math.CO"],"primary_cat":"cs.CC","authors_text":"Cristopher Moore, Stephan Mertens","submitted_at":"2011-10-09T11:16:48Z","abstract_excerpt":"In the context of statistical physics, Chandrasekharan and Wiese recently introduced the \\emph{fermionant} $\\Ferm_k$, a determinant-like quantity where each permutation $\\pi$ is weighted by $-k$ raised to the number of cycles in $\\pi$. We show that computing $\\Ferm_k$ is #P-hard under Turing reductions for any constant $k > 2$, and is $\\oplusP$-hard for $k=2$, even for the adjacency matrices of planar graphs. As a consequence, unless the polynomial hierarchy collapses, it is impossible to compute the immanant $\\Imm_\\lambda \\,A$ as a function of the Young diagram $\\lambda$ in polynomial time, e"},"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":"1110.1821","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2011-10-09T11:16:48Z","cross_cats_sorted":["cond-mat.str-el","math.CO"],"title_canon_sha256":"a57af2b4e69040208621e987e014b12507373a0bd445151ad26852a0865bf75c","abstract_canon_sha256":"cf4960ba6c7a29a98b6cb9f89c8c4624f436e13bfe3d90d1a885e26922b615c2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:29:01.864289Z","signature_b64":"Iumew6WsEEOkQCynu1bh0938o79k4SXXY1bAXA+exbpRFuqTnoqOt5oiZXBIDRG764gRY9KwTm0Z+RYNjOkTDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c30be19b419203f643451eaca93a0574ceed774bcad0c6874c1e41ea66b3f77f","last_reissued_at":"2026-05-18T02:29:01.863923Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:29:01.863923Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The complexity of the fermionant, and immanants of constant width","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.str-el","math.CO"],"primary_cat":"cs.CC","authors_text":"Cristopher Moore, Stephan Mertens","submitted_at":"2011-10-09T11:16:48Z","abstract_excerpt":"In the context of statistical physics, Chandrasekharan and Wiese recently introduced the \\emph{fermionant} $\\Ferm_k$, a determinant-like quantity where each permutation $\\pi$ is weighted by $-k$ raised to the number of cycles in $\\pi$. We show that computing $\\Ferm_k$ is #P-hard under Turing reductions for any constant $k > 2$, and is $\\oplusP$-hard for $k=2$, even for the adjacency matrices of planar graphs. As a consequence, unless the polynomial hierarchy collapses, it is impossible to compute the immanant $\\Imm_\\lambda \\,A$ as a function of the Young diagram $\\lambda$ in polynomial time, e"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1110.1821","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":"1110.1821","created_at":"2026-05-18T02:29:01.863978+00:00"},{"alias_kind":"arxiv_version","alias_value":"1110.1821v2","created_at":"2026-05-18T02:29:01.863978+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1110.1821","created_at":"2026-05-18T02:29:01.863978+00:00"},{"alias_kind":"pith_short_12","alias_value":"YMF6DG2BSIB7","created_at":"2026-05-18T12:26:47.523578+00:00"},{"alias_kind":"pith_short_16","alias_value":"YMF6DG2BSIB7MQ2F","created_at":"2026-05-18T12:26:47.523578+00:00"},{"alias_kind":"pith_short_8","alias_value":"YMF6DG2B","created_at":"2026-05-18T12:26:47.523578+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/YMF6DG2BSIB7MQ2FD2WKSOQFOT","json":"https://pith.science/pith/YMF6DG2BSIB7MQ2FD2WKSOQFOT.json","graph_json":"https://pith.science/api/pith-number/YMF6DG2BSIB7MQ2FD2WKSOQFOT/graph.json","events_json":"https://pith.science/api/pith-number/YMF6DG2BSIB7MQ2FD2WKSOQFOT/events.json","paper":"https://pith.science/paper/YMF6DG2B"},"agent_actions":{"view_html":"https://pith.science/pith/YMF6DG2BSIB7MQ2FD2WKSOQFOT","download_json":"https://pith.science/pith/YMF6DG2BSIB7MQ2FD2WKSOQFOT.json","view_paper":"https://pith.science/paper/YMF6DG2B","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1110.1821&json=true","fetch_graph":"https://pith.science/api/pith-number/YMF6DG2BSIB7MQ2FD2WKSOQFOT/graph.json","fetch_events":"https://pith.science/api/pith-number/YMF6DG2BSIB7MQ2FD2WKSOQFOT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YMF6DG2BSIB7MQ2FD2WKSOQFOT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YMF6DG2BSIB7MQ2FD2WKSOQFOT/action/storage_attestation","attest_author":"https://pith.science/pith/YMF6DG2BSIB7MQ2FD2WKSOQFOT/action/author_attestation","sign_citation":"https://pith.science/pith/YMF6DG2BSIB7MQ2FD2WKSOQFOT/action/citation_signature","submit_replication":"https://pith.science/pith/YMF6DG2BSIB7MQ2FD2WKSOQFOT/action/replication_record"}},"created_at":"2026-05-18T02:29:01.863978+00:00","updated_at":"2026-05-18T02:29:01.863978+00:00"}