{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:CFR6ZZSHL5RH5GC2FGKZYBFVCV","short_pith_number":"pith:CFR6ZZSH","canonical_record":{"source":{"id":"2503.08090","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2025-03-11T06:46:49Z","cross_cats_sorted":[],"title_canon_sha256":"16df9265117e94de35ba1ef29993e38d1a3abee41e75ab4bf609b31e25d38f88","abstract_canon_sha256":"14d30bf604d72b39da7f1bcb842faf3dd43008b5c9d80a03c4ddebcd72a80166"},"schema_version":"1.0"},"canonical_sha256":"1163ece6475f627e985a29959c04b515487262ef44b8f272bdf3465f462f4403","source":{"kind":"arxiv","id":"2503.08090","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2503.08090","created_at":"2026-07-05T11:44:02Z"},{"alias_kind":"arxiv_version","alias_value":"2503.08090v2","created_at":"2026-07-05T11:44:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2503.08090","created_at":"2026-07-05T11:44:02Z"},{"alias_kind":"pith_short_12","alias_value":"CFR6ZZSHL5RH","created_at":"2026-07-05T11:44:02Z"},{"alias_kind":"pith_short_16","alias_value":"CFR6ZZSHL5RH5GC2","created_at":"2026-07-05T11:44:02Z"},{"alias_kind":"pith_short_8","alias_value":"CFR6ZZSH","created_at":"2026-07-05T11:44:02Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:CFR6ZZSHL5RH5GC2FGKZYBFVCV","target":"record","payload":{"canonical_record":{"source":{"id":"2503.08090","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2025-03-11T06:46:49Z","cross_cats_sorted":[],"title_canon_sha256":"16df9265117e94de35ba1ef29993e38d1a3abee41e75ab4bf609b31e25d38f88","abstract_canon_sha256":"14d30bf604d72b39da7f1bcb842faf3dd43008b5c9d80a03c4ddebcd72a80166"},"schema_version":"1.0"},"canonical_sha256":"1163ece6475f627e985a29959c04b515487262ef44b8f272bdf3465f462f4403","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:44:02.365799Z","signature_b64":"1uJa20FqUUPb7YM5L4WWKvSZkIZ5gZI3NxYPUqn6NJM/8etEn++u0Y5LjYD39pxqvokRxIrqbqcc0vZEKQvbDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1163ece6475f627e985a29959c04b515487262ef44b8f272bdf3465f462f4403","last_reissued_at":"2026-07-05T11:44:02.365227Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:44:02.365227Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2503.08090","source_version":2,"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-05T11:44:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uQbNHe27tPMI1EklXyayiNTdhBH3bwUWVAIR+DKxajqtPJvX/WGDSMEGldHUxbm3JcCYYstWlrPiJ1V4AHBVDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-07T17:39:53.699386Z"},"content_sha256":"2664a44d8977169e286f8bfd326b937943ab868949a857ee24c6865c18d614ae","schema_version":"1.0","event_id":"sha256:2664a44d8977169e286f8bfd326b937943ab868949a857ee24c6865c18d614ae"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:CFR6ZZSHL5RH5GC2FGKZYBFVCV","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"LATMOS: Latent Automaton Task Model from Observation Sequences","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Eduardo Sebasti\\'an, Nikolay Atanasov, Qiyue Dong, Weixiao Zhan","submitted_at":"2025-03-11T06:46:49Z","abstract_excerpt":"Robot task planning from high-level instructions is an important step towards deploying fully autonomous robot systems in the service sector. Three key aspects of robot task planning present challenges yet to be resolved simultaneously, namely, (i) factorization of complex tasks specifications into simpler executable subtasks, (ii) understanding of the current task state from raw observations, and (iii) planning and verification of task executions. To address these challenges, we propose LATMOS, an automata-inspired task model that, given observations from correct task executions, is able to f"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2503.08090","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2503.08090/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-05T11:44:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"S2C9RG85DuQiPBGKiNNc1Q+SainhC0x+Rho2SnmPs/P3PtGIuumanuuCB2Y2rZ/NwwLtgpaBGa6Ggz8BTAJ8AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-07T17:39:53.700057Z"},"content_sha256":"2a0baa45ad04ffe44a1f2d2aad71fff16dc3277d612ce922e2c2183069778945","schema_version":"1.0","event_id":"sha256:2a0baa45ad04ffe44a1f2d2aad71fff16dc3277d612ce922e2c2183069778945"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CFR6ZZSHL5RH5GC2FGKZYBFVCV/bundle.json","state_url":"https://pith.science/pith/CFR6ZZSHL5RH5GC2FGKZYBFVCV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CFR6ZZSHL5RH5GC2FGKZYBFVCV/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-08-07T17:39:53Z","links":{"resolver":"https://pith.science/pith/CFR6ZZSHL5RH5GC2FGKZYBFVCV","bundle":"https://pith.science/pith/CFR6ZZSHL5RH5GC2FGKZYBFVCV/bundle.json","state":"https://pith.science/pith/CFR6ZZSHL5RH5GC2FGKZYBFVCV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CFR6ZZSHL5RH5GC2FGKZYBFVCV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:CFR6ZZSHL5RH5GC2FGKZYBFVCV","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":"14d30bf604d72b39da7f1bcb842faf3dd43008b5c9d80a03c4ddebcd72a80166","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2025-03-11T06:46:49Z","title_canon_sha256":"16df9265117e94de35ba1ef29993e38d1a3abee41e75ab4bf609b31e25d38f88"},"schema_version":"1.0","source":{"id":"2503.08090","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2503.08090","created_at":"2026-07-05T11:44:02Z"},{"alias_kind":"arxiv_version","alias_value":"2503.08090v2","created_at":"2026-07-05T11:44:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2503.08090","created_at":"2026-07-05T11:44:02Z"},{"alias_kind":"pith_short_12","alias_value":"CFR6ZZSHL5RH","created_at":"2026-07-05T11:44:02Z"},{"alias_kind":"pith_short_16","alias_value":"CFR6ZZSHL5RH5GC2","created_at":"2026-07-05T11:44:02Z"},{"alias_kind":"pith_short_8","alias_value":"CFR6ZZSH","created_at":"2026-07-05T11:44:02Z"}],"graph_snapshots":[{"event_id":"sha256:2a0baa45ad04ffe44a1f2d2aad71fff16dc3277d612ce922e2c2183069778945","target":"graph","created_at":"2026-07-05T11:44:02Z","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/2503.08090/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Robot task planning from high-level instructions is an important step towards deploying fully autonomous robot systems in the service sector. Three key aspects of robot task planning present challenges yet to be resolved simultaneously, namely, (i) factorization of complex tasks specifications into simpler executable subtasks, (ii) understanding of the current task state from raw observations, and (iii) planning and verification of task executions. To address these challenges, we propose LATMOS, an automata-inspired task model that, given observations from correct task executions, is able to f","authors_text":"Eduardo Sebasti\\'an, Nikolay Atanasov, Qiyue Dong, Weixiao Zhan","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2025-03-11T06:46:49Z","title":"LATMOS: Latent Automaton Task Model from Observation Sequences"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2503.08090","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:2664a44d8977169e286f8bfd326b937943ab868949a857ee24c6865c18d614ae","target":"record","created_at":"2026-07-05T11:44:02Z","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":"14d30bf604d72b39da7f1bcb842faf3dd43008b5c9d80a03c4ddebcd72a80166","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2025-03-11T06:46:49Z","title_canon_sha256":"16df9265117e94de35ba1ef29993e38d1a3abee41e75ab4bf609b31e25d38f88"},"schema_version":"1.0","source":{"id":"2503.08090","kind":"arxiv","version":2}},"canonical_sha256":"1163ece6475f627e985a29959c04b515487262ef44b8f272bdf3465f462f4403","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1163ece6475f627e985a29959c04b515487262ef44b8f272bdf3465f462f4403","first_computed_at":"2026-07-05T11:44:02.365227Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:44:02.365227Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"1uJa20FqUUPb7YM5L4WWKvSZkIZ5gZI3NxYPUqn6NJM/8etEn++u0Y5LjYD39pxqvokRxIrqbqcc0vZEKQvbDw==","signature_status":"signed_v1","signed_at":"2026-07-05T11:44:02.365799Z","signed_message":"canonical_sha256_bytes"},"source_id":"2503.08090","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2664a44d8977169e286f8bfd326b937943ab868949a857ee24c6865c18d614ae","sha256:2a0baa45ad04ffe44a1f2d2aad71fff16dc3277d612ce922e2c2183069778945"],"state_sha256":"ed6ac2e224e087e4709b808282deb13bb036fca25e96c1925551a472187e5b05"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TTqonqz1AzzYTaRm77GQsfM+4MySJAL4cBamEC8rtoBx2Y/jZ/OfarTJoKM5ZbJcJWhjt+f2u5B89TN1tTrYDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-07T17:39:53.704359Z","bundle_sha256":"55c685e60d92ccf7e4b6bbf89d9980504c39ab24102c90aef597a24b5464cb5d"}}