{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:ZMXPHHEV5Y3GQAE7S2EKBNFP54","short_pith_number":"pith:ZMXPHHEV","schema_version":"1.0","canonical_sha256":"cb2ef39c95ee3668009f9688a0b4afef300a9084b2831f9e733064b096a0d3e0","source":{"kind":"arxiv","id":"1208.5092","version":1},"attestation_state":"computed","paper":{"title":"Graph Degree Linkage: Agglomerative Clustering on a Directed Graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SI","stat.ML"],"primary_cat":"cs.CV","authors_text":"Deli Zhao, Wei Zhang, Xiaogang Wang, Xiaoou Tang","submitted_at":"2012-08-25T02:51:36Z","abstract_excerpt":"This paper proposes a simple but effective graph-based agglomerative algorithm, for clustering high-dimensional data. We explore the different roles of two fundamental concepts in graph theory, indegree and outdegree, in the context of clustering. The average indegree reflects the density near a sample, and the average outdegree characterizes the local geometry around a sample. Based on such insights, we define the affinity measure of clusters via the product of average indegree and average outdegree. The product-based affinity makes our algorithm robust to noise. The algorithm has three main "},"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":"1208.5092","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2012-08-25T02:51:36Z","cross_cats_sorted":["cs.SI","stat.ML"],"title_canon_sha256":"c80d4c6999f5b3de5a2ef4b82377fe06cc136c216c37f7aca5952f19d4a804e9","abstract_canon_sha256":"1fb2589b0f1955fd87d1afbe056e9ed0cb382b545241551968f8dc8dd139d0c1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:21:00.257524Z","signature_b64":"yPAb5V9WoLY3kA1pJfojG2dBs0dN1twzhdgBDYIQK8uvClgBq4u7V/sxLJFBoB0jT+/Nh5LYbu8fMwlXn/oDCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cb2ef39c95ee3668009f9688a0b4afef300a9084b2831f9e733064b096a0d3e0","last_reissued_at":"2026-05-18T02:21:00.256821Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:21:00.256821Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Graph Degree Linkage: Agglomerative Clustering on a Directed Graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SI","stat.ML"],"primary_cat":"cs.CV","authors_text":"Deli Zhao, Wei Zhang, Xiaogang Wang, Xiaoou Tang","submitted_at":"2012-08-25T02:51:36Z","abstract_excerpt":"This paper proposes a simple but effective graph-based agglomerative algorithm, for clustering high-dimensional data. We explore the different roles of two fundamental concepts in graph theory, indegree and outdegree, in the context of clustering. The average indegree reflects the density near a sample, and the average outdegree characterizes the local geometry around a sample. Based on such insights, we define the affinity measure of clusters via the product of average indegree and average outdegree. The product-based affinity makes our algorithm robust to noise. The algorithm has three main "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1208.5092","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":"1208.5092","created_at":"2026-05-18T02:21:00.256918+00:00"},{"alias_kind":"arxiv_version","alias_value":"1208.5092v1","created_at":"2026-05-18T02:21:00.256918+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1208.5092","created_at":"2026-05-18T02:21:00.256918+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZMXPHHEV5Y3G","created_at":"2026-05-18T12:27:30.460161+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZMXPHHEV5Y3GQAE7","created_at":"2026-05-18T12:27:30.460161+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZMXPHHEV","created_at":"2026-05-18T12:27:30.460161+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/ZMXPHHEV5Y3GQAE7S2EKBNFP54","json":"https://pith.science/pith/ZMXPHHEV5Y3GQAE7S2EKBNFP54.json","graph_json":"https://pith.science/api/pith-number/ZMXPHHEV5Y3GQAE7S2EKBNFP54/graph.json","events_json":"https://pith.science/api/pith-number/ZMXPHHEV5Y3GQAE7S2EKBNFP54/events.json","paper":"https://pith.science/paper/ZMXPHHEV"},"agent_actions":{"view_html":"https://pith.science/pith/ZMXPHHEV5Y3GQAE7S2EKBNFP54","download_json":"https://pith.science/pith/ZMXPHHEV5Y3GQAE7S2EKBNFP54.json","view_paper":"https://pith.science/paper/ZMXPHHEV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1208.5092&json=true","fetch_graph":"https://pith.science/api/pith-number/ZMXPHHEV5Y3GQAE7S2EKBNFP54/graph.json","fetch_events":"https://pith.science/api/pith-number/ZMXPHHEV5Y3GQAE7S2EKBNFP54/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZMXPHHEV5Y3GQAE7S2EKBNFP54/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZMXPHHEV5Y3GQAE7S2EKBNFP54/action/storage_attestation","attest_author":"https://pith.science/pith/ZMXPHHEV5Y3GQAE7S2EKBNFP54/action/author_attestation","sign_citation":"https://pith.science/pith/ZMXPHHEV5Y3GQAE7S2EKBNFP54/action/citation_signature","submit_replication":"https://pith.science/pith/ZMXPHHEV5Y3GQAE7S2EKBNFP54/action/replication_record"}},"created_at":"2026-05-18T02:21:00.256918+00:00","updated_at":"2026-05-18T02:21:00.256918+00:00"}