{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:GHMSG2V2E4ZLFQ3WI4T74ODVXK","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":"ef4ed43308a5126150f353a626e268e4ee68a6578bbb855f4321b26e57e252d0","cross_cats_sorted":["cs.AI","cs.MA","cs.SY","eess.SY"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2022-10-17T19:20:58Z","title_canon_sha256":"1c2a0a591f557b97e2d9527f8038e3b803f03413cfae9b7e3c3651488c39359b"},"schema_version":"1.0","source":{"id":"2210.09378","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2210.09378","created_at":"2026-07-05T05:08:05Z"},{"alias_kind":"arxiv_version","alias_value":"2210.09378v1","created_at":"2026-07-05T05:08:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2210.09378","created_at":"2026-07-05T05:08:05Z"},{"alias_kind":"pith_short_12","alias_value":"GHMSG2V2E4ZL","created_at":"2026-07-05T05:08:05Z"},{"alias_kind":"pith_short_16","alias_value":"GHMSG2V2E4ZLFQ3W","created_at":"2026-07-05T05:08:05Z"},{"alias_kind":"pith_short_8","alias_value":"GHMSG2V2","created_at":"2026-07-05T05:08:05Z"}],"graph_snapshots":[{"event_id":"sha256:103f7921d0e8c7df415bd28f4f3d37236434499fd19fb8e9c5c03d2bac53954e","target":"graph","created_at":"2026-07-05T05:08:05Z","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/2210.09378/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Chenning Yu, Hongzhan Yu, Sicun Gao","cross_cats":["cs.AI","cs.MA","cs.SY","eess.SY"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2022-10-17T19:20:58Z","title":"Learning Control Admissibility Models with Graph Neural Networks for Multi-Agent Navigation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2210.09378","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:3a573d28bc1a04a005d9f65e52002af2143bb452cbba980d2c5f6c2b185dce24","target":"record","created_at":"2026-07-05T05:08:05Z","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":"ef4ed43308a5126150f353a626e268e4ee68a6578bbb855f4321b26e57e252d0","cross_cats_sorted":["cs.AI","cs.MA","cs.SY","eess.SY"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2022-10-17T19:20:58Z","title_canon_sha256":"1c2a0a591f557b97e2d9527f8038e3b803f03413cfae9b7e3c3651488c39359b"},"schema_version":"1.0","source":{"id":"2210.09378","kind":"arxiv","version":1}},"canonical_sha256":"31d9236aba2732b2c3764727fe3875ba9441fe754d1fb7dc9e72f1ed41252723","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"31d9236aba2732b2c3764727fe3875ba9441fe754d1fb7dc9e72f1ed41252723","first_computed_at":"2026-07-05T05:08:05.543531Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T05:08:05.543531Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"BJYeoduTahuOliBM2RNPeRD25XRUg5QdzkP/z2nC6ytnx5KgNsA746Inb1AjON3yLNLCUM3VEFLFdhXdZyCiAA==","signature_status":"signed_v1","signed_at":"2026-07-05T05:08:05.543936Z","signed_message":"canonical_sha256_bytes"},"source_id":"2210.09378","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3a573d28bc1a04a005d9f65e52002af2143bb452cbba980d2c5f6c2b185dce24","sha256:103f7921d0e8c7df415bd28f4f3d37236434499fd19fb8e9c5c03d2bac53954e"],"state_sha256":"ca458175e5d84faa259072554e1ca7fc09d9175e1f1061daa29e43b3d62f8191"}