{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:RCN3KPHUQSUJ5M3MSSWNJZG3RU","short_pith_number":"pith:RCN3KPHU","schema_version":"1.0","canonical_sha256":"889bb53cf484a89eb36c94acd4e4db8d321cda6e7ab6f8f35b8ac014bebea855","source":{"kind":"arxiv","id":"2607.15701","version":1},"attestation_state":"computed","paper":{"title":"RAVEN: Reinforcement-Adaptive Visibility-Graph Planning for Robust Humanoid Navigation with Collision-Free MPC","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Beom Jun Kim, Dennis W. Hong, Hanzhang Fang, Mehak Singal, Ruochen Hou, Shiqi Wang","submitted_at":"2026-07-17T07:23:54Z","abstract_excerpt":"Humanoid navigation in dynamic environments requires long-horizon planning while respecting short-horizon dynamic and safety constraints. Classical visibility-graph planners combined with model predictive control (MPC) can efficiently generate collision-free trajectories, but their performance depends on manually tuned parameters and accurate system modeling. In real robotic systems, control delays, state-estimation noise, and locomotion uncertainties can cause overshoot and constraint violations even when the nominal path is geometrically optimal. We propose RAVEN, a hierarchical reinforcemen"},"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":"2607.15701","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2026-07-17T07:23:54Z","cross_cats_sorted":[],"title_canon_sha256":"02fd6944ecc9a2c1f88e4c74ecae32120c9b11ba2cc81000497cfa908f975966","abstract_canon_sha256":"620a531e90f72988f3f1e5195569879f801ede3df60cf01f192effd7c1057b78"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-20T01:19:05.078883Z","signature_b64":"eeLUbqxKb7gXJCQyHy5m9KSlqpWT3Mhe2fup/Hq1cGSl2ZRsl9+WOlwZwMcXoUJxD8PbP8mspipreXodos1oBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"889bb53cf484a89eb36c94acd4e4db8d321cda6e7ab6f8f35b8ac014bebea855","last_reissued_at":"2026-07-20T01:19:05.078002Z","signature_status":"signed_v1","first_computed_at":"2026-07-20T01:19:05.078002Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"RAVEN: Reinforcement-Adaptive Visibility-Graph Planning for Robust Humanoid Navigation with Collision-Free MPC","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Beom Jun Kim, Dennis W. Hong, Hanzhang Fang, Mehak Singal, Ruochen Hou, Shiqi Wang","submitted_at":"2026-07-17T07:23:54Z","abstract_excerpt":"Humanoid navigation in dynamic environments requires long-horizon planning while respecting short-horizon dynamic and safety constraints. Classical visibility-graph planners combined with model predictive control (MPC) can efficiently generate collision-free trajectories, but their performance depends on manually tuned parameters and accurate system modeling. In real robotic systems, control delays, state-estimation noise, and locomotion uncertainties can cause overshoot and constraint violations even when the nominal path is geometrically optimal. We propose RAVEN, a hierarchical reinforcemen"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.15701","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/2607.15701/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":"2607.15701","created_at":"2026-07-20T01:19:05.078464+00:00"},{"alias_kind":"arxiv_version","alias_value":"2607.15701v1","created_at":"2026-07-20T01:19:05.078464+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.15701","created_at":"2026-07-20T01:19:05.078464+00:00"},{"alias_kind":"pith_short_12","alias_value":"RCN3KPHUQSUJ","created_at":"2026-07-20T01:19:05.078464+00:00"},{"alias_kind":"pith_short_16","alias_value":"RCN3KPHUQSUJ5M3M","created_at":"2026-07-20T01:19:05.078464+00:00"},{"alias_kind":"pith_short_8","alias_value":"RCN3KPHU","created_at":"2026-07-20T01:19:05.078464+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/RCN3KPHUQSUJ5M3MSSWNJZG3RU","json":"https://pith.science/pith/RCN3KPHUQSUJ5M3MSSWNJZG3RU.json","graph_json":"https://pith.science/api/pith-number/RCN3KPHUQSUJ5M3MSSWNJZG3RU/graph.json","events_json":"https://pith.science/api/pith-number/RCN3KPHUQSUJ5M3MSSWNJZG3RU/events.json","paper":"https://pith.science/paper/RCN3KPHU"},"agent_actions":{"view_html":"https://pith.science/pith/RCN3KPHUQSUJ5M3MSSWNJZG3RU","download_json":"https://pith.science/pith/RCN3KPHUQSUJ5M3MSSWNJZG3RU.json","view_paper":"https://pith.science/paper/RCN3KPHU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2607.15701&json=true","fetch_graph":"https://pith.science/api/pith-number/RCN3KPHUQSUJ5M3MSSWNJZG3RU/graph.json","fetch_events":"https://pith.science/api/pith-number/RCN3KPHUQSUJ5M3MSSWNJZG3RU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RCN3KPHUQSUJ5M3MSSWNJZG3RU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RCN3KPHUQSUJ5M3MSSWNJZG3RU/action/storage_attestation","attest_author":"https://pith.science/pith/RCN3KPHUQSUJ5M3MSSWNJZG3RU/action/author_attestation","sign_citation":"https://pith.science/pith/RCN3KPHUQSUJ5M3MSSWNJZG3RU/action/citation_signature","submit_replication":"https://pith.science/pith/RCN3KPHUQSUJ5M3MSSWNJZG3RU/action/replication_record"}},"created_at":"2026-07-20T01:19:05.078464+00:00","updated_at":"2026-07-20T01:19:05.078464+00:00"}