{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:M2U7ZJPNYMXL2BOIQF6O566A57","short_pith_number":"pith:M2U7ZJPN","canonical_record":{"source":{"id":"1803.08475","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-03-22T17:22:24Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"0252e7163b542178c1f64441b9002eaf8ce5fdc0fed2e5d325a2cab28c9fba76","abstract_canon_sha256":"4f457f12186e878cc10466d515459017070bb486a4b1ed8e0f26598102e80f7f"},"schema_version":"1.0"},"canonical_sha256":"66a9fca5edc32ebd05c8817ceefbc0efeade192af3a626c02135d09b114d4d1a","source":{"kind":"arxiv","id":"1803.08475","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1803.08475","created_at":"2026-05-17T23:54:34Z"},{"alias_kind":"arxiv_version","alias_value":"1803.08475v3","created_at":"2026-05-17T23:54:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.08475","created_at":"2026-05-17T23:54:34Z"},{"alias_kind":"pith_short_12","alias_value":"M2U7ZJPNYMXL","created_at":"2026-05-18T12:32:37Z"},{"alias_kind":"pith_short_16","alias_value":"M2U7ZJPNYMXL2BOI","created_at":"2026-05-18T12:32:37Z"},{"alias_kind":"pith_short_8","alias_value":"M2U7ZJPN","created_at":"2026-05-18T12:32:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:M2U7ZJPNYMXL2BOIQF6O566A57","target":"record","payload":{"canonical_record":{"source":{"id":"1803.08475","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-03-22T17:22:24Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"0252e7163b542178c1f64441b9002eaf8ce5fdc0fed2e5d325a2cab28c9fba76","abstract_canon_sha256":"4f457f12186e878cc10466d515459017070bb486a4b1ed8e0f26598102e80f7f"},"schema_version":"1.0"},"canonical_sha256":"66a9fca5edc32ebd05c8817ceefbc0efeade192af3a626c02135d09b114d4d1a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:54:34.501020Z","signature_b64":"cjCObmcKdII0ypaE/EHiItqIG0yZ0HkAlkzX/3toXsEfgcMDo2/9D0lGawlHy8PGNzzaJDl+lehQt0v5m8BCDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"66a9fca5edc32ebd05c8817ceefbc0efeade192af3a626c02135d09b114d4d1a","last_reissued_at":"2026-05-17T23:54:34.500430Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:54:34.500430Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1803.08475","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-17T23:54:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ggop5unAEvQl/ABjhxsVaQwUKsx1pv3X1Z5eshd18vj2vcN2wYfTChI353ypS50ptACtGZz+d3cj9Z4JXKIQBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T21:27:38.969869Z"},"content_sha256":"e59998f361ff4a179ad55fb75ed080e3049c150b2d94d855bbc4286f42912cd6","schema_version":"1.0","event_id":"sha256:e59998f361ff4a179ad55fb75ed080e3049c150b2d94d855bbc4286f42912cd6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:M2U7ZJPNYMXL2BOIQF6O566A57","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Attention, Learn to Solve Routing Problems!","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Herke van Hoof, Max Welling, Wouter Kool","submitted_at":"2018-03-22T17:22:24Z","abstract_excerpt":"The recently presented idea to learn heuristics for combinatorial optimization problems is promising as it can save costly development. However, to push this idea towards practical implementation, we need better models and better ways of training. We contribute in both directions: we propose a model based on attention layers with benefits over the Pointer Network and we show how to train this model using REINFORCE with a simple baseline based on a deterministic greedy rollout, which we find is more efficient than using a value function. We significantly improve over recent learned heuristics f"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.08475","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-17T23:54:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VEZsE96hPx82xBdeVefk1lrnw0rGtfa0/Mj1Vkt5JrJIziLw/j2iw45QiOMLS9KUeAOCr78tAtYUhHSel31oCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T21:27:38.970618Z"},"content_sha256":"5ec05123f030f0cb0ac1eee0a6b61d5c03e7bc00ca526cca8b02503a50487162","schema_version":"1.0","event_id":"sha256:5ec05123f030f0cb0ac1eee0a6b61d5c03e7bc00ca526cca8b02503a50487162"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/M2U7ZJPNYMXL2BOIQF6O566A57/bundle.json","state_url":"https://pith.science/pith/M2U7ZJPNYMXL2BOIQF6O566A57/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/M2U7ZJPNYMXL2BOIQF6O566A57/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-06-08T21:27:38Z","links":{"resolver":"https://pith.science/pith/M2U7ZJPNYMXL2BOIQF6O566A57","bundle":"https://pith.science/pith/M2U7ZJPNYMXL2BOIQF6O566A57/bundle.json","state":"https://pith.science/pith/M2U7ZJPNYMXL2BOIQF6O566A57/state.json","well_known_bundle":"https://pith.science/.well-known/pith/M2U7ZJPNYMXL2BOIQF6O566A57/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:M2U7ZJPNYMXL2BOIQF6O566A57","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":"4f457f12186e878cc10466d515459017070bb486a4b1ed8e0f26598102e80f7f","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-03-22T17:22:24Z","title_canon_sha256":"0252e7163b542178c1f64441b9002eaf8ce5fdc0fed2e5d325a2cab28c9fba76"},"schema_version":"1.0","source":{"id":"1803.08475","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1803.08475","created_at":"2026-05-17T23:54:34Z"},{"alias_kind":"arxiv_version","alias_value":"1803.08475v3","created_at":"2026-05-17T23:54:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.08475","created_at":"2026-05-17T23:54:34Z"},{"alias_kind":"pith_short_12","alias_value":"M2U7ZJPNYMXL","created_at":"2026-05-18T12:32:37Z"},{"alias_kind":"pith_short_16","alias_value":"M2U7ZJPNYMXL2BOI","created_at":"2026-05-18T12:32:37Z"},{"alias_kind":"pith_short_8","alias_value":"M2U7ZJPN","created_at":"2026-05-18T12:32:37Z"}],"graph_snapshots":[{"event_id":"sha256:5ec05123f030f0cb0ac1eee0a6b61d5c03e7bc00ca526cca8b02503a50487162","target":"graph","created_at":"2026-05-17T23:54:34Z","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":"The recently presented idea to learn heuristics for combinatorial optimization problems is promising as it can save costly development. However, to push this idea towards practical implementation, we need better models and better ways of training. We contribute in both directions: we propose a model based on attention layers with benefits over the Pointer Network and we show how to train this model using REINFORCE with a simple baseline based on a deterministic greedy rollout, which we find is more efficient than using a value function. We significantly improve over recent learned heuristics f","authors_text":"Herke van Hoof, Max Welling, Wouter Kool","cross_cats":["cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-03-22T17:22:24Z","title":"Attention, Learn to Solve Routing Problems!"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.08475","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:e59998f361ff4a179ad55fb75ed080e3049c150b2d94d855bbc4286f42912cd6","target":"record","created_at":"2026-05-17T23:54:34Z","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":"4f457f12186e878cc10466d515459017070bb486a4b1ed8e0f26598102e80f7f","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-03-22T17:22:24Z","title_canon_sha256":"0252e7163b542178c1f64441b9002eaf8ce5fdc0fed2e5d325a2cab28c9fba76"},"schema_version":"1.0","source":{"id":"1803.08475","kind":"arxiv","version":3}},"canonical_sha256":"66a9fca5edc32ebd05c8817ceefbc0efeade192af3a626c02135d09b114d4d1a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"66a9fca5edc32ebd05c8817ceefbc0efeade192af3a626c02135d09b114d4d1a","first_computed_at":"2026-05-17T23:54:34.500430Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:54:34.500430Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"cjCObmcKdII0ypaE/EHiItqIG0yZ0HkAlkzX/3toXsEfgcMDo2/9D0lGawlHy8PGNzzaJDl+lehQt0v5m8BCDA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:54:34.501020Z","signed_message":"canonical_sha256_bytes"},"source_id":"1803.08475","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e59998f361ff4a179ad55fb75ed080e3049c150b2d94d855bbc4286f42912cd6","sha256:5ec05123f030f0cb0ac1eee0a6b61d5c03e7bc00ca526cca8b02503a50487162"],"state_sha256":"bdff697f19235bf8feb841ee65709314250a78fc6a881498ad7867077236ed7c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uQiuxshuEepBEEs+YAwhIaofT2hdvriTSmgwyO0Kbwyst4PpRnEQ7qJQxoDrHyhKJfTi9ybnOMnYl978n48fBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T21:27:38.974398Z","bundle_sha256":"cb5e7aa15c359b8248193fe6795aece8f4061bf3088925a4cec99ec925d1376c"}}