{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:EZTOJ4ZJEYEMZRHP5Y52REVCTH","short_pith_number":"pith:EZTOJ4ZJ","schema_version":"1.0","canonical_sha256":"2666e4f3292608ccc4efee3ba892a299d2ab2089c525f1623db14313604e0855","source":{"kind":"arxiv","id":"1710.04211","version":2},"attestation_state":"computed","paper":{"title":"StackSeq2Seq: Dual Encoder Seq2Seq Recurrent Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","cs.NE","stat.ML"],"primary_cat":"cs.LG","authors_text":"Alessandro Bay, Biswa Sengupta","submitted_at":"2017-10-11T11:22:26Z","abstract_excerpt":"A widely studied non-deterministic polynomial time (NP) hard problem lies in finding a route between the two nodes of a graph. Often meta-heuristics algorithms such as $A^{*}$ are employed on graphs with a large number of nodes. Here, we propose a deep recurrent neural network architecture based on the Sequence-2-Sequence (Seq2Seq) model, widely used, for instance in text translation. Particularly, we illustrate that utilising a context vector that has been learned from two different recurrent networks enables increased accuracies in learning the shortest route of a graph. Additionally, we sho"},"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":"1710.04211","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-10-11T11:22:26Z","cross_cats_sorted":["cs.DM","cs.NE","stat.ML"],"title_canon_sha256":"0da01e15ca5205546a38e474f4b268c0ef4f6a114eca67d2d8b2b4d6b37fb5ef","abstract_canon_sha256":"e396d536341a4f6f7489df7f4c4e5a30b4095c06ac675613e661fd6fd450fe1e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:25:41.701590Z","signature_b64":"2RJdICOIY6QCd3nuelQKh6qLxCbYMAulwn1l3s7DoYxiGkvmhqzhpLeX350iMiMvvndit2XuXrEbi6ZtjhdOCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2666e4f3292608ccc4efee3ba892a299d2ab2089c525f1623db14313604e0855","last_reissued_at":"2026-05-18T00:25:41.701064Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:25:41.701064Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"StackSeq2Seq: Dual Encoder Seq2Seq Recurrent Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","cs.NE","stat.ML"],"primary_cat":"cs.LG","authors_text":"Alessandro Bay, Biswa Sengupta","submitted_at":"2017-10-11T11:22:26Z","abstract_excerpt":"A widely studied non-deterministic polynomial time (NP) hard problem lies in finding a route between the two nodes of a graph. Often meta-heuristics algorithms such as $A^{*}$ are employed on graphs with a large number of nodes. Here, we propose a deep recurrent neural network architecture based on the Sequence-2-Sequence (Seq2Seq) model, widely used, for instance in text translation. Particularly, we illustrate that utilising a context vector that has been learned from two different recurrent networks enables increased accuracies in learning the shortest route of a graph. Additionally, we sho"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.04211","kind":"arxiv","version":2},"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":"1710.04211","created_at":"2026-05-18T00:25:41.701155+00:00"},{"alias_kind":"arxiv_version","alias_value":"1710.04211v2","created_at":"2026-05-18T00:25:41.701155+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.04211","created_at":"2026-05-18T00:25:41.701155+00:00"},{"alias_kind":"pith_short_12","alias_value":"EZTOJ4ZJEYEM","created_at":"2026-05-18T12:31:12.930513+00:00"},{"alias_kind":"pith_short_16","alias_value":"EZTOJ4ZJEYEMZRHP","created_at":"2026-05-18T12:31:12.930513+00:00"},{"alias_kind":"pith_short_8","alias_value":"EZTOJ4ZJ","created_at":"2026-05-18T12:31:12.930513+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/EZTOJ4ZJEYEMZRHP5Y52REVCTH","json":"https://pith.science/pith/EZTOJ4ZJEYEMZRHP5Y52REVCTH.json","graph_json":"https://pith.science/api/pith-number/EZTOJ4ZJEYEMZRHP5Y52REVCTH/graph.json","events_json":"https://pith.science/api/pith-number/EZTOJ4ZJEYEMZRHP5Y52REVCTH/events.json","paper":"https://pith.science/paper/EZTOJ4ZJ"},"agent_actions":{"view_html":"https://pith.science/pith/EZTOJ4ZJEYEMZRHP5Y52REVCTH","download_json":"https://pith.science/pith/EZTOJ4ZJEYEMZRHP5Y52REVCTH.json","view_paper":"https://pith.science/paper/EZTOJ4ZJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1710.04211&json=true","fetch_graph":"https://pith.science/api/pith-number/EZTOJ4ZJEYEMZRHP5Y52REVCTH/graph.json","fetch_events":"https://pith.science/api/pith-number/EZTOJ4ZJEYEMZRHP5Y52REVCTH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EZTOJ4ZJEYEMZRHP5Y52REVCTH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EZTOJ4ZJEYEMZRHP5Y52REVCTH/action/storage_attestation","attest_author":"https://pith.science/pith/EZTOJ4ZJEYEMZRHP5Y52REVCTH/action/author_attestation","sign_citation":"https://pith.science/pith/EZTOJ4ZJEYEMZRHP5Y52REVCTH/action/citation_signature","submit_replication":"https://pith.science/pith/EZTOJ4ZJEYEMZRHP5Y52REVCTH/action/replication_record"}},"created_at":"2026-05-18T00:25:41.701155+00:00","updated_at":"2026-05-18T00:25:41.701155+00:00"}