{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:KOGGT2WM7EOWNA5D7CIEYTL2TW","short_pith_number":"pith:KOGGT2WM","schema_version":"1.0","canonical_sha256":"538c69eaccf91d6683a3f8904c4d7a9d9c5107c61fe7ff5564855413a9157dcf","source":{"kind":"arxiv","id":"2107.00860","version":1},"attestation_state":"computed","paper":{"title":"Rapid Neural Architecture Search by Learning to Generate Graphs from Datasets","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["cs.CV"],"primary_cat":"cs.LG","authors_text":"Eunyoung Hyung, Hayeon Lee, Sung Ju Hwang","submitted_at":"2021-07-02T06:33:59Z","abstract_excerpt":"Despite the success of recent Neural Architecture Search (NAS) methods on various tasks which have shown to output networks that largely outperform human-designed networks, conventional NAS methods have mostly tackled the optimization of searching for the network architecture for a single task (dataset), which does not generalize well across multiple tasks (datasets). Moreover, since such task-specific methods search for a neural architecture from scratch for every given task, they incur a large computational cost, which is problematic when the time and monetary budget are limited. In this pap"},"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":"2107.00860","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.LG","submitted_at":"2021-07-02T06:33:59Z","cross_cats_sorted":["cs.CV"],"title_canon_sha256":"b15e5bbd2198d72e8d3b4356132e5e90599d5e5251e747c83c1b9d1dc4dbde17","abstract_canon_sha256":"bbf6b450a444e5292b0f563e666619ff4d2507ae35564399c6679d0695edfdf4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:54:34.468166Z","signature_b64":"dI086JDbg3M23xgWhPk9v23pNvilbYmo51lGRjy8ZmsYXQEiBhtzUfNl3CHUKfwU45IZqOMXiKHO3aeH6T06Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"538c69eaccf91d6683a3f8904c4d7a9d9c5107c61fe7ff5564855413a9157dcf","last_reissued_at":"2026-07-05T02:54:34.467741Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:54:34.467741Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Rapid Neural Architecture Search by Learning to Generate Graphs from Datasets","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["cs.CV"],"primary_cat":"cs.LG","authors_text":"Eunyoung Hyung, Hayeon Lee, Sung Ju Hwang","submitted_at":"2021-07-02T06:33:59Z","abstract_excerpt":"Despite the success of recent Neural Architecture Search (NAS) methods on various tasks which have shown to output networks that largely outperform human-designed networks, conventional NAS methods have mostly tackled the optimization of searching for the network architecture for a single task (dataset), which does not generalize well across multiple tasks (datasets). Moreover, since such task-specific methods search for a neural architecture from scratch for every given task, they incur a large computational cost, which is problematic when the time and monetary budget are limited. In this pap"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2107.00860","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/2107.00860/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":"2107.00860","created_at":"2026-07-05T02:54:34.467796+00:00"},{"alias_kind":"arxiv_version","alias_value":"2107.00860v1","created_at":"2026-07-05T02:54:34.467796+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2107.00860","created_at":"2026-07-05T02:54:34.467796+00:00"},{"alias_kind":"pith_short_12","alias_value":"KOGGT2WM7EOW","created_at":"2026-07-05T02:54:34.467796+00:00"},{"alias_kind":"pith_short_16","alias_value":"KOGGT2WM7EOWNA5D","created_at":"2026-07-05T02:54:34.467796+00:00"},{"alias_kind":"pith_short_8","alias_value":"KOGGT2WM","created_at":"2026-07-05T02:54:34.467796+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2508.14352","citing_title":"SBGD: Improving Graph Diffusion Generative Model via Stochastic Block Diffusion","ref_index":30,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/KOGGT2WM7EOWNA5D7CIEYTL2TW","json":"https://pith.science/pith/KOGGT2WM7EOWNA5D7CIEYTL2TW.json","graph_json":"https://pith.science/api/pith-number/KOGGT2WM7EOWNA5D7CIEYTL2TW/graph.json","events_json":"https://pith.science/api/pith-number/KOGGT2WM7EOWNA5D7CIEYTL2TW/events.json","paper":"https://pith.science/paper/KOGGT2WM"},"agent_actions":{"view_html":"https://pith.science/pith/KOGGT2WM7EOWNA5D7CIEYTL2TW","download_json":"https://pith.science/pith/KOGGT2WM7EOWNA5D7CIEYTL2TW.json","view_paper":"https://pith.science/paper/KOGGT2WM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2107.00860&json=true","fetch_graph":"https://pith.science/api/pith-number/KOGGT2WM7EOWNA5D7CIEYTL2TW/graph.json","fetch_events":"https://pith.science/api/pith-number/KOGGT2WM7EOWNA5D7CIEYTL2TW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KOGGT2WM7EOWNA5D7CIEYTL2TW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KOGGT2WM7EOWNA5D7CIEYTL2TW/action/storage_attestation","attest_author":"https://pith.science/pith/KOGGT2WM7EOWNA5D7CIEYTL2TW/action/author_attestation","sign_citation":"https://pith.science/pith/KOGGT2WM7EOWNA5D7CIEYTL2TW/action/citation_signature","submit_replication":"https://pith.science/pith/KOGGT2WM7EOWNA5D7CIEYTL2TW/action/replication_record"}},"created_at":"2026-07-05T02:54:34.467796+00:00","updated_at":"2026-07-05T02:54:34.467796+00:00"}