{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:UPWTI5XMVTD6IHF5QDGDJJEGXA","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":"a8d21a113cbf768e2132282a0b59354a7d33b6cea1a3d1d9155ee4a52b1b3a68","cross_cats_sorted":["cs.AI","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-09-30T00:18:56Z","title_canon_sha256":"294fd3b56b3109782fc8381759efaf089dafe869f877d7e423699733c7da1f2d"},"schema_version":"1.0","source":{"id":"1909.13404","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1909.13404","created_at":"2026-07-05T00:08:10Z"},{"alias_kind":"arxiv_version","alias_value":"1909.13404v1","created_at":"2026-07-05T00:08:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1909.13404","created_at":"2026-07-05T00:08:10Z"},{"alias_kind":"pith_short_12","alias_value":"UPWTI5XMVTD6","created_at":"2026-07-05T00:08:10Z"},{"alias_kind":"pith_short_16","alias_value":"UPWTI5XMVTD6IHF5","created_at":"2026-07-05T00:08:10Z"},{"alias_kind":"pith_short_8","alias_value":"UPWTI5XM","created_at":"2026-07-05T00:08:10Z"}],"graph_snapshots":[{"event_id":"sha256:0634b3602f1ef7026bb5b8656a4e17b783d0f0d9f70572a6de3b3b344b36a5c8","target":"graph","created_at":"2026-07-05T00:08:10Z","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.13404/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Neural architecture search methods are able to find high performance deep learning architectures with minimal effort from an expert. However, current systems focus on specific use-cases (e.g. convolutional image classifiers and recurrent language models), making them unsuitable for general use-cases that an expert might wish to write. Hyperparameter optimization systems are general-purpose but lack the constructs needed for easy application to architecture search. In this work, we propose a formal language for encoding search spaces over general computational graphs. The language constructs al","authors_text":"Daniel Ferreira, Darshan Patil, Geoffrey Gordon, Matthew Gormley, Nghia Le, Renato Negrinho","cross_cats":["cs.AI","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-09-30T00:18:56Z","title":"Towards modular and programmable architecture search"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1909.13404","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:bf38cab1c09aeea9eb1193db53b1c95e39c561b692b1098840aa7dc2b1551027","target":"record","created_at":"2026-07-05T00:08:10Z","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":"a8d21a113cbf768e2132282a0b59354a7d33b6cea1a3d1d9155ee4a52b1b3a68","cross_cats_sorted":["cs.AI","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-09-30T00:18:56Z","title_canon_sha256":"294fd3b56b3109782fc8381759efaf089dafe869f877d7e423699733c7da1f2d"},"schema_version":"1.0","source":{"id":"1909.13404","kind":"arxiv","version":1}},"canonical_sha256":"a3ed3476ecacc7e41cbd80cc34a486b83c75be55bb1394a1508cd5f0c93e674c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a3ed3476ecacc7e41cbd80cc34a486b83c75be55bb1394a1508cd5f0c93e674c","first_computed_at":"2026-07-05T00:08:10.008968Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T00:08:10.008968Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"4omKEunZEQ7IP2py4IRXiwot7QYHzb5TfSh8JC1WXrFxrviTRnB8Q2RUVvhw2X3QGMjL/YM7KFONahaj63kfCQ==","signature_status":"signed_v1","signed_at":"2026-07-05T00:08:10.009416Z","signed_message":"canonical_sha256_bytes"},"source_id":"1909.13404","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bf38cab1c09aeea9eb1193db53b1c95e39c561b692b1098840aa7dc2b1551027","sha256:0634b3602f1ef7026bb5b8656a4e17b783d0f0d9f70572a6de3b3b344b36a5c8"],"state_sha256":"9e9a0f677b976110c1e9152a7e016fc408fdb026306b68ae59a615b1e2e69a17"}