{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:NAVHDTI2W7MLAI2HPYSM6E7SJH","short_pith_number":"pith:NAVHDTI2","schema_version":"1.0","canonical_sha256":"682a71cd1ab7d8b023477e24cf13f249ef8c124aa6e4c986405221fc2a2ebdb2","source":{"kind":"arxiv","id":"1809.02966","version":1},"attestation_state":"computed","paper":{"title":"LS-Net: Learning to Solve Nonlinear Least Squares for Monocular Stereo","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Andrew J. Davison, Jan Czarnowski, Michael Bloesch, Ronald Clark, Stefan Leutenegger","submitted_at":"2018-09-09T13:20:00Z","abstract_excerpt":"Sum-of-squares objective functions are very popular in computer vision algorithms. However, these objective functions are not always easy to optimize. The underlying assumptions made by solvers are often not satisfied and many problems are inherently ill-posed. In this paper, we propose LS-Net, a neural nonlinear least squares optimization algorithm which learns to effectively optimize these cost functions even in the presence of adversities. Unlike traditional approaches, the proposed solver requires no hand-crafted regularizers or priors as these are implicitly learned from the data. We appl"},"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":"1809.02966","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2018-09-09T13:20:00Z","cross_cats_sorted":[],"title_canon_sha256":"780916860098f9a103ac2d42dc358499041afbe3c27cf44ef50553558441ae32","abstract_canon_sha256":"110316d2e9fcb2199c37e0a4e6c09ebad1318c5a73e86734d53db1a227759d38"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:06:10.484147Z","signature_b64":"TC2M1rhC/VQxfQ7yURTLzm/0Ub7yARMl5Y1k5oecNiRlk9EUPynwhG4OUcdfNK3/72Pu1VwM8YA52CcecwVbAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"682a71cd1ab7d8b023477e24cf13f249ef8c124aa6e4c986405221fc2a2ebdb2","last_reissued_at":"2026-05-18T00:06:10.483603Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:06:10.483603Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"LS-Net: Learning to Solve Nonlinear Least Squares for Monocular Stereo","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Andrew J. Davison, Jan Czarnowski, Michael Bloesch, Ronald Clark, Stefan Leutenegger","submitted_at":"2018-09-09T13:20:00Z","abstract_excerpt":"Sum-of-squares objective functions are very popular in computer vision algorithms. However, these objective functions are not always easy to optimize. The underlying assumptions made by solvers are often not satisfied and many problems are inherently ill-posed. In this paper, we propose LS-Net, a neural nonlinear least squares optimization algorithm which learns to effectively optimize these cost functions even in the presence of adversities. Unlike traditional approaches, the proposed solver requires no hand-crafted regularizers or priors as these are implicitly learned from the data. We appl"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.02966","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":"1809.02966","created_at":"2026-05-18T00:06:10.483704+00:00"},{"alias_kind":"arxiv_version","alias_value":"1809.02966v1","created_at":"2026-05-18T00:06:10.483704+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.02966","created_at":"2026-05-18T00:06:10.483704+00:00"},{"alias_kind":"pith_short_12","alias_value":"NAVHDTI2W7ML","created_at":"2026-05-18T12:32:40.477152+00:00"},{"alias_kind":"pith_short_16","alias_value":"NAVHDTI2W7MLAI2H","created_at":"2026-05-18T12:32:40.477152+00:00"},{"alias_kind":"pith_short_8","alias_value":"NAVHDTI2","created_at":"2026-05-18T12:32:40.477152+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/NAVHDTI2W7MLAI2HPYSM6E7SJH","json":"https://pith.science/pith/NAVHDTI2W7MLAI2HPYSM6E7SJH.json","graph_json":"https://pith.science/api/pith-number/NAVHDTI2W7MLAI2HPYSM6E7SJH/graph.json","events_json":"https://pith.science/api/pith-number/NAVHDTI2W7MLAI2HPYSM6E7SJH/events.json","paper":"https://pith.science/paper/NAVHDTI2"},"agent_actions":{"view_html":"https://pith.science/pith/NAVHDTI2W7MLAI2HPYSM6E7SJH","download_json":"https://pith.science/pith/NAVHDTI2W7MLAI2HPYSM6E7SJH.json","view_paper":"https://pith.science/paper/NAVHDTI2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1809.02966&json=true","fetch_graph":"https://pith.science/api/pith-number/NAVHDTI2W7MLAI2HPYSM6E7SJH/graph.json","fetch_events":"https://pith.science/api/pith-number/NAVHDTI2W7MLAI2HPYSM6E7SJH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NAVHDTI2W7MLAI2HPYSM6E7SJH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NAVHDTI2W7MLAI2HPYSM6E7SJH/action/storage_attestation","attest_author":"https://pith.science/pith/NAVHDTI2W7MLAI2HPYSM6E7SJH/action/author_attestation","sign_citation":"https://pith.science/pith/NAVHDTI2W7MLAI2HPYSM6E7SJH/action/citation_signature","submit_replication":"https://pith.science/pith/NAVHDTI2W7MLAI2HPYSM6E7SJH/action/replication_record"}},"created_at":"2026-05-18T00:06:10.483704+00:00","updated_at":"2026-05-18T00:06:10.483704+00:00"}