{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:XPXHJBGV6HIGCH5DDLEPCB7L4Y","short_pith_number":"pith:XPXHJBGV","schema_version":"1.0","canonical_sha256":"bbee7484d5f1d0611fa31ac8f107ebe61b650d63512f3e16f1888e52aeeae74c","source":{"kind":"arxiv","id":"1309.0049","version":3},"attestation_state":"computed","paper":{"title":"The Euclidean distance degree of an algebraic variety","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"math.AG","authors_text":"Bernd Sturmfels, Emil Horobet, Giorgio Ottaviani, Jan Draisma, Rekha R. Thomas","submitted_at":"2013-08-31T00:04:27Z","abstract_excerpt":"The nearest point map of a real algebraic variety with respect to Euclidean distance is an algebraic function. For instance, for varieties of low rank matrices, the Eckart-Young Theorem states that this map is given by the singular value decomposition. This article develops a theory of such nearest point maps from the perspective of computational algebraic geometry. The Euclidean distance degree of a variety is the number of critical points of the squared distance to a generic point outside the variety. Focusing on varieties seen in applications, we present numerous tools for exact computation"},"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":"1309.0049","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.AG","submitted_at":"2013-08-31T00:04:27Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"e3ffccd761f655223eac97609a85d9e8d5ce774121717dcb2d0cedb06258fedd","abstract_canon_sha256":"35d1ad0a8804dee6b8371cc33c434bbdab9cfccc6bfbb1c1cf58397c9810c059"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:32:39.033220Z","signature_b64":"sMc4eaXx+TOUqKPNtRf5CvFP7ZH9ua90UelDQBoB2PO86Bp1fpHWniZLUNOrvFoab/iQ9r7ZW0JwQTuGmhtYCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bbee7484d5f1d0611fa31ac8f107ebe61b650d63512f3e16f1888e52aeeae74c","last_reissued_at":"2026-05-18T02:32:39.032833Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:32:39.032833Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Euclidean distance degree of an algebraic variety","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"math.AG","authors_text":"Bernd Sturmfels, Emil Horobet, Giorgio Ottaviani, Jan Draisma, Rekha R. Thomas","submitted_at":"2013-08-31T00:04:27Z","abstract_excerpt":"The nearest point map of a real algebraic variety with respect to Euclidean distance is an algebraic function. For instance, for varieties of low rank matrices, the Eckart-Young Theorem states that this map is given by the singular value decomposition. This article develops a theory of such nearest point maps from the perspective of computational algebraic geometry. The Euclidean distance degree of a variety is the number of critical points of the squared distance to a generic point outside the variety. Focusing on varieties seen in applications, we present numerous tools for exact computation"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1309.0049","kind":"arxiv","version":3},"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":"1309.0049","created_at":"2026-05-18T02:32:39.032892+00:00"},{"alias_kind":"arxiv_version","alias_value":"1309.0049v3","created_at":"2026-05-18T02:32:39.032892+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.0049","created_at":"2026-05-18T02:32:39.032892+00:00"},{"alias_kind":"pith_short_12","alias_value":"XPXHJBGV6HIG","created_at":"2026-05-18T12:28:06.772260+00:00"},{"alias_kind":"pith_short_16","alias_value":"XPXHJBGV6HIGCH5D","created_at":"2026-05-18T12:28:06.772260+00:00"},{"alias_kind":"pith_short_8","alias_value":"XPXHJBGV","created_at":"2026-05-18T12:28:06.772260+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2605.13410","citing_title":"Semi-interlaced polytopes","ref_index":13,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/XPXHJBGV6HIGCH5DDLEPCB7L4Y","json":"https://pith.science/pith/XPXHJBGV6HIGCH5DDLEPCB7L4Y.json","graph_json":"https://pith.science/api/pith-number/XPXHJBGV6HIGCH5DDLEPCB7L4Y/graph.json","events_json":"https://pith.science/api/pith-number/XPXHJBGV6HIGCH5DDLEPCB7L4Y/events.json","paper":"https://pith.science/paper/XPXHJBGV"},"agent_actions":{"view_html":"https://pith.science/pith/XPXHJBGV6HIGCH5DDLEPCB7L4Y","download_json":"https://pith.science/pith/XPXHJBGV6HIGCH5DDLEPCB7L4Y.json","view_paper":"https://pith.science/paper/XPXHJBGV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1309.0049&json=true","fetch_graph":"https://pith.science/api/pith-number/XPXHJBGV6HIGCH5DDLEPCB7L4Y/graph.json","fetch_events":"https://pith.science/api/pith-number/XPXHJBGV6HIGCH5DDLEPCB7L4Y/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XPXHJBGV6HIGCH5DDLEPCB7L4Y/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XPXHJBGV6HIGCH5DDLEPCB7L4Y/action/storage_attestation","attest_author":"https://pith.science/pith/XPXHJBGV6HIGCH5DDLEPCB7L4Y/action/author_attestation","sign_citation":"https://pith.science/pith/XPXHJBGV6HIGCH5DDLEPCB7L4Y/action/citation_signature","submit_replication":"https://pith.science/pith/XPXHJBGV6HIGCH5DDLEPCB7L4Y/action/replication_record"}},"created_at":"2026-05-18T02:32:39.032892+00:00","updated_at":"2026-05-18T02:32:39.032892+00:00"}