{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:YEG3IOGS3IZGJ2542J53AP2Y6K","short_pith_number":"pith:YEG3IOGS","schema_version":"1.0","canonical_sha256":"c10db438d2da3264ebbcd27bb03f58f2b64d25972ab5aec2378ee2e21ffa3711","source":{"kind":"arxiv","id":"1909.01051","version":4},"attestation_state":"computed","paper":{"title":"MANAS: Multi-Agent Neural Architecture Search","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","cs.MA"],"primary_cat":"cs.CV","authors_text":"Antoine Yang, Fabio Maria Carlucci, Hang Xu, Jun Wang, Marco Singh, Pedro M Esperan\\c{c}a, Vasco Lopes, Victor Gabillon, Zewei Chen","submitted_at":"2019-09-03T10:36:37Z","abstract_excerpt":"The Neural Architecture Search (NAS) problem is typically formulated as a graph search problem where the goal is to learn the optimal operations over edges in order to maximise a graph-level global objective. Due to the large architecture parameter space, efficiency is a key bottleneck preventing NAS from its practical use. In this paper, we address the issue by framing NAS as a multi-agent problem where agents control a subset of the network and coordinate to reach optimal architectures. We provide two distinct lightweight implementations, with reduced memory requirements (1/8th of state-of-t"},"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":"1909.01051","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2019-09-03T10:36:37Z","cross_cats_sorted":["cs.LG","cs.MA"],"title_canon_sha256":"fd7510b8c62caa729ea4359509903a46ec71972f9a8200b0e2c84aee3e074d67","abstract_canon_sha256":"f0d8df14ecc94303a7c674fad2d3650836069b607f9a208a8ea856599831f8cb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:32:27.921538Z","signature_b64":"HcGi2UTys6WPtfpvH4pvEmAOsePK3llzyhRtLVpq7tsEmCeWKYk3Em4jCd14f3OY0e80yAmflsIGFxUPIRyEDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c10db438d2da3264ebbcd27bb03f58f2b64d25972ab5aec2378ee2e21ffa3711","last_reissued_at":"2026-07-05T05:32:27.921183Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:32:27.921183Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"MANAS: Multi-Agent Neural Architecture Search","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","cs.MA"],"primary_cat":"cs.CV","authors_text":"Antoine Yang, Fabio Maria Carlucci, Hang Xu, Jun Wang, Marco Singh, Pedro M Esperan\\c{c}a, Vasco Lopes, Victor Gabillon, Zewei Chen","submitted_at":"2019-09-03T10:36:37Z","abstract_excerpt":"The Neural Architecture Search (NAS) problem is typically formulated as a graph search problem where the goal is to learn the optimal operations over edges in order to maximise a graph-level global objective. Due to the large architecture parameter space, efficiency is a key bottleneck preventing NAS from its practical use. In this paper, we address the issue by framing NAS as a multi-agent problem where agents control a subset of the network and coordinate to reach optimal architectures. We provide two distinct lightweight implementations, with reduced memory requirements (1/8th of state-of-t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1909.01051","kind":"arxiv","version":4},"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/1909.01051/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":"1909.01051","created_at":"2026-07-05T05:32:27.921239+00:00"},{"alias_kind":"arxiv_version","alias_value":"1909.01051v4","created_at":"2026-07-05T05:32:27.921239+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1909.01051","created_at":"2026-07-05T05:32:27.921239+00:00"},{"alias_kind":"pith_short_12","alias_value":"YEG3IOGS3IZG","created_at":"2026-07-05T05:32:27.921239+00:00"},{"alias_kind":"pith_short_16","alias_value":"YEG3IOGS3IZGJ254","created_at":"2026-07-05T05:32:27.921239+00:00"},{"alias_kind":"pith_short_8","alias_value":"YEG3IOGS","created_at":"2026-07-05T05:32:27.921239+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/YEG3IOGS3IZGJ2542J53AP2Y6K","json":"https://pith.science/pith/YEG3IOGS3IZGJ2542J53AP2Y6K.json","graph_json":"https://pith.science/api/pith-number/YEG3IOGS3IZGJ2542J53AP2Y6K/graph.json","events_json":"https://pith.science/api/pith-number/YEG3IOGS3IZGJ2542J53AP2Y6K/events.json","paper":"https://pith.science/paper/YEG3IOGS"},"agent_actions":{"view_html":"https://pith.science/pith/YEG3IOGS3IZGJ2542J53AP2Y6K","download_json":"https://pith.science/pith/YEG3IOGS3IZGJ2542J53AP2Y6K.json","view_paper":"https://pith.science/paper/YEG3IOGS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1909.01051&json=true","fetch_graph":"https://pith.science/api/pith-number/YEG3IOGS3IZGJ2542J53AP2Y6K/graph.json","fetch_events":"https://pith.science/api/pith-number/YEG3IOGS3IZGJ2542J53AP2Y6K/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YEG3IOGS3IZGJ2542J53AP2Y6K/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YEG3IOGS3IZGJ2542J53AP2Y6K/action/storage_attestation","attest_author":"https://pith.science/pith/YEG3IOGS3IZGJ2542J53AP2Y6K/action/author_attestation","sign_citation":"https://pith.science/pith/YEG3IOGS3IZGJ2542J53AP2Y6K/action/citation_signature","submit_replication":"https://pith.science/pith/YEG3IOGS3IZGJ2542J53AP2Y6K/action/replication_record"}},"created_at":"2026-07-05T05:32:27.921239+00:00","updated_at":"2026-07-05T05:32:27.921239+00:00"}