{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:4OLQXT4TBIRN2D3YU5G64SDKI2","short_pith_number":"pith:4OLQXT4T","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"},"canonical_sha256":"e3970bcf930a22dd0f78a74dee486a46a03257473635278c614d07d3badb674e","source":{"kind":"arxiv","id":"1701.04464","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1701.04464","created_at":"2026-05-18T00:49:22Z"},{"alias_kind":"arxiv_version","alias_value":"1701.04464v2","created_at":"2026-05-18T00:49:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.04464","created_at":"2026-05-18T00:49:22Z"},{"alias_kind":"pith_short_12","alias_value":"4OLQXT4TBIRN","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_16","alias_value":"4OLQXT4TBIRN2D3Y","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_8","alias_value":"4OLQXT4T","created_at":"2026-05-18T12:31:00Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:4OLQXT4TBIRN2D3YU5G64SDKI2","target":"record","payload":{"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"},"canonical_sha256":"e3970bcf930a22dd0f78a74dee486a46a03257473635278c614d07d3badb674e","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"},"source_kind":"arxiv","source_id":"1701.04464","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:49:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qcYxV2C79Y3wbihNErbIaJtoLCfDzect45x8zYf3Yblt9Hecib5iF1MyH+wDE+isNUwbEDtfa1/i6IQuxSiJAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T01:02:08.892510Z"},"content_sha256":"bfd8151dfae12267a7bff3e9125c3f8a39fed34fabce73afc4efc63d634dbff8","schema_version":"1.0","event_id":"sha256:bfd8151dfae12267a7bff3e9125c3f8a39fed34fabce73afc4efc63d634dbff8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:4OLQXT4TBIRN2D3YU5G64SDKI2","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:49:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4nJGkyK9EWAaMQ2BzD2qpZVg0ZG6IbboLy3m0B1Kx0BM+3vgpZYx9LT64xk51YtjEerAgf37rInPP0+2LlCGBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T01:02:08.893269Z"},"content_sha256":"0c04105ba9f5242f7fd23930026bc79e9ad46c27f4f4cfc2280bef4c70a4f695","schema_version":"1.0","event_id":"sha256:0c04105ba9f5242f7fd23930026bc79e9ad46c27f4f4cfc2280bef4c70a4f695"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4OLQXT4TBIRN2D3YU5G64SDKI2/bundle.json","state_url":"https://pith.science/pith/4OLQXT4TBIRN2D3YU5G64SDKI2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4OLQXT4TBIRN2D3YU5G64SDKI2/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-10T01:02:08Z","links":{"resolver":"https://pith.science/pith/4OLQXT4TBIRN2D3YU5G64SDKI2","bundle":"https://pith.science/pith/4OLQXT4TBIRN2D3YU5G64SDKI2/bundle.json","state":"https://pith.science/pith/4OLQXT4TBIRN2D3YU5G64SDKI2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4OLQXT4TBIRN2D3YU5G64SDKI2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:4OLQXT4TBIRN2D3YU5G64SDKI2","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"6072a40a4cf988dac83ed7ef888ee263bfab5c65f6c48c9e756868a1fc6e87ca","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-01-16T21:46:09Z","title_canon_sha256":"45d768c8f1b32c3d6c8b02b28f3bdc24623a0d1e5e124708e00df2a502afabc8"},"schema_version":"1.0","source":{"id":"1701.04464","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1701.04464","created_at":"2026-05-18T00:49:22Z"},{"alias_kind":"arxiv_version","alias_value":"1701.04464v2","created_at":"2026-05-18T00:49:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.04464","created_at":"2026-05-18T00:49:22Z"},{"alias_kind":"pith_short_12","alias_value":"4OLQXT4TBIRN","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_16","alias_value":"4OLQXT4TBIRN2D3Y","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_8","alias_value":"4OLQXT4T","created_at":"2026-05-18T12:31:00Z"}],"graph_snapshots":[{"event_id":"sha256:0c04105ba9f5242f7fd23930026bc79e9ad46c27f4f4cfc2280bef4c70a4f695","target":"graph","created_at":"2026-05-18T00:49:22Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Nguyen Mau Nam, Sam Raynolds, Tuyen Tran, Wondi Geremew","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-01-16T21:46:09Z","title":"Nesterov's Smoothing Technique and Minimizing Differences of Convex Functions for Hierarchical Clustering"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.04464","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:bfd8151dfae12267a7bff3e9125c3f8a39fed34fabce73afc4efc63d634dbff8","target":"record","created_at":"2026-05-18T00:49:22Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"6072a40a4cf988dac83ed7ef888ee263bfab5c65f6c48c9e756868a1fc6e87ca","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-01-16T21:46:09Z","title_canon_sha256":"45d768c8f1b32c3d6c8b02b28f3bdc24623a0d1e5e124708e00df2a502afabc8"},"schema_version":"1.0","source":{"id":"1701.04464","kind":"arxiv","version":2}},"canonical_sha256":"e3970bcf930a22dd0f78a74dee486a46a03257473635278c614d07d3badb674e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e3970bcf930a22dd0f78a74dee486a46a03257473635278c614d07d3badb674e","first_computed_at":"2026-05-18T00:49:22.716050Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:49:22.716050Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"BSCr3IdcQGIvUjS5QY0jATHMEMT3NpEwyZlwFi3H3XZkxyPHB6SVAwvqkrOKQtsBTyq0GZh09bvRXKm7ElYRCg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:49:22.716494Z","signed_message":"canonical_sha256_bytes"},"source_id":"1701.04464","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bfd8151dfae12267a7bff3e9125c3f8a39fed34fabce73afc4efc63d634dbff8","sha256:0c04105ba9f5242f7fd23930026bc79e9ad46c27f4f4cfc2280bef4c70a4f695"],"state_sha256":"66cefd5b9b7b3de214403723db8cdeb4b8e7f4dc61060a08094a4fafef44bc96"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"torQ1+PULGqMl/sAX4ulNOOt76tm/+kxz4rKZdA/wg8WELrXJ1u6jdYjzX4kZhGPr3eoQz1U/oSmTEVnEw9pDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-10T01:02:08.897326Z","bundle_sha256":"26ed35e3cca32b7f565fbf3efd1586cdbca9685dd7437f779fa47008e74b2cc5"}}