{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:GB4YJD4CDIVXEXH3NN2YP3DN2H","short_pith_number":"pith:GB4YJD4C","schema_version":"1.0","canonical_sha256":"3079848f821a2b725cfb6b7587ec6dd1c6fcb024b0ea9a02c69ab39f70d327cd","source":{"kind":"arxiv","id":"2106.15292","version":3},"attestation_state":"computed","paper":{"title":"Adaptive Sample Selection for Robust Learning under Label Noise","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.CV"],"primary_cat":"cs.LG","authors_text":"Deep Patel, P.S. Sastry","submitted_at":"2021-06-29T12:10:58Z","abstract_excerpt":"Deep Neural Networks (DNNs) have been shown to be susceptible to memorization or overfitting in the presence of noisily-labelled data. For the problem of robust learning under such noisy data, several algorithms have been proposed. A prominent class of algorithms rely on sample selection strategies wherein, essentially, a fraction of samples with loss values below a certain threshold are selected for training. These algorithms are sensitive to such thresholds, and it is difficult to fix or learn these thresholds. Often, these algorithms also require information such as label noise rates which "},"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":"2106.15292","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2021-06-29T12:10:58Z","cross_cats_sorted":["cs.AI","cs.CV"],"title_canon_sha256":"19430222d02026ed876e884bc5d51e1a7a862bf9f02d4ef87ea53c313ab64042","abstract_canon_sha256":"1ea8ea84fd87f027c599f66d52515681322294869bcb5f0d624094be5f5a79a1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:22:03.894186Z","signature_b64":"LL+HbnvJErCQ2P++NBRcNJXpF63nzr3Z7ipO4Wvyba9hEt4tTYOnjLoui40HYUimsZCVE8fEJpTLOUnjI2d2Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3079848f821a2b725cfb6b7587ec6dd1c6fcb024b0ea9a02c69ab39f70d327cd","last_reissued_at":"2026-07-05T05:22:03.893756Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:22:03.893756Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Adaptive Sample Selection for Robust Learning under Label Noise","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.CV"],"primary_cat":"cs.LG","authors_text":"Deep Patel, P.S. Sastry","submitted_at":"2021-06-29T12:10:58Z","abstract_excerpt":"Deep Neural Networks (DNNs) have been shown to be susceptible to memorization or overfitting in the presence of noisily-labelled data. For the problem of robust learning under such noisy data, several algorithms have been proposed. A prominent class of algorithms rely on sample selection strategies wherein, essentially, a fraction of samples with loss values below a certain threshold are selected for training. These algorithms are sensitive to such thresholds, and it is difficult to fix or learn these thresholds. Often, these algorithms also require information such as label noise rates which "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2106.15292","kind":"arxiv","version":3},"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/2106.15292/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":"2106.15292","created_at":"2026-07-05T05:22:03.893829+00:00"},{"alias_kind":"arxiv_version","alias_value":"2106.15292v3","created_at":"2026-07-05T05:22:03.893829+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2106.15292","created_at":"2026-07-05T05:22:03.893829+00:00"},{"alias_kind":"pith_short_12","alias_value":"GB4YJD4CDIVX","created_at":"2026-07-05T05:22:03.893829+00:00"},{"alias_kind":"pith_short_16","alias_value":"GB4YJD4CDIVXEXH3","created_at":"2026-07-05T05:22:03.893829+00:00"},{"alias_kind":"pith_short_8","alias_value":"GB4YJD4C","created_at":"2026-07-05T05:22:03.893829+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/GB4YJD4CDIVXEXH3NN2YP3DN2H","json":"https://pith.science/pith/GB4YJD4CDIVXEXH3NN2YP3DN2H.json","graph_json":"https://pith.science/api/pith-number/GB4YJD4CDIVXEXH3NN2YP3DN2H/graph.json","events_json":"https://pith.science/api/pith-number/GB4YJD4CDIVXEXH3NN2YP3DN2H/events.json","paper":"https://pith.science/paper/GB4YJD4C"},"agent_actions":{"view_html":"https://pith.science/pith/GB4YJD4CDIVXEXH3NN2YP3DN2H","download_json":"https://pith.science/pith/GB4YJD4CDIVXEXH3NN2YP3DN2H.json","view_paper":"https://pith.science/paper/GB4YJD4C","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2106.15292&json=true","fetch_graph":"https://pith.science/api/pith-number/GB4YJD4CDIVXEXH3NN2YP3DN2H/graph.json","fetch_events":"https://pith.science/api/pith-number/GB4YJD4CDIVXEXH3NN2YP3DN2H/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GB4YJD4CDIVXEXH3NN2YP3DN2H/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GB4YJD4CDIVXEXH3NN2YP3DN2H/action/storage_attestation","attest_author":"https://pith.science/pith/GB4YJD4CDIVXEXH3NN2YP3DN2H/action/author_attestation","sign_citation":"https://pith.science/pith/GB4YJD4CDIVXEXH3NN2YP3DN2H/action/citation_signature","submit_replication":"https://pith.science/pith/GB4YJD4CDIVXEXH3NN2YP3DN2H/action/replication_record"}},"created_at":"2026-07-05T05:22:03.893829+00:00","updated_at":"2026-07-05T05:22:03.893829+00:00"}