{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:AYP37CVYBEVG5AEI7BAKEA4IS6","short_pith_number":"pith:AYP37CVY","schema_version":"1.0","canonical_sha256":"061fbf8ab8092a6e8088f840a2038897a545d40ba7472108a203f23a724d4cf8","source":{"kind":"arxiv","id":"2101.04789","version":2},"attestation_state":"computed","paper":{"title":"Improving Classification Accuracy with Graph Filtering","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Bastien Pasdeloup, Carlos Lassance, Lucas Drumetz, Mounia Hamidouche, Vincent Gripon, Yuqing Hu","submitted_at":"2021-01-12T22:51:55Z","abstract_excerpt":"In machine learning, classifiers are typically susceptible to noise in the training data. In this work, we aim at reducing intra-class noise with the help of graph filtering to improve the classification performance. Considered graphs are obtained by connecting samples of the training set that belong to a same class depending on the similarity of their representation in a latent space. We show that the proposed graph filtering methodology has the effect of asymptotically reducing intra-class variance, while maintaining the mean. While our approach applies to all classification problems in gene"},"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.04789","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2021-01-12T22:51:55Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"135d2397595afa1e28d724983e0014e59c171dc14ecbaa035bb7fe725934d583","abstract_canon_sha256":"f3cdd7e341fa2163990a1c9c24a35de3c42401cdf2e0287bc825516b525d0a2f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:09:16.183049Z","signature_b64":"Wxomxb8GZGu9ODRPuieI5edMjFOcyvbPTBZWp3wlNaw+Li5ZZ7l1AL2SbdVGwxGGRalTBCovte9J3Tor3inKBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"061fbf8ab8092a6e8088f840a2038897a545d40ba7472108a203f23a724d4cf8","last_reissued_at":"2026-07-05T02:09:16.182614Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:09:16.182614Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Improving Classification Accuracy with Graph Filtering","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Bastien Pasdeloup, Carlos Lassance, Lucas Drumetz, Mounia Hamidouche, Vincent Gripon, Yuqing Hu","submitted_at":"2021-01-12T22:51:55Z","abstract_excerpt":"In machine learning, classifiers are typically susceptible to noise in the training data. In this work, we aim at reducing intra-class noise with the help of graph filtering to improve the classification performance. Considered graphs are obtained by connecting samples of the training set that belong to a same class depending on the similarity of their representation in a latent space. We show that the proposed graph filtering methodology has the effect of asymptotically reducing intra-class variance, while maintaining the mean. While our approach applies to all classification problems in gene"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2101.04789","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/2101.04789/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.04789","created_at":"2026-07-05T02:09:16.182673+00:00"},{"alias_kind":"arxiv_version","alias_value":"2101.04789v2","created_at":"2026-07-05T02:09:16.182673+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2101.04789","created_at":"2026-07-05T02:09:16.182673+00:00"},{"alias_kind":"pith_short_12","alias_value":"AYP37CVYBEVG","created_at":"2026-07-05T02:09:16.182673+00:00"},{"alias_kind":"pith_short_16","alias_value":"AYP37CVYBEVG5AEI","created_at":"2026-07-05T02:09:16.182673+00:00"},{"alias_kind":"pith_short_8","alias_value":"AYP37CVY","created_at":"2026-07-05T02:09:16.182673+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/AYP37CVYBEVG5AEI7BAKEA4IS6","json":"https://pith.science/pith/AYP37CVYBEVG5AEI7BAKEA4IS6.json","graph_json":"https://pith.science/api/pith-number/AYP37CVYBEVG5AEI7BAKEA4IS6/graph.json","events_json":"https://pith.science/api/pith-number/AYP37CVYBEVG5AEI7BAKEA4IS6/events.json","paper":"https://pith.science/paper/AYP37CVY"},"agent_actions":{"view_html":"https://pith.science/pith/AYP37CVYBEVG5AEI7BAKEA4IS6","download_json":"https://pith.science/pith/AYP37CVYBEVG5AEI7BAKEA4IS6.json","view_paper":"https://pith.science/paper/AYP37CVY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2101.04789&json=true","fetch_graph":"https://pith.science/api/pith-number/AYP37CVYBEVG5AEI7BAKEA4IS6/graph.json","fetch_events":"https://pith.science/api/pith-number/AYP37CVYBEVG5AEI7BAKEA4IS6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AYP37CVYBEVG5AEI7BAKEA4IS6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AYP37CVYBEVG5AEI7BAKEA4IS6/action/storage_attestation","attest_author":"https://pith.science/pith/AYP37CVYBEVG5AEI7BAKEA4IS6/action/author_attestation","sign_citation":"https://pith.science/pith/AYP37CVYBEVG5AEI7BAKEA4IS6/action/citation_signature","submit_replication":"https://pith.science/pith/AYP37CVYBEVG5AEI7BAKEA4IS6/action/replication_record"}},"created_at":"2026-07-05T02:09:16.182673+00:00","updated_at":"2026-07-05T02:09:16.182673+00:00"}