{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:QXJOTVVK4Z6T4HOJEQQEB4LTIE","short_pith_number":"pith:QXJOTVVK","schema_version":"1.0","canonical_sha256":"85d2e9d6aae67d3e1dc9242040f1734100d0d526929d0cc5fc8d3dc7e2bce7e0","source":{"kind":"arxiv","id":"1908.09942","version":1},"attestation_state":"computed","paper":{"title":"On the Bounds of Function Approximations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.NE","stat.ML"],"primary_cat":"cs.LG","authors_text":"Adrian de Wynter","submitted_at":"2019-08-26T22:32:33Z","abstract_excerpt":"Within machine learning, the subfield of Neural Architecture Search (NAS) has recently garnered research attention due to its ability to improve upon human-designed models. However, the computational requirements for finding an exact solution to this problem are often intractable, and the design of the search space still requires manual intervention. In this paper we attempt to establish a formalized framework from which we can better understand the computational bounds of NAS in relation to its search space. For this, we first reformulate the function approximation problem in terms of sequenc"},"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":"1908.09942","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-08-26T22:32:33Z","cross_cats_sorted":["cs.CC","cs.NE","stat.ML"],"title_canon_sha256":"f2a6a17b7ef1294483d8e86cd346f6440a944c45d8a360b4e4410e361487778a","abstract_canon_sha256":"f425c1a7af7153d62c5c8a10dc9f359b42d1d70bf598723ad4b47e60d7bb0ba1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:04:29.820906Z","signature_b64":"Mb9MgdR1Xc6j2z1Et2aU4ZXbf5cCZ8qF9Umy1/jji+DCLDwqOgD5gE0zu4Bfugl+tup/I20p4YtQLb24Lq2rBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"85d2e9d6aae67d3e1dc9242040f1734100d0d526929d0cc5fc8d3dc7e2bce7e0","last_reissued_at":"2026-07-05T00:04:29.820496Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:04:29.820496Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the Bounds of Function Approximations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.NE","stat.ML"],"primary_cat":"cs.LG","authors_text":"Adrian de Wynter","submitted_at":"2019-08-26T22:32:33Z","abstract_excerpt":"Within machine learning, the subfield of Neural Architecture Search (NAS) has recently garnered research attention due to its ability to improve upon human-designed models. However, the computational requirements for finding an exact solution to this problem are often intractable, and the design of the search space still requires manual intervention. In this paper we attempt to establish a formalized framework from which we can better understand the computational bounds of NAS in relation to its search space. For this, we first reformulate the function approximation problem in terms of sequenc"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.09942","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/1908.09942/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":"1908.09942","created_at":"2026-07-05T00:04:29.820552+00:00"},{"alias_kind":"arxiv_version","alias_value":"1908.09942v1","created_at":"2026-07-05T00:04:29.820552+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.09942","created_at":"2026-07-05T00:04:29.820552+00:00"},{"alias_kind":"pith_short_12","alias_value":"QXJOTVVK4Z6T","created_at":"2026-07-05T00:04:29.820552+00:00"},{"alias_kind":"pith_short_16","alias_value":"QXJOTVVK4Z6T4HOJ","created_at":"2026-07-05T00:04:29.820552+00:00"},{"alias_kind":"pith_short_8","alias_value":"QXJOTVVK","created_at":"2026-07-05T00:04:29.820552+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/QXJOTVVK4Z6T4HOJEQQEB4LTIE","json":"https://pith.science/pith/QXJOTVVK4Z6T4HOJEQQEB4LTIE.json","graph_json":"https://pith.science/api/pith-number/QXJOTVVK4Z6T4HOJEQQEB4LTIE/graph.json","events_json":"https://pith.science/api/pith-number/QXJOTVVK4Z6T4HOJEQQEB4LTIE/events.json","paper":"https://pith.science/paper/QXJOTVVK"},"agent_actions":{"view_html":"https://pith.science/pith/QXJOTVVK4Z6T4HOJEQQEB4LTIE","download_json":"https://pith.science/pith/QXJOTVVK4Z6T4HOJEQQEB4LTIE.json","view_paper":"https://pith.science/paper/QXJOTVVK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1908.09942&json=true","fetch_graph":"https://pith.science/api/pith-number/QXJOTVVK4Z6T4HOJEQQEB4LTIE/graph.json","fetch_events":"https://pith.science/api/pith-number/QXJOTVVK4Z6T4HOJEQQEB4LTIE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QXJOTVVK4Z6T4HOJEQQEB4LTIE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QXJOTVVK4Z6T4HOJEQQEB4LTIE/action/storage_attestation","attest_author":"https://pith.science/pith/QXJOTVVK4Z6T4HOJEQQEB4LTIE/action/author_attestation","sign_citation":"https://pith.science/pith/QXJOTVVK4Z6T4HOJEQQEB4LTIE/action/citation_signature","submit_replication":"https://pith.science/pith/QXJOTVVK4Z6T4HOJEQQEB4LTIE/action/replication_record"}},"created_at":"2026-07-05T00:04:29.820552+00:00","updated_at":"2026-07-05T00:04:29.820552+00:00"}