{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:DNCG4EPQYWOSSRE5NCTUKJYCXY","short_pith_number":"pith:DNCG4EPQ","schema_version":"1.0","canonical_sha256":"1b446e11f0c59d29449d68a7452702be22e4ca64be798d18553ef61a51fab684","source":{"kind":"arxiv","id":"2101.10382","version":3},"attestation_state":"computed","paper":{"title":"Curriculum Learning: A Survey","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CL","cs.CV"],"primary_cat":"cs.LG","authors_text":"Nicu Sebe, Paolo Rota, Petru Soviany, Radu Tudor Ionescu","submitted_at":"2021-01-25T20:08:32Z","abstract_excerpt":"Training machine learning models in a meaningful order, from the easy samples to the hard ones, using curriculum learning can provide performance improvements over the standard training approach based on random data shuffling, without any additional computational costs. Curriculum learning strategies have been successfully employed in all areas of machine learning, in a wide range of tasks. However, the necessity of finding a way to rank the samples from easy to hard, as well as the right pacing function for introducing more difficult data can limit the usage of the curriculum approaches. In t"},"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.10382","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2021-01-25T20:08:32Z","cross_cats_sorted":["cs.CL","cs.CV"],"title_canon_sha256":"3505c4f968395162d7788f33e95ac74ef0153ffbb335927308fb08f116c625ef","abstract_canon_sha256":"8845b7c00122377934d48e510ac405d6dc555851324e951c7c97b0eb4885c0fd"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:13:08.886576Z","signature_b64":"KKf2thjb90ZXxscsEHUfnqp2WZKw2HaLx7tXqBw5lbYdu1ldMlsPJ9HnXlLwkC8u58Hr1tJd3Er04y2EX/kKBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1b446e11f0c59d29449d68a7452702be22e4ca64be798d18553ef61a51fab684","last_reissued_at":"2026-07-05T04:13:08.886150Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:13:08.886150Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Curriculum Learning: A Survey","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CL","cs.CV"],"primary_cat":"cs.LG","authors_text":"Nicu Sebe, Paolo Rota, Petru Soviany, Radu Tudor Ionescu","submitted_at":"2021-01-25T20:08:32Z","abstract_excerpt":"Training machine learning models in a meaningful order, from the easy samples to the hard ones, using curriculum learning can provide performance improvements over the standard training approach based on random data shuffling, without any additional computational costs. Curriculum learning strategies have been successfully employed in all areas of machine learning, in a wide range of tasks. However, the necessity of finding a way to rank the samples from easy to hard, as well as the right pacing function for introducing more difficult data can limit the usage of the curriculum approaches. In t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2101.10382","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/2101.10382/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.10382","created_at":"2026-07-05T04:13:08.886204+00:00"},{"alias_kind":"arxiv_version","alias_value":"2101.10382v3","created_at":"2026-07-05T04:13:08.886204+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2101.10382","created_at":"2026-07-05T04:13:08.886204+00:00"},{"alias_kind":"pith_short_12","alias_value":"DNCG4EPQYWOS","created_at":"2026-07-05T04:13:08.886204+00:00"},{"alias_kind":"pith_short_16","alias_value":"DNCG4EPQYWOSSRE5","created_at":"2026-07-05T04:13:08.886204+00:00"},{"alias_kind":"pith_short_8","alias_value":"DNCG4EPQ","created_at":"2026-07-05T04:13:08.886204+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":3,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2504.09844","citing_title":"MegaScale-Data: Scaling Dataloader for Multisource Large Foundation Model Training","ref_index":63,"is_internal_anchor":false},{"citing_arxiv_id":"2602.07299","citing_title":"Optimizing Chlorination in Water Distribution Systems via Surrogate-assisted Neuroevolution","ref_index":34,"is_internal_anchor":false},{"citing_arxiv_id":"2605.06688","citing_title":"American Options Pricing under Heston Model via Curriculum Learning in Coupled PINNs","ref_index":18,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/DNCG4EPQYWOSSRE5NCTUKJYCXY","json":"https://pith.science/pith/DNCG4EPQYWOSSRE5NCTUKJYCXY.json","graph_json":"https://pith.science/api/pith-number/DNCG4EPQYWOSSRE5NCTUKJYCXY/graph.json","events_json":"https://pith.science/api/pith-number/DNCG4EPQYWOSSRE5NCTUKJYCXY/events.json","paper":"https://pith.science/paper/DNCG4EPQ"},"agent_actions":{"view_html":"https://pith.science/pith/DNCG4EPQYWOSSRE5NCTUKJYCXY","download_json":"https://pith.science/pith/DNCG4EPQYWOSSRE5NCTUKJYCXY.json","view_paper":"https://pith.science/paper/DNCG4EPQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2101.10382&json=true","fetch_graph":"https://pith.science/api/pith-number/DNCG4EPQYWOSSRE5NCTUKJYCXY/graph.json","fetch_events":"https://pith.science/api/pith-number/DNCG4EPQYWOSSRE5NCTUKJYCXY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DNCG4EPQYWOSSRE5NCTUKJYCXY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DNCG4EPQYWOSSRE5NCTUKJYCXY/action/storage_attestation","attest_author":"https://pith.science/pith/DNCG4EPQYWOSSRE5NCTUKJYCXY/action/author_attestation","sign_citation":"https://pith.science/pith/DNCG4EPQYWOSSRE5NCTUKJYCXY/action/citation_signature","submit_replication":"https://pith.science/pith/DNCG4EPQYWOSSRE5NCTUKJYCXY/action/replication_record"}},"created_at":"2026-07-05T04:13:08.886204+00:00","updated_at":"2026-07-05T04:13:08.886204+00:00"}