{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:EZTOJ4ZJEYEMZRHP5Y52REVCTH","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":"e396d536341a4f6f7489df7f4c4e5a30b4095c06ac675613e661fd6fd450fe1e","cross_cats_sorted":["cs.DM","cs.NE","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-10-11T11:22:26Z","title_canon_sha256":"0da01e15ca5205546a38e474f4b268c0ef4f6a114eca67d2d8b2b4d6b37fb5ef"},"schema_version":"1.0","source":{"id":"1710.04211","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1710.04211","created_at":"2026-05-18T00:25:41Z"},{"alias_kind":"arxiv_version","alias_value":"1710.04211v2","created_at":"2026-05-18T00:25:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.04211","created_at":"2026-05-18T00:25:41Z"},{"alias_kind":"pith_short_12","alias_value":"EZTOJ4ZJEYEM","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_16","alias_value":"EZTOJ4ZJEYEMZRHP","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_8","alias_value":"EZTOJ4ZJ","created_at":"2026-05-18T12:31:12Z"}],"graph_snapshots":[{"event_id":"sha256:db41d9163b90e0687b36ce747cb521a646b23f836c36893c55aa4ac0ce574a5b","target":"graph","created_at":"2026-05-18T00:25:41Z","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":"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","authors_text":"Alessandro Bay, Biswa Sengupta","cross_cats":["cs.DM","cs.NE","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-10-11T11:22:26Z","title":"StackSeq2Seq: Dual Encoder Seq2Seq Recurrent Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.04211","kind":"arxiv","version":2},"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:12401851836565ee1571ac6a6c25cf69622591402d5dfe54dcd1fe8ebc4e282b","target":"record","created_at":"2026-05-18T00:25:41Z","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":"e396d536341a4f6f7489df7f4c4e5a30b4095c06ac675613e661fd6fd450fe1e","cross_cats_sorted":["cs.DM","cs.NE","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-10-11T11:22:26Z","title_canon_sha256":"0da01e15ca5205546a38e474f4b268c0ef4f6a114eca67d2d8b2b4d6b37fb5ef"},"schema_version":"1.0","source":{"id":"1710.04211","kind":"arxiv","version":2}},"canonical_sha256":"2666e4f3292608ccc4efee3ba892a299d2ab2089c525f1623db14313604e0855","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2666e4f3292608ccc4efee3ba892a299d2ab2089c525f1623db14313604e0855","first_computed_at":"2026-05-18T00:25:41.701064Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:25:41.701064Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"2RJdICOIY6QCd3nuelQKh6qLxCbYMAulwn1l3s7DoYxiGkvmhqzhpLeX350iMiMvvndit2XuXrEbi6ZtjhdOCg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:25:41.701590Z","signed_message":"canonical_sha256_bytes"},"source_id":"1710.04211","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:12401851836565ee1571ac6a6c25cf69622591402d5dfe54dcd1fe8ebc4e282b","sha256:db41d9163b90e0687b36ce747cb521a646b23f836c36893c55aa4ac0ce574a5b"],"state_sha256":"d609f0a6d4d4c8ae35514fd9d6249acb7bb7c8df3b0065be4944b50d64b05b53"}