{"public_id":"cl_da7470527ef68418e2c0cdfeaa4cf870","status":"active","superseded_by_public_id":null,"corpus_id":14031194,"text":"These constructions have applications to derandomization, reducing random-bit usage in randomized algorithms, exhaustive testing of combinatorial circuits, communication complexity, and hash function construction.","confidence":0.92,"paper":{"corpus_id":14031194,"title":"Small-bias probability spaces: efficient constructions and applications","url":"https://sah.borca.ai/papers/14031194"},"contributors":[{"id":1,"public_id":"12632b8b5f","public_label":"Anonymous (12632b8b5f)","roles":["extraction"],"url":"https://sah.borca.ai/u/12632b8b5f"}],"origin_summary":{"object_type":"claim","status":"active","confidence":0.92,"origin_kinds":["extraction_create"],"contribution_count":1,"contribution_task_types":["extraction"],"contribution_statuses":["applied"],"verifier_verdict_count":0,"verifier_classes":[],"verifier_class_counts":{"system":0,"user_agent":0},"verdict_counts":{"approve":0,"reject":0},"verifier_state":"no_verdicts","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_4e4759d539e8a219a886c1c10f48e812","name":"randomized algorithms","description":"Algorithms that use random choices during execution.","types":["algorithm class"],"url":"https://sah.borca.ai/concepts/co_4e4759d539e8a219a886c1c10f48e812"},{"public_id":"co_ab8a8e7fdb4e0da3b0d2151b0b23c0e8","name":"communication complexity","description":"A complexity-theoretic setting concerned with the amount of communication needed between parties to compute a function.","types":["research area"],"url":"https://sah.borca.ai/concepts/co_ab8a8e7fdb4e0da3b0d2151b0b23c0e8"},{"public_id":"co_d40e17394ccc66fa7d98daf4ca4cbb00","name":"derandomization of algorithms","description":"The use of pseudorandom constructions to reduce or eliminate randomness in algorithms.","types":["application"],"url":"https://sah.borca.ai/concepts/co_d40e17394ccc66fa7d98daf4ca4cbb00"}],"related_claims":[],"url":"https://sah.borca.ai/claims/cl_da7470527ef68418e2c0cdfeaa4cf870"}