{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:VFKFP6RTEM56M5HONESBX5LQ74","short_pith_number":"pith:VFKFP6RT","schema_version":"1.0","canonical_sha256":"a95457fa33233be674ee69241bf570ff120752b8ee3c3b88ace6d5faad058e43","source":{"kind":"arxiv","id":"1910.03103","version":3},"attestation_state":"computed","paper":{"title":"Energy-Aware Neural Architecture Optimization with Fast Splitting Steepest Descent","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Dilin Wang, Lemeng Wu, Meng Li, Qiang Liu, Vikas Chandra","submitted_at":"2019-10-07T21:45:17Z","abstract_excerpt":"Designing energy-efficient networks is of critical importance for enabling state-of-the-art deep learning in mobile and edge settings where the computation and energy budgets are highly limited. Recently, Liu et al. (2019) framed the search of efficient neural architectures into a continuous splitting process: it iteratively splits existing neurons into multiple off-springs to achieve progressive loss minimization, thus finding novel architectures by gradually growing the neural network. However, this method was not specifically tailored for designing energy-efficient networks, and is computat"},"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":"1910.03103","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-10-07T21:45:17Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"c3e13d42256177e22c95f10fad385aeb86619370f534fdfae67215a0567cd7c5","abstract_canon_sha256":"612a5c3bd1b78490855915e004e1adc65cdbcab6244f2071b8689a65ec2e1f33"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:17:24.988554Z","signature_b64":"zI7YyDPfrE0iu8fKkcapRhVlumg6yVBotS5nYCewkEx5nB4Am7dxNL122jgjlJZTEU/NIE/4LPpRGv+6khqbBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a95457fa33233be674ee69241bf570ff120752b8ee3c3b88ace6d5faad058e43","last_reissued_at":"2026-07-05T01:17:24.988075Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:17:24.988075Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Energy-Aware Neural Architecture Optimization with Fast Splitting Steepest Descent","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Dilin Wang, Lemeng Wu, Meng Li, Qiang Liu, Vikas Chandra","submitted_at":"2019-10-07T21:45:17Z","abstract_excerpt":"Designing energy-efficient networks is of critical importance for enabling state-of-the-art deep learning in mobile and edge settings where the computation and energy budgets are highly limited. Recently, Liu et al. (2019) framed the search of efficient neural architectures into a continuous splitting process: it iteratively splits existing neurons into multiple off-springs to achieve progressive loss minimization, thus finding novel architectures by gradually growing the neural network. However, this method was not specifically tailored for designing energy-efficient networks, and is computat"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1910.03103","kind":"arxiv","version":3},"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/1910.03103/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":"1910.03103","created_at":"2026-07-05T01:17:24.988131+00:00"},{"alias_kind":"arxiv_version","alias_value":"1910.03103v3","created_at":"2026-07-05T01:17:24.988131+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1910.03103","created_at":"2026-07-05T01:17:24.988131+00:00"},{"alias_kind":"pith_short_12","alias_value":"VFKFP6RTEM56","created_at":"2026-07-05T01:17:24.988131+00:00"},{"alias_kind":"pith_short_16","alias_value":"VFKFP6RTEM56M5HO","created_at":"2026-07-05T01:17:24.988131+00:00"},{"alias_kind":"pith_short_8","alias_value":"VFKFP6RT","created_at":"2026-07-05T01:17:24.988131+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.31110","citing_title":"Explaining Machine Learning and Memorization with Statistical Mechanics","ref_index":89,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/VFKFP6RTEM56M5HONESBX5LQ74","json":"https://pith.science/pith/VFKFP6RTEM56M5HONESBX5LQ74.json","graph_json":"https://pith.science/api/pith-number/VFKFP6RTEM56M5HONESBX5LQ74/graph.json","events_json":"https://pith.science/api/pith-number/VFKFP6RTEM56M5HONESBX5LQ74/events.json","paper":"https://pith.science/paper/VFKFP6RT"},"agent_actions":{"view_html":"https://pith.science/pith/VFKFP6RTEM56M5HONESBX5LQ74","download_json":"https://pith.science/pith/VFKFP6RTEM56M5HONESBX5LQ74.json","view_paper":"https://pith.science/paper/VFKFP6RT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1910.03103&json=true","fetch_graph":"https://pith.science/api/pith-number/VFKFP6RTEM56M5HONESBX5LQ74/graph.json","fetch_events":"https://pith.science/api/pith-number/VFKFP6RTEM56M5HONESBX5LQ74/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VFKFP6RTEM56M5HONESBX5LQ74/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VFKFP6RTEM56M5HONESBX5LQ74/action/storage_attestation","attest_author":"https://pith.science/pith/VFKFP6RTEM56M5HONESBX5LQ74/action/author_attestation","sign_citation":"https://pith.science/pith/VFKFP6RTEM56M5HONESBX5LQ74/action/citation_signature","submit_replication":"https://pith.science/pith/VFKFP6RTEM56M5HONESBX5LQ74/action/replication_record"}},"created_at":"2026-07-05T01:17:24.988131+00:00","updated_at":"2026-07-05T01:17:24.988131+00:00"}