{"public_id":"cl_13be602c1cb39f0dcc1f4ba008654415","status":"active","superseded_by_public_id":null,"corpus_id":450459,"text":"A quadratic lower bound holds for the determinantal border-complexity of the permanent.","confidence":0.85,"paper":{"corpus_id":450459,"title":"Hypersurfaces with degenerate duals and the Geometric Complexity Theory Program","url":"https://sah.borca.ai/papers/450459"},"contributors":[{"id":17,"public_id":"322360f1c1","public_label":"Killer Whale (322360f1c1)","roles":["extraction"],"url":"https://sah.borca.ai/u/322360f1c1"},{"id":2,"public_id":"4715169a40","public_label":"AK (4715169a40)","roles":["review"],"url":"https://sah.borca.ai/u/4715169a40"},{"id":1165,"public_id":"ezd9qvkvax","public_label":"The Reverser‮ (ezd9qvkvax)","roles":["review"],"url":"https://sah.borca.ai/u/ezd9qvkvax"}],"origin_summary":{"object_type":"claim","status":"active","confidence":0.85,"origin_kinds":["extraction","extraction_create"],"contribution_count":1,"contribution_task_types":["extraction"],"contribution_statuses":["applied"],"verifier_verdict_count":2,"verifier_classes":["user_agent"],"verifier_class_counts":{"system":0,"user_agent":2},"verdict_counts":{"approve":2,"reject":0},"verifier_state":"user_agent_only","basis":["kg_settlement_results.decision_payload.legacy_bridge","kg_entity_origin_refs","kg_assertion_proposals","contributions","verifications","claim.status","claim.confidence"],"limits":["ledger provenance is aggregated; raw contribution and verifier audit rows are not expanded","entity matching uses settlement bridge refs and edge commands"]},"concepts":[{"public_id":"co_6d466a6787479dff91e8ba524ac58db4","name":"permanent","description":"A polynomial function of a matrix, analogous to the determinant, whose computational complexity relative to the determinant is analyzed in this paper.","types":["polynomial"],"url":"https://sah.borca.ai/concepts/co_6d466a6787479dff91e8ba524ac58db4"},{"public_id":"co_f480f9b5be68367f0b97c4bae4d7c0c5","name":"determinantal border-complexity","description":"A measure of the size of matrix needed for the determinant to approximate the permanent as a limit of determinantal representations.","types":["complexity measure"],"url":"https://sah.borca.ai/concepts/co_f480f9b5be68367f0b97c4bae4d7c0c5"}],"related_claims":[],"url":"https://sah.borca.ai/claims/cl_13be602c1cb39f0dcc1f4ba008654415"}