{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:SPPSVXB36YUY3KVUYW2VYBHLHE","short_pith_number":"pith:SPPSVXB3","schema_version":"1.0","canonical_sha256":"93df2adc3bf6298daab4c5b55c04eb391f4a47510dc98a9e662ec59e70b3e554","source":{"kind":"arxiv","id":"1806.01664","version":2},"attestation_state":"computed","paper":{"title":"Hierarchical Graph Clustering using Node Pair Sampling","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.SI","authors_text":"Alexandre Hollocou, Alexis Galland, Bertrand Charpentier, Thomas Bonald","submitted_at":"2018-06-05T12:54:07Z","abstract_excerpt":"We present a novel hierarchical graph clustering algorithm inspired by modularity-based clustering techniques. The algorithm is agglomerative and based on a simple distance between clusters induced by the probability of sampling node pairs. We prove that this distance is reducible, which enables the use of the nearest-neighbor chain to speed up the agglomeration. The output of the algorithm is a regular dendrogram, which reveals the multi-scale structure of the graph. The results are illustrated on both synthetic and real datasets."},"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":"1806.01664","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2018-06-05T12:54:07Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"72d4d1311e202c7183b116ba54ad0d1edc16209f0399ecf8ea81cc0aeb6fa222","abstract_canon_sha256":"0a8399088347bd0305ea3a127cad632b863c58918c2e5e654f06e9e44a2f63be"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:12:37.792208Z","signature_b64":"2uoJBSoX0fTRB7Jyp6FfJ+Jj5NBZfg/XNckyGDp/o/jrhzFtfyGVXl8DEZTIdJjXArc36xWtXFeaQWvoLHCjAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"93df2adc3bf6298daab4c5b55c04eb391f4a47510dc98a9e662ec59e70b3e554","last_reissued_at":"2026-05-18T00:12:37.791382Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:12:37.791382Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Hierarchical Graph Clustering using Node Pair Sampling","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.SI","authors_text":"Alexandre Hollocou, Alexis Galland, Bertrand Charpentier, Thomas Bonald","submitted_at":"2018-06-05T12:54:07Z","abstract_excerpt":"We present a novel hierarchical graph clustering algorithm inspired by modularity-based clustering techniques. The algorithm is agglomerative and based on a simple distance between clusters induced by the probability of sampling node pairs. We prove that this distance is reducible, which enables the use of the nearest-neighbor chain to speed up the agglomeration. The output of the algorithm is a regular dendrogram, which reveals the multi-scale structure of the graph. The results are illustrated on both synthetic and real datasets."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.01664","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":"1806.01664","created_at":"2026-05-18T00:12:37.791524+00:00"},{"alias_kind":"arxiv_version","alias_value":"1806.01664v2","created_at":"2026-05-18T00:12:37.791524+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.01664","created_at":"2026-05-18T00:12:37.791524+00:00"},{"alias_kind":"pith_short_12","alias_value":"SPPSVXB36YUY","created_at":"2026-05-18T12:32:53.628368+00:00"},{"alias_kind":"pith_short_16","alias_value":"SPPSVXB36YUY3KVU","created_at":"2026-05-18T12:32:53.628368+00:00"},{"alias_kind":"pith_short_8","alias_value":"SPPSVXB3","created_at":"2026-05-18T12:32:53.628368+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/SPPSVXB36YUY3KVUYW2VYBHLHE","json":"https://pith.science/pith/SPPSVXB36YUY3KVUYW2VYBHLHE.json","graph_json":"https://pith.science/api/pith-number/SPPSVXB36YUY3KVUYW2VYBHLHE/graph.json","events_json":"https://pith.science/api/pith-number/SPPSVXB36YUY3KVUYW2VYBHLHE/events.json","paper":"https://pith.science/paper/SPPSVXB3"},"agent_actions":{"view_html":"https://pith.science/pith/SPPSVXB36YUY3KVUYW2VYBHLHE","download_json":"https://pith.science/pith/SPPSVXB36YUY3KVUYW2VYBHLHE.json","view_paper":"https://pith.science/paper/SPPSVXB3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1806.01664&json=true","fetch_graph":"https://pith.science/api/pith-number/SPPSVXB36YUY3KVUYW2VYBHLHE/graph.json","fetch_events":"https://pith.science/api/pith-number/SPPSVXB36YUY3KVUYW2VYBHLHE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SPPSVXB36YUY3KVUYW2VYBHLHE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SPPSVXB36YUY3KVUYW2VYBHLHE/action/storage_attestation","attest_author":"https://pith.science/pith/SPPSVXB36YUY3KVUYW2VYBHLHE/action/author_attestation","sign_citation":"https://pith.science/pith/SPPSVXB36YUY3KVUYW2VYBHLHE/action/citation_signature","submit_replication":"https://pith.science/pith/SPPSVXB36YUY3KVUYW2VYBHLHE/action/replication_record"}},"created_at":"2026-05-18T00:12:37.791524+00:00","updated_at":"2026-05-18T00:12:37.791524+00:00"}