{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:KCMTYBEGA7MJQBMICAJDJVTXEF","short_pith_number":"pith:KCMTYBEG","schema_version":"1.0","canonical_sha256":"50993c048607d8980588101234d67721784494d73271f15c3b135767a1a24338","source":{"kind":"arxiv","id":"2104.14300","version":1},"attestation_state":"computed","paper":{"title":"Capability Iteration Network for Robot Path Planning","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Buqing Nie, Feng Gao, Yidong Mei, Yue Gao","submitted_at":"2021-04-29T12:38:10Z","abstract_excerpt":"Path planning is an important topic in robotics. Recently, value iteration based deep learning models have achieved good performance such as Value Iteration Network(VIN). However, previous methods suffer from slow convergence and low accuracy on large maps, hence restricted in path planning for agents with complex kinematics such as legged robots. Therefore, we propose a new value iteration based path planning method called Capability Iteration Network(CIN). CIN utilizes sparse reward maps and encodes the capability of the agent with state-action transition probability, rather than a convoluti"},"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":"2104.14300","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.RO","submitted_at":"2021-04-29T12:38:10Z","cross_cats_sorted":[],"title_canon_sha256":"eb8b01daa8d7829b914dedf544537ae0023844775b1fc989b28fd90388e5c56c","abstract_canon_sha256":"14a3de764a6f7071111b4c0e4846a5b894ca3b766a1b146338df6269b29908b5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:36:15.108590Z","signature_b64":"5tHEdNMJ1FuFd7ujjMirmLyhk9w1YdxuQwrzlEsykaHn+yELHwyJoDWNyUrHDi2XpPR23/hPNukIay0P+F1ZAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"50993c048607d8980588101234d67721784494d73271f15c3b135767a1a24338","last_reissued_at":"2026-07-05T02:36:15.108103Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:36:15.108103Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Capability Iteration Network for Robot Path Planning","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Buqing Nie, Feng Gao, Yidong Mei, Yue Gao","submitted_at":"2021-04-29T12:38:10Z","abstract_excerpt":"Path planning is an important topic in robotics. Recently, value iteration based deep learning models have achieved good performance such as Value Iteration Network(VIN). However, previous methods suffer from slow convergence and low accuracy on large maps, hence restricted in path planning for agents with complex kinematics such as legged robots. Therefore, we propose a new value iteration based path planning method called Capability Iteration Network(CIN). CIN utilizes sparse reward maps and encodes the capability of the agent with state-action transition probability, rather than a convoluti"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2104.14300","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/2104.14300/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":"2104.14300","created_at":"2026-07-05T02:36:15.108161+00:00"},{"alias_kind":"arxiv_version","alias_value":"2104.14300v1","created_at":"2026-07-05T02:36:15.108161+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2104.14300","created_at":"2026-07-05T02:36:15.108161+00:00"},{"alias_kind":"pith_short_12","alias_value":"KCMTYBEGA7MJ","created_at":"2026-07-05T02:36:15.108161+00:00"},{"alias_kind":"pith_short_16","alias_value":"KCMTYBEGA7MJQBMI","created_at":"2026-07-05T02:36:15.108161+00:00"},{"alias_kind":"pith_short_8","alias_value":"KCMTYBEG","created_at":"2026-07-05T02:36:15.108161+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/KCMTYBEGA7MJQBMICAJDJVTXEF","json":"https://pith.science/pith/KCMTYBEGA7MJQBMICAJDJVTXEF.json","graph_json":"https://pith.science/api/pith-number/KCMTYBEGA7MJQBMICAJDJVTXEF/graph.json","events_json":"https://pith.science/api/pith-number/KCMTYBEGA7MJQBMICAJDJVTXEF/events.json","paper":"https://pith.science/paper/KCMTYBEG"},"agent_actions":{"view_html":"https://pith.science/pith/KCMTYBEGA7MJQBMICAJDJVTXEF","download_json":"https://pith.science/pith/KCMTYBEGA7MJQBMICAJDJVTXEF.json","view_paper":"https://pith.science/paper/KCMTYBEG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2104.14300&json=true","fetch_graph":"https://pith.science/api/pith-number/KCMTYBEGA7MJQBMICAJDJVTXEF/graph.json","fetch_events":"https://pith.science/api/pith-number/KCMTYBEGA7MJQBMICAJDJVTXEF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KCMTYBEGA7MJQBMICAJDJVTXEF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KCMTYBEGA7MJQBMICAJDJVTXEF/action/storage_attestation","attest_author":"https://pith.science/pith/KCMTYBEGA7MJQBMICAJDJVTXEF/action/author_attestation","sign_citation":"https://pith.science/pith/KCMTYBEGA7MJQBMICAJDJVTXEF/action/citation_signature","submit_replication":"https://pith.science/pith/KCMTYBEGA7MJQBMICAJDJVTXEF/action/replication_record"}},"created_at":"2026-07-05T02:36:15.108161+00:00","updated_at":"2026-07-05T02:36:15.108161+00:00"}