{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:XUJ6HGEMJ73QKPLU3U56HZYJIH","short_pith_number":"pith:XUJ6HGEM","canonical_record":{"source":{"id":"1909.13121","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2019-09-28T16:35:38Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"5e8b1a3af732e345954c299c7645671b7d8514a6c66d8217eeb43de6143c4290","abstract_canon_sha256":"930fed24d1448d6ae465e41469494bae77be5c8cf9d01edfb30bce8a55ad8d4e"},"schema_version":"1.0"},"canonical_sha256":"bd13e3988c4ff7053d74dd3be3e70941f8f40c98bf564528892afe000ea792b9","source":{"kind":"arxiv","id":"1909.13121","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1909.13121","created_at":"2026-07-05T00:07:56Z"},{"alias_kind":"arxiv_version","alias_value":"1909.13121v1","created_at":"2026-07-05T00:07:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1909.13121","created_at":"2026-07-05T00:07:56Z"},{"alias_kind":"pith_short_12","alias_value":"XUJ6HGEMJ73Q","created_at":"2026-07-05T00:07:56Z"},{"alias_kind":"pith_short_16","alias_value":"XUJ6HGEMJ73QKPLU","created_at":"2026-07-05T00:07:56Z"},{"alias_kind":"pith_short_8","alias_value":"XUJ6HGEM","created_at":"2026-07-05T00:07:56Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:XUJ6HGEMJ73QKPLU3U56HZYJIH","target":"record","payload":{"canonical_record":{"source":{"id":"1909.13121","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2019-09-28T16:35:38Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"5e8b1a3af732e345954c299c7645671b7d8514a6c66d8217eeb43de6143c4290","abstract_canon_sha256":"930fed24d1448d6ae465e41469494bae77be5c8cf9d01edfb30bce8a55ad8d4e"},"schema_version":"1.0"},"canonical_sha256":"bd13e3988c4ff7053d74dd3be3e70941f8f40c98bf564528892afe000ea792b9","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:07:56.256626Z","signature_b64":"/WvxXQx3S7e7DOu4F2ABih0IGopvytFczD96gMrf+QZSxpBUSvx9URkqMM7eRCaD094hlbLB+8RpZooJ248GAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bd13e3988c4ff7053d74dd3be3e70941f8f40c98bf564528892afe000ea792b9","last_reissued_at":"2026-07-05T00:07:56.256277Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:07:56.256277Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1909.13121","source_version":1,"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-05T00:07:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pTCRkA/LBMoq2P3yQ+rfFoYolfzEG5xM/NZRnRNZj7PWszVbZ4+WA91giT3umemSK6d6XlyAG6n5bj2SX15iAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-17T19:12:43.627442Z"},"content_sha256":"ce96b93fb5d516f4e97aa41209ca54b9d25075794216d19d705f5323f4e8270b","schema_version":"1.0","event_id":"sha256:ce96b93fb5d516f4e97aa41209ca54b9d25075794216d19d705f5323f4e8270b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:XUJ6HGEMJ73QKPLU3U56HZYJIH","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"How to Evaluate Machine Learning Approaches for Combinatorial Optimization: Application to the Travelling Salesman Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.AI","authors_text":"Antoine Fran\\c{c}ois, Louis-Martin Rousseau, Quentin Cappart","submitted_at":"2019-09-28T16:35:38Z","abstract_excerpt":"Combinatorial optimization is the field devoted to the study and practice of algorithms that solve NP-hard problems. As Machine Learning (ML) and deep learning have popularized, several research groups have started to use ML to solve combinatorial optimization problems, such as the well-known Travelling Salesman Problem (TSP). Based on deep (reinforcement) learning, new models and architecture for the TSP have been successively developed and have gained increasing performances. At the time of writing, state-of-the-art models provide solutions to TSP instances of 100 cities that are roughly 1.3"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1909.13121","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/1909.13121/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-05T00:07:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"N0mq57jL1DANReiMRcauf5u0ExQcnsnhknI3zaUgoAsK4SOLU+70lofTyxf+HkQHmi0kOxwkDdwQlamh/b+6BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-17T19:12:43.627954Z"},"content_sha256":"31c579a0ef2c732bb01b35beabecaabb12cf1c2668d7100eb754bed20f99fb32","schema_version":"1.0","event_id":"sha256:31c579a0ef2c732bb01b35beabecaabb12cf1c2668d7100eb754bed20f99fb32"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XUJ6HGEMJ73QKPLU3U56HZYJIH/bundle.json","state_url":"https://pith.science/pith/XUJ6HGEMJ73QKPLU3U56HZYJIH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XUJ6HGEMJ73QKPLU3U56HZYJIH/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-17T19:12:43Z","links":{"resolver":"https://pith.science/pith/XUJ6HGEMJ73QKPLU3U56HZYJIH","bundle":"https://pith.science/pith/XUJ6HGEMJ73QKPLU3U56HZYJIH/bundle.json","state":"https://pith.science/pith/XUJ6HGEMJ73QKPLU3U56HZYJIH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XUJ6HGEMJ73QKPLU3U56HZYJIH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:XUJ6HGEMJ73QKPLU3U56HZYJIH","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":"930fed24d1448d6ae465e41469494bae77be5c8cf9d01edfb30bce8a55ad8d4e","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2019-09-28T16:35:38Z","title_canon_sha256":"5e8b1a3af732e345954c299c7645671b7d8514a6c66d8217eeb43de6143c4290"},"schema_version":"1.0","source":{"id":"1909.13121","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1909.13121","created_at":"2026-07-05T00:07:56Z"},{"alias_kind":"arxiv_version","alias_value":"1909.13121v1","created_at":"2026-07-05T00:07:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1909.13121","created_at":"2026-07-05T00:07:56Z"},{"alias_kind":"pith_short_12","alias_value":"XUJ6HGEMJ73Q","created_at":"2026-07-05T00:07:56Z"},{"alias_kind":"pith_short_16","alias_value":"XUJ6HGEMJ73QKPLU","created_at":"2026-07-05T00:07:56Z"},{"alias_kind":"pith_short_8","alias_value":"XUJ6HGEM","created_at":"2026-07-05T00:07:56Z"}],"graph_snapshots":[{"event_id":"sha256:31c579a0ef2c732bb01b35beabecaabb12cf1c2668d7100eb754bed20f99fb32","target":"graph","created_at":"2026-07-05T00:07:56Z","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/1909.13121/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Combinatorial optimization is the field devoted to the study and practice of algorithms that solve NP-hard problems. As Machine Learning (ML) and deep learning have popularized, several research groups have started to use ML to solve combinatorial optimization problems, such as the well-known Travelling Salesman Problem (TSP). Based on deep (reinforcement) learning, new models and architecture for the TSP have been successively developed and have gained increasing performances. At the time of writing, state-of-the-art models provide solutions to TSP instances of 100 cities that are roughly 1.3","authors_text":"Antoine Fran\\c{c}ois, Louis-Martin Rousseau, Quentin Cappart","cross_cats":["cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2019-09-28T16:35:38Z","title":"How to Evaluate Machine Learning Approaches for Combinatorial Optimization: Application to the Travelling Salesman Problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1909.13121","kind":"arxiv","version":1},"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:ce96b93fb5d516f4e97aa41209ca54b9d25075794216d19d705f5323f4e8270b","target":"record","created_at":"2026-07-05T00:07:56Z","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":"930fed24d1448d6ae465e41469494bae77be5c8cf9d01edfb30bce8a55ad8d4e","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2019-09-28T16:35:38Z","title_canon_sha256":"5e8b1a3af732e345954c299c7645671b7d8514a6c66d8217eeb43de6143c4290"},"schema_version":"1.0","source":{"id":"1909.13121","kind":"arxiv","version":1}},"canonical_sha256":"bd13e3988c4ff7053d74dd3be3e70941f8f40c98bf564528892afe000ea792b9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"bd13e3988c4ff7053d74dd3be3e70941f8f40c98bf564528892afe000ea792b9","first_computed_at":"2026-07-05T00:07:56.256277Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T00:07:56.256277Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"/WvxXQx3S7e7DOu4F2ABih0IGopvytFczD96gMrf+QZSxpBUSvx9URkqMM7eRCaD094hlbLB+8RpZooJ248GAA==","signature_status":"signed_v1","signed_at":"2026-07-05T00:07:56.256626Z","signed_message":"canonical_sha256_bytes"},"source_id":"1909.13121","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ce96b93fb5d516f4e97aa41209ca54b9d25075794216d19d705f5323f4e8270b","sha256:31c579a0ef2c732bb01b35beabecaabb12cf1c2668d7100eb754bed20f99fb32"],"state_sha256":"09f94638b00845ba6a5ee05e34c5d0730920f35174343902127de1fee0e64d78"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9/6sgPeMm2as4VS+MVfNapqPmYtm5dzm1cYCUWJiVE2mermUjsK2urDhMFyopOg84Bep8p1wYrjeFqaWcu5pAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-17T19:12:43.632790Z","bundle_sha256":"86ca1e8eb4bb7f79e9d0ac6121eb99bceb51cab188cff3aa91f45495fad3d6fc"}}