{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:K2QGPOTKZKPUP6MSGQB5QLZ37X","short_pith_number":"pith:K2QGPOTK","schema_version":"1.0","canonical_sha256":"56a067ba6aca9f47f9923403d82f3bfdc0c15df9d7b8331fd66176983fe6b2ca","source":{"kind":"arxiv","id":"2011.06188","version":1},"attestation_state":"computed","paper":{"title":"Evaluating Curriculum Learning Strategies in Neural Combinatorial Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NE"],"primary_cat":"cs.LG","authors_text":"Arash Afkanpour, Graham W. Taylor, Michal Lisicki","submitted_at":"2020-11-12T04:21:04Z","abstract_excerpt":"Neural combinatorial optimization (NCO) aims at designing problem-independent and efficient neural network-based strategies for solving combinatorial problems. The field recently experienced growth by successfully adapting architectures originally designed for machine translation. Even though the results are promising, a large gap still exists between NCO models and classic deterministic solvers, both in terms of accuracy and efficiency. One of the drawbacks of current approaches is the inefficiency of training on multiple problem sizes. Curriculum learning strategies have been shown helpful i"},"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":"2011.06188","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-11-12T04:21:04Z","cross_cats_sorted":["cs.NE"],"title_canon_sha256":"0bfe95acaa7889f6a226a91420f45e21bacf60bac9c0ecc5acee381974316ea1","abstract_canon_sha256":"7fbb7ea773031d746241459f548b545f46c5f9bd9614829bcdb97ca6fd15e921"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:51:12.796744Z","signature_b64":"z9tP08wR87g2gqh180wTxpSiEaIjdhhp05uVhSKDNQu4B6v18iOnk2kPeyrXdqY42KcTixlH44wBR1ksx/9sCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"56a067ba6aca9f47f9923403d82f3bfdc0c15df9d7b8331fd66176983fe6b2ca","last_reissued_at":"2026-07-05T01:51:12.796367Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:51:12.796367Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Evaluating Curriculum Learning Strategies in Neural Combinatorial Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NE"],"primary_cat":"cs.LG","authors_text":"Arash Afkanpour, Graham W. Taylor, Michal Lisicki","submitted_at":"2020-11-12T04:21:04Z","abstract_excerpt":"Neural combinatorial optimization (NCO) aims at designing problem-independent and efficient neural network-based strategies for solving combinatorial problems. The field recently experienced growth by successfully adapting architectures originally designed for machine translation. Even though the results are promising, a large gap still exists between NCO models and classic deterministic solvers, both in terms of accuracy and efficiency. One of the drawbacks of current approaches is the inefficiency of training on multiple problem sizes. Curriculum learning strategies have been shown helpful i"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2011.06188","kind":"arxiv","version":1},"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/2011.06188/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":"2011.06188","created_at":"2026-07-05T01:51:12.796421+00:00"},{"alias_kind":"arxiv_version","alias_value":"2011.06188v1","created_at":"2026-07-05T01:51:12.796421+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2011.06188","created_at":"2026-07-05T01:51:12.796421+00:00"},{"alias_kind":"pith_short_12","alias_value":"K2QGPOTKZKPU","created_at":"2026-07-05T01:51:12.796421+00:00"},{"alias_kind":"pith_short_16","alias_value":"K2QGPOTKZKPUP6MS","created_at":"2026-07-05T01:51:12.796421+00:00"},{"alias_kind":"pith_short_8","alias_value":"K2QGPOTK","created_at":"2026-07-05T01:51:12.796421+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2508.02510","citing_title":"On Distributional Dependent Performance of Classical and Neural Routing Solvers","ref_index":32,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/K2QGPOTKZKPUP6MSGQB5QLZ37X","json":"https://pith.science/pith/K2QGPOTKZKPUP6MSGQB5QLZ37X.json","graph_json":"https://pith.science/api/pith-number/K2QGPOTKZKPUP6MSGQB5QLZ37X/graph.json","events_json":"https://pith.science/api/pith-number/K2QGPOTKZKPUP6MSGQB5QLZ37X/events.json","paper":"https://pith.science/paper/K2QGPOTK"},"agent_actions":{"view_html":"https://pith.science/pith/K2QGPOTKZKPUP6MSGQB5QLZ37X","download_json":"https://pith.science/pith/K2QGPOTKZKPUP6MSGQB5QLZ37X.json","view_paper":"https://pith.science/paper/K2QGPOTK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2011.06188&json=true","fetch_graph":"https://pith.science/api/pith-number/K2QGPOTKZKPUP6MSGQB5QLZ37X/graph.json","fetch_events":"https://pith.science/api/pith-number/K2QGPOTKZKPUP6MSGQB5QLZ37X/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/K2QGPOTKZKPUP6MSGQB5QLZ37X/action/timestamp_anchor","attest_storage":"https://pith.science/pith/K2QGPOTKZKPUP6MSGQB5QLZ37X/action/storage_attestation","attest_author":"https://pith.science/pith/K2QGPOTKZKPUP6MSGQB5QLZ37X/action/author_attestation","sign_citation":"https://pith.science/pith/K2QGPOTKZKPUP6MSGQB5QLZ37X/action/citation_signature","submit_replication":"https://pith.science/pith/K2QGPOTKZKPUP6MSGQB5QLZ37X/action/replication_record"}},"created_at":"2026-07-05T01:51:12.796421+00:00","updated_at":"2026-07-05T01:51:12.796421+00:00"}