{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:5TBTWR7IBFNBLCU4AP2WYXODLA","short_pith_number":"pith:5TBTWR7I","canonical_record":{"source":{"id":"1903.03348","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-03-08T10:04:27Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"990e270271a0b7093ad4346ddac2388f2a25ff893d775bf4fb2eddcc0b5c7da7","abstract_canon_sha256":"65434db4ab4b87e3ce892e363fb001aedd1ef3243065a1ee84bc4c1d20f5558f"},"schema_version":"1.0"},"canonical_sha256":"ecc33b47e8095a158a9c03f56c5dc35824497d1348fee684ddb0eff84870aee8","source":{"kind":"arxiv","id":"1903.03348","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1903.03348","created_at":"2026-05-17T23:51:45Z"},{"alias_kind":"arxiv_version","alias_value":"1903.03348v1","created_at":"2026-05-17T23:51:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.03348","created_at":"2026-05-17T23:51:45Z"},{"alias_kind":"pith_short_12","alias_value":"5TBTWR7IBFNB","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_16","alias_value":"5TBTWR7IBFNBLCU4","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_8","alias_value":"5TBTWR7I","created_at":"2026-05-18T12:33:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:5TBTWR7IBFNBLCU4AP2WYXODLA","target":"record","payload":{"canonical_record":{"source":{"id":"1903.03348","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-03-08T10:04:27Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"990e270271a0b7093ad4346ddac2388f2a25ff893d775bf4fb2eddcc0b5c7da7","abstract_canon_sha256":"65434db4ab4b87e3ce892e363fb001aedd1ef3243065a1ee84bc4c1d20f5558f"},"schema_version":"1.0"},"canonical_sha256":"ecc33b47e8095a158a9c03f56c5dc35824497d1348fee684ddb0eff84870aee8","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:51:45.745997Z","signature_b64":"B1RFemb1z3MWzMguMnXwWt5Y/pLMrgfPQM3Q3t+iTRc2SP0E7PTX8gfV4ql3YKElY5ajga4vN8iNusDgczk1Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ecc33b47e8095a158a9c03f56c5dc35824497d1348fee684ddb0eff84870aee8","last_reissued_at":"2026-05-17T23:51:45.745207Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:51:45.745207Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1903.03348","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-05-17T23:51:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"G28In3sSDC8GHxg1Jpaq/t8gx1WhHSv9q+ZsIkVpY2QGTMw47JRahKNw4cOadcngAq6TOgVxnqT8Q4WOwPr0BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-28T10:35:18.425622Z"},"content_sha256":"d42fb58f53217d5bb44f662af43557b26f45542a690b30bc1d02f82540163097","schema_version":"1.0","event_id":"sha256:d42fb58f53217d5bb44f662af43557b26f45542a690b30bc1d02f82540163097"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:5TBTWR7IBFNBLCU4AP2WYXODLA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Approximating Optimisation Solutions for Travelling Officer Problem with Customised Deep Learning Network","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Fabio Zambetta, Flora D. Salim, Jeffrey Chan, Sean Morrison, Wei Shao","submitted_at":"2019-03-08T10:04:27Z","abstract_excerpt":"Deep learning has been extended to a number of new domains with critical success, though some traditional orienteering problems such as the Travelling Salesman Problem (TSP) and its variants are not commonly solved using such techniques. Deep neural networks (DNNs) are a potentially promising and under-explored solution to solve these problems due to their powerful function approximation abilities, and their fast feed-forward computation. In this paper, we outline a method for converting an orienteering problem into a classification problem, and design a customised multi-layer deep learning ne"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.03348","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":""},"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:51:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TEtvV4wg9May7MNt+QrVqlu724XOZpyND7HNQ6JPO539cBtVu5gww+ESXpRNOAwaMGgBXxhrjMwizXTe3qtKCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-28T10:35:18.425977Z"},"content_sha256":"ef0a4c122c5048590856ef377c6c71e7400ae5fdc27e82e3d6c8b2b97324f951","schema_version":"1.0","event_id":"sha256:ef0a4c122c5048590856ef377c6c71e7400ae5fdc27e82e3d6c8b2b97324f951"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5TBTWR7IBFNBLCU4AP2WYXODLA/bundle.json","state_url":"https://pith.science/pith/5TBTWR7IBFNBLCU4AP2WYXODLA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5TBTWR7IBFNBLCU4AP2WYXODLA/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-28T10:35:18Z","links":{"resolver":"https://pith.science/pith/5TBTWR7IBFNBLCU4AP2WYXODLA","bundle":"https://pith.science/pith/5TBTWR7IBFNBLCU4AP2WYXODLA/bundle.json","state":"https://pith.science/pith/5TBTWR7IBFNBLCU4AP2WYXODLA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5TBTWR7IBFNBLCU4AP2WYXODLA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:5TBTWR7IBFNBLCU4AP2WYXODLA","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":"65434db4ab4b87e3ce892e363fb001aedd1ef3243065a1ee84bc4c1d20f5558f","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-03-08T10:04:27Z","title_canon_sha256":"990e270271a0b7093ad4346ddac2388f2a25ff893d775bf4fb2eddcc0b5c7da7"},"schema_version":"1.0","source":{"id":"1903.03348","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1903.03348","created_at":"2026-05-17T23:51:45Z"},{"alias_kind":"arxiv_version","alias_value":"1903.03348v1","created_at":"2026-05-17T23:51:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.03348","created_at":"2026-05-17T23:51:45Z"},{"alias_kind":"pith_short_12","alias_value":"5TBTWR7IBFNB","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_16","alias_value":"5TBTWR7IBFNBLCU4","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_8","alias_value":"5TBTWR7I","created_at":"2026-05-18T12:33:10Z"}],"graph_snapshots":[{"event_id":"sha256:ef0a4c122c5048590856ef377c6c71e7400ae5fdc27e82e3d6c8b2b97324f951","target":"graph","created_at":"2026-05-17T23:51:45Z","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":"Deep learning has been extended to a number of new domains with critical success, though some traditional orienteering problems such as the Travelling Salesman Problem (TSP) and its variants are not commonly solved using such techniques. Deep neural networks (DNNs) are a potentially promising and under-explored solution to solve these problems due to their powerful function approximation abilities, and their fast feed-forward computation. In this paper, we outline a method for converting an orienteering problem into a classification problem, and design a customised multi-layer deep learning ne","authors_text":"Fabio Zambetta, Flora D. Salim, Jeffrey Chan, Sean Morrison, Wei Shao","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-03-08T10:04:27Z","title":"Approximating Optimisation Solutions for Travelling Officer Problem with Customised Deep Learning Network"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.03348","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:d42fb58f53217d5bb44f662af43557b26f45542a690b30bc1d02f82540163097","target":"record","created_at":"2026-05-17T23:51:45Z","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":"65434db4ab4b87e3ce892e363fb001aedd1ef3243065a1ee84bc4c1d20f5558f","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-03-08T10:04:27Z","title_canon_sha256":"990e270271a0b7093ad4346ddac2388f2a25ff893d775bf4fb2eddcc0b5c7da7"},"schema_version":"1.0","source":{"id":"1903.03348","kind":"arxiv","version":1}},"canonical_sha256":"ecc33b47e8095a158a9c03f56c5dc35824497d1348fee684ddb0eff84870aee8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ecc33b47e8095a158a9c03f56c5dc35824497d1348fee684ddb0eff84870aee8","first_computed_at":"2026-05-17T23:51:45.745207Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:51:45.745207Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"B1RFemb1z3MWzMguMnXwWt5Y/pLMrgfPQM3Q3t+iTRc2SP0E7PTX8gfV4ql3YKElY5ajga4vN8iNusDgczk1Dg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:51:45.745997Z","signed_message":"canonical_sha256_bytes"},"source_id":"1903.03348","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d42fb58f53217d5bb44f662af43557b26f45542a690b30bc1d02f82540163097","sha256:ef0a4c122c5048590856ef377c6c71e7400ae5fdc27e82e3d6c8b2b97324f951"],"state_sha256":"eb2f66bb3ea2f6230af00847f0b973776a94d7e4a706c95f918e07cea8db13e2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yiKBttRqPipE1vqmmn6vEUR8Ce7q8HSo9fA+np2jtax86320Dey7zAfE/QmJ3UNP4B12gjfrGZ9QNePqTwVnDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-28T10:35:18.427960Z","bundle_sha256":"be118268e9d043af5f0a05432e4f250b09a90bf49dd1c1f64465b5a1b031b358"}}