{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:MMSM7SQXLYFPHHR55LFC7NOKVL","short_pith_number":"pith:MMSM7SQX","canonical_record":{"source":{"id":"1709.02194","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-09-07T11:54:36Z","cross_cats_sorted":["cs.DM","cs.LG"],"title_canon_sha256":"ee1fe01948c4fd61f59f17cb13101a3680a66a82131bb6c29848d86a825ae5bb","abstract_canon_sha256":"0ae78bad2c5cd3b391883fe8d5c69fa11bdaeb466992c5173c41e98cd72828b7"},"schema_version":"1.0"},"canonical_sha256":"6324cfca175e0af39e3deaca2fb5caaac49648d45c10f557aefe6d62636b7838","source":{"kind":"arxiv","id":"1709.02194","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1709.02194","created_at":"2026-05-18T00:35:49Z"},{"alias_kind":"arxiv_version","alias_value":"1709.02194v1","created_at":"2026-05-18T00:35:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.02194","created_at":"2026-05-18T00:35:49Z"},{"alias_kind":"pith_short_12","alias_value":"MMSM7SQXLYFP","created_at":"2026-05-18T12:31:31Z"},{"alias_kind":"pith_short_16","alias_value":"MMSM7SQXLYFPHHR5","created_at":"2026-05-18T12:31:31Z"},{"alias_kind":"pith_short_8","alias_value":"MMSM7SQX","created_at":"2026-05-18T12:31:31Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:MMSM7SQXLYFPHHR55LFC7NOKVL","target":"record","payload":{"canonical_record":{"source":{"id":"1709.02194","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-09-07T11:54:36Z","cross_cats_sorted":["cs.DM","cs.LG"],"title_canon_sha256":"ee1fe01948c4fd61f59f17cb13101a3680a66a82131bb6c29848d86a825ae5bb","abstract_canon_sha256":"0ae78bad2c5cd3b391883fe8d5c69fa11bdaeb466992c5173c41e98cd72828b7"},"schema_version":"1.0"},"canonical_sha256":"6324cfca175e0af39e3deaca2fb5caaac49648d45c10f557aefe6d62636b7838","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:35:49.910386Z","signature_b64":"Wxkz3ziXfFWOUTl+Ca6CEO8f2i7fX+dZeTKMRqCw3UTU1bDXRtkwheRpd4ZSPUqdFOgQQ7r6u1PPnMPb5+4VCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6324cfca175e0af39e3deaca2fb5caaac49648d45c10f557aefe6d62636b7838","last_reissued_at":"2026-05-18T00:35:49.909795Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:35:49.909795Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1709.02194","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-18T00:35:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yRU7iroERDPXmdJi+8ppCr0JRtba/kK2EKyE8sWKlxLqLg1azjc4Whq152GqaNVH8ae0GnZxjW5e6kBtmayjBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-24T21:22:29.136413Z"},"content_sha256":"5598d4054185ff98847422ef372182c08f548365aa647401cc8821fbc5a3ac30","schema_version":"1.0","event_id":"sha256:5598d4054185ff98847422ef372182c08f548365aa647401cc8821fbc5a3ac30"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:MMSM7SQXLYFPHHR55LFC7NOKVL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Approximating meta-heuristics with homotopic recurrent neural networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","cs.LG"],"primary_cat":"stat.ML","authors_text":"Alessandro Bay, Biswa Sengupta","submitted_at":"2017-09-07T11:54:36Z","abstract_excerpt":"Much combinatorial optimisation problems constitute a non-polynomial (NP) hard optimisation problem, i.e., they can not be solved in polynomial time. One such problem is finding the shortest route between two nodes on a graph. Meta-heuristic algorithms such as $A^{*}$ along with mixed-integer programming (MIP) methods are often employed for these problems. Our work demonstrates that it is possible to approximate solutions generated by a meta-heuristic algorithm using a deep recurrent neural network. We compare different methodologies based on reinforcement learning (RL) and recurrent neural ne"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.02194","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-18T00:35:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fkyytziULK//mVy1vhIdkRasaAhU7pNl/LjsB9KA/ULG3p/eGUWV/giI2oxzMYl1N2VYG59YuKhbiMTe7sCsCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-24T21:22:29.136987Z"},"content_sha256":"bbdf03abf166de1f7f8aac9c3011edb0c6cf3af41298a9b3b8e59651ae5d8570","schema_version":"1.0","event_id":"sha256:bbdf03abf166de1f7f8aac9c3011edb0c6cf3af41298a9b3b8e59651ae5d8570"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MMSM7SQXLYFPHHR55LFC7NOKVL/bundle.json","state_url":"https://pith.science/pith/MMSM7SQXLYFPHHR55LFC7NOKVL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MMSM7SQXLYFPHHR55LFC7NOKVL/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-05-24T21:22:29Z","links":{"resolver":"https://pith.science/pith/MMSM7SQXLYFPHHR55LFC7NOKVL","bundle":"https://pith.science/pith/MMSM7SQXLYFPHHR55LFC7NOKVL/bundle.json","state":"https://pith.science/pith/MMSM7SQXLYFPHHR55LFC7NOKVL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MMSM7SQXLYFPHHR55LFC7NOKVL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:MMSM7SQXLYFPHHR55LFC7NOKVL","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":"0ae78bad2c5cd3b391883fe8d5c69fa11bdaeb466992c5173c41e98cd72828b7","cross_cats_sorted":["cs.DM","cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-09-07T11:54:36Z","title_canon_sha256":"ee1fe01948c4fd61f59f17cb13101a3680a66a82131bb6c29848d86a825ae5bb"},"schema_version":"1.0","source":{"id":"1709.02194","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1709.02194","created_at":"2026-05-18T00:35:49Z"},{"alias_kind":"arxiv_version","alias_value":"1709.02194v1","created_at":"2026-05-18T00:35:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.02194","created_at":"2026-05-18T00:35:49Z"},{"alias_kind":"pith_short_12","alias_value":"MMSM7SQXLYFP","created_at":"2026-05-18T12:31:31Z"},{"alias_kind":"pith_short_16","alias_value":"MMSM7SQXLYFPHHR5","created_at":"2026-05-18T12:31:31Z"},{"alias_kind":"pith_short_8","alias_value":"MMSM7SQX","created_at":"2026-05-18T12:31:31Z"}],"graph_snapshots":[{"event_id":"sha256:bbdf03abf166de1f7f8aac9c3011edb0c6cf3af41298a9b3b8e59651ae5d8570","target":"graph","created_at":"2026-05-18T00:35:49Z","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":"Much combinatorial optimisation problems constitute a non-polynomial (NP) hard optimisation problem, i.e., they can not be solved in polynomial time. One such problem is finding the shortest route between two nodes on a graph. Meta-heuristic algorithms such as $A^{*}$ along with mixed-integer programming (MIP) methods are often employed for these problems. Our work demonstrates that it is possible to approximate solutions generated by a meta-heuristic algorithm using a deep recurrent neural network. We compare different methodologies based on reinforcement learning (RL) and recurrent neural ne","authors_text":"Alessandro Bay, Biswa Sengupta","cross_cats":["cs.DM","cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-09-07T11:54:36Z","title":"Approximating meta-heuristics with homotopic recurrent neural networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.02194","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:5598d4054185ff98847422ef372182c08f548365aa647401cc8821fbc5a3ac30","target":"record","created_at":"2026-05-18T00:35:49Z","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":"0ae78bad2c5cd3b391883fe8d5c69fa11bdaeb466992c5173c41e98cd72828b7","cross_cats_sorted":["cs.DM","cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-09-07T11:54:36Z","title_canon_sha256":"ee1fe01948c4fd61f59f17cb13101a3680a66a82131bb6c29848d86a825ae5bb"},"schema_version":"1.0","source":{"id":"1709.02194","kind":"arxiv","version":1}},"canonical_sha256":"6324cfca175e0af39e3deaca2fb5caaac49648d45c10f557aefe6d62636b7838","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6324cfca175e0af39e3deaca2fb5caaac49648d45c10f557aefe6d62636b7838","first_computed_at":"2026-05-18T00:35:49.909795Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:35:49.909795Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Wxkz3ziXfFWOUTl+Ca6CEO8f2i7fX+dZeTKMRqCw3UTU1bDXRtkwheRpd4ZSPUqdFOgQQ7r6u1PPnMPb5+4VCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:35:49.910386Z","signed_message":"canonical_sha256_bytes"},"source_id":"1709.02194","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5598d4054185ff98847422ef372182c08f548365aa647401cc8821fbc5a3ac30","sha256:bbdf03abf166de1f7f8aac9c3011edb0c6cf3af41298a9b3b8e59651ae5d8570"],"state_sha256":"1706775088d79f2579990b09b40abbdad651beaddb6205c5d2ab1406c9b978af"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HFlLPKxnFZErwNZqaoOQFoLUa7hqD4uqT7PvT9hexLD56zZolJKQb9X9kqf5LSZVK1B1MthB5pnGf7q+cl9uAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-24T21:22:29.140828Z","bundle_sha256":"1bc8d8404fa5c602ade04f98e326d895b0e502473a3f0a854f54d98731336f07"}}