{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:GHMSG2V2E4ZLFQ3WI4T74ODVXK","short_pith_number":"pith:GHMSG2V2","schema_version":"1.0","canonical_sha256":"31d9236aba2732b2c3764727fe3875ba9441fe754d1fb7dc9e72f1ed41252723","source":{"kind":"arxiv","id":"2210.09378","version":1},"attestation_state":"computed","paper":{"title":"Learning Control Admissibility Models with Graph Neural Networks for Multi-Agent Navigation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.MA","cs.SY","eess.SY"],"primary_cat":"cs.RO","authors_text":"Chenning Yu, Hongzhan Yu, Sicun Gao","submitted_at":"2022-10-17T19:20:58Z","abstract_excerpt":"Deep reinforcement learning in continuous domains focuses on learning control policies that map states to distributions over actions that ideally concentrate on the optimal choices in each step. In multi-agent navigation problems, the optimal actions depend heavily on the agents' density. Their interaction patterns grow exponentially with respect to such density, making it hard for learning-based methods to generalize. We propose to switch the learning objectives from predicting the optimal actions to predicting sets of admissible actions, which we call control admissibility models (CAMs), suc"},"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":"2210.09378","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2022-10-17T19:20:58Z","cross_cats_sorted":["cs.AI","cs.MA","cs.SY","eess.SY"],"title_canon_sha256":"1c2a0a591f557b97e2d9527f8038e3b803f03413cfae9b7e3c3651488c39359b","abstract_canon_sha256":"ef4ed43308a5126150f353a626e268e4ee68a6578bbb855f4321b26e57e252d0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:08:05.543936Z","signature_b64":"BJYeoduTahuOliBM2RNPeRD25XRUg5QdzkP/z2nC6ytnx5KgNsA746Inb1AjON3yLNLCUM3VEFLFdhXdZyCiAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"31d9236aba2732b2c3764727fe3875ba9441fe754d1fb7dc9e72f1ed41252723","last_reissued_at":"2026-07-05T05:08:05.543531Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:08:05.543531Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Learning Control Admissibility Models with Graph Neural Networks for Multi-Agent Navigation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.MA","cs.SY","eess.SY"],"primary_cat":"cs.RO","authors_text":"Chenning Yu, Hongzhan Yu, Sicun Gao","submitted_at":"2022-10-17T19:20:58Z","abstract_excerpt":"Deep reinforcement learning in continuous domains focuses on learning control policies that map states to distributions over actions that ideally concentrate on the optimal choices in each step. In multi-agent navigation problems, the optimal actions depend heavily on the agents' density. Their interaction patterns grow exponentially with respect to such density, making it hard for learning-based methods to generalize. We propose to switch the learning objectives from predicting the optimal actions to predicting sets of admissible actions, which we call control admissibility models (CAMs), suc"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2210.09378","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/2210.09378/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":"2210.09378","created_at":"2026-07-05T05:08:05.543587+00:00"},{"alias_kind":"arxiv_version","alias_value":"2210.09378v1","created_at":"2026-07-05T05:08:05.543587+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2210.09378","created_at":"2026-07-05T05:08:05.543587+00:00"},{"alias_kind":"pith_short_12","alias_value":"GHMSG2V2E4ZL","created_at":"2026-07-05T05:08:05.543587+00:00"},{"alias_kind":"pith_short_16","alias_value":"GHMSG2V2E4ZLFQ3W","created_at":"2026-07-05T05:08:05.543587+00:00"},{"alias_kind":"pith_short_8","alias_value":"GHMSG2V2","created_at":"2026-07-05T05:08:05.543587+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/GHMSG2V2E4ZLFQ3WI4T74ODVXK","json":"https://pith.science/pith/GHMSG2V2E4ZLFQ3WI4T74ODVXK.json","graph_json":"https://pith.science/api/pith-number/GHMSG2V2E4ZLFQ3WI4T74ODVXK/graph.json","events_json":"https://pith.science/api/pith-number/GHMSG2V2E4ZLFQ3WI4T74ODVXK/events.json","paper":"https://pith.science/paper/GHMSG2V2"},"agent_actions":{"view_html":"https://pith.science/pith/GHMSG2V2E4ZLFQ3WI4T74ODVXK","download_json":"https://pith.science/pith/GHMSG2V2E4ZLFQ3WI4T74ODVXK.json","view_paper":"https://pith.science/paper/GHMSG2V2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2210.09378&json=true","fetch_graph":"https://pith.science/api/pith-number/GHMSG2V2E4ZLFQ3WI4T74ODVXK/graph.json","fetch_events":"https://pith.science/api/pith-number/GHMSG2V2E4ZLFQ3WI4T74ODVXK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GHMSG2V2E4ZLFQ3WI4T74ODVXK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GHMSG2V2E4ZLFQ3WI4T74ODVXK/action/storage_attestation","attest_author":"https://pith.science/pith/GHMSG2V2E4ZLFQ3WI4T74ODVXK/action/author_attestation","sign_citation":"https://pith.science/pith/GHMSG2V2E4ZLFQ3WI4T74ODVXK/action/citation_signature","submit_replication":"https://pith.science/pith/GHMSG2V2E4ZLFQ3WI4T74ODVXK/action/replication_record"}},"created_at":"2026-07-05T05:08:05.543587+00:00","updated_at":"2026-07-05T05:08:05.543587+00:00"}