{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:4RVKFYDIJN6MRKUJEBOISVPKZP","short_pith_number":"pith:4RVKFYDI","canonical_record":{"source":{"id":"1412.4973","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2014-12-16T12:18:52Z","cross_cats_sorted":["physics.soc-ph"],"title_canon_sha256":"2eabff2565ddc44ad66d31d6cf55b33097c3ae4342d947bd65a929d1bb3da42b","abstract_canon_sha256":"de246d6a3097918ad4b6a749e6bed10430e8137c48cc22057465b2d45325bd9e"},"schema_version":"1.0"},"canonical_sha256":"e46aa2e0684b7cc8aa89205c8955eacbee573158b97a9aad0366af7c3d6543e9","source":{"kind":"arxiv","id":"1412.4973","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1412.4973","created_at":"2026-05-18T02:31:01Z"},{"alias_kind":"arxiv_version","alias_value":"1412.4973v2","created_at":"2026-05-18T02:31:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.4973","created_at":"2026-05-18T02:31:01Z"},{"alias_kind":"pith_short_12","alias_value":"4RVKFYDIJN6M","created_at":"2026-05-18T12:28:14Z"},{"alias_kind":"pith_short_16","alias_value":"4RVKFYDIJN6MRKUJ","created_at":"2026-05-18T12:28:14Z"},{"alias_kind":"pith_short_8","alias_value":"4RVKFYDI","created_at":"2026-05-18T12:28:14Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:4RVKFYDIJN6MRKUJEBOISVPKZP","target":"record","payload":{"canonical_record":{"source":{"id":"1412.4973","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2014-12-16T12:18:52Z","cross_cats_sorted":["physics.soc-ph"],"title_canon_sha256":"2eabff2565ddc44ad66d31d6cf55b33097c3ae4342d947bd65a929d1bb3da42b","abstract_canon_sha256":"de246d6a3097918ad4b6a749e6bed10430e8137c48cc22057465b2d45325bd9e"},"schema_version":"1.0"},"canonical_sha256":"e46aa2e0684b7cc8aa89205c8955eacbee573158b97a9aad0366af7c3d6543e9","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:31:01.900182Z","signature_b64":"vyWE3NNDYJdLVDfZRi1XAoz8y/fk/CALrX1Z3X7IDvXX/mzaj78ShluwnkkSCeLIcINSgn2SSn+Xyaj8KiWVDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e46aa2e0684b7cc8aa89205c8955eacbee573158b97a9aad0366af7c3d6543e9","last_reissued_at":"2026-05-18T02:31:01.899643Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:31:01.899643Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1412.4973","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-18T02:31:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QKM3s2OeEB4Dkv+nsBkQUcG0VlyO+H2zhiu+B2I0YPslGq9qG8ePHhhUExH6UALvq7GUayugd3xCBpvtHnhfDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T00:23:05.119229Z"},"content_sha256":"02af62ac02e92cea3abae367bb600a37df4ee7f197f22710081d8dc9e0a77875","schema_version":"1.0","event_id":"sha256:02af62ac02e92cea3abae367bb600a37df4ee7f197f22710081d8dc9e0a77875"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:4RVKFYDIJN6MRKUJEBOISVPKZP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Overlapping Communities in Social Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["physics.soc-ph"],"primary_cat":"cs.SI","authors_text":"Felix Reidl, Jan Dreier, Peter Rossmanith, Philipp Kuinke, Rafael Przybylski, Somnath Sikdar","submitted_at":"2014-12-16T12:18:52Z","abstract_excerpt":"Complex networks can be typically broken down into groups or modules. Discovering this \"community structure\" is an important step in studying the large-scale structure of networks. Many algorithms have been proposed for community detection and benchmarks have been created to evaluate their performance. Typically algorithms for community detection either partition the graph (non-overlapping communities) or find node covers (overlapping communities).\n  In this paper, we propose a particularly simple semi-supervised learning algorithm for finding out communities. In essence, given the community i"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.4973","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-18T02:31:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uFz+s8XjxVpDzkzfd40ASMmD3ET+e1DjSapj6HJDXegCHmGP7yr2YvMaKXRYRyBBkYUNmnb9O1veNGNVWqoJDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T00:23:05.119591Z"},"content_sha256":"6ad6cc5e54d3ac6c6035ad9e13116547cfdaed736007309d2bad7257232daf97","schema_version":"1.0","event_id":"sha256:6ad6cc5e54d3ac6c6035ad9e13116547cfdaed736007309d2bad7257232daf97"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4RVKFYDIJN6MRKUJEBOISVPKZP/bundle.json","state_url":"https://pith.science/pith/4RVKFYDIJN6MRKUJEBOISVPKZP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4RVKFYDIJN6MRKUJEBOISVPKZP/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-09T00:23:05Z","links":{"resolver":"https://pith.science/pith/4RVKFYDIJN6MRKUJEBOISVPKZP","bundle":"https://pith.science/pith/4RVKFYDIJN6MRKUJEBOISVPKZP/bundle.json","state":"https://pith.science/pith/4RVKFYDIJN6MRKUJEBOISVPKZP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4RVKFYDIJN6MRKUJEBOISVPKZP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:4RVKFYDIJN6MRKUJEBOISVPKZP","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":"de246d6a3097918ad4b6a749e6bed10430e8137c48cc22057465b2d45325bd9e","cross_cats_sorted":["physics.soc-ph"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2014-12-16T12:18:52Z","title_canon_sha256":"2eabff2565ddc44ad66d31d6cf55b33097c3ae4342d947bd65a929d1bb3da42b"},"schema_version":"1.0","source":{"id":"1412.4973","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1412.4973","created_at":"2026-05-18T02:31:01Z"},{"alias_kind":"arxiv_version","alias_value":"1412.4973v2","created_at":"2026-05-18T02:31:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.4973","created_at":"2026-05-18T02:31:01Z"},{"alias_kind":"pith_short_12","alias_value":"4RVKFYDIJN6M","created_at":"2026-05-18T12:28:14Z"},{"alias_kind":"pith_short_16","alias_value":"4RVKFYDIJN6MRKUJ","created_at":"2026-05-18T12:28:14Z"},{"alias_kind":"pith_short_8","alias_value":"4RVKFYDI","created_at":"2026-05-18T12:28:14Z"}],"graph_snapshots":[{"event_id":"sha256:6ad6cc5e54d3ac6c6035ad9e13116547cfdaed736007309d2bad7257232daf97","target":"graph","created_at":"2026-05-18T02:31:01Z","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":"Complex networks can be typically broken down into groups or modules. Discovering this \"community structure\" is an important step in studying the large-scale structure of networks. Many algorithms have been proposed for community detection and benchmarks have been created to evaluate their performance. Typically algorithms for community detection either partition the graph (non-overlapping communities) or find node covers (overlapping communities).\n  In this paper, we propose a particularly simple semi-supervised learning algorithm for finding out communities. In essence, given the community i","authors_text":"Felix Reidl, Jan Dreier, Peter Rossmanith, Philipp Kuinke, Rafael Przybylski, Somnath Sikdar","cross_cats":["physics.soc-ph"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2014-12-16T12:18:52Z","title":"Overlapping Communities in Social Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.4973","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:02af62ac02e92cea3abae367bb600a37df4ee7f197f22710081d8dc9e0a77875","target":"record","created_at":"2026-05-18T02:31:01Z","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":"de246d6a3097918ad4b6a749e6bed10430e8137c48cc22057465b2d45325bd9e","cross_cats_sorted":["physics.soc-ph"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2014-12-16T12:18:52Z","title_canon_sha256":"2eabff2565ddc44ad66d31d6cf55b33097c3ae4342d947bd65a929d1bb3da42b"},"schema_version":"1.0","source":{"id":"1412.4973","kind":"arxiv","version":2}},"canonical_sha256":"e46aa2e0684b7cc8aa89205c8955eacbee573158b97a9aad0366af7c3d6543e9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e46aa2e0684b7cc8aa89205c8955eacbee573158b97a9aad0366af7c3d6543e9","first_computed_at":"2026-05-18T02:31:01.899643Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:31:01.899643Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"vyWE3NNDYJdLVDfZRi1XAoz8y/fk/CALrX1Z3X7IDvXX/mzaj78ShluwnkkSCeLIcINSgn2SSn+Xyaj8KiWVDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:31:01.900182Z","signed_message":"canonical_sha256_bytes"},"source_id":"1412.4973","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:02af62ac02e92cea3abae367bb600a37df4ee7f197f22710081d8dc9e0a77875","sha256:6ad6cc5e54d3ac6c6035ad9e13116547cfdaed736007309d2bad7257232daf97"],"state_sha256":"72133f233be857c2850d053b246913b8dd079eccfb8cd3e589bb5b91fe0fce9d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NWq0C5r+Wgln5YjXtErc41X9SFqrlmWiTJP+gJjTqt5P+VikqGI50M+6JJ0LkbnuD8dUHzZaZfKobei4Tt/VCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T00:23:05.121492Z","bundle_sha256":"d30043a35c858799167ad5cc8f5463e486bb0a75035bd725d0be557cf72f2a14"}}