{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:DJAQFCE5Y6FU4BGK2K7ND2VF7W","short_pith_number":"pith:DJAQFCE5","canonical_record":{"source":{"id":"1705.01936","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-05-04T17:59:30Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"b97294530c0e500b663862ca6a43b4fa6e4fd50258a5f3bc1f261b7129df1f89","abstract_canon_sha256":"95a398bb56cdfb6d2b83c9860191b428a70dc035f6a182c2d417d23cc8e11f52"},"schema_version":"1.0"},"canonical_sha256":"1a4102889dc78b4e04cad2bed1eaa5fda55b5a54fe3c5d5984732ef626456b68","source":{"kind":"arxiv","id":"1705.01936","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.01936","created_at":"2026-05-18T00:38:18Z"},{"alias_kind":"arxiv_version","alias_value":"1705.01936v3","created_at":"2026-05-18T00:38:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.01936","created_at":"2026-05-18T00:38:18Z"},{"alias_kind":"pith_short_12","alias_value":"DJAQFCE5Y6FU","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_16","alias_value":"DJAQFCE5Y6FU4BGK","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_8","alias_value":"DJAQFCE5","created_at":"2026-05-18T12:31:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:DJAQFCE5Y6FU4BGK2K7ND2VF7W","target":"record","payload":{"canonical_record":{"source":{"id":"1705.01936","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-05-04T17:59:30Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"b97294530c0e500b663862ca6a43b4fa6e4fd50258a5f3bc1f261b7129df1f89","abstract_canon_sha256":"95a398bb56cdfb6d2b83c9860191b428a70dc035f6a182c2d417d23cc8e11f52"},"schema_version":"1.0"},"canonical_sha256":"1a4102889dc78b4e04cad2bed1eaa5fda55b5a54fe3c5d5984732ef626456b68","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:38:18.046037Z","signature_b64":"kvARPhr8BJxSmYee6VxbZDdPYiZAKBhZi9rVBeEC2lpA9pfYrhtSsUptJLiauQjQtBc6d044j7NLmZ0j4NYCBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1a4102889dc78b4e04cad2bed1eaa5fda55b5a54fe3c5d5984732ef626456b68","last_reissued_at":"2026-05-18T00:38:18.045240Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:38:18.045240Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1705.01936","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-05-18T00:38:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iFoGWRO2Nodlc45Nw5dBjdkp9fzZJxU6WOyjX2CL1JD2itQuwagjObSkDlRyhbM+ivL47Uz0Z1BH55L5wdnVDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T05:19:14.471910Z"},"content_sha256":"94addc0f58633dcf6d172ea6522c7fa6feea557de2b1c2664b530edc2499e8d2","schema_version":"1.0","event_id":"sha256:94addc0f58633dcf6d172ea6522c7fa6feea557de2b1c2664b530edc2499e8d2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:DJAQFCE5Y6FU4BGK2K7ND2VF7W","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Learning with Confident Examples: Rank Pruning for Robust Classification with Noisy Labels","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Curtis G. Northcutt, Isaac L. Chuang, Tailin Wu","submitted_at":"2017-05-04T17:59:30Z","abstract_excerpt":"Noisy PN learning is the problem of binary classification when training examples may be mislabeled (flipped) uniformly with noise rate rho1 for positive examples and rho0 for negative examples. We propose Rank Pruning (RP) to solve noisy PN learning and the open problem of estimating the noise rates, i.e. the fraction of wrong positive and negative labels. Unlike prior solutions, RP is time-efficient and general, requiring O(T) for any unrestricted choice of probabilistic classifier with T fitting time. We prove RP has consistent noise estimation and equivalent expected risk as learning with u"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.01936","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":""},"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-05-18T00:38:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4FTNjpb5CJU5Cpgbc0JLpKhi3cbky18ABEcMwuuzZynIZOreM16s6Nbj7HvzSXQ8Shi3zLGYn9qcdpjvsvDoBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T05:19:14.472429Z"},"content_sha256":"a90c383e6546de3c138cd27f642a3d85ac77ec4141fe8ff7decea7b05c317d5c","schema_version":"1.0","event_id":"sha256:a90c383e6546de3c138cd27f642a3d85ac77ec4141fe8ff7decea7b05c317d5c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DJAQFCE5Y6FU4BGK2K7ND2VF7W/bundle.json","state_url":"https://pith.science/pith/DJAQFCE5Y6FU4BGK2K7ND2VF7W/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DJAQFCE5Y6FU4BGK2K7ND2VF7W/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-05-27T05:19:14Z","links":{"resolver":"https://pith.science/pith/DJAQFCE5Y6FU4BGK2K7ND2VF7W","bundle":"https://pith.science/pith/DJAQFCE5Y6FU4BGK2K7ND2VF7W/bundle.json","state":"https://pith.science/pith/DJAQFCE5Y6FU4BGK2K7ND2VF7W/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DJAQFCE5Y6FU4BGK2K7ND2VF7W/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:DJAQFCE5Y6FU4BGK2K7ND2VF7W","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":"95a398bb56cdfb6d2b83c9860191b428a70dc035f6a182c2d417d23cc8e11f52","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-05-04T17:59:30Z","title_canon_sha256":"b97294530c0e500b663862ca6a43b4fa6e4fd50258a5f3bc1f261b7129df1f89"},"schema_version":"1.0","source":{"id":"1705.01936","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.01936","created_at":"2026-05-18T00:38:18Z"},{"alias_kind":"arxiv_version","alias_value":"1705.01936v3","created_at":"2026-05-18T00:38:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.01936","created_at":"2026-05-18T00:38:18Z"},{"alias_kind":"pith_short_12","alias_value":"DJAQFCE5Y6FU","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_16","alias_value":"DJAQFCE5Y6FU4BGK","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_8","alias_value":"DJAQFCE5","created_at":"2026-05-18T12:31:10Z"}],"graph_snapshots":[{"event_id":"sha256:a90c383e6546de3c138cd27f642a3d85ac77ec4141fe8ff7decea7b05c317d5c","target":"graph","created_at":"2026-05-18T00:38:18Z","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"},"paper":{"abstract_excerpt":"Noisy PN learning is the problem of binary classification when training examples may be mislabeled (flipped) uniformly with noise rate rho1 for positive examples and rho0 for negative examples. We propose Rank Pruning (RP) to solve noisy PN learning and the open problem of estimating the noise rates, i.e. the fraction of wrong positive and negative labels. Unlike prior solutions, RP is time-efficient and general, requiring O(T) for any unrestricted choice of probabilistic classifier with T fitting time. We prove RP has consistent noise estimation and equivalent expected risk as learning with u","authors_text":"Curtis G. Northcutt, Isaac L. Chuang, Tailin Wu","cross_cats":["cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-05-04T17:59:30Z","title":"Learning with Confident Examples: Rank Pruning for Robust Classification with Noisy Labels"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.01936","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:94addc0f58633dcf6d172ea6522c7fa6feea557de2b1c2664b530edc2499e8d2","target":"record","created_at":"2026-05-18T00:38:18Z","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":"95a398bb56cdfb6d2b83c9860191b428a70dc035f6a182c2d417d23cc8e11f52","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-05-04T17:59:30Z","title_canon_sha256":"b97294530c0e500b663862ca6a43b4fa6e4fd50258a5f3bc1f261b7129df1f89"},"schema_version":"1.0","source":{"id":"1705.01936","kind":"arxiv","version":3}},"canonical_sha256":"1a4102889dc78b4e04cad2bed1eaa5fda55b5a54fe3c5d5984732ef626456b68","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1a4102889dc78b4e04cad2bed1eaa5fda55b5a54fe3c5d5984732ef626456b68","first_computed_at":"2026-05-18T00:38:18.045240Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:38:18.045240Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"kvARPhr8BJxSmYee6VxbZDdPYiZAKBhZi9rVBeEC2lpA9pfYrhtSsUptJLiauQjQtBc6d044j7NLmZ0j4NYCBw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:38:18.046037Z","signed_message":"canonical_sha256_bytes"},"source_id":"1705.01936","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:94addc0f58633dcf6d172ea6522c7fa6feea557de2b1c2664b530edc2499e8d2","sha256:a90c383e6546de3c138cd27f642a3d85ac77ec4141fe8ff7decea7b05c317d5c"],"state_sha256":"f100266ca7a9217af0f0addb5b79bc55b0bfe124e076b3f4688916ed77aa48a5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yJR8pTzbxextiGsuSBsy4h6ad3YTShkbyD0UDMVeX8aOv+Q1qAk1gonf7FLmDK0q4KS4Fl+Sbsqi8n9e4LvIBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T05:19:14.475008Z","bundle_sha256":"74a090725de22fd015f948dddbf2e7f4e0a62dd473e475b0702be1ba27823562"}}