{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:CPSP7B53C3T63NNX2OKRFSS4XS","short_pith_number":"pith:CPSP7B53","schema_version":"1.0","canonical_sha256":"13e4ff87bb16e7edb5b7d39512ca5cbca71feb43398a08fdbf9c6e64047070a5","source":{"kind":"arxiv","id":"1803.06120","version":1},"attestation_state":"computed","paper":{"title":"Learning Sparse Deep Feedforward Networks via Tree Skeleton Expansion","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Nevin L. Zhang, Xiaopeng Li, Zhourong Chen","submitted_at":"2018-03-16T09:22:47Z","abstract_excerpt":"Despite the popularity of deep learning, structure learning for deep models remains a relatively under-explored area. In contrast, structure learning has been studied extensively for probabilistic graphical models (PGMs). In particular, an efficient algorithm has been developed for learning a class of tree-structured PGMs called hierarchical latent tree models (HLTMs), where there is a layer of observed variables at the bottom and multiple layers of latent variables on top. In this paper, we propose a simple method for learning the structures of feedforward neural networks (FNNs) based on HLTM"},"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":"1803.06120","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-03-16T09:22:47Z","cross_cats_sorted":[],"title_canon_sha256":"e52f79cc609b04e71d3cb68f5c3b21b01d5947e94d2c57fcedb00d5447e4d31e","abstract_canon_sha256":"af35cc7996e47f75ef8a8d2a6ffe5e0f53dd42641f2383f2206597c335b24b87"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:20:50.555407Z","signature_b64":"VkjV1G6iJwMgvS7QVT9b3Ky23Z1TwkGm2PPDl5Wjt/7ffjw/4SoGN19BP9i1lrQVgfHVqj1GcOMi5xV2N2OkDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"13e4ff87bb16e7edb5b7d39512ca5cbca71feb43398a08fdbf9c6e64047070a5","last_reissued_at":"2026-05-18T00:20:50.554903Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:20:50.554903Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Learning Sparse Deep Feedforward Networks via Tree Skeleton Expansion","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Nevin L. Zhang, Xiaopeng Li, Zhourong Chen","submitted_at":"2018-03-16T09:22:47Z","abstract_excerpt":"Despite the popularity of deep learning, structure learning for deep models remains a relatively under-explored area. In contrast, structure learning has been studied extensively for probabilistic graphical models (PGMs). In particular, an efficient algorithm has been developed for learning a class of tree-structured PGMs called hierarchical latent tree models (HLTMs), where there is a layer of observed variables at the bottom and multiple layers of latent variables on top. In this paper, we propose a simple method for learning the structures of feedforward neural networks (FNNs) based on HLTM"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.06120","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":""},"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":"1803.06120","created_at":"2026-05-18T00:20:50.554982+00:00"},{"alias_kind":"arxiv_version","alias_value":"1803.06120v1","created_at":"2026-05-18T00:20:50.554982+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.06120","created_at":"2026-05-18T00:20:50.554982+00:00"},{"alias_kind":"pith_short_12","alias_value":"CPSP7B53C3T6","created_at":"2026-05-18T12:32:16.446611+00:00"},{"alias_kind":"pith_short_16","alias_value":"CPSP7B53C3T63NNX","created_at":"2026-05-18T12:32:16.446611+00:00"},{"alias_kind":"pith_short_8","alias_value":"CPSP7B53","created_at":"2026-05-18T12:32:16.446611+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/CPSP7B53C3T63NNX2OKRFSS4XS","json":"https://pith.science/pith/CPSP7B53C3T63NNX2OKRFSS4XS.json","graph_json":"https://pith.science/api/pith-number/CPSP7B53C3T63NNX2OKRFSS4XS/graph.json","events_json":"https://pith.science/api/pith-number/CPSP7B53C3T63NNX2OKRFSS4XS/events.json","paper":"https://pith.science/paper/CPSP7B53"},"agent_actions":{"view_html":"https://pith.science/pith/CPSP7B53C3T63NNX2OKRFSS4XS","download_json":"https://pith.science/pith/CPSP7B53C3T63NNX2OKRFSS4XS.json","view_paper":"https://pith.science/paper/CPSP7B53","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1803.06120&json=true","fetch_graph":"https://pith.science/api/pith-number/CPSP7B53C3T63NNX2OKRFSS4XS/graph.json","fetch_events":"https://pith.science/api/pith-number/CPSP7B53C3T63NNX2OKRFSS4XS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CPSP7B53C3T63NNX2OKRFSS4XS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CPSP7B53C3T63NNX2OKRFSS4XS/action/storage_attestation","attest_author":"https://pith.science/pith/CPSP7B53C3T63NNX2OKRFSS4XS/action/author_attestation","sign_citation":"https://pith.science/pith/CPSP7B53C3T63NNX2OKRFSS4XS/action/citation_signature","submit_replication":"https://pith.science/pith/CPSP7B53C3T63NNX2OKRFSS4XS/action/replication_record"}},"created_at":"2026-05-18T00:20:50.554982+00:00","updated_at":"2026-05-18T00:20:50.554982+00:00"}