{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:SV546VWJQEXKAFKVVVP574IHR3","short_pith_number":"pith:SV546VWJ","canonical_record":{"source":{"id":"1112.1831","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2011-12-08T13:28:04Z","cross_cats_sorted":["cs.DS","physics.soc-ph"],"title_canon_sha256":"5adaaaf4c5251763c691a83003d4dd3e68d24a14970bf21ea23ef67c1cf65a32","abstract_canon_sha256":"8d9442c719a009e593b75250ba01844a1b4c10300586159309e9712a167c8e7a"},"schema_version":"1.0"},"canonical_sha256":"957bcf56c9812ea01555ad5fdff1078ed5104eaadf586da58546d31b658a7cac","source":{"kind":"arxiv","id":"1112.1831","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1112.1831","created_at":"2026-05-18T04:06:45Z"},{"alias_kind":"arxiv_version","alias_value":"1112.1831v1","created_at":"2026-05-18T04:06:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1112.1831","created_at":"2026-05-18T04:06:45Z"},{"alias_kind":"pith_short_12","alias_value":"SV546VWJQEXK","created_at":"2026-05-18T12:26:41Z"},{"alias_kind":"pith_short_16","alias_value":"SV546VWJQEXKAFKV","created_at":"2026-05-18T12:26:41Z"},{"alias_kind":"pith_short_8","alias_value":"SV546VWJ","created_at":"2026-05-18T12:26:41Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:SV546VWJQEXKAFKVVVP574IHR3","target":"record","payload":{"canonical_record":{"source":{"id":"1112.1831","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2011-12-08T13:28:04Z","cross_cats_sorted":["cs.DS","physics.soc-ph"],"title_canon_sha256":"5adaaaf4c5251763c691a83003d4dd3e68d24a14970bf21ea23ef67c1cf65a32","abstract_canon_sha256":"8d9442c719a009e593b75250ba01844a1b4c10300586159309e9712a167c8e7a"},"schema_version":"1.0"},"canonical_sha256":"957bcf56c9812ea01555ad5fdff1078ed5104eaadf586da58546d31b658a7cac","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:06:45.566599Z","signature_b64":"kDY34mPKyjwoBQ5oLGfJTu/z/WiC7uuVyzEq7dObU2uU55vPh4YMz4wBBGjvZD0Q4m5WQeYtUZTz+DGOFGumDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"957bcf56c9812ea01555ad5fdff1078ed5104eaadf586da58546d31b658a7cac","last_reissued_at":"2026-05-18T04:06:45.565694Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:06:45.565694Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1112.1831","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:06:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pCL64lrGS4aW4iVuQexw0CPtmRLU7XJrTebEUmIerqNoTLUhXkbceZIhewMTNwky4LW+uUDrtXP9gfwLRZo2AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T09:09:21.505199Z"},"content_sha256":"c7cf2d8af4cf19acd6840427bd828249c12125b3f577c925c1c9806aed9d9c51","schema_version":"1.0","event_id":"sha256:c7cf2d8af4cf19acd6840427bd828249c12125b3f577c925c1c9806aed9d9c51"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:SV546VWJQEXKAFKVVVP574IHR3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Finding Overlapping Communities in Social Networks: Toward a Rigorous Approach","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","physics.soc-ph"],"primary_cat":"cs.SI","authors_text":"Grant Schoenebeck, Rong Ge, Sanjeev Arora, Sushant Sachdeva","submitted_at":"2011-12-08T13:28:04Z","abstract_excerpt":"A \"community\" in a social network is usually understood to be a group of nodes more densely connected with each other than with the rest of the network. This is an important concept in most domains where networks arise: social, technological, biological, etc. For many years algorithms for finding communities implicitly assumed communities are nonoverlapping (leading to use of clustering-based approaches) but there is increasing interest in finding overlapping communities. A barrier to finding communities is that the solution concept is often defined in terms of an NP-complete problem such as C"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1112.1831","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:06:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rd1ISzB1xsbAhl32Jlgw4xtsHYKNJTY43Yxc/4zXdD4u5hu2D+Z3OtSaoJh6+NKQiatFgQ3E3TsE8ZdvtVi4CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T09:09:21.505856Z"},"content_sha256":"faf8308fb167fd574f193397b532ac60387fa0781453df934dd3fbbd6dde8074","schema_version":"1.0","event_id":"sha256:faf8308fb167fd574f193397b532ac60387fa0781453df934dd3fbbd6dde8074"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SV546VWJQEXKAFKVVVP574IHR3/bundle.json","state_url":"https://pith.science/pith/SV546VWJQEXKAFKVVVP574IHR3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SV546VWJQEXKAFKVVVP574IHR3/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-26T09:09:21Z","links":{"resolver":"https://pith.science/pith/SV546VWJQEXKAFKVVVP574IHR3","bundle":"https://pith.science/pith/SV546VWJQEXKAFKVVVP574IHR3/bundle.json","state":"https://pith.science/pith/SV546VWJQEXKAFKVVVP574IHR3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SV546VWJQEXKAFKVVVP574IHR3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:SV546VWJQEXKAFKVVVP574IHR3","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":"8d9442c719a009e593b75250ba01844a1b4c10300586159309e9712a167c8e7a","cross_cats_sorted":["cs.DS","physics.soc-ph"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2011-12-08T13:28:04Z","title_canon_sha256":"5adaaaf4c5251763c691a83003d4dd3e68d24a14970bf21ea23ef67c1cf65a32"},"schema_version":"1.0","source":{"id":"1112.1831","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1112.1831","created_at":"2026-05-18T04:06:45Z"},{"alias_kind":"arxiv_version","alias_value":"1112.1831v1","created_at":"2026-05-18T04:06:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1112.1831","created_at":"2026-05-18T04:06:45Z"},{"alias_kind":"pith_short_12","alias_value":"SV546VWJQEXK","created_at":"2026-05-18T12:26:41Z"},{"alias_kind":"pith_short_16","alias_value":"SV546VWJQEXKAFKV","created_at":"2026-05-18T12:26:41Z"},{"alias_kind":"pith_short_8","alias_value":"SV546VWJ","created_at":"2026-05-18T12:26:41Z"}],"graph_snapshots":[{"event_id":"sha256:faf8308fb167fd574f193397b532ac60387fa0781453df934dd3fbbd6dde8074","target":"graph","created_at":"2026-05-18T04:06:45Z","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":"A \"community\" in a social network is usually understood to be a group of nodes more densely connected with each other than with the rest of the network. This is an important concept in most domains where networks arise: social, technological, biological, etc. For many years algorithms for finding communities implicitly assumed communities are nonoverlapping (leading to use of clustering-based approaches) but there is increasing interest in finding overlapping communities. A barrier to finding communities is that the solution concept is often defined in terms of an NP-complete problem such as C","authors_text":"Grant Schoenebeck, Rong Ge, Sanjeev Arora, Sushant Sachdeva","cross_cats":["cs.DS","physics.soc-ph"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2011-12-08T13:28:04Z","title":"Finding Overlapping Communities in Social Networks: Toward a Rigorous Approach"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1112.1831","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:c7cf2d8af4cf19acd6840427bd828249c12125b3f577c925c1c9806aed9d9c51","target":"record","created_at":"2026-05-18T04:06:45Z","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":"8d9442c719a009e593b75250ba01844a1b4c10300586159309e9712a167c8e7a","cross_cats_sorted":["cs.DS","physics.soc-ph"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2011-12-08T13:28:04Z","title_canon_sha256":"5adaaaf4c5251763c691a83003d4dd3e68d24a14970bf21ea23ef67c1cf65a32"},"schema_version":"1.0","source":{"id":"1112.1831","kind":"arxiv","version":1}},"canonical_sha256":"957bcf56c9812ea01555ad5fdff1078ed5104eaadf586da58546d31b658a7cac","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"957bcf56c9812ea01555ad5fdff1078ed5104eaadf586da58546d31b658a7cac","first_computed_at":"2026-05-18T04:06:45.565694Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:06:45.565694Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"kDY34mPKyjwoBQ5oLGfJTu/z/WiC7uuVyzEq7dObU2uU55vPh4YMz4wBBGjvZD0Q4m5WQeYtUZTz+DGOFGumDA==","signature_status":"signed_v1","signed_at":"2026-05-18T04:06:45.566599Z","signed_message":"canonical_sha256_bytes"},"source_id":"1112.1831","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c7cf2d8af4cf19acd6840427bd828249c12125b3f577c925c1c9806aed9d9c51","sha256:faf8308fb167fd574f193397b532ac60387fa0781453df934dd3fbbd6dde8074"],"state_sha256":"3c44222ce1b946d9aac646b984e52af0dd33ccc496718f0da859914c621acf64"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kkCe9FORTopxgVRLPBb+PFmeh3RUJq8kv1GhaKrinknRj4fC589x6S6E2lwIDvGTrxmdpz8iPHMgnUTskY/pCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T09:09:21.509258Z","bundle_sha256":"fd884e4f28fc6c675d86725783f7dafad035b697fb745a98fda4d44354974995"}}