{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:FSHYKEEKHL4Y7ZMZING7JHFGUC","short_pith_number":"pith:FSHYKEEK","schema_version":"1.0","canonical_sha256":"2c8f85108a3af98fe599434df49ca6a0a0128d2be172cb17d99618f49efe8313","source":{"kind":"arxiv","id":"1203.0578","version":2},"attestation_state":"computed","paper":{"title":"A Look at the Generalized Heron Problem through the Lens of Majorization-Minimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.NA"],"primary_cat":"math.OC","authors_text":"Eric C. Chi, Kenneth Lange","submitted_at":"2012-03-02T21:44:59Z","abstract_excerpt":"In a recent issue of this journal, Mordukhovich et al.\\ pose and solve an interesting non-differentiable generalization of the Heron problem in the framework of modern convex analysis. In the generalized Heron problem one is given $k+1$ closed convex sets in $\\Real^d$ equipped with its Euclidean norm and asked to find the point in the last set such that the sum of the distances to the first $k$ sets is minimal. In later work the authors generalize the Heron problem even further, relax its convexity assumptions, study its theoretical properties, and pursue subgradient algorithms for solving the"},"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":"1203.0578","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2012-03-02T21:44:59Z","cross_cats_sorted":["math.NA"],"title_canon_sha256":"29a77e1bdd4c0c5f171921826177bf808e821df89d7b18193bfbe0fe8e5b92b6","abstract_canon_sha256":"74ad67f2cafc332fa7233c83550974272f3d788b12358c8b958ba4a320a08741"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:21:17.317663Z","signature_b64":"x4ioMPh2+I+4uCP7jkzBXYRV4z3JH2/D7SuHSPtZaUXAG5G1re7yMDgjyoJcnt0cXkdhWzogu+LWgPaPtmdmAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2c8f85108a3af98fe599434df49ca6a0a0128d2be172cb17d99618f49efe8313","last_reissued_at":"2026-05-18T02:21:17.316919Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:21:17.316919Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Look at the Generalized Heron Problem through the Lens of Majorization-Minimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.NA"],"primary_cat":"math.OC","authors_text":"Eric C. Chi, Kenneth Lange","submitted_at":"2012-03-02T21:44:59Z","abstract_excerpt":"In a recent issue of this journal, Mordukhovich et al.\\ pose and solve an interesting non-differentiable generalization of the Heron problem in the framework of modern convex analysis. In the generalized Heron problem one is given $k+1$ closed convex sets in $\\Real^d$ equipped with its Euclidean norm and asked to find the point in the last set such that the sum of the distances to the first $k$ sets is minimal. In later work the authors generalize the Heron problem even further, relax its convexity assumptions, study its theoretical properties, and pursue subgradient algorithms for solving the"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1203.0578","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":"1203.0578","created_at":"2026-05-18T02:21:17.317039+00:00"},{"alias_kind":"arxiv_version","alias_value":"1203.0578v2","created_at":"2026-05-18T02:21:17.317039+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1203.0578","created_at":"2026-05-18T02:21:17.317039+00:00"},{"alias_kind":"pith_short_12","alias_value":"FSHYKEEKHL4Y","created_at":"2026-05-18T12:27:06.952714+00:00"},{"alias_kind":"pith_short_16","alias_value":"FSHYKEEKHL4Y7ZMZ","created_at":"2026-05-18T12:27:06.952714+00:00"},{"alias_kind":"pith_short_8","alias_value":"FSHYKEEK","created_at":"2026-05-18T12:27:06.952714+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/FSHYKEEKHL4Y7ZMZING7JHFGUC","json":"https://pith.science/pith/FSHYKEEKHL4Y7ZMZING7JHFGUC.json","graph_json":"https://pith.science/api/pith-number/FSHYKEEKHL4Y7ZMZING7JHFGUC/graph.json","events_json":"https://pith.science/api/pith-number/FSHYKEEKHL4Y7ZMZING7JHFGUC/events.json","paper":"https://pith.science/paper/FSHYKEEK"},"agent_actions":{"view_html":"https://pith.science/pith/FSHYKEEKHL4Y7ZMZING7JHFGUC","download_json":"https://pith.science/pith/FSHYKEEKHL4Y7ZMZING7JHFGUC.json","view_paper":"https://pith.science/paper/FSHYKEEK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1203.0578&json=true","fetch_graph":"https://pith.science/api/pith-number/FSHYKEEKHL4Y7ZMZING7JHFGUC/graph.json","fetch_events":"https://pith.science/api/pith-number/FSHYKEEKHL4Y7ZMZING7JHFGUC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FSHYKEEKHL4Y7ZMZING7JHFGUC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FSHYKEEKHL4Y7ZMZING7JHFGUC/action/storage_attestation","attest_author":"https://pith.science/pith/FSHYKEEKHL4Y7ZMZING7JHFGUC/action/author_attestation","sign_citation":"https://pith.science/pith/FSHYKEEKHL4Y7ZMZING7JHFGUC/action/citation_signature","submit_replication":"https://pith.science/pith/FSHYKEEKHL4Y7ZMZING7JHFGUC/action/replication_record"}},"created_at":"2026-05-18T02:21:17.317039+00:00","updated_at":"2026-05-18T02:21:17.317039+00:00"}