{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:KNHHSSE3KFAL4ZJIS4IWAQK34V","short_pith_number":"pith:KNHHSSE3","schema_version":"1.0","canonical_sha256":"534e79489b5140be6528971160415be54f485c08d74f78efc04b2ba278d1cbb4","source":{"kind":"arxiv","id":"1508.02826","version":1},"attestation_state":"computed","paper":{"title":"Inappropriate use of L-BFGS, Illustrated on frame field design","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GR","authors_text":"Dmitry Sokolov, Nicolas Ray","submitted_at":"2015-08-12T07:02:19Z","abstract_excerpt":"L-BFGS is a hill climbing method that is guarantied to converge only for convex problems. In computer graphics, it is often used as a black box solver for a more general class of non linear problems, including problems having many local minima. Some works obtain very nice results by solving such difficult problems with L-BFGS. Surprisingly, the method is able to escape local minima: our interpretation is that the approximation of the Hessian is smoother than the real Hessian, making it possible to evade the local minima. We analyse the behavior of L-BFGS on the design of 2D frame fields. It in"},"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":"1508.02826","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GR","submitted_at":"2015-08-12T07:02:19Z","cross_cats_sorted":[],"title_canon_sha256":"079415d9a1dee8c59a099ef4b48a8ca81bb590a1a15792cbdc42caf5a795db4d","abstract_canon_sha256":"a55053a9a85a2a69f3f6c68ac6eec2634e639ab65a315a54ce28a48f0c0215c1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:35:23.748553Z","signature_b64":"naFsJU0xalXiJyZhMo6LY0AcDyvV4Q+y7Jd4pgTJnJLz+py5xbgtJmbkn3FXDf9TxSnaCWDu0O0MllTitBRcDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"534e79489b5140be6528971160415be54f485c08d74f78efc04b2ba278d1cbb4","last_reissued_at":"2026-05-18T01:35:23.747897Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:35:23.747897Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Inappropriate use of L-BFGS, Illustrated on frame field design","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GR","authors_text":"Dmitry Sokolov, Nicolas Ray","submitted_at":"2015-08-12T07:02:19Z","abstract_excerpt":"L-BFGS is a hill climbing method that is guarantied to converge only for convex problems. In computer graphics, it is often used as a black box solver for a more general class of non linear problems, including problems having many local minima. Some works obtain very nice results by solving such difficult problems with L-BFGS. Surprisingly, the method is able to escape local minima: our interpretation is that the approximation of the Hessian is smoother than the real Hessian, making it possible to evade the local minima. We analyse the behavior of L-BFGS on the design of 2D frame fields. It in"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1508.02826","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":"1508.02826","created_at":"2026-05-18T01:35:23.748025+00:00"},{"alias_kind":"arxiv_version","alias_value":"1508.02826v1","created_at":"2026-05-18T01:35:23.748025+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1508.02826","created_at":"2026-05-18T01:35:23.748025+00:00"},{"alias_kind":"pith_short_12","alias_value":"KNHHSSE3KFAL","created_at":"2026-05-18T12:29:29.992203+00:00"},{"alias_kind":"pith_short_16","alias_value":"KNHHSSE3KFAL4ZJI","created_at":"2026-05-18T12:29:29.992203+00:00"},{"alias_kind":"pith_short_8","alias_value":"KNHHSSE3","created_at":"2026-05-18T12:29:29.992203+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/KNHHSSE3KFAL4ZJIS4IWAQK34V","json":"https://pith.science/pith/KNHHSSE3KFAL4ZJIS4IWAQK34V.json","graph_json":"https://pith.science/api/pith-number/KNHHSSE3KFAL4ZJIS4IWAQK34V/graph.json","events_json":"https://pith.science/api/pith-number/KNHHSSE3KFAL4ZJIS4IWAQK34V/events.json","paper":"https://pith.science/paper/KNHHSSE3"},"agent_actions":{"view_html":"https://pith.science/pith/KNHHSSE3KFAL4ZJIS4IWAQK34V","download_json":"https://pith.science/pith/KNHHSSE3KFAL4ZJIS4IWAQK34V.json","view_paper":"https://pith.science/paper/KNHHSSE3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1508.02826&json=true","fetch_graph":"https://pith.science/api/pith-number/KNHHSSE3KFAL4ZJIS4IWAQK34V/graph.json","fetch_events":"https://pith.science/api/pith-number/KNHHSSE3KFAL4ZJIS4IWAQK34V/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KNHHSSE3KFAL4ZJIS4IWAQK34V/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KNHHSSE3KFAL4ZJIS4IWAQK34V/action/storage_attestation","attest_author":"https://pith.science/pith/KNHHSSE3KFAL4ZJIS4IWAQK34V/action/author_attestation","sign_citation":"https://pith.science/pith/KNHHSSE3KFAL4ZJIS4IWAQK34V/action/citation_signature","submit_replication":"https://pith.science/pith/KNHHSSE3KFAL4ZJIS4IWAQK34V/action/replication_record"}},"created_at":"2026-05-18T01:35:23.748025+00:00","updated_at":"2026-05-18T01:35:23.748025+00:00"}