{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:TDL62HZP3VVJXPKWPC4B2XQXLH","short_pith_number":"pith:TDL62HZP","schema_version":"1.0","canonical_sha256":"98d7ed1f2fdd6a9bbd5678b81d5e1759e35fa41ed7c5cb07e4dac0befc688da4","source":{"kind":"arxiv","id":"2412.19677","version":1},"attestation_state":"computed","paper":{"title":"Deep ReLU networks -- injectivity capacity upper bounds","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cond-mat.dis-nn","cs.IT","cs.LG","math.IT"],"primary_cat":"stat.ML","authors_text":"Mihailo Stojnic","submitted_at":"2024-12-27T14:57:40Z","abstract_excerpt":"We study deep ReLU feed forward neural networks (NN) and their injectivity abilities. The main focus is on \\emph{precisely} determining the so-called injectivity capacity. For any given hidden layers architecture, it is defined as the minimal ratio between number of network's outputs and inputs which ensures unique recoverability of the input from a realizable output. A strong recent progress in precisely studying single ReLU layer injectivity properties is here moved to a deep network level. In particular, we develop a program that connects deep $l$-layer net injectivity to an $l$-extension o"},"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":"2412.19677","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"stat.ML","submitted_at":"2024-12-27T14:57:40Z","cross_cats_sorted":["cond-mat.dis-nn","cs.IT","cs.LG","math.IT"],"title_canon_sha256":"1e3b4e300d1f73d0f31ae60cf7126d80e9ad6d49e001c2929b4f2da430a6a70c","abstract_canon_sha256":"3584ee11cb1f35f0e953e02d981c9934130acf6322118d844735cb232823ac8e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:54:39.555493Z","signature_b64":"JnqyucN4LUFconOdGdW4GJ069dXUHGYdHw94gl6jJfLubr3TIH83inM9hVGXE+t7Z/ZnxfMvINiZ4Eu8MdAGDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"98d7ed1f2fdd6a9bbd5678b81d5e1759e35fa41ed7c5cb07e4dac0befc688da4","last_reissued_at":"2026-07-05T09:54:39.554982Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:54:39.554982Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Deep ReLU networks -- injectivity capacity upper bounds","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cond-mat.dis-nn","cs.IT","cs.LG","math.IT"],"primary_cat":"stat.ML","authors_text":"Mihailo Stojnic","submitted_at":"2024-12-27T14:57:40Z","abstract_excerpt":"We study deep ReLU feed forward neural networks (NN) and their injectivity abilities. The main focus is on \\emph{precisely} determining the so-called injectivity capacity. For any given hidden layers architecture, it is defined as the minimal ratio between number of network's outputs and inputs which ensures unique recoverability of the input from a realizable output. A strong recent progress in precisely studying single ReLU layer injectivity properties is here moved to a deep network level. In particular, we develop a program that connects deep $l$-layer net injectivity to an $l$-extension o"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2412.19677","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/2412.19677/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":"2412.19677","created_at":"2026-07-05T09:54:39.555047+00:00"},{"alias_kind":"arxiv_version","alias_value":"2412.19677v1","created_at":"2026-07-05T09:54:39.555047+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2412.19677","created_at":"2026-07-05T09:54:39.555047+00:00"},{"alias_kind":"pith_short_12","alias_value":"TDL62HZP3VVJ","created_at":"2026-07-05T09:54:39.555047+00:00"},{"alias_kind":"pith_short_16","alias_value":"TDL62HZP3VVJXPKW","created_at":"2026-07-05T09:54:39.555047+00:00"},{"alias_kind":"pith_short_8","alias_value":"TDL62HZP","created_at":"2026-07-05T09:54:39.555047+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/TDL62HZP3VVJXPKWPC4B2XQXLH","json":"https://pith.science/pith/TDL62HZP3VVJXPKWPC4B2XQXLH.json","graph_json":"https://pith.science/api/pith-number/TDL62HZP3VVJXPKWPC4B2XQXLH/graph.json","events_json":"https://pith.science/api/pith-number/TDL62HZP3VVJXPKWPC4B2XQXLH/events.json","paper":"https://pith.science/paper/TDL62HZP"},"agent_actions":{"view_html":"https://pith.science/pith/TDL62HZP3VVJXPKWPC4B2XQXLH","download_json":"https://pith.science/pith/TDL62HZP3VVJXPKWPC4B2XQXLH.json","view_paper":"https://pith.science/paper/TDL62HZP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2412.19677&json=true","fetch_graph":"https://pith.science/api/pith-number/TDL62HZP3VVJXPKWPC4B2XQXLH/graph.json","fetch_events":"https://pith.science/api/pith-number/TDL62HZP3VVJXPKWPC4B2XQXLH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TDL62HZP3VVJXPKWPC4B2XQXLH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TDL62HZP3VVJXPKWPC4B2XQXLH/action/storage_attestation","attest_author":"https://pith.science/pith/TDL62HZP3VVJXPKWPC4B2XQXLH/action/author_attestation","sign_citation":"https://pith.science/pith/TDL62HZP3VVJXPKWPC4B2XQXLH/action/citation_signature","submit_replication":"https://pith.science/pith/TDL62HZP3VVJXPKWPC4B2XQXLH/action/replication_record"}},"created_at":"2026-07-05T09:54:39.555047+00:00","updated_at":"2026-07-05T09:54:39.555047+00:00"}