{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:COLGN5NSYGFVMRD4KGMFBJQLEV","short_pith_number":"pith:COLGN5NS","schema_version":"1.0","canonical_sha256":"139666f5b2c18b56447c519850a60b2547440c06f288146edf8321649d233ce4","source":{"kind":"arxiv","id":"2101.03238","version":1},"attestation_state":"computed","paper":{"title":"Neurosymbolic Transformers for Multi-Agent Communication","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","cs.PL"],"primary_cat":"cs.MA","authors_text":"Armando Solar-Lezama, James Paulos, Jeevana Priya Inala, Martin Rinard, Osbert Bastani, Vijay Kumar, Yewen Pu, Yichen Yang","submitted_at":"2021-01-05T04:13:57Z","abstract_excerpt":"We study the problem of inferring communication structures that can solve cooperative multi-agent planning problems while minimizing the amount of communication. We quantify the amount of communication as the maximum degree of the communication graph; this metric captures settings where agents have limited bandwidth. Minimizing communication is challenging due to the combinatorial nature of both the decision space and the objective; for instance, we cannot solve this problem by training neural networks using gradient descent. We propose a novel algorithm that synthesizes a control policy that "},"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":"2101.03238","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MA","submitted_at":"2021-01-05T04:13:57Z","cross_cats_sorted":["cs.LG","cs.PL"],"title_canon_sha256":"40862d43a40624b8cac44e699aaab0c6a99851ea3b9e5bde5e2b37f08e2141eb","abstract_canon_sha256":"775c9f8f7779bbd9e8f2d0a005107c479ac23b54cd61540a7efa6293c7ab861c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:27:55.926636Z","signature_b64":"ewPRNiSXOpiBNF64jqO1cVxz9HkM5gTBLAC3JrGWn6NxQ87gCKa+SzRWiAwtkkX9PTAh03FjApgOHY0CmpCRCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"139666f5b2c18b56447c519850a60b2547440c06f288146edf8321649d233ce4","last_reissued_at":"2026-07-05T03:27:55.926220Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:27:55.926220Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Neurosymbolic Transformers for Multi-Agent Communication","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","cs.PL"],"primary_cat":"cs.MA","authors_text":"Armando Solar-Lezama, James Paulos, Jeevana Priya Inala, Martin Rinard, Osbert Bastani, Vijay Kumar, Yewen Pu, Yichen Yang","submitted_at":"2021-01-05T04:13:57Z","abstract_excerpt":"We study the problem of inferring communication structures that can solve cooperative multi-agent planning problems while minimizing the amount of communication. We quantify the amount of communication as the maximum degree of the communication graph; this metric captures settings where agents have limited bandwidth. Minimizing communication is challenging due to the combinatorial nature of both the decision space and the objective; for instance, we cannot solve this problem by training neural networks using gradient descent. We propose a novel algorithm that synthesizes a control policy that "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2101.03238","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/2101.03238/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":"2101.03238","created_at":"2026-07-05T03:27:55.926284+00:00"},{"alias_kind":"arxiv_version","alias_value":"2101.03238v1","created_at":"2026-07-05T03:27:55.926284+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2101.03238","created_at":"2026-07-05T03:27:55.926284+00:00"},{"alias_kind":"pith_short_12","alias_value":"COLGN5NSYGFV","created_at":"2026-07-05T03:27:55.926284+00:00"},{"alias_kind":"pith_short_16","alias_value":"COLGN5NSYGFVMRD4","created_at":"2026-07-05T03:27:55.926284+00:00"},{"alias_kind":"pith_short_8","alias_value":"COLGN5NS","created_at":"2026-07-05T03:27:55.926284+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/COLGN5NSYGFVMRD4KGMFBJQLEV","json":"https://pith.science/pith/COLGN5NSYGFVMRD4KGMFBJQLEV.json","graph_json":"https://pith.science/api/pith-number/COLGN5NSYGFVMRD4KGMFBJQLEV/graph.json","events_json":"https://pith.science/api/pith-number/COLGN5NSYGFVMRD4KGMFBJQLEV/events.json","paper":"https://pith.science/paper/COLGN5NS"},"agent_actions":{"view_html":"https://pith.science/pith/COLGN5NSYGFVMRD4KGMFBJQLEV","download_json":"https://pith.science/pith/COLGN5NSYGFVMRD4KGMFBJQLEV.json","view_paper":"https://pith.science/paper/COLGN5NS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2101.03238&json=true","fetch_graph":"https://pith.science/api/pith-number/COLGN5NSYGFVMRD4KGMFBJQLEV/graph.json","fetch_events":"https://pith.science/api/pith-number/COLGN5NSYGFVMRD4KGMFBJQLEV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/COLGN5NSYGFVMRD4KGMFBJQLEV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/COLGN5NSYGFVMRD4KGMFBJQLEV/action/storage_attestation","attest_author":"https://pith.science/pith/COLGN5NSYGFVMRD4KGMFBJQLEV/action/author_attestation","sign_citation":"https://pith.science/pith/COLGN5NSYGFVMRD4KGMFBJQLEV/action/citation_signature","submit_replication":"https://pith.science/pith/COLGN5NSYGFVMRD4KGMFBJQLEV/action/replication_record"}},"created_at":"2026-07-05T03:27:55.926284+00:00","updated_at":"2026-07-05T03:27:55.926284+00:00"}