{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:KSD6CBD3IWQEZVR4OEJHE2B4VI","short_pith_number":"pith:KSD6CBD3","schema_version":"1.0","canonical_sha256":"5487e1047b45a04cd63c711272683caa157a1613528aa0ba56688edddbfe0cd5","source":{"kind":"arxiv","id":"1912.12814","version":1},"attestation_state":"computed","paper":{"title":"RC-DARTS: Resource Constrained Differentiable Architecture Search","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NE"],"primary_cat":"cs.CV","authors_text":"Jiang Wang, Jiashi Feng, Joshua Slocum, Ming-Hsuan Yang, Shengyang Dai, Shuicheng Yan, Xiaojie Jin","submitted_at":"2019-12-30T05:02:38Z","abstract_excerpt":"Recent advances show that Neural Architectural Search (NAS) method is able to find state-of-the-art image classification deep architectures. In this paper, we consider the one-shot NAS problem for resource constrained applications. This problem is of great interest because it is critical to choose different architectures according to task complexity when the resource is constrained. Previous techniques are either too slow for one-shot learning or does not take the resource constraint into consideration. In this paper, we propose the resource constrained differentiable architecture search (RC-D"},"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":"1912.12814","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2019-12-30T05:02:38Z","cross_cats_sorted":["cs.NE"],"title_canon_sha256":"6500067db6be31d84303c207d3f8de6dac29bdc52249560e406ef283c2aea05e","abstract_canon_sha256":"7be5963696b14818ee82e8f865f5a7ac91560ed3307c33bbf1776578a42ad6f5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:29:03.568433Z","signature_b64":"rv16leVhLFY9iudNv5GvWL1oVHcEWg6A6I43iMfdZ5pfYEVRGgVYFjjaYHgPdPP/Vb8nwjB0U/11e+vR9Vn2DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5487e1047b45a04cd63c711272683caa157a1613528aa0ba56688edddbfe0cd5","last_reissued_at":"2026-07-05T00:29:03.567987Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:29:03.567987Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"RC-DARTS: Resource Constrained Differentiable Architecture Search","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NE"],"primary_cat":"cs.CV","authors_text":"Jiang Wang, Jiashi Feng, Joshua Slocum, Ming-Hsuan Yang, Shengyang Dai, Shuicheng Yan, Xiaojie Jin","submitted_at":"2019-12-30T05:02:38Z","abstract_excerpt":"Recent advances show that Neural Architectural Search (NAS) method is able to find state-of-the-art image classification deep architectures. In this paper, we consider the one-shot NAS problem for resource constrained applications. This problem is of great interest because it is critical to choose different architectures according to task complexity when the resource is constrained. Previous techniques are either too slow for one-shot learning or does not take the resource constraint into consideration. In this paper, we propose the resource constrained differentiable architecture search (RC-D"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1912.12814","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/1912.12814/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":"1912.12814","created_at":"2026-07-05T00:29:03.568051+00:00"},{"alias_kind":"arxiv_version","alias_value":"1912.12814v1","created_at":"2026-07-05T00:29:03.568051+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1912.12814","created_at":"2026-07-05T00:29:03.568051+00:00"},{"alias_kind":"pith_short_12","alias_value":"KSD6CBD3IWQE","created_at":"2026-07-05T00:29:03.568051+00:00"},{"alias_kind":"pith_short_16","alias_value":"KSD6CBD3IWQEZVR4","created_at":"2026-07-05T00:29:03.568051+00:00"},{"alias_kind":"pith_short_8","alias_value":"KSD6CBD3","created_at":"2026-07-05T00:29:03.568051+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.12718","citing_title":"CHAL: Council of Hierarchical Agentic Language","ref_index":83,"is_internal_anchor":false},{"citing_arxiv_id":"2605.00649","citing_title":"Model Compression with Exact Budget Constraints via Riemannian Manifolds","ref_index":3,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/KSD6CBD3IWQEZVR4OEJHE2B4VI","json":"https://pith.science/pith/KSD6CBD3IWQEZVR4OEJHE2B4VI.json","graph_json":"https://pith.science/api/pith-number/KSD6CBD3IWQEZVR4OEJHE2B4VI/graph.json","events_json":"https://pith.science/api/pith-number/KSD6CBD3IWQEZVR4OEJHE2B4VI/events.json","paper":"https://pith.science/paper/KSD6CBD3"},"agent_actions":{"view_html":"https://pith.science/pith/KSD6CBD3IWQEZVR4OEJHE2B4VI","download_json":"https://pith.science/pith/KSD6CBD3IWQEZVR4OEJHE2B4VI.json","view_paper":"https://pith.science/paper/KSD6CBD3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1912.12814&json=true","fetch_graph":"https://pith.science/api/pith-number/KSD6CBD3IWQEZVR4OEJHE2B4VI/graph.json","fetch_events":"https://pith.science/api/pith-number/KSD6CBD3IWQEZVR4OEJHE2B4VI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KSD6CBD3IWQEZVR4OEJHE2B4VI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KSD6CBD3IWQEZVR4OEJHE2B4VI/action/storage_attestation","attest_author":"https://pith.science/pith/KSD6CBD3IWQEZVR4OEJHE2B4VI/action/author_attestation","sign_citation":"https://pith.science/pith/KSD6CBD3IWQEZVR4OEJHE2B4VI/action/citation_signature","submit_replication":"https://pith.science/pith/KSD6CBD3IWQEZVR4OEJHE2B4VI/action/replication_record"}},"created_at":"2026-07-05T00:29:03.568051+00:00","updated_at":"2026-07-05T00:29:03.568051+00:00"}