{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:5KCFXGYIT4BSLZMUZ6XAOZYUVI","short_pith_number":"pith:5KCFXGYI","schema_version":"1.0","canonical_sha256":"ea845b9b089f0325e594cfae076714aa35fc79d0c3a6ff44758d6df386e55460","source":{"kind":"arxiv","id":"1603.03980","version":2},"attestation_state":"computed","paper":{"title":"On Learning High Dimensional Structured Single Index Models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.LG"],"primary_cat":"stat.ML","authors_text":"Laura Balzano, Nikhil Rao, Ravi Ganti, Rebecca Willett, Robert Nowak","submitted_at":"2016-03-13T01:53:40Z","abstract_excerpt":"Single Index Models (SIMs) are simple yet flexible semi-parametric models for machine learning, where the response variable is modeled as a monotonic function of a linear combination of features. Estimation in this context requires learning both the feature weights and the nonlinear function that relates features to observations. While methods have been described to learn SIMs in the low dimensional regime, a method that can efficiently learn SIMs in high dimensions, and under general structural assumptions, has not been forthcoming. In this paper, we propose computationally efficient algorith"},"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":"1603.03980","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-03-13T01:53:40Z","cross_cats_sorted":["cs.AI","cs.LG"],"title_canon_sha256":"e0b341967aa46f699dd7e7aa522a5f310b4f65c71da48c2e5d1c63f39e8a80e5","abstract_canon_sha256":"bc34e52ff62083b2debe89f9cf7988bccabe0d5b2052004211fbc24a978468e8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:56:12.235910Z","signature_b64":"Bdwf4v+7ceYuSRS4x2pYSnGrL2JUhnndVB3ZuQQki6FxBkN9XPR3YZe3ZdcHzQj5q36jJsbiPuKm2Ve39XMrCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ea845b9b089f0325e594cfae076714aa35fc79d0c3a6ff44758d6df386e55460","last_reissued_at":"2026-05-18T00:56:12.235416Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:56:12.235416Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On Learning High Dimensional Structured Single Index Models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.LG"],"primary_cat":"stat.ML","authors_text":"Laura Balzano, Nikhil Rao, Ravi Ganti, Rebecca Willett, Robert Nowak","submitted_at":"2016-03-13T01:53:40Z","abstract_excerpt":"Single Index Models (SIMs) are simple yet flexible semi-parametric models for machine learning, where the response variable is modeled as a monotonic function of a linear combination of features. Estimation in this context requires learning both the feature weights and the nonlinear function that relates features to observations. While methods have been described to learn SIMs in the low dimensional regime, a method that can efficiently learn SIMs in high dimensions, and under general structural assumptions, has not been forthcoming. In this paper, we propose computationally efficient algorith"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.03980","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":"1603.03980","created_at":"2026-05-18T00:56:12.235495+00:00"},{"alias_kind":"arxiv_version","alias_value":"1603.03980v2","created_at":"2026-05-18T00:56:12.235495+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.03980","created_at":"2026-05-18T00:56:12.235495+00:00"},{"alias_kind":"pith_short_12","alias_value":"5KCFXGYIT4BS","created_at":"2026-05-18T12:30:01.593930+00:00"},{"alias_kind":"pith_short_16","alias_value":"5KCFXGYIT4BSLZMU","created_at":"2026-05-18T12:30:01.593930+00:00"},{"alias_kind":"pith_short_8","alias_value":"5KCFXGYI","created_at":"2026-05-18T12:30:01.593930+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/5KCFXGYIT4BSLZMUZ6XAOZYUVI","json":"https://pith.science/pith/5KCFXGYIT4BSLZMUZ6XAOZYUVI.json","graph_json":"https://pith.science/api/pith-number/5KCFXGYIT4BSLZMUZ6XAOZYUVI/graph.json","events_json":"https://pith.science/api/pith-number/5KCFXGYIT4BSLZMUZ6XAOZYUVI/events.json","paper":"https://pith.science/paper/5KCFXGYI"},"agent_actions":{"view_html":"https://pith.science/pith/5KCFXGYIT4BSLZMUZ6XAOZYUVI","download_json":"https://pith.science/pith/5KCFXGYIT4BSLZMUZ6XAOZYUVI.json","view_paper":"https://pith.science/paper/5KCFXGYI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1603.03980&json=true","fetch_graph":"https://pith.science/api/pith-number/5KCFXGYIT4BSLZMUZ6XAOZYUVI/graph.json","fetch_events":"https://pith.science/api/pith-number/5KCFXGYIT4BSLZMUZ6XAOZYUVI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5KCFXGYIT4BSLZMUZ6XAOZYUVI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5KCFXGYIT4BSLZMUZ6XAOZYUVI/action/storage_attestation","attest_author":"https://pith.science/pith/5KCFXGYIT4BSLZMUZ6XAOZYUVI/action/author_attestation","sign_citation":"https://pith.science/pith/5KCFXGYIT4BSLZMUZ6XAOZYUVI/action/citation_signature","submit_replication":"https://pith.science/pith/5KCFXGYIT4BSLZMUZ6XAOZYUVI/action/replication_record"}},"created_at":"2026-05-18T00:56:12.235495+00:00","updated_at":"2026-05-18T00:56:12.235495+00:00"}