{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:L4IVX7EG67KIZX64MRNBS3WDJE","short_pith_number":"pith:L4IVX7EG","schema_version":"1.0","canonical_sha256":"5f115bfc86f7d48cdfdc645a196ec349196c6a44a049e52e6259eba862b79df8","source":{"kind":"arxiv","id":"1908.03343","version":1},"attestation_state":"computed","paper":{"title":"Fully Convolutional Search Heuristic Learning for Rapid Path Planners","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.RO"],"primary_cat":"cs.LG","authors_text":"Takuya Narihira, Yuka Ariki","submitted_at":"2019-08-09T07:27:28Z","abstract_excerpt":"Path-planning algorithms are an important part of a wide variety of robotic applications, such as mobile robot navigation and robot arm manipulation. However, in large search spaces in which local traps may exist, it remains challenging to reliably find a path while satisfying real-time constraints. Efforts to speed up the path search have led to the development of many practical path-planning algorithms. These algorithms often define a search heuristic to guide the search towards the goal. The heuristics should be carefully designed for each specific problem to ensure reliability in the vario"},"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":"1908.03343","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-08-09T07:27:28Z","cross_cats_sorted":["cs.AI","cs.RO"],"title_canon_sha256":"3a0aef9929010df2f3722073e8bbaa95cc3e33c6ae23532b64758f024177aed7","abstract_canon_sha256":"2117d6952f0e08831b1d9c3dc387226aac4bc96ba9d351e322aece532b4bb0ca"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T23:52:39.157786Z","signature_b64":"JoJRzE/Om3AGigPI2GqfaUYd8aV2CqztCzDSmuDxiujWdNe/54W7uu9w0QchQt3EF1zuq3aWWuice2ilIgsuCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5f115bfc86f7d48cdfdc645a196ec349196c6a44a049e52e6259eba862b79df8","last_reissued_at":"2026-07-04T23:52:39.157427Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T23:52:39.157427Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fully Convolutional Search Heuristic Learning for Rapid Path Planners","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.RO"],"primary_cat":"cs.LG","authors_text":"Takuya Narihira, Yuka Ariki","submitted_at":"2019-08-09T07:27:28Z","abstract_excerpt":"Path-planning algorithms are an important part of a wide variety of robotic applications, such as mobile robot navigation and robot arm manipulation. However, in large search spaces in which local traps may exist, it remains challenging to reliably find a path while satisfying real-time constraints. Efforts to speed up the path search have led to the development of many practical path-planning algorithms. These algorithms often define a search heuristic to guide the search towards the goal. The heuristics should be carefully designed for each specific problem to ensure reliability in the vario"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.03343","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1908.03343/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":"1908.03343","created_at":"2026-07-04T23:52:39.157484+00:00"},{"alias_kind":"arxiv_version","alias_value":"1908.03343v1","created_at":"2026-07-04T23:52:39.157484+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.03343","created_at":"2026-07-04T23:52:39.157484+00:00"},{"alias_kind":"pith_short_12","alias_value":"L4IVX7EG67KI","created_at":"2026-07-04T23:52:39.157484+00:00"},{"alias_kind":"pith_short_16","alias_value":"L4IVX7EG67KIZX64","created_at":"2026-07-04T23:52:39.157484+00:00"},{"alias_kind":"pith_short_8","alias_value":"L4IVX7EG","created_at":"2026-07-04T23:52:39.157484+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/L4IVX7EG67KIZX64MRNBS3WDJE","json":"https://pith.science/pith/L4IVX7EG67KIZX64MRNBS3WDJE.json","graph_json":"https://pith.science/api/pith-number/L4IVX7EG67KIZX64MRNBS3WDJE/graph.json","events_json":"https://pith.science/api/pith-number/L4IVX7EG67KIZX64MRNBS3WDJE/events.json","paper":"https://pith.science/paper/L4IVX7EG"},"agent_actions":{"view_html":"https://pith.science/pith/L4IVX7EG67KIZX64MRNBS3WDJE","download_json":"https://pith.science/pith/L4IVX7EG67KIZX64MRNBS3WDJE.json","view_paper":"https://pith.science/paper/L4IVX7EG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1908.03343&json=true","fetch_graph":"https://pith.science/api/pith-number/L4IVX7EG67KIZX64MRNBS3WDJE/graph.json","fetch_events":"https://pith.science/api/pith-number/L4IVX7EG67KIZX64MRNBS3WDJE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/L4IVX7EG67KIZX64MRNBS3WDJE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/L4IVX7EG67KIZX64MRNBS3WDJE/action/storage_attestation","attest_author":"https://pith.science/pith/L4IVX7EG67KIZX64MRNBS3WDJE/action/author_attestation","sign_citation":"https://pith.science/pith/L4IVX7EG67KIZX64MRNBS3WDJE/action/citation_signature","submit_replication":"https://pith.science/pith/L4IVX7EG67KIZX64MRNBS3WDJE/action/replication_record"}},"created_at":"2026-07-04T23:52:39.157484+00:00","updated_at":"2026-07-04T23:52:39.157484+00:00"}