{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2022:TN4YEJQTALEWBQC27LNMKLZH73","short_pith_number":"pith:TN4YEJQT","canonical_record":{"source":{"id":"2206.03292","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.RO","submitted_at":"2022-06-07T13:33:53Z","cross_cats_sorted":[],"title_canon_sha256":"3f7c43d71d738f9055541f9560d71c3584acf1b163e2267afb6cc5d86821f9f6","abstract_canon_sha256":"634316ab7f248851087416604e377c7eb8431f551d548cb59d70838ddfd26464"},"schema_version":"1.0"},"canonical_sha256":"9b7982261302c960c05afadac52f27fefc8fb81d2477b2eab2d1c4768f2a9add","source":{"kind":"arxiv","id":"2206.03292","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2206.03292","created_at":"2026-07-05T06:52:19Z"},{"alias_kind":"arxiv_version","alias_value":"2206.03292v2","created_at":"2026-07-05T06:52:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2206.03292","created_at":"2026-07-05T06:52:19Z"},{"alias_kind":"pith_short_12","alias_value":"TN4YEJQTALEW","created_at":"2026-07-05T06:52:19Z"},{"alias_kind":"pith_short_16","alias_value":"TN4YEJQTALEWBQC2","created_at":"2026-07-05T06:52:19Z"},{"alias_kind":"pith_short_8","alias_value":"TN4YEJQT","created_at":"2026-07-05T06:52:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2022:TN4YEJQTALEWBQC27LNMKLZH73","target":"record","payload":{"canonical_record":{"source":{"id":"2206.03292","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.RO","submitted_at":"2022-06-07T13:33:53Z","cross_cats_sorted":[],"title_canon_sha256":"3f7c43d71d738f9055541f9560d71c3584acf1b163e2267afb6cc5d86821f9f6","abstract_canon_sha256":"634316ab7f248851087416604e377c7eb8431f551d548cb59d70838ddfd26464"},"schema_version":"1.0"},"canonical_sha256":"9b7982261302c960c05afadac52f27fefc8fb81d2477b2eab2d1c4768f2a9add","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:52:19.671651Z","signature_b64":"LEvjxNBcWGA/8/fkV0xobxapBlgwcydvmkh/NwAccj2+zr5edL7Nln2JRWGWYU76DaXP+FNXUZ3eBuFvNjtyCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9b7982261302c960c05afadac52f27fefc8fb81d2477b2eab2d1c4768f2a9add","last_reissued_at":"2026-07-05T06:52:19.671167Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:52:19.671167Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2206.03292","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-05T06:52:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fZ0kzA5fuzSguNH29etYfltJEubhC/+zgjj2sd+C8t6yY7RnEB28oHE8OupdCU+12+NTxVOxziuTTs0et/NvBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-21T22:40:37.114961Z"},"content_sha256":"8f5b9eeb9a0e7cddeabc4594a2317ee6f0b2a98c71e23d80f7657ce2eed2248e","schema_version":"1.0","event_id":"sha256:8f5b9eeb9a0e7cddeabc4594a2317ee6f0b2a98c71e23d80f7657ce2eed2248e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2022:TN4YEJQTALEWBQC27LNMKLZH73","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Learning-Based Motion Planning with Mixture Density Networks","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Jianping He, Xiaoming Duan, Yinghan Wang","submitted_at":"2022-06-07T13:33:53Z","abstract_excerpt":"The trade-off between computation time and path optimality is a key consideration in motion planning algorithms. While classical sampling based algorithms fall short of computational efficiency in high dimensional planning, learning based methods have shown great potential in achieving time efficient and optimal motion planning. The SOTA learning based motion planning algorithms utilize paths generated by sampling based methods as expert supervision data and train networks via regression techniques. However, these methods often overlook the important multimodal property of the optimal paths in"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2206.03292","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/2206.03292/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-05T06:52:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uNXzi4HyPL5qyq6p0qFVv0/ceDESYLEzYurxZeALa6Z9RxUJWgEYO0/UP5o7lAiKMe2RkLRl2wRZ4evg4IU9Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-21T22:40:37.115461Z"},"content_sha256":"37bd37dcbddf4e6287397dd4a681397caed57da2fe8c8173379770752262d212","schema_version":"1.0","event_id":"sha256:37bd37dcbddf4e6287397dd4a681397caed57da2fe8c8173379770752262d212"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TN4YEJQTALEWBQC27LNMKLZH73/bundle.json","state_url":"https://pith.science/pith/TN4YEJQTALEWBQC27LNMKLZH73/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TN4YEJQTALEWBQC27LNMKLZH73/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-21T22:40:37Z","links":{"resolver":"https://pith.science/pith/TN4YEJQTALEWBQC27LNMKLZH73","bundle":"https://pith.science/pith/TN4YEJQTALEWBQC27LNMKLZH73/bundle.json","state":"https://pith.science/pith/TN4YEJQTALEWBQC27LNMKLZH73/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TN4YEJQTALEWBQC27LNMKLZH73/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:TN4YEJQTALEWBQC27LNMKLZH73","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":"634316ab7f248851087416604e377c7eb8431f551d548cb59d70838ddfd26464","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.RO","submitted_at":"2022-06-07T13:33:53Z","title_canon_sha256":"3f7c43d71d738f9055541f9560d71c3584acf1b163e2267afb6cc5d86821f9f6"},"schema_version":"1.0","source":{"id":"2206.03292","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2206.03292","created_at":"2026-07-05T06:52:19Z"},{"alias_kind":"arxiv_version","alias_value":"2206.03292v2","created_at":"2026-07-05T06:52:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2206.03292","created_at":"2026-07-05T06:52:19Z"},{"alias_kind":"pith_short_12","alias_value":"TN4YEJQTALEW","created_at":"2026-07-05T06:52:19Z"},{"alias_kind":"pith_short_16","alias_value":"TN4YEJQTALEWBQC2","created_at":"2026-07-05T06:52:19Z"},{"alias_kind":"pith_short_8","alias_value":"TN4YEJQT","created_at":"2026-07-05T06:52:19Z"}],"graph_snapshots":[{"event_id":"sha256:37bd37dcbddf4e6287397dd4a681397caed57da2fe8c8173379770752262d212","target":"graph","created_at":"2026-07-05T06:52:19Z","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/2206.03292/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The trade-off between computation time and path optimality is a key consideration in motion planning algorithms. While classical sampling based algorithms fall short of computational efficiency in high dimensional planning, learning based methods have shown great potential in achieving time efficient and optimal motion planning. The SOTA learning based motion planning algorithms utilize paths generated by sampling based methods as expert supervision data and train networks via regression techniques. However, these methods often overlook the important multimodal property of the optimal paths in","authors_text":"Jianping He, Xiaoming Duan, Yinghan Wang","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.RO","submitted_at":"2022-06-07T13:33:53Z","title":"Learning-Based Motion Planning with Mixture Density Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2206.03292","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:8f5b9eeb9a0e7cddeabc4594a2317ee6f0b2a98c71e23d80f7657ce2eed2248e","target":"record","created_at":"2026-07-05T06:52:19Z","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":"634316ab7f248851087416604e377c7eb8431f551d548cb59d70838ddfd26464","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.RO","submitted_at":"2022-06-07T13:33:53Z","title_canon_sha256":"3f7c43d71d738f9055541f9560d71c3584acf1b163e2267afb6cc5d86821f9f6"},"schema_version":"1.0","source":{"id":"2206.03292","kind":"arxiv","version":2}},"canonical_sha256":"9b7982261302c960c05afadac52f27fefc8fb81d2477b2eab2d1c4768f2a9add","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9b7982261302c960c05afadac52f27fefc8fb81d2477b2eab2d1c4768f2a9add","first_computed_at":"2026-07-05T06:52:19.671167Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T06:52:19.671167Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"LEvjxNBcWGA/8/fkV0xobxapBlgwcydvmkh/NwAccj2+zr5edL7Nln2JRWGWYU76DaXP+FNXUZ3eBuFvNjtyCw==","signature_status":"signed_v1","signed_at":"2026-07-05T06:52:19.671651Z","signed_message":"canonical_sha256_bytes"},"source_id":"2206.03292","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8f5b9eeb9a0e7cddeabc4594a2317ee6f0b2a98c71e23d80f7657ce2eed2248e","sha256:37bd37dcbddf4e6287397dd4a681397caed57da2fe8c8173379770752262d212"],"state_sha256":"2f02f27c89a68fe67760fab60ee63df98b7069be87a9d658e1a685dc405637aa"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/7uCBbQi3vptPso9Xa87i0Ffw3qdtrQVeW9jfquq6hhAlsjF+c43ey9guc0claRbKAdjNcpTLkU2DwK+QjbSDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-21T22:40:37.120761Z","bundle_sha256":"5cd22a43e9581d87f6398980b36ddbafe8d084797824f9789fb71ee486189287"}}