{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:HAZPUD3HEJPSJ4DZPS6LC5BUTI","short_pith_number":"pith:HAZPUD3H","schema_version":"1.0","canonical_sha256":"3832fa0f67225f24f0797cbcb174349a25c805fc051b9ac0c7169c88486fca50","source":{"kind":"arxiv","id":"2007.05503","version":1},"attestation_state":"computed","paper":{"title":"Predicting Bit Error Rate from Meta Information using Random Forests","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"eess.SP","authors_text":"Hussein Metwaly Saad, Jianyuan Yu, R. Michael Buehrer, Yue Xu","submitted_at":"2020-07-10T17:29:22Z","abstract_excerpt":"With the increasing power of machine learning-based reasoning, the use of meta-information (e.g., digital signal modulation parameters, channel conditions, etc.) to predict the performance of various signal processing techniques has become feasible. One such problem of practical interest is choosing a proper interference mitigation method based on the meta information of the received signal. Since heuristic table-based methods suffer from limited prediction capability for unseen cases, we propose a recommendation system based on the use of Random Forests (RF). Specifically, RF used to predict "},"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":"2007.05503","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SP","submitted_at":"2020-07-10T17:29:22Z","cross_cats_sorted":[],"title_canon_sha256":"21a2d91e16c85525ef1563fa10ee525a60085ad26b4f1fbe7c0aed0bb304ca09","abstract_canon_sha256":"66c6b0c878e5e45f0aa5c5cd73e1a0a04b413baeb288609e90830634e8a7d9a8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:17:47.559295Z","signature_b64":"7WVZbxhsLHiWwImOduChnmD2s0j4ZohJy1NbvzX/5W6ool38Z2B287iV2MlYQIaSk3QXoxGPgth97i0V+DTvBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3832fa0f67225f24f0797cbcb174349a25c805fc051b9ac0c7169c88486fca50","last_reissued_at":"2026-07-05T01:17:47.558910Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:17:47.558910Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Predicting Bit Error Rate from Meta Information using Random Forests","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"eess.SP","authors_text":"Hussein Metwaly Saad, Jianyuan Yu, R. Michael Buehrer, Yue Xu","submitted_at":"2020-07-10T17:29:22Z","abstract_excerpt":"With the increasing power of machine learning-based reasoning, the use of meta-information (e.g., digital signal modulation parameters, channel conditions, etc.) to predict the performance of various signal processing techniques has become feasible. One such problem of practical interest is choosing a proper interference mitigation method based on the meta information of the received signal. Since heuristic table-based methods suffer from limited prediction capability for unseen cases, we propose a recommendation system based on the use of Random Forests (RF). Specifically, RF used to predict "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2007.05503","kind":"arxiv","version":1},"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/2007.05503/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":"2007.05503","created_at":"2026-07-05T01:17:47.558965+00:00"},{"alias_kind":"arxiv_version","alias_value":"2007.05503v1","created_at":"2026-07-05T01:17:47.558965+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2007.05503","created_at":"2026-07-05T01:17:47.558965+00:00"},{"alias_kind":"pith_short_12","alias_value":"HAZPUD3HEJPS","created_at":"2026-07-05T01:17:47.558965+00:00"},{"alias_kind":"pith_short_16","alias_value":"HAZPUD3HEJPSJ4DZ","created_at":"2026-07-05T01:17:47.558965+00:00"},{"alias_kind":"pith_short_8","alias_value":"HAZPUD3H","created_at":"2026-07-05T01:17:47.558965+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/HAZPUD3HEJPSJ4DZPS6LC5BUTI","json":"https://pith.science/pith/HAZPUD3HEJPSJ4DZPS6LC5BUTI.json","graph_json":"https://pith.science/api/pith-number/HAZPUD3HEJPSJ4DZPS6LC5BUTI/graph.json","events_json":"https://pith.science/api/pith-number/HAZPUD3HEJPSJ4DZPS6LC5BUTI/events.json","paper":"https://pith.science/paper/HAZPUD3H"},"agent_actions":{"view_html":"https://pith.science/pith/HAZPUD3HEJPSJ4DZPS6LC5BUTI","download_json":"https://pith.science/pith/HAZPUD3HEJPSJ4DZPS6LC5BUTI.json","view_paper":"https://pith.science/paper/HAZPUD3H","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2007.05503&json=true","fetch_graph":"https://pith.science/api/pith-number/HAZPUD3HEJPSJ4DZPS6LC5BUTI/graph.json","fetch_events":"https://pith.science/api/pith-number/HAZPUD3HEJPSJ4DZPS6LC5BUTI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HAZPUD3HEJPSJ4DZPS6LC5BUTI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HAZPUD3HEJPSJ4DZPS6LC5BUTI/action/storage_attestation","attest_author":"https://pith.science/pith/HAZPUD3HEJPSJ4DZPS6LC5BUTI/action/author_attestation","sign_citation":"https://pith.science/pith/HAZPUD3HEJPSJ4DZPS6LC5BUTI/action/citation_signature","submit_replication":"https://pith.science/pith/HAZPUD3HEJPSJ4DZPS6LC5BUTI/action/replication_record"}},"created_at":"2026-07-05T01:17:47.558965+00:00","updated_at":"2026-07-05T01:17:47.558965+00:00"}