{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:3RVBOM3JVN36VOGFZCP23RDSQJ","short_pith_number":"pith:3RVBOM3J","canonical_record":{"source":{"id":"1903.09243","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2019-03-21T21:38:20Z","cross_cats_sorted":["cs.AI","cs.CL","cs.LG"],"title_canon_sha256":"d6556d4358ac088addf3bf9c1b260c1c6c2c3beadfb12a09a7723168a03485c7","abstract_canon_sha256":"3a57140d307bdcf2bec51737f67c6cf4b9ad9d77615cd14e6e642cd6b4b8bf5e"},"schema_version":"1.0"},"canonical_sha256":"dc6a173369ab77eab8c5c89fadc4728266fcad63c1f21abd9b254cf1addc35f7","source":{"kind":"arxiv","id":"1903.09243","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1903.09243","created_at":"2026-05-17T23:50:40Z"},{"alias_kind":"arxiv_version","alias_value":"1903.09243v1","created_at":"2026-05-17T23:50:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.09243","created_at":"2026-05-17T23:50:40Z"},{"alias_kind":"pith_short_12","alias_value":"3RVBOM3JVN36","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_16","alias_value":"3RVBOM3JVN36VOGF","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_8","alias_value":"3RVBOM3J","created_at":"2026-05-18T12:33:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:3RVBOM3JVN36VOGFZCP23RDSQJ","target":"record","payload":{"canonical_record":{"source":{"id":"1903.09243","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2019-03-21T21:38:20Z","cross_cats_sorted":["cs.AI","cs.CL","cs.LG"],"title_canon_sha256":"d6556d4358ac088addf3bf9c1b260c1c6c2c3beadfb12a09a7723168a03485c7","abstract_canon_sha256":"3a57140d307bdcf2bec51737f67c6cf4b9ad9d77615cd14e6e642cd6b4b8bf5e"},"schema_version":"1.0"},"canonical_sha256":"dc6a173369ab77eab8c5c89fadc4728266fcad63c1f21abd9b254cf1addc35f7","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:50:40.225986Z","signature_b64":"mNS+7Ixh9TyHxkzZ9fXjrn6Nvh/FtmcmeRXUMrmcbvlK4FcwOc8K0ZfH+E4SOmcWK8OYIV/G1xiF5ZFmvTwmBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dc6a173369ab77eab8c5c89fadc4728266fcad63c1f21abd9b254cf1addc35f7","last_reissued_at":"2026-05-17T23:50:40.225519Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:50:40.225519Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1903.09243","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-17T23:50:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Q1jMULEgO9tjQPgtE8DkSAIZo0dMqPMVxldf3FUakIfAGctDp0IOHWVIcJpKcQ1VmoMTC50QRQ90x/kLf/S0Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T21:53:23.582643Z"},"content_sha256":"0e5db372b24373500abb7b1ec7582898b1b14bdef8f747461c26a92965d93d5e","schema_version":"1.0","event_id":"sha256:0e5db372b24373500abb7b1ec7582898b1b14bdef8f747461c26a92965d93d5e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:3RVBOM3JVN36VOGFZCP23RDSQJ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Inferring Compact Representations for Efficient Natural Language Understanding of Robot Instructions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.CL","cs.LG"],"primary_cat":"cs.RO","authors_text":"Andrea F. Daniele, Matthew R. Walter, Siddharth Patki, Thomas M. Howard","submitted_at":"2019-03-21T21:38:20Z","abstract_excerpt":"The speed and accuracy with which robots are able to interpret natural language is fundamental to realizing effective human-robot interaction. A great deal of attention has been paid to developing models and approximate inference algorithms that improve the efficiency of language understanding. However, existing methods still attempt to reason over a representation of the environment that is flat and unnecessarily detailed, which limits scalability. An open problem is then to develop methods capable of producing the most compact environment model sufficient for accurate and efficient natural l"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.09243","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-17T23:50:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"p+0Txpf3fNkrmYhbAV06YGTfcWgIFDdUt0XW8IxPxMXDRwMnWHEjJ3oCO/odnItjTvNSJ6dx5y6U5y8lyl13BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T21:53:23.583267Z"},"content_sha256":"c32036f1f4674e857343226391cb9fbfc23d63c92f04e12a09840d2e22e94db3","schema_version":"1.0","event_id":"sha256:c32036f1f4674e857343226391cb9fbfc23d63c92f04e12a09840d2e22e94db3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3RVBOM3JVN36VOGFZCP23RDSQJ/bundle.json","state_url":"https://pith.science/pith/3RVBOM3JVN36VOGFZCP23RDSQJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3RVBOM3JVN36VOGFZCP23RDSQJ/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-27T21:53:23Z","links":{"resolver":"https://pith.science/pith/3RVBOM3JVN36VOGFZCP23RDSQJ","bundle":"https://pith.science/pith/3RVBOM3JVN36VOGFZCP23RDSQJ/bundle.json","state":"https://pith.science/pith/3RVBOM3JVN36VOGFZCP23RDSQJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3RVBOM3JVN36VOGFZCP23RDSQJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:3RVBOM3JVN36VOGFZCP23RDSQJ","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":"3a57140d307bdcf2bec51737f67c6cf4b9ad9d77615cd14e6e642cd6b4b8bf5e","cross_cats_sorted":["cs.AI","cs.CL","cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2019-03-21T21:38:20Z","title_canon_sha256":"d6556d4358ac088addf3bf9c1b260c1c6c2c3beadfb12a09a7723168a03485c7"},"schema_version":"1.0","source":{"id":"1903.09243","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1903.09243","created_at":"2026-05-17T23:50:40Z"},{"alias_kind":"arxiv_version","alias_value":"1903.09243v1","created_at":"2026-05-17T23:50:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.09243","created_at":"2026-05-17T23:50:40Z"},{"alias_kind":"pith_short_12","alias_value":"3RVBOM3JVN36","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_16","alias_value":"3RVBOM3JVN36VOGF","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_8","alias_value":"3RVBOM3J","created_at":"2026-05-18T12:33:10Z"}],"graph_snapshots":[{"event_id":"sha256:c32036f1f4674e857343226391cb9fbfc23d63c92f04e12a09840d2e22e94db3","target":"graph","created_at":"2026-05-17T23:50:40Z","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":"The speed and accuracy with which robots are able to interpret natural language is fundamental to realizing effective human-robot interaction. A great deal of attention has been paid to developing models and approximate inference algorithms that improve the efficiency of language understanding. However, existing methods still attempt to reason over a representation of the environment that is flat and unnecessarily detailed, which limits scalability. An open problem is then to develop methods capable of producing the most compact environment model sufficient for accurate and efficient natural l","authors_text":"Andrea F. Daniele, Matthew R. Walter, Siddharth Patki, Thomas M. Howard","cross_cats":["cs.AI","cs.CL","cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2019-03-21T21:38:20Z","title":"Inferring Compact Representations for Efficient Natural Language Understanding of Robot Instructions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.09243","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:0e5db372b24373500abb7b1ec7582898b1b14bdef8f747461c26a92965d93d5e","target":"record","created_at":"2026-05-17T23:50:40Z","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":"3a57140d307bdcf2bec51737f67c6cf4b9ad9d77615cd14e6e642cd6b4b8bf5e","cross_cats_sorted":["cs.AI","cs.CL","cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2019-03-21T21:38:20Z","title_canon_sha256":"d6556d4358ac088addf3bf9c1b260c1c6c2c3beadfb12a09a7723168a03485c7"},"schema_version":"1.0","source":{"id":"1903.09243","kind":"arxiv","version":1}},"canonical_sha256":"dc6a173369ab77eab8c5c89fadc4728266fcad63c1f21abd9b254cf1addc35f7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"dc6a173369ab77eab8c5c89fadc4728266fcad63c1f21abd9b254cf1addc35f7","first_computed_at":"2026-05-17T23:50:40.225519Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:50:40.225519Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"mNS+7Ixh9TyHxkzZ9fXjrn6Nvh/FtmcmeRXUMrmcbvlK4FcwOc8K0ZfH+E4SOmcWK8OYIV/G1xiF5ZFmvTwmBw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:50:40.225986Z","signed_message":"canonical_sha256_bytes"},"source_id":"1903.09243","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0e5db372b24373500abb7b1ec7582898b1b14bdef8f747461c26a92965d93d5e","sha256:c32036f1f4674e857343226391cb9fbfc23d63c92f04e12a09840d2e22e94db3"],"state_sha256":"dfbff449a7d894f925bdf608252d02af5df94cbaec3f19b6472dc1a16bb367ce"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"J8StBJWl9suklpREhD1Gve7B9P9p5u0lyW+3nLpmrLQlK6+uRfnLnAufPYqXThqCqt7Uxdlz0PLsK5UZOOPEDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T21:53:23.586635Z","bundle_sha256":"2b1def95357206967de3ffa956be88ab269f8d65de6bd4694f5d07edda923057"}}