{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:6YWK5HWZPGKYTIGYLUSVLGLIGC","short_pith_number":"pith:6YWK5HWZ","canonical_record":{"source":{"id":"1203.4685","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2012-03-21T09:27:24Z","cross_cats_sorted":["physics.soc-ph"],"title_canon_sha256":"df5e68dd6567edd739fbc95fd2ad5e9548d7296d83c476d2db9ca36d69407dd2","abstract_canon_sha256":"2a3841a2e71e286d7dd06ad47a9c5f20570eceaa479276a3380820d3d6dfde65"},"schema_version":"1.0"},"canonical_sha256":"f62cae9ed9799589a0d85d25559968309cf1c8be10d9b49f2ce296092936c9c6","source":{"kind":"arxiv","id":"1203.4685","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1203.4685","created_at":"2026-05-18T03:59:15Z"},{"alias_kind":"arxiv_version","alias_value":"1203.4685v2","created_at":"2026-05-18T03:59:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1203.4685","created_at":"2026-05-18T03:59:15Z"},{"alias_kind":"pith_short_12","alias_value":"6YWK5HWZPGKY","created_at":"2026-05-18T12:26:56Z"},{"alias_kind":"pith_short_16","alias_value":"6YWK5HWZPGKYTIGY","created_at":"2026-05-18T12:26:56Z"},{"alias_kind":"pith_short_8","alias_value":"6YWK5HWZ","created_at":"2026-05-18T12:26:56Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:6YWK5HWZPGKYTIGYLUSVLGLIGC","target":"record","payload":{"canonical_record":{"source":{"id":"1203.4685","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2012-03-21T09:27:24Z","cross_cats_sorted":["physics.soc-ph"],"title_canon_sha256":"df5e68dd6567edd739fbc95fd2ad5e9548d7296d83c476d2db9ca36d69407dd2","abstract_canon_sha256":"2a3841a2e71e286d7dd06ad47a9c5f20570eceaa479276a3380820d3d6dfde65"},"schema_version":"1.0"},"canonical_sha256":"f62cae9ed9799589a0d85d25559968309cf1c8be10d9b49f2ce296092936c9c6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:59:15.328777Z","signature_b64":"APSNdOVsOzuWpo2YqiUsaMq7JPDoErFr1YsNRfgf15cAyxrjdegKHSeHI0HSxoW23VTZO2+Khg3UGl8KFlp7Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f62cae9ed9799589a0d85d25559968309cf1c8be10d9b49f2ce296092936c9c6","last_reissued_at":"2026-05-18T03:59:15.328218Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:59:15.328218Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1203.4685","source_version":2,"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-18T03:59:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5TVznT52QGqd4xZRmMOTFwzBv15Qj8e8rn8f6Kd4Er7gvYdWej5Ms22IAvZpgKCXSMNlxrCivhn6TtHXxkosAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T19:25:16.849679Z"},"content_sha256":"013deb8611af76a24ead050387f1d368fa36be7bc4b7262ef1b7a90fa6bea659","schema_version":"1.0","event_id":"sha256:013deb8611af76a24ead050387f1d368fa36be7bc4b7262ef1b7a90fa6bea659"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:6YWK5HWZPGKYTIGYLUSVLGLIGC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Local Approach for Identifying Clusters in Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["physics.soc-ph"],"primary_cat":"cs.SI","authors_text":"Sumit Singh","submitted_at":"2012-03-21T09:27:24Z","abstract_excerpt":"Graph clustering is a fundamental problem that has been extensively studied both in theory and practice. The problem has been defined in several ways in literature and most of them have been proven to be NP-Hard. Due to their high practical relevancy, several heuristics for graph clustering have been introduced which constitute a central tool for coping with NP-completeness, and are used in applications of clustering ranging from computer vision, to data analysis, to learning. There exist many methodologies for this problem, however most of them are global in nature and are unlikely to scale w"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1203.4685","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"},"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-18T03:59:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5djhME8FA6JIC0w5m+STa46ynKVKb4Wk83dlUELfb7tv4/ADa7Z7FG5jbd1rEItORRpgCsQVzxqjoNTmXPNeDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T19:25:16.850011Z"},"content_sha256":"0a90b775a9d1b7f6e2bcd0f950e97414247a1fadfa54bfec10628b40d44d538a","schema_version":"1.0","event_id":"sha256:0a90b775a9d1b7f6e2bcd0f950e97414247a1fadfa54bfec10628b40d44d538a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6YWK5HWZPGKYTIGYLUSVLGLIGC/bundle.json","state_url":"https://pith.science/pith/6YWK5HWZPGKYTIGYLUSVLGLIGC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6YWK5HWZPGKYTIGYLUSVLGLIGC/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-26T19:25:16Z","links":{"resolver":"https://pith.science/pith/6YWK5HWZPGKYTIGYLUSVLGLIGC","bundle":"https://pith.science/pith/6YWK5HWZPGKYTIGYLUSVLGLIGC/bundle.json","state":"https://pith.science/pith/6YWK5HWZPGKYTIGYLUSVLGLIGC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6YWK5HWZPGKYTIGYLUSVLGLIGC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:6YWK5HWZPGKYTIGYLUSVLGLIGC","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":"2a3841a2e71e286d7dd06ad47a9c5f20570eceaa479276a3380820d3d6dfde65","cross_cats_sorted":["physics.soc-ph"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2012-03-21T09:27:24Z","title_canon_sha256":"df5e68dd6567edd739fbc95fd2ad5e9548d7296d83c476d2db9ca36d69407dd2"},"schema_version":"1.0","source":{"id":"1203.4685","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1203.4685","created_at":"2026-05-18T03:59:15Z"},{"alias_kind":"arxiv_version","alias_value":"1203.4685v2","created_at":"2026-05-18T03:59:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1203.4685","created_at":"2026-05-18T03:59:15Z"},{"alias_kind":"pith_short_12","alias_value":"6YWK5HWZPGKY","created_at":"2026-05-18T12:26:56Z"},{"alias_kind":"pith_short_16","alias_value":"6YWK5HWZPGKYTIGY","created_at":"2026-05-18T12:26:56Z"},{"alias_kind":"pith_short_8","alias_value":"6YWK5HWZ","created_at":"2026-05-18T12:26:56Z"}],"graph_snapshots":[{"event_id":"sha256:0a90b775a9d1b7f6e2bcd0f950e97414247a1fadfa54bfec10628b40d44d538a","target":"graph","created_at":"2026-05-18T03:59:15Z","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":"Graph clustering is a fundamental problem that has been extensively studied both in theory and practice. The problem has been defined in several ways in literature and most of them have been proven to be NP-Hard. Due to their high practical relevancy, several heuristics for graph clustering have been introduced which constitute a central tool for coping with NP-completeness, and are used in applications of clustering ranging from computer vision, to data analysis, to learning. There exist many methodologies for this problem, however most of them are global in nature and are unlikely to scale w","authors_text":"Sumit Singh","cross_cats":["physics.soc-ph"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2012-03-21T09:27:24Z","title":"A Local Approach for Identifying Clusters in Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1203.4685","kind":"arxiv","version":2},"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:013deb8611af76a24ead050387f1d368fa36be7bc4b7262ef1b7a90fa6bea659","target":"record","created_at":"2026-05-18T03:59:15Z","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":"2a3841a2e71e286d7dd06ad47a9c5f20570eceaa479276a3380820d3d6dfde65","cross_cats_sorted":["physics.soc-ph"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2012-03-21T09:27:24Z","title_canon_sha256":"df5e68dd6567edd739fbc95fd2ad5e9548d7296d83c476d2db9ca36d69407dd2"},"schema_version":"1.0","source":{"id":"1203.4685","kind":"arxiv","version":2}},"canonical_sha256":"f62cae9ed9799589a0d85d25559968309cf1c8be10d9b49f2ce296092936c9c6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f62cae9ed9799589a0d85d25559968309cf1c8be10d9b49f2ce296092936c9c6","first_computed_at":"2026-05-18T03:59:15.328218Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:59:15.328218Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"APSNdOVsOzuWpo2YqiUsaMq7JPDoErFr1YsNRfgf15cAyxrjdegKHSeHI0HSxoW23VTZO2+Khg3UGl8KFlp7Bw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:59:15.328777Z","signed_message":"canonical_sha256_bytes"},"source_id":"1203.4685","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:013deb8611af76a24ead050387f1d368fa36be7bc4b7262ef1b7a90fa6bea659","sha256:0a90b775a9d1b7f6e2bcd0f950e97414247a1fadfa54bfec10628b40d44d538a"],"state_sha256":"56036ef4fde04ac002bb4d4983ac5e647f284408decddb1f69be9f13917d4968"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bavVHkMHxqL0SWghjBmdI9yTfP1XtlCvOcZOo/wxcqqHKQ/JOwd9YwAvA1nwF8s6hwnd2l1z4pWUtc7KLqY1Cw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-26T19:25:16.851942Z","bundle_sha256":"29bf67ce26cf8803894146c105d72c9ee193b018a1e1f19fad4e6312b1ffdc01"}}