{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:IQXFNQFOJOOMLB4RXQJXI3QYBB","short_pith_number":"pith:IQXFNQFO","schema_version":"1.0","canonical_sha256":"442e56c0ae4b9cc58791bc13746e18085b84cc2bfc8f43b641a63a4c66155c05","source":{"kind":"arxiv","id":"2411.14612","version":2},"attestation_state":"computed","paper":{"title":"Exploiting Boosting in Hyperdimensional Computing for Enhanced Reliability in Healthcare","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Hamza Errahmouni Barkam, Mohsen Imani, Sanggeon Yun, Shaahin Angizi, Sungheon Jeong, Yeseong Kim","submitted_at":"2024-11-21T22:28:45Z","abstract_excerpt":"Hyperdimensional computing (HDC) enables efficient data encoding and processing in high-dimensional space, benefiting machine learning and data analysis. However, underutilization of these spaces can lead to overfitting and reduced model reliability, especially in data-limited systems a critical issue in sectors like healthcare that demand robustness and consistent performance. We introduce BoostHD, an approach that applies boosting algorithms to partition the hyperdimensional space into subspaces, creating an ensemble of weak learners. By integrating boosting with HDC, BoostHD enhances perfor"},"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":"2411.14612","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2024-11-21T22:28:45Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"b7350de669aa1573a6e92780f14d345da9cf4e7ef3423442ba9043d0578614cb","abstract_canon_sha256":"521a43e8252bc9ee365f3a8675f699d2805f94f095bcb60c321357e14a44418e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:00:43.887799Z","signature_b64":"qNN3WxFiV7HWpEzS+SO12wqYLtH/s6z8Gcbz/qMV53D77Te3l0U+6Rm+8jZRp+f/reEYbaOUZ1mV3JVzejzcAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"442e56c0ae4b9cc58791bc13746e18085b84cc2bfc8f43b641a63a4c66155c05","last_reissued_at":"2026-07-05T10:00:43.887351Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:00:43.887351Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Exploiting Boosting in Hyperdimensional Computing for Enhanced Reliability in Healthcare","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Hamza Errahmouni Barkam, Mohsen Imani, Sanggeon Yun, Shaahin Angizi, Sungheon Jeong, Yeseong Kim","submitted_at":"2024-11-21T22:28:45Z","abstract_excerpt":"Hyperdimensional computing (HDC) enables efficient data encoding and processing in high-dimensional space, benefiting machine learning and data analysis. However, underutilization of these spaces can lead to overfitting and reduced model reliability, especially in data-limited systems a critical issue in sectors like healthcare that demand robustness and consistent performance. We introduce BoostHD, an approach that applies boosting algorithms to partition the hyperdimensional space into subspaces, creating an ensemble of weak learners. By integrating boosting with HDC, BoostHD enhances perfor"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2411.14612","kind":"arxiv","version":2},"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/2411.14612/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":"2411.14612","created_at":"2026-07-05T10:00:43.887410+00:00"},{"alias_kind":"arxiv_version","alias_value":"2411.14612v2","created_at":"2026-07-05T10:00:43.887410+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.14612","created_at":"2026-07-05T10:00:43.887410+00:00"},{"alias_kind":"pith_short_12","alias_value":"IQXFNQFOJOOM","created_at":"2026-07-05T10:00:43.887410+00:00"},{"alias_kind":"pith_short_16","alias_value":"IQXFNQFOJOOMLB4R","created_at":"2026-07-05T10:00:43.887410+00:00"},{"alias_kind":"pith_short_8","alias_value":"IQXFNQFO","created_at":"2026-07-05T10:00:43.887410+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2411.09072","citing_title":"Continuous GNN-based Anomaly Detection on Edge using Efficient Adaptive Knowledge Graph Learning","ref_index":25,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/IQXFNQFOJOOMLB4RXQJXI3QYBB","json":"https://pith.science/pith/IQXFNQFOJOOMLB4RXQJXI3QYBB.json","graph_json":"https://pith.science/api/pith-number/IQXFNQFOJOOMLB4RXQJXI3QYBB/graph.json","events_json":"https://pith.science/api/pith-number/IQXFNQFOJOOMLB4RXQJXI3QYBB/events.json","paper":"https://pith.science/paper/IQXFNQFO"},"agent_actions":{"view_html":"https://pith.science/pith/IQXFNQFOJOOMLB4RXQJXI3QYBB","download_json":"https://pith.science/pith/IQXFNQFOJOOMLB4RXQJXI3QYBB.json","view_paper":"https://pith.science/paper/IQXFNQFO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2411.14612&json=true","fetch_graph":"https://pith.science/api/pith-number/IQXFNQFOJOOMLB4RXQJXI3QYBB/graph.json","fetch_events":"https://pith.science/api/pith-number/IQXFNQFOJOOMLB4RXQJXI3QYBB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IQXFNQFOJOOMLB4RXQJXI3QYBB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IQXFNQFOJOOMLB4RXQJXI3QYBB/action/storage_attestation","attest_author":"https://pith.science/pith/IQXFNQFOJOOMLB4RXQJXI3QYBB/action/author_attestation","sign_citation":"https://pith.science/pith/IQXFNQFOJOOMLB4RXQJXI3QYBB/action/citation_signature","submit_replication":"https://pith.science/pith/IQXFNQFOJOOMLB4RXQJXI3QYBB/action/replication_record"}},"created_at":"2026-07-05T10:00:43.887410+00:00","updated_at":"2026-07-05T10:00:43.887410+00:00"}