{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2021:KCMTYBEGA7MJQBMICAJDJVTXEF","short_pith_number":"pith:KCMTYBEG","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"},"canonical_sha256":"50993c048607d8980588101234d67721784494d73271f15c3b135767a1a24338","source":{"kind":"arxiv","id":"2104.14300","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2104.14300","created_at":"2026-07-05T02:36:15Z"},{"alias_kind":"arxiv_version","alias_value":"2104.14300v1","created_at":"2026-07-05T02:36:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2104.14300","created_at":"2026-07-05T02:36:15Z"},{"alias_kind":"pith_short_12","alias_value":"KCMTYBEGA7MJ","created_at":"2026-07-05T02:36:15Z"},{"alias_kind":"pith_short_16","alias_value":"KCMTYBEGA7MJQBMI","created_at":"2026-07-05T02:36:15Z"},{"alias_kind":"pith_short_8","alias_value":"KCMTYBEG","created_at":"2026-07-05T02:36:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2021:KCMTYBEGA7MJQBMICAJDJVTXEF","target":"record","payload":{"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"},"canonical_sha256":"50993c048607d8980588101234d67721784494d73271f15c3b135767a1a24338","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"},"source_kind":"arxiv","source_id":"2104.14300","source_version":1,"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-05T02:36:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VyCQJopkAbkom5XQEgS44P/1i45QfMwrmh3R3NAggqxyQlNDrQex8G0ZaRMlOe8VMa9PGZreePde1NANbYRcAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-05T08:05:40.783827Z"},"content_sha256":"4e1fa1520876fb8d94d899a21a15b20a4af1f565e02e967d9fadd3dc8c4d31a7","schema_version":"1.0","event_id":"sha256:4e1fa1520876fb8d94d899a21a15b20a4af1f565e02e967d9fadd3dc8c4d31a7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2021:KCMTYBEGA7MJQBMICAJDJVTXEF","target":"graph","payload":{"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"},"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-05T02:36:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SNG3/qHtR9MxwL03tTCurhR+R8qU7R8ilO/+W9VTnkfSCebHo1XLF02FASBdUDP/yNNBUa7kZR+rM2MAdKuZAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-05T08:05:40.784226Z"},"content_sha256":"82be28d28b544a3446c12d83c13498ac29423b88f94fe62d6ba8374ceb4d2bc7","schema_version":"1.0","event_id":"sha256:82be28d28b544a3446c12d83c13498ac29423b88f94fe62d6ba8374ceb4d2bc7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KCMTYBEGA7MJQBMICAJDJVTXEF/bundle.json","state_url":"https://pith.science/pith/KCMTYBEGA7MJQBMICAJDJVTXEF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KCMTYBEGA7MJQBMICAJDJVTXEF/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-05T08:05:40Z","links":{"resolver":"https://pith.science/pith/KCMTYBEGA7MJQBMICAJDJVTXEF","bundle":"https://pith.science/pith/KCMTYBEGA7MJQBMICAJDJVTXEF/bundle.json","state":"https://pith.science/pith/KCMTYBEGA7MJQBMICAJDJVTXEF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KCMTYBEGA7MJQBMICAJDJVTXEF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2021:KCMTYBEGA7MJQBMICAJDJVTXEF","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":"14a3de764a6f7071111b4c0e4846a5b894ca3b766a1b146338df6269b29908b5","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.RO","submitted_at":"2021-04-29T12:38:10Z","title_canon_sha256":"eb8b01daa8d7829b914dedf544537ae0023844775b1fc989b28fd90388e5c56c"},"schema_version":"1.0","source":{"id":"2104.14300","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2104.14300","created_at":"2026-07-05T02:36:15Z"},{"alias_kind":"arxiv_version","alias_value":"2104.14300v1","created_at":"2026-07-05T02:36:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2104.14300","created_at":"2026-07-05T02:36:15Z"},{"alias_kind":"pith_short_12","alias_value":"KCMTYBEGA7MJ","created_at":"2026-07-05T02:36:15Z"},{"alias_kind":"pith_short_16","alias_value":"KCMTYBEGA7MJQBMI","created_at":"2026-07-05T02:36:15Z"},{"alias_kind":"pith_short_8","alias_value":"KCMTYBEG","created_at":"2026-07-05T02:36:15Z"}],"graph_snapshots":[{"event_id":"sha256:82be28d28b544a3446c12d83c13498ac29423b88f94fe62d6ba8374ceb4d2bc7","target":"graph","created_at":"2026-07-05T02:36:15Z","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/2104.14300/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Buqing Nie, Feng Gao, Yidong Mei, Yue Gao","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.RO","submitted_at":"2021-04-29T12:38:10Z","title":"Capability Iteration Network for Robot Path Planning"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2104.14300","kind":"arxiv","version":1},"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:4e1fa1520876fb8d94d899a21a15b20a4af1f565e02e967d9fadd3dc8c4d31a7","target":"record","created_at":"2026-07-05T02:36:15Z","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":"14a3de764a6f7071111b4c0e4846a5b894ca3b766a1b146338df6269b29908b5","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.RO","submitted_at":"2021-04-29T12:38:10Z","title_canon_sha256":"eb8b01daa8d7829b914dedf544537ae0023844775b1fc989b28fd90388e5c56c"},"schema_version":"1.0","source":{"id":"2104.14300","kind":"arxiv","version":1}},"canonical_sha256":"50993c048607d8980588101234d67721784494d73271f15c3b135767a1a24338","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"50993c048607d8980588101234d67721784494d73271f15c3b135767a1a24338","first_computed_at":"2026-07-05T02:36:15.108103Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T02:36:15.108103Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"5tHEdNMJ1FuFd7ujjMirmLyhk9w1YdxuQwrzlEsykaHn+yELHwyJoDWNyUrHDi2XpPR23/hPNukIay0P+F1ZAg==","signature_status":"signed_v1","signed_at":"2026-07-05T02:36:15.108590Z","signed_message":"canonical_sha256_bytes"},"source_id":"2104.14300","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4e1fa1520876fb8d94d899a21a15b20a4af1f565e02e967d9fadd3dc8c4d31a7","sha256:82be28d28b544a3446c12d83c13498ac29423b88f94fe62d6ba8374ceb4d2bc7"],"state_sha256":"084580b7af675aea3432facfbf6c131f10f5e92713d3d079fb4dc9702afaf360"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Sxnf8czLsQ1X4vdReZREkQx8SReDQ8bpoad3Ug+b0svKarXuVGjySr7A8gf5pVzSY4CRQZhFcqudAfgHRcZCCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-05T08:05:40.786308Z","bundle_sha256":"d679adce414f058e81edf1e3c215ca69bfedfad7b878e172a7d4b6f1333f55ba"}}