{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:4OLQXT4TBIRN2D3YU5G64SDKI2","short_pith_number":"pith:4OLQXT4T","schema_version":"1.0","canonical_sha256":"e3970bcf930a22dd0f78a74dee486a46a03257473635278c614d07d3badb674e","source":{"kind":"arxiv","id":"1701.04464","version":2},"attestation_state":"computed","paper":{"title":"Nesterov's Smoothing Technique and Minimizing Differences of Convex Functions for Hierarchical Clustering","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Nguyen Mau Nam, Sam Raynolds, Tuyen Tran, Wondi Geremew","submitted_at":"2017-01-16T21:46:09Z","abstract_excerpt":"A bilevel hierarchical clustering model is commonly used in designing optimal multicast networks. In this paper, we consider two different formulations of the bilevel hierarchical clustering problem, a discrete optimization problem which can be shown to be NP-hard. Our approach is to reformulate the problem as a continuous optimization problem by making some relaxations on the discreteness conditions. Then Nesterov's smoothing technique and a numerical algorithm for minimizing differences of convex functions called the DCA are applied to cope with the nonsmoothness and nonconvexity of the prob"},"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":"1701.04464","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-01-16T21:46:09Z","cross_cats_sorted":[],"title_canon_sha256":"45d768c8f1b32c3d6c8b02b28f3bdc24623a0d1e5e124708e00df2a502afabc8","abstract_canon_sha256":"6072a40a4cf988dac83ed7ef888ee263bfab5c65f6c48c9e756868a1fc6e87ca"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:49:22.716494Z","signature_b64":"BSCr3IdcQGIvUjS5QY0jATHMEMT3NpEwyZlwFi3H3XZkxyPHB6SVAwvqkrOKQtsBTyq0GZh09bvRXKm7ElYRCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e3970bcf930a22dd0f78a74dee486a46a03257473635278c614d07d3badb674e","last_reissued_at":"2026-05-18T00:49:22.716050Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:49:22.716050Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Nesterov's Smoothing Technique and Minimizing Differences of Convex Functions for Hierarchical Clustering","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Nguyen Mau Nam, Sam Raynolds, Tuyen Tran, Wondi Geremew","submitted_at":"2017-01-16T21:46:09Z","abstract_excerpt":"A bilevel hierarchical clustering model is commonly used in designing optimal multicast networks. In this paper, we consider two different formulations of the bilevel hierarchical clustering problem, a discrete optimization problem which can be shown to be NP-hard. Our approach is to reformulate the problem as a continuous optimization problem by making some relaxations on the discreteness conditions. Then Nesterov's smoothing technique and a numerical algorithm for minimizing differences of convex functions called the DCA are applied to cope with the nonsmoothness and nonconvexity of the prob"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.04464","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":"1701.04464","created_at":"2026-05-18T00:49:22.716118+00:00"},{"alias_kind":"arxiv_version","alias_value":"1701.04464v2","created_at":"2026-05-18T00:49:22.716118+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.04464","created_at":"2026-05-18T00:49:22.716118+00:00"},{"alias_kind":"pith_short_12","alias_value":"4OLQXT4TBIRN","created_at":"2026-05-18T12:31:00.734936+00:00"},{"alias_kind":"pith_short_16","alias_value":"4OLQXT4TBIRN2D3Y","created_at":"2026-05-18T12:31:00.734936+00:00"},{"alias_kind":"pith_short_8","alias_value":"4OLQXT4T","created_at":"2026-05-18T12:31:00.734936+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/4OLQXT4TBIRN2D3YU5G64SDKI2","json":"https://pith.science/pith/4OLQXT4TBIRN2D3YU5G64SDKI2.json","graph_json":"https://pith.science/api/pith-number/4OLQXT4TBIRN2D3YU5G64SDKI2/graph.json","events_json":"https://pith.science/api/pith-number/4OLQXT4TBIRN2D3YU5G64SDKI2/events.json","paper":"https://pith.science/paper/4OLQXT4T"},"agent_actions":{"view_html":"https://pith.science/pith/4OLQXT4TBIRN2D3YU5G64SDKI2","download_json":"https://pith.science/pith/4OLQXT4TBIRN2D3YU5G64SDKI2.json","view_paper":"https://pith.science/paper/4OLQXT4T","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1701.04464&json=true","fetch_graph":"https://pith.science/api/pith-number/4OLQXT4TBIRN2D3YU5G64SDKI2/graph.json","fetch_events":"https://pith.science/api/pith-number/4OLQXT4TBIRN2D3YU5G64SDKI2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4OLQXT4TBIRN2D3YU5G64SDKI2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4OLQXT4TBIRN2D3YU5G64SDKI2/action/storage_attestation","attest_author":"https://pith.science/pith/4OLQXT4TBIRN2D3YU5G64SDKI2/action/author_attestation","sign_citation":"https://pith.science/pith/4OLQXT4TBIRN2D3YU5G64SDKI2/action/citation_signature","submit_replication":"https://pith.science/pith/4OLQXT4TBIRN2D3YU5G64SDKI2/action/replication_record"}},"created_at":"2026-05-18T00:49:22.716118+00:00","updated_at":"2026-05-18T00:49:22.716118+00:00"}