{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:YEG3IOGS3IZGJ2542J53AP2Y6K","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":"f0d8df14ecc94303a7c674fad2d3650836069b607f9a208a8ea856599831f8cb","cross_cats_sorted":["cs.LG","cs.MA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2019-09-03T10:36:37Z","title_canon_sha256":"fd7510b8c62caa729ea4359509903a46ec71972f9a8200b0e2c84aee3e074d67"},"schema_version":"1.0","source":{"id":"1909.01051","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1909.01051","created_at":"2026-07-05T05:32:27Z"},{"alias_kind":"arxiv_version","alias_value":"1909.01051v4","created_at":"2026-07-05T05:32:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1909.01051","created_at":"2026-07-05T05:32:27Z"},{"alias_kind":"pith_short_12","alias_value":"YEG3IOGS3IZG","created_at":"2026-07-05T05:32:27Z"},{"alias_kind":"pith_short_16","alias_value":"YEG3IOGS3IZGJ254","created_at":"2026-07-05T05:32:27Z"},{"alias_kind":"pith_short_8","alias_value":"YEG3IOGS","created_at":"2026-07-05T05:32:27Z"}],"graph_snapshots":[{"event_id":"sha256:1af64ee8e335a2f9a9ba7ecef7b73f71d4a74c2a2b4cdfdd32ecacb0961dae25","target":"graph","created_at":"2026-07-05T05:32:27Z","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/1909.01051/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","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","cross_cats":["cs.LG","cs.MA"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2019-09-03T10:36:37Z","title":"MANAS: Multi-Agent Neural Architecture Search"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1909.01051","kind":"arxiv","version":4},"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:00d5212e64bf1eec62bb77aa6daaed61c18302245c11aa81ea3839b438129143","target":"record","created_at":"2026-07-05T05:32:27Z","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":"f0d8df14ecc94303a7c674fad2d3650836069b607f9a208a8ea856599831f8cb","cross_cats_sorted":["cs.LG","cs.MA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2019-09-03T10:36:37Z","title_canon_sha256":"fd7510b8c62caa729ea4359509903a46ec71972f9a8200b0e2c84aee3e074d67"},"schema_version":"1.0","source":{"id":"1909.01051","kind":"arxiv","version":4}},"canonical_sha256":"c10db438d2da3264ebbcd27bb03f58f2b64d25972ab5aec2378ee2e21ffa3711","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c10db438d2da3264ebbcd27bb03f58f2b64d25972ab5aec2378ee2e21ffa3711","first_computed_at":"2026-07-05T05:32:27.921183Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T05:32:27.921183Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"HcGi2UTys6WPtfpvH4pvEmAOsePK3llzyhRtLVpq7tsEmCeWKYk3Em4jCd14f3OY0e80yAmflsIGFxUPIRyEDA==","signature_status":"signed_v1","signed_at":"2026-07-05T05:32:27.921538Z","signed_message":"canonical_sha256_bytes"},"source_id":"1909.01051","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:00d5212e64bf1eec62bb77aa6daaed61c18302245c11aa81ea3839b438129143","sha256:1af64ee8e335a2f9a9ba7ecef7b73f71d4a74c2a2b4cdfdd32ecacb0961dae25"],"state_sha256":"04252892a014606500d40e6684cc429784d3d543f893a253dbf07146aa8fb9d6"}