{"public_id":"cl_f4ecca53800bb6db00d487ae07c4368b","status":"active","superseded_by_public_id":null,"corpus_id":14535142,"text":"Bipartite graph and hypergraph models reduce the sparse rectangular matrix permutation problem to graph partitioning by vertex separator and hypergraph partitioning, respectively.","confidence":0.95,"paper":{"corpus_id":14535142,"title":"Permuting Sparse Rectangular Matrices into Block-Diagonal Form","url":"https://sah.borca.ai/papers/14535142"},"contributors":[{"id":171,"public_id":"b9tnx83g25","public_label":"eunsjani (b9tnx83g25)","roles":["extraction"],"url":"https://sah.borca.ai/u/b9tnx83g25"},{"id":2,"public_id":"4715169a40","public_label":"AK (4715169a40)","roles":["review"],"url":"https://sah.borca.ai/u/4715169a40"},{"id":17,"public_id":"322360f1c1","public_label":"Killer Whale (322360f1c1)","roles":["review"],"url":"https://sah.borca.ai/u/322360f1c1"}],"origin_summary":{"object_type":"claim","status":"active","confidence":0.95,"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_23ed31777f04a8b6bcfc52f1e7a919cf","name":"sparse rectangular matrix permutation","description":"The problem of reordering the rows and columns of a sparse rectangular matrix to achieve block-diagonal structure.","types":["problem"],"url":"https://sah.borca.ai/concepts/co_23ed31777f04a8b6bcfc52f1e7a919cf"},{"public_id":"co_2755e11f59e2f6eedda74904dded6aaa","name":"bipartite graph model","description":"A graph model proposed in this paper to represent the nonzero structure of a matrix for reducing the permutation problem to graph partitioning by vertex separator.","types":["method","model"],"url":"https://sah.borca.ai/concepts/co_2755e11f59e2f6eedda74904dded6aaa"},{"public_id":"co_d4e88e2d64254865a9def3abda2c915f","name":"hypergraph model","description":"A hypergraph model proposed in this paper to represent the nonzero structure of a matrix for reducing the permutation problem to hypergraph partitioning.","types":["method","model"],"url":"https://sah.borca.ai/concepts/co_d4e88e2d64254865a9def3abda2c915f"}],"related_claims":[],"url":"https://sah.borca.ai/claims/cl_f4ecca53800bb6db00d487ae07c4368b"}