{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:BZ65MUFJ4KJMSJTMG2TNAJKAUU","short_pith_number":"pith:BZ65MUFJ","canonical_record":{"source":{"id":"1902.01560","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2019-02-05T06:03:18Z","cross_cats_sorted":["cs.RO"],"title_canon_sha256":"d635d8ed72951df9ae352ecdb05a504191a107b5aac6781399f036a0b0e4bef6","abstract_canon_sha256":"0ce0fe0e73ffd15f3a5c1fc382f53f69f758ee3a8a3b07793946773c6911a3bc"},"schema_version":"1.0"},"canonical_sha256":"0e7dd650a9e292c9266c36a6d02540a51862740103e2c00f391cce7839f307b2","source":{"kind":"arxiv","id":"1902.01560","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1902.01560","created_at":"2026-05-17T23:47:01Z"},{"alias_kind":"arxiv_version","alias_value":"1902.01560v2","created_at":"2026-05-17T23:47:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.01560","created_at":"2026-05-17T23:47:01Z"},{"alias_kind":"pith_short_12","alias_value":"BZ65MUFJ4KJM","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_16","alias_value":"BZ65MUFJ4KJMSJTM","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_8","alias_value":"BZ65MUFJ","created_at":"2026-05-18T12:33:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:BZ65MUFJ4KJMSJTMG2TNAJKAUU","target":"record","payload":{"canonical_record":{"source":{"id":"1902.01560","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2019-02-05T06:03:18Z","cross_cats_sorted":["cs.RO"],"title_canon_sha256":"d635d8ed72951df9ae352ecdb05a504191a107b5aac6781399f036a0b0e4bef6","abstract_canon_sha256":"0ce0fe0e73ffd15f3a5c1fc382f53f69f758ee3a8a3b07793946773c6911a3bc"},"schema_version":"1.0"},"canonical_sha256":"0e7dd650a9e292c9266c36a6d02540a51862740103e2c00f391cce7839f307b2","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:47:01.931281Z","signature_b64":"XNQsk76M1hHQGu7a2QkdOwz/CvzvyqusH+sNETVDmZi/SyIbt8T2/OUp12Z+UmitK8Uy92zgXUR6xQ083Th2AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0e7dd650a9e292c9266c36a6d02540a51862740103e2c00f391cce7839f307b2","last_reissued_at":"2026-05-17T23:47:01.930567Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:47:01.930567Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1902.01560","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-05-17T23:47:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UvbkpwrquhbwkQz0v9mM0DE1tl223ZXkm+SKIG0221mEiJb83ShkR0rD+aZOkJHcaHvjb6tAayHia+kFAwaEDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T05:08:24.452624Z"},"content_sha256":"475e94e56524c96ac3865ac838f10b69cdb9bed914372c1f6cabe2a1c5cab027","schema_version":"1.0","event_id":"sha256:475e94e56524c96ac3865ac838f10b69cdb9bed914372c1f6cabe2a1c5cab027"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:BZ65MUFJ4KJMSJTMG2TNAJKAUU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Dynamic Real-time Multimodal Routing with Hierarchical Hybrid Planning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.RO"],"primary_cat":"cs.AI","authors_text":"Jacob P. Knickerbocker, Mykel J. Kochenderfer, Shushman Choudhury","submitted_at":"2019-02-05T06:03:18Z","abstract_excerpt":"We introduce the problem of Dynamic Real-time Multimodal Routing (DREAMR), which requires planning and executing routes under uncertainty for an autonomous agent. The agent has access to a time-varying transit vehicle network in which it can use multiple modes of transportation. For instance, a drone can either fly or ride on terrain vehicles for segments of their routes. DREAMR is a difficult problem of sequential decision making under uncertainty with both discrete and continuous variables. We design a novel hierarchical hybrid planning framework to solve the DREAMR problem that exploits its"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.01560","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":""},"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:47:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ju8iImylM4JKJolzJNK9KhCZgik45+fJlUZ0t+iaJ0scF6fjlOpqqBzY6rmBoZpjgoliCYLg0Gwujuch16gEBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T05:08:24.453251Z"},"content_sha256":"9f7fa5b81962025f06fb8901d1b71be04209d9bdab0cf018d3e2a86084ac5020","schema_version":"1.0","event_id":"sha256:9f7fa5b81962025f06fb8901d1b71be04209d9bdab0cf018d3e2a86084ac5020"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BZ65MUFJ4KJMSJTMG2TNAJKAUU/bundle.json","state_url":"https://pith.science/pith/BZ65MUFJ4KJMSJTMG2TNAJKAUU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BZ65MUFJ4KJMSJTMG2TNAJKAUU/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-02T05:08:24Z","links":{"resolver":"https://pith.science/pith/BZ65MUFJ4KJMSJTMG2TNAJKAUU","bundle":"https://pith.science/pith/BZ65MUFJ4KJMSJTMG2TNAJKAUU/bundle.json","state":"https://pith.science/pith/BZ65MUFJ4KJMSJTMG2TNAJKAUU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BZ65MUFJ4KJMSJTMG2TNAJKAUU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:BZ65MUFJ4KJMSJTMG2TNAJKAUU","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":"0ce0fe0e73ffd15f3a5c1fc382f53f69f758ee3a8a3b07793946773c6911a3bc","cross_cats_sorted":["cs.RO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2019-02-05T06:03:18Z","title_canon_sha256":"d635d8ed72951df9ae352ecdb05a504191a107b5aac6781399f036a0b0e4bef6"},"schema_version":"1.0","source":{"id":"1902.01560","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1902.01560","created_at":"2026-05-17T23:47:01Z"},{"alias_kind":"arxiv_version","alias_value":"1902.01560v2","created_at":"2026-05-17T23:47:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.01560","created_at":"2026-05-17T23:47:01Z"},{"alias_kind":"pith_short_12","alias_value":"BZ65MUFJ4KJM","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_16","alias_value":"BZ65MUFJ4KJMSJTM","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_8","alias_value":"BZ65MUFJ","created_at":"2026-05-18T12:33:12Z"}],"graph_snapshots":[{"event_id":"sha256:9f7fa5b81962025f06fb8901d1b71be04209d9bdab0cf018d3e2a86084ac5020","target":"graph","created_at":"2026-05-17T23:47:01Z","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":"We introduce the problem of Dynamic Real-time Multimodal Routing (DREAMR), which requires planning and executing routes under uncertainty for an autonomous agent. The agent has access to a time-varying transit vehicle network in which it can use multiple modes of transportation. For instance, a drone can either fly or ride on terrain vehicles for segments of their routes. DREAMR is a difficult problem of sequential decision making under uncertainty with both discrete and continuous variables. We design a novel hierarchical hybrid planning framework to solve the DREAMR problem that exploits its","authors_text":"Jacob P. Knickerbocker, Mykel J. Kochenderfer, Shushman Choudhury","cross_cats":["cs.RO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2019-02-05T06:03:18Z","title":"Dynamic Real-time Multimodal Routing with Hierarchical Hybrid Planning"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.01560","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:475e94e56524c96ac3865ac838f10b69cdb9bed914372c1f6cabe2a1c5cab027","target":"record","created_at":"2026-05-17T23:47:01Z","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":"0ce0fe0e73ffd15f3a5c1fc382f53f69f758ee3a8a3b07793946773c6911a3bc","cross_cats_sorted":["cs.RO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2019-02-05T06:03:18Z","title_canon_sha256":"d635d8ed72951df9ae352ecdb05a504191a107b5aac6781399f036a0b0e4bef6"},"schema_version":"1.0","source":{"id":"1902.01560","kind":"arxiv","version":2}},"canonical_sha256":"0e7dd650a9e292c9266c36a6d02540a51862740103e2c00f391cce7839f307b2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0e7dd650a9e292c9266c36a6d02540a51862740103e2c00f391cce7839f307b2","first_computed_at":"2026-05-17T23:47:01.930567Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:47:01.930567Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"XNQsk76M1hHQGu7a2QkdOwz/CvzvyqusH+sNETVDmZi/SyIbt8T2/OUp12Z+UmitK8Uy92zgXUR6xQ083Th2AQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:47:01.931281Z","signed_message":"canonical_sha256_bytes"},"source_id":"1902.01560","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:475e94e56524c96ac3865ac838f10b69cdb9bed914372c1f6cabe2a1c5cab027","sha256:9f7fa5b81962025f06fb8901d1b71be04209d9bdab0cf018d3e2a86084ac5020"],"state_sha256":"9fc5f1c2d6c04a90ea09faaec46d60622fa4d478b98c1db08813755dd382cbf4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"imB9Xp/wNBimjWSrbLMHTlmiHBtzp1hiu6m6vB+TkjIG2XsGdoZVMIDNrewwroXsNAGvsakQv4y3Mrwa7EWcDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T05:08:24.456447Z","bundle_sha256":"d4eb7d862d6e46a7dcf49d225d27a21df1648e8f5817d5405431706e021c6491"}}