{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2021:GB4YJD4CDIVXEXH3NN2YP3DN2H","short_pith_number":"pith:GB4YJD4C","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"},"canonical_sha256":"3079848f821a2b725cfb6b7587ec6dd1c6fcb024b0ea9a02c69ab39f70d327cd","source":{"kind":"arxiv","id":"2106.15292","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2106.15292","created_at":"2026-07-05T05:22:03Z"},{"alias_kind":"arxiv_version","alias_value":"2106.15292v3","created_at":"2026-07-05T05:22:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2106.15292","created_at":"2026-07-05T05:22:03Z"},{"alias_kind":"pith_short_12","alias_value":"GB4YJD4CDIVX","created_at":"2026-07-05T05:22:03Z"},{"alias_kind":"pith_short_16","alias_value":"GB4YJD4CDIVXEXH3","created_at":"2026-07-05T05:22:03Z"},{"alias_kind":"pith_short_8","alias_value":"GB4YJD4C","created_at":"2026-07-05T05:22:03Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2021:GB4YJD4CDIVXEXH3NN2YP3DN2H","target":"record","payload":{"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"},"canonical_sha256":"3079848f821a2b725cfb6b7587ec6dd1c6fcb024b0ea9a02c69ab39f70d327cd","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"},"source_kind":"arxiv","source_id":"2106.15292","source_version":3,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T05:22:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BCgpujX6dsUE6R65k8zTRJBi0SUmjpkhhx17L2dudVa/cDwbDFESUJPK4AWFmD9uB5N8V6MoMthv5LHTvSvBDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T13:52:51.632271Z"},"content_sha256":"d1f7b75405fb385cb48f0b8166d8350551bffdabb054c0430b7491900e78e6b2","schema_version":"1.0","event_id":"sha256:d1f7b75405fb385cb48f0b8166d8350551bffdabb054c0430b7491900e78e6b2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2021:GB4YJD4CDIVXEXH3NN2YP3DN2H","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T05:22:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MXV95q9uWlgwmQnSrBRQCvqXzMpi4TxOKA8CQScS1eQZyu2WshKSpGfuHx39SMTMKpOLYDCj83aSS2OhU/0/BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T13:52:51.633190Z"},"content_sha256":"3433d69c5b7e9377cd9f49f4949bd144e934cf6d6d23e10ed295933897f9d093","schema_version":"1.0","event_id":"sha256:3433d69c5b7e9377cd9f49f4949bd144e934cf6d6d23e10ed295933897f9d093"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GB4YJD4CDIVXEXH3NN2YP3DN2H/bundle.json","state_url":"https://pith.science/pith/GB4YJD4CDIVXEXH3NN2YP3DN2H/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GB4YJD4CDIVXEXH3NN2YP3DN2H/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-08-08T13:52:51Z","links":{"resolver":"https://pith.science/pith/GB4YJD4CDIVXEXH3NN2YP3DN2H","bundle":"https://pith.science/pith/GB4YJD4CDIVXEXH3NN2YP3DN2H/bundle.json","state":"https://pith.science/pith/GB4YJD4CDIVXEXH3NN2YP3DN2H/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GB4YJD4CDIVXEXH3NN2YP3DN2H/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2021:GB4YJD4CDIVXEXH3NN2YP3DN2H","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"1ea8ea84fd87f027c599f66d52515681322294869bcb5f0d624094be5f5a79a1","cross_cats_sorted":["cs.AI","cs.CV"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2021-06-29T12:10:58Z","title_canon_sha256":"19430222d02026ed876e884bc5d51e1a7a862bf9f02d4ef87ea53c313ab64042"},"schema_version":"1.0","source":{"id":"2106.15292","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2106.15292","created_at":"2026-07-05T05:22:03Z"},{"alias_kind":"arxiv_version","alias_value":"2106.15292v3","created_at":"2026-07-05T05:22:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2106.15292","created_at":"2026-07-05T05:22:03Z"},{"alias_kind":"pith_short_12","alias_value":"GB4YJD4CDIVX","created_at":"2026-07-05T05:22:03Z"},{"alias_kind":"pith_short_16","alias_value":"GB4YJD4CDIVXEXH3","created_at":"2026-07-05T05:22:03Z"},{"alias_kind":"pith_short_8","alias_value":"GB4YJD4C","created_at":"2026-07-05T05:22:03Z"}],"graph_snapshots":[{"event_id":"sha256:3433d69c5b7e9377cd9f49f4949bd144e934cf6d6d23e10ed295933897f9d093","target":"graph","created_at":"2026-07-05T05:22:03Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2106.15292/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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 ","authors_text":"Deep Patel, P.S. Sastry","cross_cats":["cs.AI","cs.CV"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2021-06-29T12:10:58Z","title":"Adaptive Sample Selection for Robust Learning under Label Noise"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2106.15292","kind":"arxiv","version":3},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:d1f7b75405fb385cb48f0b8166d8350551bffdabb054c0430b7491900e78e6b2","target":"record","created_at":"2026-07-05T05:22:03Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"1ea8ea84fd87f027c599f66d52515681322294869bcb5f0d624094be5f5a79a1","cross_cats_sorted":["cs.AI","cs.CV"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2021-06-29T12:10:58Z","title_canon_sha256":"19430222d02026ed876e884bc5d51e1a7a862bf9f02d4ef87ea53c313ab64042"},"schema_version":"1.0","source":{"id":"2106.15292","kind":"arxiv","version":3}},"canonical_sha256":"3079848f821a2b725cfb6b7587ec6dd1c6fcb024b0ea9a02c69ab39f70d327cd","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3079848f821a2b725cfb6b7587ec6dd1c6fcb024b0ea9a02c69ab39f70d327cd","first_computed_at":"2026-07-05T05:22:03.893756Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T05:22:03.893756Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"LL+HbnvJErCQ2P++NBRcNJXpF63nzr3Z7ipO4Wvyba9hEt4tTYOnjLoui40HYUimsZCVE8fEJpTLOUnjI2d2Dg==","signature_status":"signed_v1","signed_at":"2026-07-05T05:22:03.894186Z","signed_message":"canonical_sha256_bytes"},"source_id":"2106.15292","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d1f7b75405fb385cb48f0b8166d8350551bffdabb054c0430b7491900e78e6b2","sha256:3433d69c5b7e9377cd9f49f4949bd144e934cf6d6d23e10ed295933897f9d093"],"state_sha256":"3b4494b311d559ba49b6747f87c23c0ed848bb0e25cd9067cfcde428fad93003"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7KY0lx+IaKb7DsCCIAemi5G18ITLXMzS06VDk/KFezCfAIXFnh25Y4lr6S3Tdgy197lNWbpPGE3+WaHdq/74Dw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-08T13:52:51.640182Z","bundle_sha256":"605e8f5446289cf00a71d273f090dbdd7a5cf8c6bfa5a0110491903441fed13c"}}