{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:QHUQHFRA4TCRGSO6CEEVGNVH4N","short_pith_number":"pith:QHUQHFRA","schema_version":"1.0","canonical_sha256":"81e9039620e4c51349de11095336a7e378dde7cf512294ce6179e5566c0f40e3","source":{"kind":"arxiv","id":"1511.05678","version":3},"attestation_state":"computed","paper":{"title":"Expressiveness of Rectifier Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Vivek Srikumar, Xingyuan Pan","submitted_at":"2015-11-18T07:26:12Z","abstract_excerpt":"Rectified Linear Units (ReLUs) have been shown to ameliorate the vanishing gradient problem, allow for efficient backpropagation, and empirically promote sparsity in the learned parameters. They have led to state-of-the-art results in a variety of applications. However, unlike threshold and sigmoid networks, ReLU networks are less explored from the perspective of their expressiveness. This paper studies the expressiveness of ReLU networks. We characterize the decision boundary of two-layer ReLU networks by constructing functionally equivalent threshold networks. We show that while the decision"},"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":"1511.05678","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-11-18T07:26:12Z","cross_cats_sorted":[],"title_canon_sha256":"4d12416ce59b3434330a22b25dff78bfc3a7ad9380de9ed695dcceb8b29bc440","abstract_canon_sha256":"a0c4f0d4c292a6f8c983edcb274c0a59b4e710479d9e46b5f776a34b65448e86"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:13:30.743106Z","signature_b64":"ocsxLyCZpLtovuVMiVtDVbKBHcIyf49qGvigC9KdrrltwFSUQBPNxkbh6zwVTCk5WdWefa/htAG1RvzX7f0gBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"81e9039620e4c51349de11095336a7e378dde7cf512294ce6179e5566c0f40e3","last_reissued_at":"2026-05-18T01:13:30.742430Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:13:30.742430Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Expressiveness of Rectifier Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Vivek Srikumar, Xingyuan Pan","submitted_at":"2015-11-18T07:26:12Z","abstract_excerpt":"Rectified Linear Units (ReLUs) have been shown to ameliorate the vanishing gradient problem, allow for efficient backpropagation, and empirically promote sparsity in the learned parameters. They have led to state-of-the-art results in a variety of applications. However, unlike threshold and sigmoid networks, ReLU networks are less explored from the perspective of their expressiveness. This paper studies the expressiveness of ReLU networks. We characterize the decision boundary of two-layer ReLU networks by constructing functionally equivalent threshold networks. We show that while the decision"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.05678","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":""},"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":"1511.05678","created_at":"2026-05-18T01:13:30.742529+00:00"},{"alias_kind":"arxiv_version","alias_value":"1511.05678v3","created_at":"2026-05-18T01:13:30.742529+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.05678","created_at":"2026-05-18T01:13:30.742529+00:00"},{"alias_kind":"pith_short_12","alias_value":"QHUQHFRA4TCR","created_at":"2026-05-18T12:29:37.295048+00:00"},{"alias_kind":"pith_short_16","alias_value":"QHUQHFRA4TCRGSO6","created_at":"2026-05-18T12:29:37.295048+00:00"},{"alias_kind":"pith_short_8","alias_value":"QHUQHFRA","created_at":"2026-05-18T12:29:37.295048+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/QHUQHFRA4TCRGSO6CEEVGNVH4N","json":"https://pith.science/pith/QHUQHFRA4TCRGSO6CEEVGNVH4N.json","graph_json":"https://pith.science/api/pith-number/QHUQHFRA4TCRGSO6CEEVGNVH4N/graph.json","events_json":"https://pith.science/api/pith-number/QHUQHFRA4TCRGSO6CEEVGNVH4N/events.json","paper":"https://pith.science/paper/QHUQHFRA"},"agent_actions":{"view_html":"https://pith.science/pith/QHUQHFRA4TCRGSO6CEEVGNVH4N","download_json":"https://pith.science/pith/QHUQHFRA4TCRGSO6CEEVGNVH4N.json","view_paper":"https://pith.science/paper/QHUQHFRA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1511.05678&json=true","fetch_graph":"https://pith.science/api/pith-number/QHUQHFRA4TCRGSO6CEEVGNVH4N/graph.json","fetch_events":"https://pith.science/api/pith-number/QHUQHFRA4TCRGSO6CEEVGNVH4N/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QHUQHFRA4TCRGSO6CEEVGNVH4N/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QHUQHFRA4TCRGSO6CEEVGNVH4N/action/storage_attestation","attest_author":"https://pith.science/pith/QHUQHFRA4TCRGSO6CEEVGNVH4N/action/author_attestation","sign_citation":"https://pith.science/pith/QHUQHFRA4TCRGSO6CEEVGNVH4N/action/citation_signature","submit_replication":"https://pith.science/pith/QHUQHFRA4TCRGSO6CEEVGNVH4N/action/replication_record"}},"created_at":"2026-05-18T01:13:30.742529+00:00","updated_at":"2026-05-18T01:13:30.742529+00:00"}