{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:AEJBO4H2YT7U4TDPKKYAR3NVZQ","short_pith_number":"pith:AEJBO4H2","schema_version":"1.0","canonical_sha256":"01121770fac4ff4e4c6f52b008edb5cc396f22ec09efbb29b3de0ba1df9e3d03","source":{"kind":"arxiv","id":"1804.06964","version":2},"attestation_state":"computed","paper":{"title":"GNAS: A Greedy Neural Architecture Search Method for Multi-Attribute Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CV","cs.LG"],"primary_cat":"cs.NE","authors_text":"Alexander Hauptmann, Siyu Huang, Xi Li, Zhi-Qi Cheng, Zhongfei Zhang","submitted_at":"2018-04-19T01:29:00Z","abstract_excerpt":"A key problem in deep multi-attribute learning is to effectively discover the inter-attribute correlation structures. Typically, the conventional deep multi-attribute learning approaches follow the pipeline of manually designing the network architectures based on task-specific expertise prior knowledge and careful network tunings, leading to the inflexibility for various complicated scenarios in practice. Motivated by addressing this problem, we propose an efficient greedy neural architecture search approach (GNAS) to automatically discover the optimal tree-like deep architecture for multi-att"},"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":"1804.06964","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2018-04-19T01:29:00Z","cross_cats_sorted":["cs.CV","cs.LG"],"title_canon_sha256":"336fbb2cf66d1706318c958fbeb3cb529c7560dbd7b1bfc064fb5613acb8e98b","abstract_canon_sha256":"012c3436bd95cfbd7ec1c1a44160ea729881b524049fceaff35d79e240720e83"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:09:05.483661Z","signature_b64":"9hR1KdQhqEHsSmCzk+E3MoxvLWkrLi1lYljniX2yL97SwoWnGd8yrsPILCd/EbTIqjkt3wVNBhSXVhNfpdZ0Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"01121770fac4ff4e4c6f52b008edb5cc396f22ec09efbb29b3de0ba1df9e3d03","last_reissued_at":"2026-05-18T00:09:05.482981Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:09:05.482981Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"GNAS: A Greedy Neural Architecture Search Method for Multi-Attribute Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CV","cs.LG"],"primary_cat":"cs.NE","authors_text":"Alexander Hauptmann, Siyu Huang, Xi Li, Zhi-Qi Cheng, Zhongfei Zhang","submitted_at":"2018-04-19T01:29:00Z","abstract_excerpt":"A key problem in deep multi-attribute learning is to effectively discover the inter-attribute correlation structures. Typically, the conventional deep multi-attribute learning approaches follow the pipeline of manually designing the network architectures based on task-specific expertise prior knowledge and careful network tunings, leading to the inflexibility for various complicated scenarios in practice. Motivated by addressing this problem, we propose an efficient greedy neural architecture search approach (GNAS) to automatically discover the optimal tree-like deep architecture for multi-att"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.06964","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"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":"1804.06964","created_at":"2026-05-18T00:09:05.483081+00:00"},{"alias_kind":"arxiv_version","alias_value":"1804.06964v2","created_at":"2026-05-18T00:09:05.483081+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.06964","created_at":"2026-05-18T00:09:05.483081+00:00"},{"alias_kind":"pith_short_12","alias_value":"AEJBO4H2YT7U","created_at":"2026-05-18T12:32:13.499390+00:00"},{"alias_kind":"pith_short_16","alias_value":"AEJBO4H2YT7U4TDP","created_at":"2026-05-18T12:32:13.499390+00:00"},{"alias_kind":"pith_short_8","alias_value":"AEJBO4H2","created_at":"2026-05-18T12:32:13.499390+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/AEJBO4H2YT7U4TDPKKYAR3NVZQ","json":"https://pith.science/pith/AEJBO4H2YT7U4TDPKKYAR3NVZQ.json","graph_json":"https://pith.science/api/pith-number/AEJBO4H2YT7U4TDPKKYAR3NVZQ/graph.json","events_json":"https://pith.science/api/pith-number/AEJBO4H2YT7U4TDPKKYAR3NVZQ/events.json","paper":"https://pith.science/paper/AEJBO4H2"},"agent_actions":{"view_html":"https://pith.science/pith/AEJBO4H2YT7U4TDPKKYAR3NVZQ","download_json":"https://pith.science/pith/AEJBO4H2YT7U4TDPKKYAR3NVZQ.json","view_paper":"https://pith.science/paper/AEJBO4H2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1804.06964&json=true","fetch_graph":"https://pith.science/api/pith-number/AEJBO4H2YT7U4TDPKKYAR3NVZQ/graph.json","fetch_events":"https://pith.science/api/pith-number/AEJBO4H2YT7U4TDPKKYAR3NVZQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AEJBO4H2YT7U4TDPKKYAR3NVZQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AEJBO4H2YT7U4TDPKKYAR3NVZQ/action/storage_attestation","attest_author":"https://pith.science/pith/AEJBO4H2YT7U4TDPKKYAR3NVZQ/action/author_attestation","sign_citation":"https://pith.science/pith/AEJBO4H2YT7U4TDPKKYAR3NVZQ/action/citation_signature","submit_replication":"https://pith.science/pith/AEJBO4H2YT7U4TDPKKYAR3NVZQ/action/replication_record"}},"created_at":"2026-05-18T00:09:05.483081+00:00","updated_at":"2026-05-18T00:09:05.483081+00:00"}