{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:FUNRZMGYCOTXS3YI42DKYAMDZO","short_pith_number":"pith:FUNRZMGY","schema_version":"1.0","canonical_sha256":"2d1b1cb0d813a7796f08e686ac0183cb8e2107ff6e79512fb9702597b41747ef","source":{"kind":"arxiv","id":"2107.00011","version":2},"attestation_state":"computed","paper":{"title":"Complexity of Supersymmetric Systems and the Cohomology Problem","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cond-mat.other","hep-th"],"primary_cat":"quant-ph","authors_text":"Chris Cade, P. Marcos Crichigno","submitted_at":"2021-06-30T18:00:01Z","abstract_excerpt":"We consider the complexity of the local Hamiltonian problem in the context of fermionic Hamiltonians with $\\mathcal N=2 $ supersymmetry and show that the problem remains $\\mathsf{QMA}$-complete. Our main motivation for studying this is the well-known fact that the ground state energy of a supersymmetric system is exactly zero if and only if a certain cohomology group is nontrivial. This opens the door to bringing the tools of Hamiltonian complexity to study the computational complexity of a large number of algorithmic problems that arise in homological algebra, including problems in algebraic "},"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":"2107.00011","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2021-06-30T18:00:01Z","cross_cats_sorted":["cond-mat.other","hep-th"],"title_canon_sha256":"b77463d8c549d7ece8145e2e896bfdefaeb3b180209729112071fb29c2712083","abstract_canon_sha256":"c1a35704b2851e434724fced3ac21d3b50b2a996bb561b995e2bd24b9168a238"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:13:50.714391Z","signature_b64":"jwS2gLots+HucjvcDJOSjjgjouG6QYlHBaXfZF2VEabQj59NdnUfErynYBYTnZFbqEafRHtf+82abtxgCoQcBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2d1b1cb0d813a7796f08e686ac0183cb8e2107ff6e79512fb9702597b41747ef","last_reissued_at":"2026-07-05T08:13:50.713925Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:13:50.713925Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Complexity of Supersymmetric Systems and the Cohomology Problem","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cond-mat.other","hep-th"],"primary_cat":"quant-ph","authors_text":"Chris Cade, P. Marcos Crichigno","submitted_at":"2021-06-30T18:00:01Z","abstract_excerpt":"We consider the complexity of the local Hamiltonian problem in the context of fermionic Hamiltonians with $\\mathcal N=2 $ supersymmetry and show that the problem remains $\\mathsf{QMA}$-complete. Our main motivation for studying this is the well-known fact that the ground state energy of a supersymmetric system is exactly zero if and only if a certain cohomology group is nontrivial. This opens the door to bringing the tools of Hamiltonian complexity to study the computational complexity of a large number of algorithmic problems that arise in homological algebra, including problems in algebraic "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2107.00011","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2107.00011/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2107.00011","created_at":"2026-07-05T08:13:50.713975+00:00"},{"alias_kind":"arxiv_version","alias_value":"2107.00011v2","created_at":"2026-07-05T08:13:50.713975+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2107.00011","created_at":"2026-07-05T08:13:50.713975+00:00"},{"alias_kind":"pith_short_12","alias_value":"FUNRZMGYCOTX","created_at":"2026-07-05T08:13:50.713975+00:00"},{"alias_kind":"pith_short_16","alias_value":"FUNRZMGYCOTXS3YI","created_at":"2026-07-05T08:13:50.713975+00:00"},{"alias_kind":"pith_short_8","alias_value":"FUNRZMGY","created_at":"2026-07-05T08:13:50.713975+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2501.12378","citing_title":"A quantum algorithm for Khovanov homology","ref_index":35,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/FUNRZMGYCOTXS3YI42DKYAMDZO","json":"https://pith.science/pith/FUNRZMGYCOTXS3YI42DKYAMDZO.json","graph_json":"https://pith.science/api/pith-number/FUNRZMGYCOTXS3YI42DKYAMDZO/graph.json","events_json":"https://pith.science/api/pith-number/FUNRZMGYCOTXS3YI42DKYAMDZO/events.json","paper":"https://pith.science/paper/FUNRZMGY"},"agent_actions":{"view_html":"https://pith.science/pith/FUNRZMGYCOTXS3YI42DKYAMDZO","download_json":"https://pith.science/pith/FUNRZMGYCOTXS3YI42DKYAMDZO.json","view_paper":"https://pith.science/paper/FUNRZMGY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2107.00011&json=true","fetch_graph":"https://pith.science/api/pith-number/FUNRZMGYCOTXS3YI42DKYAMDZO/graph.json","fetch_events":"https://pith.science/api/pith-number/FUNRZMGYCOTXS3YI42DKYAMDZO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FUNRZMGYCOTXS3YI42DKYAMDZO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FUNRZMGYCOTXS3YI42DKYAMDZO/action/storage_attestation","attest_author":"https://pith.science/pith/FUNRZMGYCOTXS3YI42DKYAMDZO/action/author_attestation","sign_citation":"https://pith.science/pith/FUNRZMGYCOTXS3YI42DKYAMDZO/action/citation_signature","submit_replication":"https://pith.science/pith/FUNRZMGYCOTXS3YI42DKYAMDZO/action/replication_record"}},"created_at":"2026-07-05T08:13:50.713975+00:00","updated_at":"2026-07-05T08:13:50.713975+00:00"}