{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:MMSM7SQXLYFPHHR55LFC7NOKVL","short_pith_number":"pith:MMSM7SQX","schema_version":"1.0","canonical_sha256":"6324cfca175e0af39e3deaca2fb5caaac49648d45c10f557aefe6d62636b7838","source":{"kind":"arxiv","id":"1709.02194","version":1},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1709.02194","created_at":"2026-05-18T00:35:49.909881+00:00"},{"alias_kind":"arxiv_version","alias_value":"1709.02194v1","created_at":"2026-05-18T00:35:49.909881+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.02194","created_at":"2026-05-18T00:35:49.909881+00:00"},{"alias_kind":"pith_short_12","alias_value":"MMSM7SQXLYFP","created_at":"2026-05-18T12:31:31.346846+00:00"},{"alias_kind":"pith_short_16","alias_value":"MMSM7SQXLYFPHHR5","created_at":"2026-05-18T12:31:31.346846+00:00"},{"alias_kind":"pith_short_8","alias_value":"MMSM7SQX","created_at":"2026-05-18T12:31:31.346846+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/MMSM7SQXLYFPHHR55LFC7NOKVL","json":"https://pith.science/pith/MMSM7SQXLYFPHHR55LFC7NOKVL.json","graph_json":"https://pith.science/api/pith-number/MMSM7SQXLYFPHHR55LFC7NOKVL/graph.json","events_json":"https://pith.science/api/pith-number/MMSM7SQXLYFPHHR55LFC7NOKVL/events.json","paper":"https://pith.science/paper/MMSM7SQX"},"agent_actions":{"view_html":"https://pith.science/pith/MMSM7SQXLYFPHHR55LFC7NOKVL","download_json":"https://pith.science/pith/MMSM7SQXLYFPHHR55LFC7NOKVL.json","view_paper":"https://pith.science/paper/MMSM7SQX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1709.02194&json=true","fetch_graph":"https://pith.science/api/pith-number/MMSM7SQXLYFPHHR55LFC7NOKVL/graph.json","fetch_events":"https://pith.science/api/pith-number/MMSM7SQXLYFPHHR55LFC7NOKVL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MMSM7SQXLYFPHHR55LFC7NOKVL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MMSM7SQXLYFPHHR55LFC7NOKVL/action/storage_attestation","attest_author":"https://pith.science/pith/MMSM7SQXLYFPHHR55LFC7NOKVL/action/author_attestation","sign_citation":"https://pith.science/pith/MMSM7SQXLYFPHHR55LFC7NOKVL/action/citation_signature","submit_replication":"https://pith.science/pith/MMSM7SQXLYFPHHR55LFC7NOKVL/action/replication_record"}},"created_at":"2026-05-18T00:35:49.909881+00:00","updated_at":"2026-05-18T00:35:49.909881+00:00"}