{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:5AWTDWYDMQG3QFNCXPLERFFBVC","short_pith_number":"pith:5AWTDWYD","canonical_record":{"source":{"id":"1802.05835","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2018-02-16T04:52:58Z","cross_cats_sorted":[],"title_canon_sha256":"f5d859c98f35ea708bd9c2956b515b8a8f53179e160077784927564f87086605","abstract_canon_sha256":"830b98bfd99540b63419dde4535f0d28e7a4112e66149482f79ebbb2ebbcb314"},"schema_version":"1.0"},"canonical_sha256":"e82d31db03640db815a2bbd64894a1a8b28e09aecffbfeafd62af592d47aef3c","source":{"kind":"arxiv","id":"1802.05835","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.05835","created_at":"2026-05-18T00:23:10Z"},{"alias_kind":"arxiv_version","alias_value":"1802.05835v1","created_at":"2026-05-18T00:23:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.05835","created_at":"2026-05-18T00:23:10Z"},{"alias_kind":"pith_short_12","alias_value":"5AWTDWYDMQG3","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_16","alias_value":"5AWTDWYDMQG3QFNC","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_8","alias_value":"5AWTDWYD","created_at":"2026-05-18T12:32:08Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:5AWTDWYDMQG3QFNCXPLERFFBVC","target":"record","payload":{"canonical_record":{"source":{"id":"1802.05835","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2018-02-16T04:52:58Z","cross_cats_sorted":[],"title_canon_sha256":"f5d859c98f35ea708bd9c2956b515b8a8f53179e160077784927564f87086605","abstract_canon_sha256":"830b98bfd99540b63419dde4535f0d28e7a4112e66149482f79ebbb2ebbcb314"},"schema_version":"1.0"},"canonical_sha256":"e82d31db03640db815a2bbd64894a1a8b28e09aecffbfeafd62af592d47aef3c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:23:10.859392Z","signature_b64":"qkjf0oGXTCj8hLizHDoTGOdatDZy06funQj/ms/a2Jdxv0wGMmTOsaxdo70EldEfjoC73Glz3KFaDW4IQoGwDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e82d31db03640db815a2bbd64894a1a8b28e09aecffbfeafd62af592d47aef3c","last_reissued_at":"2026-05-18T00:23:10.858700Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:23:10.858700Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1802.05835","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-18T00:23:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"80C0YwbWTIY71M5xuIxcJh7gQ5FPMZsGcRL9xGXRhmrx183o4MM2H0kCDke/gX6J0zScpjfcRBXnyUOsD8mvBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T15:20:53.277681Z"},"content_sha256":"827f2652a1e45beaa07c9f767190d2650b0f4a8ba95d7f56f50934046f644ac3","schema_version":"1.0","event_id":"sha256:827f2652a1e45beaa07c9f767190d2650b0f4a8ba95d7f56f50934046f644ac3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:5AWTDWYDMQG3QFNCXPLERFFBVC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An Anytime Algorithm for Task and Motion MDPs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Nishant Desai, Richard Freedman, Shlomo Zilberstein, Siddharth Srivastava","submitted_at":"2018-02-16T04:52:58Z","abstract_excerpt":"Integrated task and motion planning has emerged as a challenging problem in sequential decision making, where a robot needs to compute high-level strategy and low-level motion plans for solving complex tasks. While high-level strategies require decision making over longer time-horizons and scales, their feasibility depends on low-level constraints based upon the geometries and continuous dynamics of the environment. The hybrid nature of this problem makes it difficult to scale; most existing approaches focus on deterministic, fully observable scenarios. We present a new approach where the high"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.05835","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-18T00:23:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RqQp8CxhL7gGBbYoAHTaaSC53gDhTS/l/SA65ExNmmBctTK3EWUMtTNDey6nj8+wVI67la2iMVOkscKL+fK5BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T15:20:53.278028Z"},"content_sha256":"2b38cff46e09a426a9f1b9da8aa828c5354747fc6140d38164eeefc9f7781a70","schema_version":"1.0","event_id":"sha256:2b38cff46e09a426a9f1b9da8aa828c5354747fc6140d38164eeefc9f7781a70"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5AWTDWYDMQG3QFNCXPLERFFBVC/bundle.json","state_url":"https://pith.science/pith/5AWTDWYDMQG3QFNCXPLERFFBVC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5AWTDWYDMQG3QFNCXPLERFFBVC/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-06-01T15:20:53Z","links":{"resolver":"https://pith.science/pith/5AWTDWYDMQG3QFNCXPLERFFBVC","bundle":"https://pith.science/pith/5AWTDWYDMQG3QFNCXPLERFFBVC/bundle.json","state":"https://pith.science/pith/5AWTDWYDMQG3QFNCXPLERFFBVC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5AWTDWYDMQG3QFNCXPLERFFBVC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:5AWTDWYDMQG3QFNCXPLERFFBVC","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":"830b98bfd99540b63419dde4535f0d28e7a4112e66149482f79ebbb2ebbcb314","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2018-02-16T04:52:58Z","title_canon_sha256":"f5d859c98f35ea708bd9c2956b515b8a8f53179e160077784927564f87086605"},"schema_version":"1.0","source":{"id":"1802.05835","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.05835","created_at":"2026-05-18T00:23:10Z"},{"alias_kind":"arxiv_version","alias_value":"1802.05835v1","created_at":"2026-05-18T00:23:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.05835","created_at":"2026-05-18T00:23:10Z"},{"alias_kind":"pith_short_12","alias_value":"5AWTDWYDMQG3","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_16","alias_value":"5AWTDWYDMQG3QFNC","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_8","alias_value":"5AWTDWYD","created_at":"2026-05-18T12:32:08Z"}],"graph_snapshots":[{"event_id":"sha256:2b38cff46e09a426a9f1b9da8aa828c5354747fc6140d38164eeefc9f7781a70","target":"graph","created_at":"2026-05-18T00:23:10Z","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":"Integrated task and motion planning has emerged as a challenging problem in sequential decision making, where a robot needs to compute high-level strategy and low-level motion plans for solving complex tasks. While high-level strategies require decision making over longer time-horizons and scales, their feasibility depends on low-level constraints based upon the geometries and continuous dynamics of the environment. The hybrid nature of this problem makes it difficult to scale; most existing approaches focus on deterministic, fully observable scenarios. We present a new approach where the high","authors_text":"Nishant Desai, Richard Freedman, Shlomo Zilberstein, Siddharth Srivastava","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2018-02-16T04:52:58Z","title":"An Anytime Algorithm for Task and Motion MDPs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.05835","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:827f2652a1e45beaa07c9f767190d2650b0f4a8ba95d7f56f50934046f644ac3","target":"record","created_at":"2026-05-18T00:23:10Z","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":"830b98bfd99540b63419dde4535f0d28e7a4112e66149482f79ebbb2ebbcb314","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2018-02-16T04:52:58Z","title_canon_sha256":"f5d859c98f35ea708bd9c2956b515b8a8f53179e160077784927564f87086605"},"schema_version":"1.0","source":{"id":"1802.05835","kind":"arxiv","version":1}},"canonical_sha256":"e82d31db03640db815a2bbd64894a1a8b28e09aecffbfeafd62af592d47aef3c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e82d31db03640db815a2bbd64894a1a8b28e09aecffbfeafd62af592d47aef3c","first_computed_at":"2026-05-18T00:23:10.858700Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:23:10.858700Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"qkjf0oGXTCj8hLizHDoTGOdatDZy06funQj/ms/a2Jdxv0wGMmTOsaxdo70EldEfjoC73Glz3KFaDW4IQoGwDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:23:10.859392Z","signed_message":"canonical_sha256_bytes"},"source_id":"1802.05835","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:827f2652a1e45beaa07c9f767190d2650b0f4a8ba95d7f56f50934046f644ac3","sha256:2b38cff46e09a426a9f1b9da8aa828c5354747fc6140d38164eeefc9f7781a70"],"state_sha256":"4e869247d21a64daafcca2cf5c9202367488c79a6c43d6b43a1de072c167c003"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CV11fyVxcxd74fTzGn2IfgcMU7yc/JJoNyYq7M8PY4z3rG8R646lV2EF6LjkusJk9wOOChC20hpbdFdD3IRJBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T15:20:53.280375Z","bundle_sha256":"f455794ced39bb20f983c7772ee69b1b1a99985f262383b8ac435cc7f77901ae"}}