{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:5T73H5LLTMGTQ6YWZLV4MZIIK6","short_pith_number":"pith:5T73H5LL","schema_version":"1.0","canonical_sha256":"ecffb3f56b9b0d387b16caebc6650857a76a1fd8f8f020cfd17a9b103c823716","source":{"kind":"arxiv","id":"2410.17547","version":3},"attestation_state":"computed","paper":{"title":"Generalizable Motion Planning via Operator Learning","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Luke Bhan, Nikolay Atanasov, Sharath Matada, Yuanyuan Shi","submitted_at":"2024-10-23T04:06:35Z","abstract_excerpt":"In this work, we introduce a planning neural operator (PNO) for predicting the value function of a motion planning problem. We recast value function approximation as learning a single operator from the cost function space to the value function space, which is defined by an Eikonal partial differential equation (PDE). Therefore, our PNO model, despite being trained with a finite number of samples at coarse resolution, inherits the zero-shot super-resolution property of neural operators. We demonstrate accurate value function approximation at $16\\times$ the training resolution on the MovingAI la"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2410.17547","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.RO","submitted_at":"2024-10-23T04:06:35Z","cross_cats_sorted":[],"title_canon_sha256":"912d3c466e2eead32571ba754a51be90216a0409ef04602dc06c1502ef0bc343","abstract_canon_sha256":"9c6d8d0bcd8403f0a90cb890723f85d78094908a76c7c86df2284b4a57e43f2d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:10:01.912241Z","signature_b64":"LouUC6OA0St/S21mQVvyLNgdZUv93tOKi4cBUuySIk1nTohPyWf0BER7V1m8WXChM6zXHY8jbuAyjzFYk8yfDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ecffb3f56b9b0d387b16caebc6650857a76a1fd8f8f020cfd17a9b103c823716","last_reissued_at":"2026-07-05T11:10:01.911742Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:10:01.911742Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Generalizable Motion Planning via Operator Learning","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Luke Bhan, Nikolay Atanasov, Sharath Matada, Yuanyuan Shi","submitted_at":"2024-10-23T04:06:35Z","abstract_excerpt":"In this work, we introduce a planning neural operator (PNO) for predicting the value function of a motion planning problem. We recast value function approximation as learning a single operator from the cost function space to the value function space, which is defined by an Eikonal partial differential equation (PDE). Therefore, our PNO model, despite being trained with a finite number of samples at coarse resolution, inherits the zero-shot super-resolution property of neural operators. We demonstrate accurate value function approximation at $16\\times$ the training resolution on the MovingAI la"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2410.17547","kind":"arxiv","version":3},"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/2410.17547/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2410.17547","created_at":"2026-07-05T11:10:01.911800+00:00"},{"alias_kind":"arxiv_version","alias_value":"2410.17547v3","created_at":"2026-07-05T11:10:01.911800+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2410.17547","created_at":"2026-07-05T11:10:01.911800+00:00"},{"alias_kind":"pith_short_12","alias_value":"5T73H5LLTMGT","created_at":"2026-07-05T11:10:01.911800+00:00"},{"alias_kind":"pith_short_16","alias_value":"5T73H5LLTMGTQ6YW","created_at":"2026-07-05T11:10:01.911800+00:00"},{"alias_kind":"pith_short_8","alias_value":"5T73H5LL","created_at":"2026-07-05T11:10:01.911800+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.03756","citing_title":"Neural Navigation Functions for Zero-Shot Generalizable Motion Planning","ref_index":3,"is_internal_anchor":false},{"citing_arxiv_id":"2601.12538","citing_title":"Agentic Reasoning for Large Language Models","ref_index":193,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/5T73H5LLTMGTQ6YWZLV4MZIIK6","json":"https://pith.science/pith/5T73H5LLTMGTQ6YWZLV4MZIIK6.json","graph_json":"https://pith.science/api/pith-number/5T73H5LLTMGTQ6YWZLV4MZIIK6/graph.json","events_json":"https://pith.science/api/pith-number/5T73H5LLTMGTQ6YWZLV4MZIIK6/events.json","paper":"https://pith.science/paper/5T73H5LL"},"agent_actions":{"view_html":"https://pith.science/pith/5T73H5LLTMGTQ6YWZLV4MZIIK6","download_json":"https://pith.science/pith/5T73H5LLTMGTQ6YWZLV4MZIIK6.json","view_paper":"https://pith.science/paper/5T73H5LL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2410.17547&json=true","fetch_graph":"https://pith.science/api/pith-number/5T73H5LLTMGTQ6YWZLV4MZIIK6/graph.json","fetch_events":"https://pith.science/api/pith-number/5T73H5LLTMGTQ6YWZLV4MZIIK6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5T73H5LLTMGTQ6YWZLV4MZIIK6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5T73H5LLTMGTQ6YWZLV4MZIIK6/action/storage_attestation","attest_author":"https://pith.science/pith/5T73H5LLTMGTQ6YWZLV4MZIIK6/action/author_attestation","sign_citation":"https://pith.science/pith/5T73H5LLTMGTQ6YWZLV4MZIIK6/action/citation_signature","submit_replication":"https://pith.science/pith/5T73H5LLTMGTQ6YWZLV4MZIIK6/action/replication_record"}},"created_at":"2026-07-05T11:10:01.911800+00:00","updated_at":"2026-07-05T11:10:01.911800+00:00"}