{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2020:6DXKAMHGSXNPG6Z5HRGME47DJ7","short_pith_number":"pith:6DXKAMHG","canonical_record":{"source":{"id":"2001.02330","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2020-01-08T01:14:11Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"579750b53a4ca8fe390de2d0d22fae85e21c034bc9258ab9f064883d72ba1791","abstract_canon_sha256":"2891e0b16c17ec2a3de6cf52f2b6cd56d2ab3791762df6e5aa78393b6384ad2d"},"schema_version":"1.0"},"canonical_sha256":"f0eea030e695daf37b3d3c4cc273e34fee7c4699e2d56ac34c34e0e11fcb03a0","source":{"kind":"arxiv","id":"2001.02330","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2001.02330","created_at":"2026-07-05T00:32:16Z"},{"alias_kind":"arxiv_version","alias_value":"2001.02330v1","created_at":"2026-07-05T00:32:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2001.02330","created_at":"2026-07-05T00:32:16Z"},{"alias_kind":"pith_short_12","alias_value":"6DXKAMHGSXNP","created_at":"2026-07-05T00:32:16Z"},{"alias_kind":"pith_short_16","alias_value":"6DXKAMHGSXNPG6Z5","created_at":"2026-07-05T00:32:16Z"},{"alias_kind":"pith_short_8","alias_value":"6DXKAMHG","created_at":"2026-07-05T00:32:16Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2020:6DXKAMHGSXNPG6Z5HRGME47DJ7","target":"record","payload":{"canonical_record":{"source":{"id":"2001.02330","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2020-01-08T01:14:11Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"579750b53a4ca8fe390de2d0d22fae85e21c034bc9258ab9f064883d72ba1791","abstract_canon_sha256":"2891e0b16c17ec2a3de6cf52f2b6cd56d2ab3791762df6e5aa78393b6384ad2d"},"schema_version":"1.0"},"canonical_sha256":"f0eea030e695daf37b3d3c4cc273e34fee7c4699e2d56ac34c34e0e11fcb03a0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:32:16.956725Z","signature_b64":"Axk3kXvaeJXRu0wZ2+gXkoswUPeDgInS/7wkSes5y4DoW4OZ65XdTxagPIl9siDIAf4RPJbWQYZv5patMOs3Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f0eea030e695daf37b3d3c4cc273e34fee7c4699e2d56ac34c34e0e11fcb03a0","last_reissued_at":"2026-07-05T00:32:16.956293Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:32:16.956293Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2001.02330","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-07-05T00:32:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tkcTsfjpE6lNNQdk10t0rqGE4Gb7vIdvGTjk/Vr+QzBUOmIh3k4FF9+k0lUbfxsHZxexOCzzopL9/v+HmLMFCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T10:00:03.295093Z"},"content_sha256":"184eb6842b4b6caad0ef729bd5c2f427e6f7c1d3a67d153d13df387b3fd19008","schema_version":"1.0","event_id":"sha256:184eb6842b4b6caad0ef729bd5c2f427e6f7c1d3a67d153d13df387b3fd19008"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2020:6DXKAMHGSXNPG6Z5HRGME47DJ7","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"High-Level Plan for Behavioral Robot Navigation with Natural Language Directions and R-NET","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.AI","authors_text":"Amar Shrestha, Haowen Fang, Krittaphat Pugdeethosapol, Qinru Qiu","submitted_at":"2020-01-08T01:14:11Z","abstract_excerpt":"When the navigational environment is known, it can be represented as a graph where landmarks are nodes, the robot behaviors that move from node to node are edges, and the route is a set of behavioral instructions. The route path from source to destination can be viewed as a class of combinatorial optimization problems where the path is a sequential subset from a set of discrete items. The pointer network is an attention-based recurrent network that is suitable for such a task. In this paper, we utilize a modified R-NET with gated attention and self-matching attention translating natural langua"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2001.02330","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2001.02330/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T00:32:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nhC2c5cbU/85os6Y40xh8caOGJahBdBBk2Dzw16CPGejZ0w68IGRZB5dMzcRveQ9vailywpYHPTe400HDkldAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T10:00:03.295475Z"},"content_sha256":"3a2a4ef65a329bf8805d8b788fdeeb488bd227a44d6d905aba5ddc20d97b5955","schema_version":"1.0","event_id":"sha256:3a2a4ef65a329bf8805d8b788fdeeb488bd227a44d6d905aba5ddc20d97b5955"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6DXKAMHGSXNPG6Z5HRGME47DJ7/bundle.json","state_url":"https://pith.science/pith/6DXKAMHGSXNPG6Z5HRGME47DJ7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6DXKAMHGSXNPG6Z5HRGME47DJ7/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-07-07T10:00:03Z","links":{"resolver":"https://pith.science/pith/6DXKAMHGSXNPG6Z5HRGME47DJ7","bundle":"https://pith.science/pith/6DXKAMHGSXNPG6Z5HRGME47DJ7/bundle.json","state":"https://pith.science/pith/6DXKAMHGSXNPG6Z5HRGME47DJ7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6DXKAMHGSXNPG6Z5HRGME47DJ7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:6DXKAMHGSXNPG6Z5HRGME47DJ7","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":"2891e0b16c17ec2a3de6cf52f2b6cd56d2ab3791762df6e5aa78393b6384ad2d","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2020-01-08T01:14:11Z","title_canon_sha256":"579750b53a4ca8fe390de2d0d22fae85e21c034bc9258ab9f064883d72ba1791"},"schema_version":"1.0","source":{"id":"2001.02330","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2001.02330","created_at":"2026-07-05T00:32:16Z"},{"alias_kind":"arxiv_version","alias_value":"2001.02330v1","created_at":"2026-07-05T00:32:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2001.02330","created_at":"2026-07-05T00:32:16Z"},{"alias_kind":"pith_short_12","alias_value":"6DXKAMHGSXNP","created_at":"2026-07-05T00:32:16Z"},{"alias_kind":"pith_short_16","alias_value":"6DXKAMHGSXNPG6Z5","created_at":"2026-07-05T00:32:16Z"},{"alias_kind":"pith_short_8","alias_value":"6DXKAMHG","created_at":"2026-07-05T00:32:16Z"}],"graph_snapshots":[{"event_id":"sha256:3a2a4ef65a329bf8805d8b788fdeeb488bd227a44d6d905aba5ddc20d97b5955","target":"graph","created_at":"2026-07-05T00:32:16Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2001.02330/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"When the navigational environment is known, it can be represented as a graph where landmarks are nodes, the robot behaviors that move from node to node are edges, and the route is a set of behavioral instructions. The route path from source to destination can be viewed as a class of combinatorial optimization problems where the path is a sequential subset from a set of discrete items. The pointer network is an attention-based recurrent network that is suitable for such a task. In this paper, we utilize a modified R-NET with gated attention and self-matching attention translating natural langua","authors_text":"Amar Shrestha, Haowen Fang, Krittaphat Pugdeethosapol, Qinru Qiu","cross_cats":["cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2020-01-08T01:14:11Z","title":"High-Level Plan for Behavioral Robot Navigation with Natural Language Directions and R-NET"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2001.02330","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:184eb6842b4b6caad0ef729bd5c2f427e6f7c1d3a67d153d13df387b3fd19008","target":"record","created_at":"2026-07-05T00:32:16Z","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":"2891e0b16c17ec2a3de6cf52f2b6cd56d2ab3791762df6e5aa78393b6384ad2d","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2020-01-08T01:14:11Z","title_canon_sha256":"579750b53a4ca8fe390de2d0d22fae85e21c034bc9258ab9f064883d72ba1791"},"schema_version":"1.0","source":{"id":"2001.02330","kind":"arxiv","version":1}},"canonical_sha256":"f0eea030e695daf37b3d3c4cc273e34fee7c4699e2d56ac34c34e0e11fcb03a0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f0eea030e695daf37b3d3c4cc273e34fee7c4699e2d56ac34c34e0e11fcb03a0","first_computed_at":"2026-07-05T00:32:16.956293Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T00:32:16.956293Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Axk3kXvaeJXRu0wZ2+gXkoswUPeDgInS/7wkSes5y4DoW4OZ65XdTxagPIl9siDIAf4RPJbWQYZv5patMOs3Ag==","signature_status":"signed_v1","signed_at":"2026-07-05T00:32:16.956725Z","signed_message":"canonical_sha256_bytes"},"source_id":"2001.02330","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:184eb6842b4b6caad0ef729bd5c2f427e6f7c1d3a67d153d13df387b3fd19008","sha256:3a2a4ef65a329bf8805d8b788fdeeb488bd227a44d6d905aba5ddc20d97b5955"],"state_sha256":"d0b9429a8337131e2cc1598db40cfa20b8daba236fb4738ff11928b4be14f385"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"w+ljUy9VMHuHxFARnHyUs+U0k2bDPrJPCzWJfuEdyH6t+aoE/VFOdId0zcq2cQXdHiVcZk4pIwjYdvJcI05FBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-07T10:00:03.297440Z","bundle_sha256":"319c537554fb3672f7f37a8ff6a27c6914eb379efe0fffbd7f0d99e82a5eb4a5"}}