{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:ULDATPI7PMEBAQ7DFRHW3CCBNP","short_pith_number":"pith:ULDATPI7","schema_version":"1.0","canonical_sha256":"a2c609bd1f7b081043e32c4f6d88416bcecb51ff7392a1309b9cb83e597b1d98","source":{"kind":"arxiv","id":"2101.09577","version":1},"attestation_state":"computed","paper":{"title":"ReliefE: Feature Ranking in High-dimensional Spaces via Manifold Embeddings","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Bla\\v{z} \\v{S}krlj, Matej Petkovi\\'c, Nada Lavra\\v{c}, Sa\\v{s}o D\\v{z}eroski","submitted_at":"2021-01-23T20:23:31Z","abstract_excerpt":"Feature ranking has been widely adopted in machine learning applications such as high-throughput biology and social sciences. The approaches of the popular Relief family of algorithms assign importances to features by iteratively accounting for nearest relevant and irrelevant instances. Despite their high utility, these algorithms can be computationally expensive and not-well suited for high-dimensional sparse input spaces. In contrast, recent embedding-based methods learn compact, low-dimensional representations, potentially facilitating down-stream learning capabilities of conventional learn"},"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":"2101.09577","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2021-01-23T20:23:31Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"c1d90661b9d99e060abcf28389bd0a7bf044af4e83dd374126c9e8934e8507de","abstract_canon_sha256":"7bbcf8b84da2248e46e69aef2a067042fa1ab5c0042ad03eb2ea0f3eb76f51f6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:09:20.231247Z","signature_b64":"d2dhSBj1hVlqo5pJZBcVrlRjUurrmP7K4YMtYV4WW4FpQKFfczSliZ/JA6KmDAw5tKdf+wy9RQDbZqMGaBoiDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a2c609bd1f7b081043e32c4f6d88416bcecb51ff7392a1309b9cb83e597b1d98","last_reissued_at":"2026-07-05T02:09:20.230902Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:09:20.230902Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"ReliefE: Feature Ranking in High-dimensional Spaces via Manifold Embeddings","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Bla\\v{z} \\v{S}krlj, Matej Petkovi\\'c, Nada Lavra\\v{c}, Sa\\v{s}o D\\v{z}eroski","submitted_at":"2021-01-23T20:23:31Z","abstract_excerpt":"Feature ranking has been widely adopted in machine learning applications such as high-throughput biology and social sciences. The approaches of the popular Relief family of algorithms assign importances to features by iteratively accounting for nearest relevant and irrelevant instances. Despite their high utility, these algorithms can be computationally expensive and not-well suited for high-dimensional sparse input spaces. In contrast, recent embedding-based methods learn compact, low-dimensional representations, potentially facilitating down-stream learning capabilities of conventional learn"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2101.09577","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/2101.09577/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":"2101.09577","created_at":"2026-07-05T02:09:20.230963+00:00"},{"alias_kind":"arxiv_version","alias_value":"2101.09577v1","created_at":"2026-07-05T02:09:20.230963+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2101.09577","created_at":"2026-07-05T02:09:20.230963+00:00"},{"alias_kind":"pith_short_12","alias_value":"ULDATPI7PMEB","created_at":"2026-07-05T02:09:20.230963+00:00"},{"alias_kind":"pith_short_16","alias_value":"ULDATPI7PMEBAQ7D","created_at":"2026-07-05T02:09:20.230963+00:00"},{"alias_kind":"pith_short_8","alias_value":"ULDATPI7","created_at":"2026-07-05T02:09:20.230963+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/ULDATPI7PMEBAQ7DFRHW3CCBNP","json":"https://pith.science/pith/ULDATPI7PMEBAQ7DFRHW3CCBNP.json","graph_json":"https://pith.science/api/pith-number/ULDATPI7PMEBAQ7DFRHW3CCBNP/graph.json","events_json":"https://pith.science/api/pith-number/ULDATPI7PMEBAQ7DFRHW3CCBNP/events.json","paper":"https://pith.science/paper/ULDATPI7"},"agent_actions":{"view_html":"https://pith.science/pith/ULDATPI7PMEBAQ7DFRHW3CCBNP","download_json":"https://pith.science/pith/ULDATPI7PMEBAQ7DFRHW3CCBNP.json","view_paper":"https://pith.science/paper/ULDATPI7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2101.09577&json=true","fetch_graph":"https://pith.science/api/pith-number/ULDATPI7PMEBAQ7DFRHW3CCBNP/graph.json","fetch_events":"https://pith.science/api/pith-number/ULDATPI7PMEBAQ7DFRHW3CCBNP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ULDATPI7PMEBAQ7DFRHW3CCBNP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ULDATPI7PMEBAQ7DFRHW3CCBNP/action/storage_attestation","attest_author":"https://pith.science/pith/ULDATPI7PMEBAQ7DFRHW3CCBNP/action/author_attestation","sign_citation":"https://pith.science/pith/ULDATPI7PMEBAQ7DFRHW3CCBNP/action/citation_signature","submit_replication":"https://pith.science/pith/ULDATPI7PMEBAQ7DFRHW3CCBNP/action/replication_record"}},"created_at":"2026-07-05T02:09:20.230963+00:00","updated_at":"2026-07-05T02:09:20.230963+00:00"}