{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:HUSEMLAH262SLUFADD6QYZW6IF","short_pith_number":"pith:HUSEMLAH","canonical_record":{"source":{"id":"1610.07108","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-10-23T00:36:12Z","cross_cats_sorted":["cs.IT","math.IT","math.OC"],"title_canon_sha256":"e9f4612fe2586306286f041ae03aaef4aeb6f7f82de6f929bcf4f07214973427","abstract_canon_sha256":"45b04524a73b82f1393a183cbb9c9e5009484c653b9ca4e6f7201eb655856f20"},"schema_version":"1.0"},"canonical_sha256":"3d24462c07d7b525d0a018fd0c66de416da7b54dd8dbaed0ea0318ec535b92d5","source":{"kind":"arxiv","id":"1610.07108","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1610.07108","created_at":"2026-05-18T01:01:35Z"},{"alias_kind":"arxiv_version","alias_value":"1610.07108v1","created_at":"2026-05-18T01:01:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.07108","created_at":"2026-05-18T01:01:35Z"},{"alias_kind":"pith_short_12","alias_value":"HUSEMLAH262S","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_16","alias_value":"HUSEMLAH262SLUFA","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_8","alias_value":"HUSEMLAH","created_at":"2026-05-18T12:30:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:HUSEMLAH262SLUFADD6QYZW6IF","target":"record","payload":{"canonical_record":{"source":{"id":"1610.07108","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-10-23T00:36:12Z","cross_cats_sorted":["cs.IT","math.IT","math.OC"],"title_canon_sha256":"e9f4612fe2586306286f041ae03aaef4aeb6f7f82de6f929bcf4f07214973427","abstract_canon_sha256":"45b04524a73b82f1393a183cbb9c9e5009484c653b9ca4e6f7201eb655856f20"},"schema_version":"1.0"},"canonical_sha256":"3d24462c07d7b525d0a018fd0c66de416da7b54dd8dbaed0ea0318ec535b92d5","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:01:35.213876Z","signature_b64":"/pFKvVOtvEsWuR35QGuXJRPVaJvL4OHafoKeuMeq0UGA0Y7PQnnkPHrbqxV1UJQ8HLyNIjWmD/H3E8spRWYYDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3d24462c07d7b525d0a018fd0c66de416da7b54dd8dbaed0ea0318ec535b92d5","last_reissued_at":"2026-05-18T01:01:35.213379Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:01:35.213379Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1610.07108","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:01:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wOqXuuGgzH7b0WyEkdzfGTeUuaRj3PNzFJGjCtHqJuYvBfW7VqqkGULKNP7+7cOSz2XZ+FFdmJDclVgBmXK7Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T17:39:27.131037Z"},"content_sha256":"485537a8c17f91446bf7dd4d114365048e1302f00401caaf8c3fcf9fe65bffcb","schema_version":"1.0","event_id":"sha256:485537a8c17f91446bf7dd4d114365048e1302f00401caaf8c3fcf9fe65bffcb"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:HUSEMLAH262SLUFADD6QYZW6IF","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Fast and Reliable Parameter Estimation from Nonlinear Observations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT","math.OC"],"primary_cat":"stat.ML","authors_text":"Mahdi Soltanolkotabi, Samet Oymak","submitted_at":"2016-10-23T00:36:12Z","abstract_excerpt":"In this paper we study the problem of recovering a structured but unknown parameter ${\\bf{\\theta}}^*$ from $n$ nonlinear observations of the form $y_i=f(\\langle {\\bf{x}}_i,{\\bf{\\theta}}^*\\rangle)$ for $i=1,2,\\ldots,n$. We develop a framework for characterizing time-data tradeoffs for a variety of parameter estimation algorithms when the nonlinear function $f$ is unknown. This framework includes many popular heuristics such as projected/proximal gradient descent and stochastic schemes. For example, we show that a projected gradient descent scheme converges at a linear rate to a reliable solutio"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.07108","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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:01:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1HmrManudc3k2WvAU/VtpoLVGnQm/JK5jt8q/Aff+dRMJxS79yvky+yBZqVl7ULNOw9O2afgwfFfww+JJbJGBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T17:39:27.131405Z"},"content_sha256":"85fda22beb2228996cea7bc399e88748b38c02cc9946fe96b1b0086c5b250702","schema_version":"1.0","event_id":"sha256:85fda22beb2228996cea7bc399e88748b38c02cc9946fe96b1b0086c5b250702"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HUSEMLAH262SLUFADD6QYZW6IF/bundle.json","state_url":"https://pith.science/pith/HUSEMLAH262SLUFADD6QYZW6IF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HUSEMLAH262SLUFADD6QYZW6IF/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-26T17:39:27Z","links":{"resolver":"https://pith.science/pith/HUSEMLAH262SLUFADD6QYZW6IF","bundle":"https://pith.science/pith/HUSEMLAH262SLUFADD6QYZW6IF/bundle.json","state":"https://pith.science/pith/HUSEMLAH262SLUFADD6QYZW6IF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HUSEMLAH262SLUFADD6QYZW6IF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:HUSEMLAH262SLUFADD6QYZW6IF","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"45b04524a73b82f1393a183cbb9c9e5009484c653b9ca4e6f7201eb655856f20","cross_cats_sorted":["cs.IT","math.IT","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-10-23T00:36:12Z","title_canon_sha256":"e9f4612fe2586306286f041ae03aaef4aeb6f7f82de6f929bcf4f07214973427"},"schema_version":"1.0","source":{"id":"1610.07108","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1610.07108","created_at":"2026-05-18T01:01:35Z"},{"alias_kind":"arxiv_version","alias_value":"1610.07108v1","created_at":"2026-05-18T01:01:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.07108","created_at":"2026-05-18T01:01:35Z"},{"alias_kind":"pith_short_12","alias_value":"HUSEMLAH262S","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_16","alias_value":"HUSEMLAH262SLUFA","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_8","alias_value":"HUSEMLAH","created_at":"2026-05-18T12:30:22Z"}],"graph_snapshots":[{"event_id":"sha256:85fda22beb2228996cea7bc399e88748b38c02cc9946fe96b1b0086c5b250702","target":"graph","created_at":"2026-05-18T01:01:35Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"In this paper we study the problem of recovering a structured but unknown parameter ${\\bf{\\theta}}^*$ from $n$ nonlinear observations of the form $y_i=f(\\langle {\\bf{x}}_i,{\\bf{\\theta}}^*\\rangle)$ for $i=1,2,\\ldots,n$. We develop a framework for characterizing time-data tradeoffs for a variety of parameter estimation algorithms when the nonlinear function $f$ is unknown. This framework includes many popular heuristics such as projected/proximal gradient descent and stochastic schemes. For example, we show that a projected gradient descent scheme converges at a linear rate to a reliable solutio","authors_text":"Mahdi Soltanolkotabi, Samet Oymak","cross_cats":["cs.IT","math.IT","math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-10-23T00:36:12Z","title":"Fast and Reliable Parameter Estimation from Nonlinear Observations"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.07108","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:485537a8c17f91446bf7dd4d114365048e1302f00401caaf8c3fcf9fe65bffcb","target":"record","created_at":"2026-05-18T01:01:35Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"45b04524a73b82f1393a183cbb9c9e5009484c653b9ca4e6f7201eb655856f20","cross_cats_sorted":["cs.IT","math.IT","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-10-23T00:36:12Z","title_canon_sha256":"e9f4612fe2586306286f041ae03aaef4aeb6f7f82de6f929bcf4f07214973427"},"schema_version":"1.0","source":{"id":"1610.07108","kind":"arxiv","version":1}},"canonical_sha256":"3d24462c07d7b525d0a018fd0c66de416da7b54dd8dbaed0ea0318ec535b92d5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3d24462c07d7b525d0a018fd0c66de416da7b54dd8dbaed0ea0318ec535b92d5","first_computed_at":"2026-05-18T01:01:35.213379Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:01:35.213379Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"/pFKvVOtvEsWuR35QGuXJRPVaJvL4OHafoKeuMeq0UGA0Y7PQnnkPHrbqxV1UJQ8HLyNIjWmD/H3E8spRWYYDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:01:35.213876Z","signed_message":"canonical_sha256_bytes"},"source_id":"1610.07108","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:485537a8c17f91446bf7dd4d114365048e1302f00401caaf8c3fcf9fe65bffcb","sha256:85fda22beb2228996cea7bc399e88748b38c02cc9946fe96b1b0086c5b250702"],"state_sha256":"3d16213640ca46fe7d87476e04229d5007debc0873f9cd1d8d0218f1f3137305"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+Elz6MRZRDQeQrbR+kAtCHFwJ1if/yLO7/lXOkK9vMSgzSSffp/x6Eep+Zz030S1FSCbX1cZj9gcZ+lxXcZWAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T17:39:27.133684Z","bundle_sha256":"cb9fe7bba40cd2ed2b2d8088c89f12f0cb91b6d7480b99895121c15ca0d45564"}}