{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:H7TQ6ZLSTMO5VZSBQ24A42KSW2","short_pith_number":"pith:H7TQ6ZLS","schema_version":"1.0","canonical_sha256":"3fe70f65729b1ddae64186b80e6952b6bc4dd8c10482dee5e1fd95d8e7bcec3a","source":{"kind":"arxiv","id":"2405.16830","version":2},"attestation_state":"computed","paper":{"title":"Structured Graph Network for Constrained Robot Crowd Navigation with Low Fidelity Simulation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.LG"],"primary_cat":"cs.RO","authors_text":"Kaiwen Hong, Katherine Driggs-Campbell, Neeloy Chakraborty, Shuijing Liu","submitted_at":"2024-05-27T04:53:09Z","abstract_excerpt":"We investigate the feasibility of deploying reinforcement learning (RL) policies for constrained crowd navigation using a low-fidelity simulator. We introduce a representation of the dynamic environment, separating human and obstacle representations. Humans are represented through detected states, while obstacles are represented as computed point clouds based on maps and robot localization. This representation enables RL policies trained in a low-fidelity simulator to deploy in real world with a reduced sim2real gap. Additionally, we propose a spatio-temporal graph to model the interactions be"},"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":"2405.16830","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2024-05-27T04:53:09Z","cross_cats_sorted":["cs.AI","cs.LG"],"title_canon_sha256":"de81253f511672b8aeda0e668dd1b4e0f779b03d3413d277021f1437eb4f7010","abstract_canon_sha256":"7ca6697e811ba9499fd436278109f65cb7abd129aa50a19b1773c141232b2039"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:24:07.169781Z","signature_b64":"GBRguiGkjvkfzxzrMVVuya9l/NqGe9Ex2AdIMMG8q80lWQh/h6FYoxayFqFjLrrkRbFN4GIbNFJggEqFY2JUCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3fe70f65729b1ddae64186b80e6952b6bc4dd8c10482dee5e1fd95d8e7bcec3a","last_reissued_at":"2026-07-05T08:24:07.169232Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:24:07.169232Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Structured Graph Network for Constrained Robot Crowd Navigation with Low Fidelity Simulation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.LG"],"primary_cat":"cs.RO","authors_text":"Kaiwen Hong, Katherine Driggs-Campbell, Neeloy Chakraborty, Shuijing Liu","submitted_at":"2024-05-27T04:53:09Z","abstract_excerpt":"We investigate the feasibility of deploying reinforcement learning (RL) policies for constrained crowd navigation using a low-fidelity simulator. We introduce a representation of the dynamic environment, separating human and obstacle representations. Humans are represented through detected states, while obstacles are represented as computed point clouds based on maps and robot localization. This representation enables RL policies trained in a low-fidelity simulator to deploy in real world with a reduced sim2real gap. Additionally, we propose a spatio-temporal graph to model the interactions be"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2405.16830","kind":"arxiv","version":2},"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/2405.16830/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":"2405.16830","created_at":"2026-07-05T08:24:07.169294+00:00"},{"alias_kind":"arxiv_version","alias_value":"2405.16830v2","created_at":"2026-07-05T08:24:07.169294+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2405.16830","created_at":"2026-07-05T08:24:07.169294+00:00"},{"alias_kind":"pith_short_12","alias_value":"H7TQ6ZLSTMO5","created_at":"2026-07-05T08:24:07.169294+00:00"},{"alias_kind":"pith_short_16","alias_value":"H7TQ6ZLSTMO5VZSB","created_at":"2026-07-05T08:24:07.169294+00:00"},{"alias_kind":"pith_short_8","alias_value":"H7TQ6ZLS","created_at":"2026-07-05T08:24:07.169294+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/H7TQ6ZLSTMO5VZSBQ24A42KSW2","json":"https://pith.science/pith/H7TQ6ZLSTMO5VZSBQ24A42KSW2.json","graph_json":"https://pith.science/api/pith-number/H7TQ6ZLSTMO5VZSBQ24A42KSW2/graph.json","events_json":"https://pith.science/api/pith-number/H7TQ6ZLSTMO5VZSBQ24A42KSW2/events.json","paper":"https://pith.science/paper/H7TQ6ZLS"},"agent_actions":{"view_html":"https://pith.science/pith/H7TQ6ZLSTMO5VZSBQ24A42KSW2","download_json":"https://pith.science/pith/H7TQ6ZLSTMO5VZSBQ24A42KSW2.json","view_paper":"https://pith.science/paper/H7TQ6ZLS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2405.16830&json=true","fetch_graph":"https://pith.science/api/pith-number/H7TQ6ZLSTMO5VZSBQ24A42KSW2/graph.json","fetch_events":"https://pith.science/api/pith-number/H7TQ6ZLSTMO5VZSBQ24A42KSW2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/H7TQ6ZLSTMO5VZSBQ24A42KSW2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/H7TQ6ZLSTMO5VZSBQ24A42KSW2/action/storage_attestation","attest_author":"https://pith.science/pith/H7TQ6ZLSTMO5VZSBQ24A42KSW2/action/author_attestation","sign_citation":"https://pith.science/pith/H7TQ6ZLSTMO5VZSBQ24A42KSW2/action/citation_signature","submit_replication":"https://pith.science/pith/H7TQ6ZLSTMO5VZSBQ24A42KSW2/action/replication_record"}},"created_at":"2026-07-05T08:24:07.169294+00:00","updated_at":"2026-07-05T08:24:07.169294+00:00"}