{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:MVWNL6DNJ62CC2RDJEDM7RYYUH","short_pith_number":"pith:MVWNL6DN","canonical_record":{"source":{"id":"2309.14845","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2023-09-26T11:20:57Z","cross_cats_sorted":["cs.SY","eess.SY"],"title_canon_sha256":"c8a98b98eb842f9dd91a063721541359dc9b88cfbcc24a813340c2946e50a0a8","abstract_canon_sha256":"2de28a4d01c3cb3a0f7a4906020fb464d881fc44f08b3b7384e3bb2cebf15fd2"},"schema_version":"1.0"},"canonical_sha256":"656cd5f86d4fb4216a234906cfc718a1e83ca99f90e35d639e30222ea26e0302","source":{"kind":"arxiv","id":"2309.14845","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2309.14845","created_at":"2026-07-05T07:15:16Z"},{"alias_kind":"arxiv_version","alias_value":"2309.14845v2","created_at":"2026-07-05T07:15:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2309.14845","created_at":"2026-07-05T07:15:16Z"},{"alias_kind":"pith_short_12","alias_value":"MVWNL6DNJ62C","created_at":"2026-07-05T07:15:16Z"},{"alias_kind":"pith_short_16","alias_value":"MVWNL6DNJ62CC2RD","created_at":"2026-07-05T07:15:16Z"},{"alias_kind":"pith_short_8","alias_value":"MVWNL6DN","created_at":"2026-07-05T07:15:16Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:MVWNL6DNJ62CC2RDJEDM7RYYUH","target":"record","payload":{"canonical_record":{"source":{"id":"2309.14845","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2023-09-26T11:20:57Z","cross_cats_sorted":["cs.SY","eess.SY"],"title_canon_sha256":"c8a98b98eb842f9dd91a063721541359dc9b88cfbcc24a813340c2946e50a0a8","abstract_canon_sha256":"2de28a4d01c3cb3a0f7a4906020fb464d881fc44f08b3b7384e3bb2cebf15fd2"},"schema_version":"1.0"},"canonical_sha256":"656cd5f86d4fb4216a234906cfc718a1e83ca99f90e35d639e30222ea26e0302","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:15:16.387432Z","signature_b64":"i9mziOBZxtxOc9iUg2yCWXZzZAVSZ5K5OcezIu7yv3r9xjb+sV2PXOapejpAeC1m6j5etfCCu9AhagSsdkrTBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"656cd5f86d4fb4216a234906cfc718a1e83ca99f90e35d639e30222ea26e0302","last_reissued_at":"2026-07-05T07:15:16.386829Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:15:16.386829Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2309.14845","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-05T07:15:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5MQsK3eKtCPxavSh/kw9hQdBxWWq+0SlzDt5afw/T6lkXpEbhjdIjA69OJNa6wx2HyXc0zmBAIrdlLIYNZmrAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T05:13:44.872307Z"},"content_sha256":"fe5ee21f30122db3c3df3ea0c83458816d632aba7deb4e2b2bb788b4b739127c","schema_version":"1.0","event_id":"sha256:fe5ee21f30122db3c3df3ea0c83458816d632aba7deb4e2b2bb788b4b739127c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:MVWNL6DNJ62CC2RDJEDM7RYYUH","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Graph Neural Network Based Method for Path Planning Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY","eess.SY"],"primary_cat":"cs.RO","authors_text":"Jiankun Wang, Wenzheng Chi, Xingrong Diao","submitted_at":"2023-09-26T11:20:57Z","abstract_excerpt":"Sampling-based path planning is a widely used method in robotics, particularly in high-dimensional state space. Among the whole process of the path planning, collision detection is the most time-consuming operation. In this paper, we propose a learning-based path planning method that aims to reduce the number of collision detection. We develop an efficient neural network model based on Graph Neural Networks (GNN) and use the environment map as input. The model outputs weights for each neighbor based on the input and current vertex information, which are used to guide the planner in avoiding ob"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2309.14845","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/2309.14845/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-05T07:15:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+2nnpwZF/g/9OAqVYi1K2t3SSbD6DluUfLmryNlaFiGp0O8HBbLP+ome3FUUcH0lF6St0eXdv8UDFjYC18xPBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T05:13:44.872710Z"},"content_sha256":"477eff3f6444602ce9cc40d7eb3272401d066f4337acd6097f453e1ad8351c9f","schema_version":"1.0","event_id":"sha256:477eff3f6444602ce9cc40d7eb3272401d066f4337acd6097f453e1ad8351c9f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MVWNL6DNJ62CC2RDJEDM7RYYUH/bundle.json","state_url":"https://pith.science/pith/MVWNL6DNJ62CC2RDJEDM7RYYUH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MVWNL6DNJ62CC2RDJEDM7RYYUH/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-07-07T05:13:44Z","links":{"resolver":"https://pith.science/pith/MVWNL6DNJ62CC2RDJEDM7RYYUH","bundle":"https://pith.science/pith/MVWNL6DNJ62CC2RDJEDM7RYYUH/bundle.json","state":"https://pith.science/pith/MVWNL6DNJ62CC2RDJEDM7RYYUH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MVWNL6DNJ62CC2RDJEDM7RYYUH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:MVWNL6DNJ62CC2RDJEDM7RYYUH","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":"2de28a4d01c3cb3a0f7a4906020fb464d881fc44f08b3b7384e3bb2cebf15fd2","cross_cats_sorted":["cs.SY","eess.SY"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2023-09-26T11:20:57Z","title_canon_sha256":"c8a98b98eb842f9dd91a063721541359dc9b88cfbcc24a813340c2946e50a0a8"},"schema_version":"1.0","source":{"id":"2309.14845","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2309.14845","created_at":"2026-07-05T07:15:16Z"},{"alias_kind":"arxiv_version","alias_value":"2309.14845v2","created_at":"2026-07-05T07:15:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2309.14845","created_at":"2026-07-05T07:15:16Z"},{"alias_kind":"pith_short_12","alias_value":"MVWNL6DNJ62C","created_at":"2026-07-05T07:15:16Z"},{"alias_kind":"pith_short_16","alias_value":"MVWNL6DNJ62CC2RD","created_at":"2026-07-05T07:15:16Z"},{"alias_kind":"pith_short_8","alias_value":"MVWNL6DN","created_at":"2026-07-05T07:15:16Z"}],"graph_snapshots":[{"event_id":"sha256:477eff3f6444602ce9cc40d7eb3272401d066f4337acd6097f453e1ad8351c9f","target":"graph","created_at":"2026-07-05T07:15:16Z","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/2309.14845/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Sampling-based path planning is a widely used method in robotics, particularly in high-dimensional state space. Among the whole process of the path planning, collision detection is the most time-consuming operation. In this paper, we propose a learning-based path planning method that aims to reduce the number of collision detection. We develop an efficient neural network model based on Graph Neural Networks (GNN) and use the environment map as input. The model outputs weights for each neighbor based on the input and current vertex information, which are used to guide the planner in avoiding ob","authors_text":"Jiankun Wang, Wenzheng Chi, Xingrong Diao","cross_cats":["cs.SY","eess.SY"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2023-09-26T11:20:57Z","title":"Graph Neural Network Based Method for Path Planning Problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2309.14845","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:fe5ee21f30122db3c3df3ea0c83458816d632aba7deb4e2b2bb788b4b739127c","target":"record","created_at":"2026-07-05T07:15:16Z","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":"2de28a4d01c3cb3a0f7a4906020fb464d881fc44f08b3b7384e3bb2cebf15fd2","cross_cats_sorted":["cs.SY","eess.SY"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2023-09-26T11:20:57Z","title_canon_sha256":"c8a98b98eb842f9dd91a063721541359dc9b88cfbcc24a813340c2946e50a0a8"},"schema_version":"1.0","source":{"id":"2309.14845","kind":"arxiv","version":2}},"canonical_sha256":"656cd5f86d4fb4216a234906cfc718a1e83ca99f90e35d639e30222ea26e0302","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"656cd5f86d4fb4216a234906cfc718a1e83ca99f90e35d639e30222ea26e0302","first_computed_at":"2026-07-05T07:15:16.386829Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T07:15:16.386829Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"i9mziOBZxtxOc9iUg2yCWXZzZAVSZ5K5OcezIu7yv3r9xjb+sV2PXOapejpAeC1m6j5etfCCu9AhagSsdkrTBw==","signature_status":"signed_v1","signed_at":"2026-07-05T07:15:16.387432Z","signed_message":"canonical_sha256_bytes"},"source_id":"2309.14845","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fe5ee21f30122db3c3df3ea0c83458816d632aba7deb4e2b2bb788b4b739127c","sha256:477eff3f6444602ce9cc40d7eb3272401d066f4337acd6097f453e1ad8351c9f"],"state_sha256":"a2e2eed06f2fdc9c06d1bd8b7506e9a4a72e7b40af8893d4026eca7ab59497c1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+99QRXWJGKjRk2UzWtKstfbZRwZYL8dj2XVnKBacMKNgx5m9mLBxyboVfaiBwG+tqZ3R78tA94tjyBpx1uQpCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-07T05:13:44.875324Z","bundle_sha256":"4528691eb35c75514ee3a896d3b0259905ce3dc8e0de96add87d5f4a9831c869"}}