{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:NN2JHGUQUKNWO64WWF67T5MAMS","short_pith_number":"pith:NN2JHGUQ","schema_version":"1.0","canonical_sha256":"6b74939a90a29b677b96b17df9f58064807227df26e82da398c8c0ec2f785d23","source":{"kind":"arxiv","id":"2108.06036","version":1},"attestation_state":"computed","paper":{"title":"An Information-theoretic Perspective of Hierarchical Clustering","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Bingchen Fan, Feng Zheng, Yicheng Pan","submitted_at":"2021-08-13T03:03:56Z","abstract_excerpt":"A combinatorial cost function for hierarchical clustering was introduced by Dasgupta \\cite{dasgupta2016cost}. It has been generalized by Cohen-Addad et al. \\cite{cohen2019hierarchical} to a general form named admissible function. In this paper, we investigate hierarchical clustering from the \\emph{information-theoretic} perspective and formulate a new objective function. We also establish the relationship between these two perspectives. In algorithmic aspect, we get rid of the traditional top-down and bottom-up frameworks, and propose a new one to stratify the \\emph{sparsest} level of a cluste"},"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":"2108.06036","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2021-08-13T03:03:56Z","cross_cats_sorted":[],"title_canon_sha256":"d250e5cd7cf009b0d67dfa29172519ce7f262f8bb8626ed575a3333cb72e336e","abstract_canon_sha256":"d93ffa4ea678b6363aa1dc1733999c584338f0b14333ec74df75c152b105b788"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:05:36.900922Z","signature_b64":"0rHhWG0n094BbH7FWg0/oZAe919SPvTsWbNP7PMFLzCCrRH249UV6gRHtCjzGF1A+ydGsTK3zMsVmTOT11UyBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6b74939a90a29b677b96b17df9f58064807227df26e82da398c8c0ec2f785d23","last_reissued_at":"2026-07-05T03:05:36.900544Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:05:36.900544Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An Information-theoretic Perspective of Hierarchical Clustering","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Bingchen Fan, Feng Zheng, Yicheng Pan","submitted_at":"2021-08-13T03:03:56Z","abstract_excerpt":"A combinatorial cost function for hierarchical clustering was introduced by Dasgupta \\cite{dasgupta2016cost}. It has been generalized by Cohen-Addad et al. \\cite{cohen2019hierarchical} to a general form named admissible function. In this paper, we investigate hierarchical clustering from the \\emph{information-theoretic} perspective and formulate a new objective function. We also establish the relationship between these two perspectives. In algorithmic aspect, we get rid of the traditional top-down and bottom-up frameworks, and propose a new one to stratify the \\emph{sparsest} level of a cluste"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2108.06036","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2108.06036/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2108.06036","created_at":"2026-07-05T03:05:36.900601+00:00"},{"alias_kind":"arxiv_version","alias_value":"2108.06036v1","created_at":"2026-07-05T03:05:36.900601+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2108.06036","created_at":"2026-07-05T03:05:36.900601+00:00"},{"alias_kind":"pith_short_12","alias_value":"NN2JHGUQUKNW","created_at":"2026-07-05T03:05:36.900601+00:00"},{"alias_kind":"pith_short_16","alias_value":"NN2JHGUQUKNWO64W","created_at":"2026-07-05T03:05:36.900601+00:00"},{"alias_kind":"pith_short_8","alias_value":"NN2JHGUQ","created_at":"2026-07-05T03:05:36.900601+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2505.14453","citing_title":"Robustness Evaluation of Graph-based News Detection Using Network Structural Information","ref_index":25,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/NN2JHGUQUKNWO64WWF67T5MAMS","json":"https://pith.science/pith/NN2JHGUQUKNWO64WWF67T5MAMS.json","graph_json":"https://pith.science/api/pith-number/NN2JHGUQUKNWO64WWF67T5MAMS/graph.json","events_json":"https://pith.science/api/pith-number/NN2JHGUQUKNWO64WWF67T5MAMS/events.json","paper":"https://pith.science/paper/NN2JHGUQ"},"agent_actions":{"view_html":"https://pith.science/pith/NN2JHGUQUKNWO64WWF67T5MAMS","download_json":"https://pith.science/pith/NN2JHGUQUKNWO64WWF67T5MAMS.json","view_paper":"https://pith.science/paper/NN2JHGUQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2108.06036&json=true","fetch_graph":"https://pith.science/api/pith-number/NN2JHGUQUKNWO64WWF67T5MAMS/graph.json","fetch_events":"https://pith.science/api/pith-number/NN2JHGUQUKNWO64WWF67T5MAMS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NN2JHGUQUKNWO64WWF67T5MAMS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NN2JHGUQUKNWO64WWF67T5MAMS/action/storage_attestation","attest_author":"https://pith.science/pith/NN2JHGUQUKNWO64WWF67T5MAMS/action/author_attestation","sign_citation":"https://pith.science/pith/NN2JHGUQUKNWO64WWF67T5MAMS/action/citation_signature","submit_replication":"https://pith.science/pith/NN2JHGUQUKNWO64WWF67T5MAMS/action/replication_record"}},"created_at":"2026-07-05T03:05:36.900601+00:00","updated_at":"2026-07-05T03:05:36.900601+00:00"}