{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:QROJZWJHCBCWLGLAVFUFGZWPAW","short_pith_number":"pith:QROJZWJH","schema_version":"1.0","canonical_sha256":"845c9cd9271045659960a9685366cf0591f520404169227ceb519422090c3c36","source":{"kind":"arxiv","id":"1611.01393","version":2},"attestation_state":"computed","paper":{"title":"Hierarchical Overlapping Clustering of Network Data Using Cut Metrics","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT","physics.soc-ph"],"primary_cat":"cs.SI","authors_text":"Alejandro Ribeiro, Fernando Gama, Santiago Segarra","submitted_at":"2016-11-04T14:23:00Z","abstract_excerpt":"A novel method to obtain hierarchical and overlapping clusters from network data -i.e., a set of nodes endowed with pairwise dissimilarities- is presented. The introduced method is hierarchical in the sense that it outputs a nested collection of groupings of the node set depending on the resolution or degree of similarity desired, and it is overlapping since it allows nodes to belong to more than one group. Our construction is rooted on the facts that a hierarchical (non-overlapping) clustering of a network can be equivalently represented by a finite ultrametric space and that a convex combina"},"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":"1611.01393","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2016-11-04T14:23:00Z","cross_cats_sorted":["cs.IT","math.IT","physics.soc-ph"],"title_canon_sha256":"2dbfcae28ac04d26641b44c4d5dad9990fb4243124f83b721161b54f0406ee3c","abstract_canon_sha256":"f1a4f4a1447d4cb7c6f8ea56244d76b5f47a521dae469df072b9c6f764deb339"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:28:16.426779Z","signature_b64":"d/Krs64fh5ONvutsuxo+DV5rPT9I3aUGAi/O7TuW1LKD3Y4EiAq+0I17UEXcBBe3aPgFklc196OZ0EE1n10IAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"845c9cd9271045659960a9685366cf0591f520404169227ceb519422090c3c36","last_reissued_at":"2026-05-18T00:28:16.426014Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:28:16.426014Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Hierarchical Overlapping Clustering of Network Data Using Cut Metrics","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT","physics.soc-ph"],"primary_cat":"cs.SI","authors_text":"Alejandro Ribeiro, Fernando Gama, Santiago Segarra","submitted_at":"2016-11-04T14:23:00Z","abstract_excerpt":"A novel method to obtain hierarchical and overlapping clusters from network data -i.e., a set of nodes endowed with pairwise dissimilarities- is presented. The introduced method is hierarchical in the sense that it outputs a nested collection of groupings of the node set depending on the resolution or degree of similarity desired, and it is overlapping since it allows nodes to belong to more than one group. Our construction is rooted on the facts that a hierarchical (non-overlapping) clustering of a network can be equivalently represented by a finite ultrametric space and that a convex combina"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.01393","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":"1611.01393","created_at":"2026-05-18T00:28:16.426117+00:00"},{"alias_kind":"arxiv_version","alias_value":"1611.01393v2","created_at":"2026-05-18T00:28:16.426117+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.01393","created_at":"2026-05-18T00:28:16.426117+00:00"},{"alias_kind":"pith_short_12","alias_value":"QROJZWJHCBCW","created_at":"2026-05-18T12:30:41.710351+00:00"},{"alias_kind":"pith_short_16","alias_value":"QROJZWJHCBCWLGLA","created_at":"2026-05-18T12:30:41.710351+00:00"},{"alias_kind":"pith_short_8","alias_value":"QROJZWJH","created_at":"2026-05-18T12:30:41.710351+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/QROJZWJHCBCWLGLAVFUFGZWPAW","json":"https://pith.science/pith/QROJZWJHCBCWLGLAVFUFGZWPAW.json","graph_json":"https://pith.science/api/pith-number/QROJZWJHCBCWLGLAVFUFGZWPAW/graph.json","events_json":"https://pith.science/api/pith-number/QROJZWJHCBCWLGLAVFUFGZWPAW/events.json","paper":"https://pith.science/paper/QROJZWJH"},"agent_actions":{"view_html":"https://pith.science/pith/QROJZWJHCBCWLGLAVFUFGZWPAW","download_json":"https://pith.science/pith/QROJZWJHCBCWLGLAVFUFGZWPAW.json","view_paper":"https://pith.science/paper/QROJZWJH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1611.01393&json=true","fetch_graph":"https://pith.science/api/pith-number/QROJZWJHCBCWLGLAVFUFGZWPAW/graph.json","fetch_events":"https://pith.science/api/pith-number/QROJZWJHCBCWLGLAVFUFGZWPAW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QROJZWJHCBCWLGLAVFUFGZWPAW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QROJZWJHCBCWLGLAVFUFGZWPAW/action/storage_attestation","attest_author":"https://pith.science/pith/QROJZWJHCBCWLGLAVFUFGZWPAW/action/author_attestation","sign_citation":"https://pith.science/pith/QROJZWJHCBCWLGLAVFUFGZWPAW/action/citation_signature","submit_replication":"https://pith.science/pith/QROJZWJHCBCWLGLAVFUFGZWPAW/action/replication_record"}},"created_at":"2026-05-18T00:28:16.426117+00:00","updated_at":"2026-05-18T00:28:16.426117+00:00"}