{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:RAKUECXNPXHVX3DDSOH5AZITG2","short_pith_number":"pith:RAKUECXN","schema_version":"1.0","canonical_sha256":"8815420aed7dcf5bec63938fd0651336a2ec6f17c2940e55ca799e672151b87e","source":{"kind":"arxiv","id":"1807.05087","version":1},"attestation_state":"computed","paper":{"title":"Learning Graph Representations by Dendrograms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"cs.SI","authors_text":"Bertrand Charpentier, Thomas Bonald","submitted_at":"2018-07-13T13:51:52Z","abstract_excerpt":"Hierarchical graph clustering is a common technique to reveal the multi-scale structure of complex networks. We propose a novel metric for assessing the quality of a hierarchical clustering. This metric reflects the ability to reconstruct the graph from the dendrogram, which encodes the hierarchy. The optimal representation of the graph defines a class of reducible linkages leading to regular dendrograms by greedy agglomerative clustering."},"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":"1807.05087","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2018-07-13T13:51:52Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"61aea0b2afa5b9da2b7be750dc01c1c12a2c16af65a4f9e358d0b9c0d4ce9c7c","abstract_canon_sha256":"b3130b61c6ad36620381a56d7bb327ac88ced6cd8d5981a0e252df64a1566dea"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:10:49.054034Z","signature_b64":"GKubhJ5rTH7cUlvRe3HY/6FsPtMPWUhKnz2WYpga0kovjEYXFYodNs526pi9qd4U2TCPov0MhZkps3X54wpqCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8815420aed7dcf5bec63938fd0651336a2ec6f17c2940e55ca799e672151b87e","last_reissued_at":"2026-05-18T00:10:49.053425Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:10:49.053425Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Learning Graph Representations by Dendrograms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"cs.SI","authors_text":"Bertrand Charpentier, Thomas Bonald","submitted_at":"2018-07-13T13:51:52Z","abstract_excerpt":"Hierarchical graph clustering is a common technique to reveal the multi-scale structure of complex networks. We propose a novel metric for assessing the quality of a hierarchical clustering. This metric reflects the ability to reconstruct the graph from the dendrogram, which encodes the hierarchy. The optimal representation of the graph defines a class of reducible linkages leading to regular dendrograms by greedy agglomerative clustering."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.05087","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":""},"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":"1807.05087","created_at":"2026-05-18T00:10:49.053511+00:00"},{"alias_kind":"arxiv_version","alias_value":"1807.05087v1","created_at":"2026-05-18T00:10:49.053511+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.05087","created_at":"2026-05-18T00:10:49.053511+00:00"},{"alias_kind":"pith_short_12","alias_value":"RAKUECXNPXHV","created_at":"2026-05-18T12:32:50.500415+00:00"},{"alias_kind":"pith_short_16","alias_value":"RAKUECXNPXHVX3DD","created_at":"2026-05-18T12:32:50.500415+00:00"},{"alias_kind":"pith_short_8","alias_value":"RAKUECXN","created_at":"2026-05-18T12:32:50.500415+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/RAKUECXNPXHVX3DDSOH5AZITG2","json":"https://pith.science/pith/RAKUECXNPXHVX3DDSOH5AZITG2.json","graph_json":"https://pith.science/api/pith-number/RAKUECXNPXHVX3DDSOH5AZITG2/graph.json","events_json":"https://pith.science/api/pith-number/RAKUECXNPXHVX3DDSOH5AZITG2/events.json","paper":"https://pith.science/paper/RAKUECXN"},"agent_actions":{"view_html":"https://pith.science/pith/RAKUECXNPXHVX3DDSOH5AZITG2","download_json":"https://pith.science/pith/RAKUECXNPXHVX3DDSOH5AZITG2.json","view_paper":"https://pith.science/paper/RAKUECXN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1807.05087&json=true","fetch_graph":"https://pith.science/api/pith-number/RAKUECXNPXHVX3DDSOH5AZITG2/graph.json","fetch_events":"https://pith.science/api/pith-number/RAKUECXNPXHVX3DDSOH5AZITG2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RAKUECXNPXHVX3DDSOH5AZITG2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RAKUECXNPXHVX3DDSOH5AZITG2/action/storage_attestation","attest_author":"https://pith.science/pith/RAKUECXNPXHVX3DDSOH5AZITG2/action/author_attestation","sign_citation":"https://pith.science/pith/RAKUECXNPXHVX3DDSOH5AZITG2/action/citation_signature","submit_replication":"https://pith.science/pith/RAKUECXNPXHVX3DDSOH5AZITG2/action/replication_record"}},"created_at":"2026-05-18T00:10:49.053511+00:00","updated_at":"2026-05-18T00:10:49.053511+00:00"}