{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:BS2GNWL2FN3SUWKNVWTGUE7YBQ","short_pith_number":"pith:BS2GNWL2","canonical_record":{"source":{"id":"1101.5141","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"physics.data-an","submitted_at":"2011-01-26T19:58:58Z","cross_cats_sorted":["cs.LG","cs.SI","physics.soc-ph"],"title_canon_sha256":"dff87d42100d8776ea6ec6f0dcedf7f0ad31ab96b56156f69692d9b6f2419ea4","abstract_canon_sha256":"976ad3ebfa7c2cfb5a6c801799eef420e649e88b85e397442ac5eaa0ed4d2cb4"},"schema_version":"1.0"},"canonical_sha256":"0cb466d97a2b772a594dada66a13f80c2b4d6eada2e9bfed3301dcbb239b104b","source":{"kind":"arxiv","id":"1101.5141","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1101.5141","created_at":"2026-05-18T04:30:46Z"},{"alias_kind":"arxiv_version","alias_value":"1101.5141v1","created_at":"2026-05-18T04:30:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1101.5141","created_at":"2026-05-18T04:30:46Z"},{"alias_kind":"pith_short_12","alias_value":"BS2GNWL2FN3S","created_at":"2026-05-18T12:26:24Z"},{"alias_kind":"pith_short_16","alias_value":"BS2GNWL2FN3SUWKN","created_at":"2026-05-18T12:26:24Z"},{"alias_kind":"pith_short_8","alias_value":"BS2GNWL2","created_at":"2026-05-18T12:26:24Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:BS2GNWL2FN3SUWKNVWTGUE7YBQ","target":"record","payload":{"canonical_record":{"source":{"id":"1101.5141","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"physics.data-an","submitted_at":"2011-01-26T19:58:58Z","cross_cats_sorted":["cs.LG","cs.SI","physics.soc-ph"],"title_canon_sha256":"dff87d42100d8776ea6ec6f0dcedf7f0ad31ab96b56156f69692d9b6f2419ea4","abstract_canon_sha256":"976ad3ebfa7c2cfb5a6c801799eef420e649e88b85e397442ac5eaa0ed4d2cb4"},"schema_version":"1.0"},"canonical_sha256":"0cb466d97a2b772a594dada66a13f80c2b4d6eada2e9bfed3301dcbb239b104b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:30:46.728454Z","signature_b64":"ifQFjvnB7uS6utpK0pJxyrRw8nQsKAj29mGabMUxT75zmwD6/Mwm/NGIoPiwjbfAxV2xJQKFZ29BvwUPqtdxCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0cb466d97a2b772a594dada66a13f80c2b4d6eada2e9bfed3301dcbb239b104b","last_reissued_at":"2026-05-18T04:30:46.727972Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:30:46.727972Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1101.5141","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-18T04:30:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wvCSJGBM02kWrmHYbTTGP3UG10Qjf4PT8UnhdzcZLeCsAi7mKzUMiJ89NMTXBdbgTdfUFLOYEYPZ9UrtzEhtAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T19:57:51.538733Z"},"content_sha256":"7deab14416bf27b0ce5bfac89bbccec4360c38c52a1f23625a72142a803e61a1","schema_version":"1.0","event_id":"sha256:7deab14416bf27b0ce5bfac89bbccec4360c38c52a1f23625a72142a803e61a1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:BS2GNWL2FN3SUWKNVWTGUE7YBQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Complex Networks Approach for Data Clustering","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","cs.SI","physics.soc-ph"],"primary_cat":"physics.data-an","authors_text":"Francisco A. Rodrigues, Guilherme Ferraz de Arruda, Luciano da Fontoura Costa","submitted_at":"2011-01-26T19:58:58Z","abstract_excerpt":"Many methods have been developed for data clustering, such as k-means, expectation maximization and algorithms based on graph theory. In this latter case, graphs are generally constructed by taking into account the Euclidian distance as a similarity measure, and partitioned using spectral methods. However, these methods are not accurate when the clusters are not well separated. In addition, it is not possible to automatically determine the number of clusters. These limitations can be overcome by taking into account network community identification algorithms. In this work, we propose a methodo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1101.5141","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-18T04:30:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Rkh/tBiPiiyZDZ7OBjRYNK7g7ZGGXZjeOBsuZiDvHRMPMImaNG7RlIGQMrYuhfVqoCNKlq8V2LhSbRm/GgEoCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T19:57:51.539077Z"},"content_sha256":"4df4f0feadb312834d6063874594b12ec4dbbf566c8beeeb50a94e858c705c14","schema_version":"1.0","event_id":"sha256:4df4f0feadb312834d6063874594b12ec4dbbf566c8beeeb50a94e858c705c14"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BS2GNWL2FN3SUWKNVWTGUE7YBQ/bundle.json","state_url":"https://pith.science/pith/BS2GNWL2FN3SUWKNVWTGUE7YBQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BS2GNWL2FN3SUWKNVWTGUE7YBQ/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-06-20T19:57:51Z","links":{"resolver":"https://pith.science/pith/BS2GNWL2FN3SUWKNVWTGUE7YBQ","bundle":"https://pith.science/pith/BS2GNWL2FN3SUWKNVWTGUE7YBQ/bundle.json","state":"https://pith.science/pith/BS2GNWL2FN3SUWKNVWTGUE7YBQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BS2GNWL2FN3SUWKNVWTGUE7YBQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:BS2GNWL2FN3SUWKNVWTGUE7YBQ","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":"976ad3ebfa7c2cfb5a6c801799eef420e649e88b85e397442ac5eaa0ed4d2cb4","cross_cats_sorted":["cs.LG","cs.SI","physics.soc-ph"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"physics.data-an","submitted_at":"2011-01-26T19:58:58Z","title_canon_sha256":"dff87d42100d8776ea6ec6f0dcedf7f0ad31ab96b56156f69692d9b6f2419ea4"},"schema_version":"1.0","source":{"id":"1101.5141","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1101.5141","created_at":"2026-05-18T04:30:46Z"},{"alias_kind":"arxiv_version","alias_value":"1101.5141v1","created_at":"2026-05-18T04:30:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1101.5141","created_at":"2026-05-18T04:30:46Z"},{"alias_kind":"pith_short_12","alias_value":"BS2GNWL2FN3S","created_at":"2026-05-18T12:26:24Z"},{"alias_kind":"pith_short_16","alias_value":"BS2GNWL2FN3SUWKN","created_at":"2026-05-18T12:26:24Z"},{"alias_kind":"pith_short_8","alias_value":"BS2GNWL2","created_at":"2026-05-18T12:26:24Z"}],"graph_snapshots":[{"event_id":"sha256:4df4f0feadb312834d6063874594b12ec4dbbf566c8beeeb50a94e858c705c14","target":"graph","created_at":"2026-05-18T04:30:46Z","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":"Many methods have been developed for data clustering, such as k-means, expectation maximization and algorithms based on graph theory. In this latter case, graphs are generally constructed by taking into account the Euclidian distance as a similarity measure, and partitioned using spectral methods. However, these methods are not accurate when the clusters are not well separated. In addition, it is not possible to automatically determine the number of clusters. These limitations can be overcome by taking into account network community identification algorithms. In this work, we propose a methodo","authors_text":"Francisco A. Rodrigues, Guilherme Ferraz de Arruda, Luciano da Fontoura Costa","cross_cats":["cs.LG","cs.SI","physics.soc-ph"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"physics.data-an","submitted_at":"2011-01-26T19:58:58Z","title":"A Complex Networks Approach for Data Clustering"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1101.5141","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:7deab14416bf27b0ce5bfac89bbccec4360c38c52a1f23625a72142a803e61a1","target":"record","created_at":"2026-05-18T04:30:46Z","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":"976ad3ebfa7c2cfb5a6c801799eef420e649e88b85e397442ac5eaa0ed4d2cb4","cross_cats_sorted":["cs.LG","cs.SI","physics.soc-ph"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"physics.data-an","submitted_at":"2011-01-26T19:58:58Z","title_canon_sha256":"dff87d42100d8776ea6ec6f0dcedf7f0ad31ab96b56156f69692d9b6f2419ea4"},"schema_version":"1.0","source":{"id":"1101.5141","kind":"arxiv","version":1}},"canonical_sha256":"0cb466d97a2b772a594dada66a13f80c2b4d6eada2e9bfed3301dcbb239b104b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0cb466d97a2b772a594dada66a13f80c2b4d6eada2e9bfed3301dcbb239b104b","first_computed_at":"2026-05-18T04:30:46.727972Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:30:46.727972Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ifQFjvnB7uS6utpK0pJxyrRw8nQsKAj29mGabMUxT75zmwD6/Mwm/NGIoPiwjbfAxV2xJQKFZ29BvwUPqtdxCw==","signature_status":"signed_v1","signed_at":"2026-05-18T04:30:46.728454Z","signed_message":"canonical_sha256_bytes"},"source_id":"1101.5141","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7deab14416bf27b0ce5bfac89bbccec4360c38c52a1f23625a72142a803e61a1","sha256:4df4f0feadb312834d6063874594b12ec4dbbf566c8beeeb50a94e858c705c14"],"state_sha256":"3113cdd45ce4d4c506fa3f885e232b6e1c6bb33f4ed623f9d4f5efb93f140377"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lofCtmnPTCrdXPhucx5BfFbUvyKOeYF0dnlL0d6RgDdYIjBU/mM5AapUnmW8xOc4AW1xB5iu9e/yunpGvND8Dg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-20T19:57:51.541058Z","bundle_sha256":"a6af259613a784b61f8a6ab7748e506740b5c05f8035d9c74287bfb241912268"}}