{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:ERKW36F7KZZCIH5OFWNLX57GHN","short_pith_number":"pith:ERKW36F7","canonical_record":{"source":{"id":"2604.28019","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2026-04-30T15:38:51Z","cross_cats_sorted":[],"title_canon_sha256":"4924ea922cdf90a05b37f7d37b6d06386e138bd171d66f9744b59153747bd616","abstract_canon_sha256":"18e46183c03f5764e09c5147296a4c64195a810df4460163e849dbf4866eab1c"},"schema_version":"1.0"},"canonical_sha256":"24556df8bf5672241fae2d9abbf7e63b666f6e14e07ebdb6968b4209027b27cc","source":{"kind":"arxiv","id":"2604.28019","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2604.28019","created_at":"2026-06-25T01:17:53Z"},{"alias_kind":"arxiv_version","alias_value":"2604.28019v2","created_at":"2026-06-25T01:17:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2604.28019","created_at":"2026-06-25T01:17:53Z"},{"alias_kind":"pith_short_12","alias_value":"ERKW36F7KZZC","created_at":"2026-06-25T01:17:53Z"},{"alias_kind":"pith_short_16","alias_value":"ERKW36F7KZZCIH5O","created_at":"2026-06-25T01:17:53Z"},{"alias_kind":"pith_short_8","alias_value":"ERKW36F7","created_at":"2026-06-25T01:17:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:ERKW36F7KZZCIH5OFWNLX57GHN","target":"record","payload":{"canonical_record":{"source":{"id":"2604.28019","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2026-04-30T15:38:51Z","cross_cats_sorted":[],"title_canon_sha256":"4924ea922cdf90a05b37f7d37b6d06386e138bd171d66f9744b59153747bd616","abstract_canon_sha256":"18e46183c03f5764e09c5147296a4c64195a810df4460163e849dbf4866eab1c"},"schema_version":"1.0"},"canonical_sha256":"24556df8bf5672241fae2d9abbf7e63b666f6e14e07ebdb6968b4209027b27cc","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-25T01:17:53.599620Z","signature_b64":"rvoBCfxldjd66t/oMoMjzy7VQCQK1MqXXBfrkmZ8CVsECuQn01MWU8i7jt4D3lxw595fRizFD0VHJZaRziUDBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"24556df8bf5672241fae2d9abbf7e63b666f6e14e07ebdb6968b4209027b27cc","last_reissued_at":"2026-06-25T01:17:53.599150Z","signature_status":"signed_v1","first_computed_at":"2026-06-25T01:17:53.599150Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2604.28019","source_version":2,"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-06-25T01:17:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"67cpQ8EhOGslk+A1QFMzinIyS57eVJKKoMMXwXMZOWCah+fpYdTMFHGHwARnNl4Dob1l3Qt6hMDVN7vER32XBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-03T23:17:55.169123Z"},"content_sha256":"3cce8e3b25753b079889c266ea15b49d3b02d55b1d543b699078721785e89f9f","schema_version":"1.0","event_id":"sha256:3cce8e3b25753b079889c266ea15b49d3b02d55b1d543b699078721785e89f9f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:ERKW36F7KZZCIH5OFWNLX57GHN","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the Principal Minor Expansion and Complexity of the Symmetrized Determinant","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"The symmetrized determinant is #P-hard to compute over some polynomial-sized algebras and gives rise to VNP-complete polynomial families.","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Markus Bl\\\"aser, Mridul Gupta, Sanyam Agarwal","submitted_at":"2026-04-30T15:38:51Z","abstract_excerpt":"Barvinok introduced the symmetrized determinant ($\\sdet$) as a \\emph{non-commutative} analogue of the determinant. Intuitively, given a square matrix over an associative algebra, we can obtain the symmetrized determinant by averaging over all possible multiplication orders in the Leibniz formula for the determinant. He used the symmetrized determinant to design algorithms estimating the permanent of a matrix. To this end, he showed that there is a $O(n^{r+3})$ algorithm computing $\\sdet$, where $r$ is the dimension of the algebra, and is therefore polynomial-time computable for fixed $r$.\n  In"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"we prove that there exists a polynomial-sized algebra such that computing the symmetrized determinant is #P-hard. [...] the associated polynomial family is VNP-complete over a suitable polynomial-dimensional algebra in the non-commutative setting. Further, when seen as a family of polynomials over the matrix algebra, it is also VNP-complete in the commutative setting.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"The reductions from known #P-hard and VNP-complete problems to the symmetrized determinant are valid for the specific polynomial-sized associative algebras constructed in the paper, without hidden restrictions on the algebra that would invalidate the hardness for general cases.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"The symmetrized determinant is #P-hard over polynomial-sized algebras and its polynomial family is VNP-complete in both non-commutative and commutative matrix algebra settings.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"The symmetrized determinant is #P-hard to compute over some polynomial-sized algebras and gives rise to VNP-complete polynomial families.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"e96fbea804e65e2c1e67b83ea408a15b3e7a8492deeb05de35f5243c0bf8056f"},"source":{"id":"2604.28019","kind":"arxiv","version":2},"verdict":{"id":"1a6c9b2b-a88f-4098-86b2-7cfcb1c7a43c","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-07T05:12:23.481254Z","strongest_claim":"we prove that there exists a polynomial-sized algebra such that computing the symmetrized determinant is #P-hard. [...] the associated polynomial family is VNP-complete over a suitable polynomial-dimensional algebra in the non-commutative setting. Further, when seen as a family of polynomials over the matrix algebra, it is also VNP-complete in the commutative setting.","one_line_summary":"The symmetrized determinant is #P-hard over polynomial-sized algebras and its polynomial family is VNP-complete in both non-commutative and commutative matrix algebra settings.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"The reductions from known #P-hard and VNP-complete problems to the symmetrized determinant are valid for the specific polynomial-sized associative algebras constructed in the paper, without hidden restrictions on the algebra that would invalidate the hardness for general cases.","pith_extraction_headline":"The symmetrized determinant is #P-hard to compute over some polynomial-sized algebras and gives rise to VNP-complete polynomial families."},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2604.28019/integrity.json","findings":[],"available":true,"detectors_run":[{"name":"ai_meta_artifact","ran_at":"2026-05-20T20:42:12.599783Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"doi_compliance","ran_at":"2026-05-19T18:41:30.708188Z","status":"completed","version":"1.0.0","findings_count":0}],"snapshot_sha256":"88dcb46b45b416e73c56a8d39fa56edcaaadbfedb344927b1bb0efb5206d9a3e"},"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":"1a6c9b2b-a88f-4098-86b2-7cfcb1c7a43c"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-06-25T01:17:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XZQwgomdqQl1AeRx3+HNuFoNk3FqVbccOsVKF7ZAjim+m3A073DCNtlWelErHS9NGrWb8nsO/BO3IX9zs2JjBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-03T23:17:55.169834Z"},"content_sha256":"0e1636a2798ba9400f0ac4a7f17f2a86aee74ae603bcb8cccee0ea6f390a5118","schema_version":"1.0","event_id":"sha256:0e1636a2798ba9400f0ac4a7f17f2a86aee74ae603bcb8cccee0ea6f390a5118"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ERKW36F7KZZCIH5OFWNLX57GHN/bundle.json","state_url":"https://pith.science/pith/ERKW36F7KZZCIH5OFWNLX57GHN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ERKW36F7KZZCIH5OFWNLX57GHN/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-08-03T23:17:55Z","links":{"resolver":"https://pith.science/pith/ERKW36F7KZZCIH5OFWNLX57GHN","bundle":"https://pith.science/pith/ERKW36F7KZZCIH5OFWNLX57GHN/bundle.json","state":"https://pith.science/pith/ERKW36F7KZZCIH5OFWNLX57GHN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ERKW36F7KZZCIH5OFWNLX57GHN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:ERKW36F7KZZCIH5OFWNLX57GHN","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":"18e46183c03f5764e09c5147296a4c64195a810df4460163e849dbf4866eab1c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2026-04-30T15:38:51Z","title_canon_sha256":"4924ea922cdf90a05b37f7d37b6d06386e138bd171d66f9744b59153747bd616"},"schema_version":"1.0","source":{"id":"2604.28019","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2604.28019","created_at":"2026-06-25T01:17:53Z"},{"alias_kind":"arxiv_version","alias_value":"2604.28019v2","created_at":"2026-06-25T01:17:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2604.28019","created_at":"2026-06-25T01:17:53Z"},{"alias_kind":"pith_short_12","alias_value":"ERKW36F7KZZC","created_at":"2026-06-25T01:17:53Z"},{"alias_kind":"pith_short_16","alias_value":"ERKW36F7KZZCIH5O","created_at":"2026-06-25T01:17:53Z"},{"alias_kind":"pith_short_8","alias_value":"ERKW36F7","created_at":"2026-06-25T01:17:53Z"}],"graph_snapshots":[{"event_id":"sha256:0e1636a2798ba9400f0ac4a7f17f2a86aee74ae603bcb8cccee0ea6f390a5118","target":"graph","created_at":"2026-06-25T01:17:53Z","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":4,"items":[{"attestation":"unclaimed","claim_id":"C1","kind":"strongest_claim","source":"verdict.strongest_claim","status":"machine_extracted","text":"we prove that there exists a polynomial-sized algebra such that computing the symmetrized determinant is #P-hard. [...] the associated polynomial family is VNP-complete over a suitable polynomial-dimensional algebra in the non-commutative setting. Further, when seen as a family of polynomials over the matrix algebra, it is also VNP-complete in the commutative setting."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"The reductions from known #P-hard and VNP-complete problems to the symmetrized determinant are valid for the specific polynomial-sized associative algebras constructed in the paper, without hidden restrictions on the algebra that would invalidate the hardness for general cases."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"The symmetrized determinant is #P-hard over polynomial-sized algebras and its polynomial family is VNP-complete in both non-commutative and commutative matrix algebra settings."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"The symmetrized determinant is #P-hard to compute over some polynomial-sized algebras and gives rise to VNP-complete polynomial families."}],"snapshot_sha256":"e96fbea804e65e2c1e67b83ea408a15b3e7a8492deeb05de35f5243c0bf8056f"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[{"findings_count":0,"name":"ai_meta_artifact","ran_at":"2026-05-20T20:42:12.599783Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"doi_compliance","ran_at":"2026-05-19T18:41:30.708188Z","status":"completed","version":"1.0.0"}],"endpoint":"/pith/2604.28019/integrity.json","findings":[],"snapshot_sha256":"88dcb46b45b416e73c56a8d39fa56edcaaadbfedb344927b1bb0efb5206d9a3e","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Barvinok introduced the symmetrized determinant ($\\sdet$) as a \\emph{non-commutative} analogue of the determinant. Intuitively, given a square matrix over an associative algebra, we can obtain the symmetrized determinant by averaging over all possible multiplication orders in the Leibniz formula for the determinant. He used the symmetrized determinant to design algorithms estimating the permanent of a matrix. To this end, he showed that there is a $O(n^{r+3})$ algorithm computing $\\sdet$, where $r$ is the dimension of the algebra, and is therefore polynomial-time computable for fixed $r$.\n  In","authors_text":"Markus Bl\\\"aser, Mridul Gupta, Sanyam Agarwal","cross_cats":[],"headline":"The symmetrized determinant is #P-hard to compute over some polynomial-sized algebras and gives rise to VNP-complete polynomial families.","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2026-04-30T15:38:51Z","title":"On the Principal Minor Expansion and Complexity of the Symmetrized Determinant"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2604.28019","kind":"arxiv","version":2},"verdict":{"created_at":"2026-05-07T05:12:23.481254Z","id":"1a6c9b2b-a88f-4098-86b2-7cfcb1c7a43c","model_set":{"reader":"grok-4.3"},"one_line_summary":"The symmetrized determinant is #P-hard over polynomial-sized algebras and its polynomial family is VNP-complete in both non-commutative and commutative matrix algebra settings.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"The symmetrized determinant is #P-hard to compute over some polynomial-sized algebras and gives rise to VNP-complete polynomial families.","strongest_claim":"we prove that there exists a polynomial-sized algebra such that computing the symmetrized determinant is #P-hard. [...] the associated polynomial family is VNP-complete over a suitable polynomial-dimensional algebra in the non-commutative setting. Further, when seen as a family of polynomials over the matrix algebra, it is also VNP-complete in the commutative setting.","weakest_assumption":"The reductions from known #P-hard and VNP-complete problems to the symmetrized determinant are valid for the specific polynomial-sized associative algebras constructed in the paper, without hidden restrictions on the algebra that would invalidate the hardness for general cases."}},"verdict_id":"1a6c9b2b-a88f-4098-86b2-7cfcb1c7a43c"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:3cce8e3b25753b079889c266ea15b49d3b02d55b1d543b699078721785e89f9f","target":"record","created_at":"2026-06-25T01:17:53Z","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":"18e46183c03f5764e09c5147296a4c64195a810df4460163e849dbf4866eab1c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2026-04-30T15:38:51Z","title_canon_sha256":"4924ea922cdf90a05b37f7d37b6d06386e138bd171d66f9744b59153747bd616"},"schema_version":"1.0","source":{"id":"2604.28019","kind":"arxiv","version":2}},"canonical_sha256":"24556df8bf5672241fae2d9abbf7e63b666f6e14e07ebdb6968b4209027b27cc","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"24556df8bf5672241fae2d9abbf7e63b666f6e14e07ebdb6968b4209027b27cc","first_computed_at":"2026-06-25T01:17:53.599150Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-25T01:17:53.599150Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"rvoBCfxldjd66t/oMoMjzy7VQCQK1MqXXBfrkmZ8CVsECuQn01MWU8i7jt4D3lxw595fRizFD0VHJZaRziUDBw==","signature_status":"signed_v1","signed_at":"2026-06-25T01:17:53.599620Z","signed_message":"canonical_sha256_bytes"},"source_id":"2604.28019","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3cce8e3b25753b079889c266ea15b49d3b02d55b1d543b699078721785e89f9f","sha256:0e1636a2798ba9400f0ac4a7f17f2a86aee74ae603bcb8cccee0ea6f390a5118"],"state_sha256":"434b7d3a6a62284225507fef50f9eede0fc952fdbc36bdea2a2201fbc2308358"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/0RYtqIfB7qNFAZHOvUINf5E2NeRkr9EECpwRncPtBkC89o2F4g7V5Axrh8G7nwgw8Fm2vqysDt+f2xCU3r8Cw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-03T23:17:55.174927Z","bundle_sha256":"cb0966dca605638ee100596ef59f812494397e7e8ef9c1473c3d313cdb3a46a6"}}