{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:IWZ7DPYWGTQ4KCH25FXWJWCCHH","short_pith_number":"pith:IWZ7DPYW","canonical_record":{"source":{"id":"1407.1352","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2014-07-05T01:58:13Z","cross_cats_sorted":[],"title_canon_sha256":"96d725c37aa9e6a04fd19a941f8b5e6356200459cbebaf2941dbc0ea174c64d0","abstract_canon_sha256":"08af42233c596355bbf1eab23539251343dd28d1cc2a02f77bcf37f4e6a9969d"},"schema_version":"1.0"},"canonical_sha256":"45b3f1bf1634e1c508fae96f64d84239e09fddfdcc0cb8c2f20335ed51302f94","source":{"kind":"arxiv","id":"1407.1352","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1407.1352","created_at":"2026-05-18T02:48:16Z"},{"alias_kind":"arxiv_version","alias_value":"1407.1352v1","created_at":"2026-05-18T02:48:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.1352","created_at":"2026-05-18T02:48:16Z"},{"alias_kind":"pith_short_12","alias_value":"IWZ7DPYWGTQ4","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_16","alias_value":"IWZ7DPYWGTQ4KCH2","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_8","alias_value":"IWZ7DPYW","created_at":"2026-05-18T12:28:33Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:IWZ7DPYWGTQ4KCH25FXWJWCCHH","target":"record","payload":{"canonical_record":{"source":{"id":"1407.1352","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2014-07-05T01:58:13Z","cross_cats_sorted":[],"title_canon_sha256":"96d725c37aa9e6a04fd19a941f8b5e6356200459cbebaf2941dbc0ea174c64d0","abstract_canon_sha256":"08af42233c596355bbf1eab23539251343dd28d1cc2a02f77bcf37f4e6a9969d"},"schema_version":"1.0"},"canonical_sha256":"45b3f1bf1634e1c508fae96f64d84239e09fddfdcc0cb8c2f20335ed51302f94","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:48:16.749406Z","signature_b64":"+CMxAovDVThw3FGTILocqDLTR/GjVCL/zHOZ/lVITZ+TeYsfeOdu3I0Pyxf/GfItWbwHRbjyyD4+6FyrToOgCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"45b3f1bf1634e1c508fae96f64d84239e09fddfdcc0cb8c2f20335ed51302f94","last_reissued_at":"2026-05-18T02:48:16.748936Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:48:16.748936Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1407.1352","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:48:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hq71lKGcfRwvVcFVSv3zbLtXUIzAzxGhQr5ljpx/IYUMY1Yis/mK9G/2P9GpKdV6SAowmHZyXeGCVtm9ND3ECQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T02:39:17.440984Z"},"content_sha256":"a306158ca56a21cd5cf410a7f8253adb25eaee6c2aa44ec785195d05cbf1cc26","schema_version":"1.0","event_id":"sha256:a306158ca56a21cd5cf410a7f8253adb25eaee6c2aa44ec785195d05cbf1cc26"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:IWZ7DPYWGTQ4KCH25FXWJWCCHH","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Homophilic Clustering by Locally Asymmetric Geometry","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Deli Zhao, Xiaoou Tang","submitted_at":"2014-07-05T01:58:13Z","abstract_excerpt":"Clustering is indispensable for data analysis in many scientific disciplines. Detecting clusters from heavy noise remains challenging, particularly for high-dimensional sparse data. Based on graph-theoretic framework, the present paper proposes a novel algorithm to address this issue. The locally asymmetric geometries of neighborhoods between data points result in a directed similarity graph to model the structural connectivity of data points. Performing similarity propagation on this directed graph simply by its adjacency matrix powers leads to an interesting discovery, in the sense that if t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1407.1352","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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:48:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cHw4SWItgKVYtPHAhKFe7YKPfx5Mn9M3XT3ah2mqpgiP5E+SRjbWGmbRoIoPvhvpEl0GTOTwSfRM0tjcn9lzBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T02:39:17.441344Z"},"content_sha256":"2c3e796d520f090bfc442cdbc33d5b560bf2f1679e11a57e81322a5641a56aeb","schema_version":"1.0","event_id":"sha256:2c3e796d520f090bfc442cdbc33d5b560bf2f1679e11a57e81322a5641a56aeb"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IWZ7DPYWGTQ4KCH25FXWJWCCHH/bundle.json","state_url":"https://pith.science/pith/IWZ7DPYWGTQ4KCH25FXWJWCCHH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IWZ7DPYWGTQ4KCH25FXWJWCCHH/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-31T02:39:17Z","links":{"resolver":"https://pith.science/pith/IWZ7DPYWGTQ4KCH25FXWJWCCHH","bundle":"https://pith.science/pith/IWZ7DPYWGTQ4KCH25FXWJWCCHH/bundle.json","state":"https://pith.science/pith/IWZ7DPYWGTQ4KCH25FXWJWCCHH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IWZ7DPYWGTQ4KCH25FXWJWCCHH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:IWZ7DPYWGTQ4KCH25FXWJWCCHH","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"08af42233c596355bbf1eab23539251343dd28d1cc2a02f77bcf37f4e6a9969d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2014-07-05T01:58:13Z","title_canon_sha256":"96d725c37aa9e6a04fd19a941f8b5e6356200459cbebaf2941dbc0ea174c64d0"},"schema_version":"1.0","source":{"id":"1407.1352","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1407.1352","created_at":"2026-05-18T02:48:16Z"},{"alias_kind":"arxiv_version","alias_value":"1407.1352v1","created_at":"2026-05-18T02:48:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.1352","created_at":"2026-05-18T02:48:16Z"},{"alias_kind":"pith_short_12","alias_value":"IWZ7DPYWGTQ4","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_16","alias_value":"IWZ7DPYWGTQ4KCH2","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_8","alias_value":"IWZ7DPYW","created_at":"2026-05-18T12:28:33Z"}],"graph_snapshots":[{"event_id":"sha256:2c3e796d520f090bfc442cdbc33d5b560bf2f1679e11a57e81322a5641a56aeb","target":"graph","created_at":"2026-05-18T02:48:16Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"Clustering is indispensable for data analysis in many scientific disciplines. Detecting clusters from heavy noise remains challenging, particularly for high-dimensional sparse data. Based on graph-theoretic framework, the present paper proposes a novel algorithm to address this issue. The locally asymmetric geometries of neighborhoods between data points result in a directed similarity graph to model the structural connectivity of data points. Performing similarity propagation on this directed graph simply by its adjacency matrix powers leads to an interesting discovery, in the sense that if t","authors_text":"Deli Zhao, Xiaoou Tang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2014-07-05T01:58:13Z","title":"Homophilic Clustering by Locally Asymmetric Geometry"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1407.1352","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:a306158ca56a21cd5cf410a7f8253adb25eaee6c2aa44ec785195d05cbf1cc26","target":"record","created_at":"2026-05-18T02:48:16Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"08af42233c596355bbf1eab23539251343dd28d1cc2a02f77bcf37f4e6a9969d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2014-07-05T01:58:13Z","title_canon_sha256":"96d725c37aa9e6a04fd19a941f8b5e6356200459cbebaf2941dbc0ea174c64d0"},"schema_version":"1.0","source":{"id":"1407.1352","kind":"arxiv","version":1}},"canonical_sha256":"45b3f1bf1634e1c508fae96f64d84239e09fddfdcc0cb8c2f20335ed51302f94","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"45b3f1bf1634e1c508fae96f64d84239e09fddfdcc0cb8c2f20335ed51302f94","first_computed_at":"2026-05-18T02:48:16.748936Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:48:16.748936Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"+CMxAovDVThw3FGTILocqDLTR/GjVCL/zHOZ/lVITZ+TeYsfeOdu3I0Pyxf/GfItWbwHRbjyyD4+6FyrToOgCw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:48:16.749406Z","signed_message":"canonical_sha256_bytes"},"source_id":"1407.1352","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a306158ca56a21cd5cf410a7f8253adb25eaee6c2aa44ec785195d05cbf1cc26","sha256:2c3e796d520f090bfc442cdbc33d5b560bf2f1679e11a57e81322a5641a56aeb"],"state_sha256":"e364916a2395e3111b9b8188d42c3ae8143e2823041090d55863b1bb6ee1e64c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JKH3SntZhYg53ZjVoEcO56MGn9W092BifvEhf2jK1MKdil97Ry/9Y/QiKIBPCuA0LPu78LNmokFzh/CavkutDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T02:39:17.443248Z","bundle_sha256":"2a06e670e977fb2b8cb21af9963c262a8d67ad3178d8df84082dc614482a12b9"}}