{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:PS6PWPZMAPL445GFKQRBYL2O52","short_pith_number":"pith:PS6PWPZM","canonical_record":{"source":{"id":"1601.06527","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2016-01-25T09:41:43Z","cross_cats_sorted":["physics.soc-ph"],"title_canon_sha256":"200521288d5f5f6b6971b5838b067c6220a72c06f85f83277e388bbac8da2c46","abstract_canon_sha256":"5a769799943965f45e5261d91aa4857f6831ab3bf9ec56a7d6bf864e79482293"},"schema_version":"1.0"},"canonical_sha256":"7cbcfb3f2c03d7ce74c554221c2f4eeea16357e99b825b419e19c6b8522eb2cb","source":{"kind":"arxiv","id":"1601.06527","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1601.06527","created_at":"2026-05-18T01:22:04Z"},{"alias_kind":"arxiv_version","alias_value":"1601.06527v1","created_at":"2026-05-18T01:22:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.06527","created_at":"2026-05-18T01:22:04Z"},{"alias_kind":"pith_short_12","alias_value":"PS6PWPZMAPL4","created_at":"2026-05-18T12:30:39Z"},{"alias_kind":"pith_short_16","alias_value":"PS6PWPZMAPL445GF","created_at":"2026-05-18T12:30:39Z"},{"alias_kind":"pith_short_8","alias_value":"PS6PWPZM","created_at":"2026-05-18T12:30:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:PS6PWPZMAPL445GFKQRBYL2O52","target":"record","payload":{"canonical_record":{"source":{"id":"1601.06527","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2016-01-25T09:41:43Z","cross_cats_sorted":["physics.soc-ph"],"title_canon_sha256":"200521288d5f5f6b6971b5838b067c6220a72c06f85f83277e388bbac8da2c46","abstract_canon_sha256":"5a769799943965f45e5261d91aa4857f6831ab3bf9ec56a7d6bf864e79482293"},"schema_version":"1.0"},"canonical_sha256":"7cbcfb3f2c03d7ce74c554221c2f4eeea16357e99b825b419e19c6b8522eb2cb","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:22:04.246689Z","signature_b64":"iQ5JP06/QVS2gT4b69vIC4hAsLTXRRq14QRMHpSTD0MPlRE0ofIm/GcZ9bfTqSOjLE1c9d9Yvf1dblabl6J0CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7cbcfb3f2c03d7ce74c554221c2f4eeea16357e99b825b419e19c6b8522eb2cb","last_reissued_at":"2026-05-18T01:22:04.246053Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:22:04.246053Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1601.06527","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-18T01:22:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VWOi6q4aY/itj/bu5K6OHGI42tq2sVYYV3WBZicZWeXe+aJ5YiKbKvO767vLdo47ijOOVi2FKPWY4QzHoSNMDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T14:23:01.182252Z"},"content_sha256":"47822ce9251d913d906de79ce626b28163bf09cd06bb91d5acb671a9ab0664e1","schema_version":"1.0","event_id":"sha256:47822ce9251d913d906de79ce626b28163bf09cd06bb91d5acb671a9ab0664e1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:PS6PWPZMAPL445GFKQRBYL2O52","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Online Community Detection by Using Nearest Hubs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["physics.soc-ph"],"primary_cat":"cs.SI","authors_text":"Pascal Held, Rudolf Kruse","submitted_at":"2016-01-25T09:41:43Z","abstract_excerpt":"Community and cluster detection is a popular field of social network analysis. Most algorithms focus on static graphs or series of snapshots.\n  In this paper we present an algorithm, which detects communities in dynamic graphs. The method is based on shortest paths to high-connected nodes, so called hubs. Due to local message passing we can update the clustering results with low computational power.\n  The presented algorithm is compared with other for some static social networks. The reached modularity is not as high as the Louvain method, but even higher then spectral clustering. For large-sc"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1601.06527","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-18T01:22:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vthV1I2bUgMk86cXDAz+NLlpcIhQI4rQkLOmMysHSkNzjGcNJSSpdBYzjsJHkWSgz2QGirBss0wblzkk65mZBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T14:23:01.182609Z"},"content_sha256":"c7d10893504177fd4cdefbeb1e1724b407be66d38766bd065f228c5389cde39e","schema_version":"1.0","event_id":"sha256:c7d10893504177fd4cdefbeb1e1724b407be66d38766bd065f228c5389cde39e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PS6PWPZMAPL445GFKQRBYL2O52/bundle.json","state_url":"https://pith.science/pith/PS6PWPZMAPL445GFKQRBYL2O52/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PS6PWPZMAPL445GFKQRBYL2O52/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-22T14:23:01Z","links":{"resolver":"https://pith.science/pith/PS6PWPZMAPL445GFKQRBYL2O52","bundle":"https://pith.science/pith/PS6PWPZMAPL445GFKQRBYL2O52/bundle.json","state":"https://pith.science/pith/PS6PWPZMAPL445GFKQRBYL2O52/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PS6PWPZMAPL445GFKQRBYL2O52/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:PS6PWPZMAPL445GFKQRBYL2O52","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":"5a769799943965f45e5261d91aa4857f6831ab3bf9ec56a7d6bf864e79482293","cross_cats_sorted":["physics.soc-ph"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2016-01-25T09:41:43Z","title_canon_sha256":"200521288d5f5f6b6971b5838b067c6220a72c06f85f83277e388bbac8da2c46"},"schema_version":"1.0","source":{"id":"1601.06527","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1601.06527","created_at":"2026-05-18T01:22:04Z"},{"alias_kind":"arxiv_version","alias_value":"1601.06527v1","created_at":"2026-05-18T01:22:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.06527","created_at":"2026-05-18T01:22:04Z"},{"alias_kind":"pith_short_12","alias_value":"PS6PWPZMAPL4","created_at":"2026-05-18T12:30:39Z"},{"alias_kind":"pith_short_16","alias_value":"PS6PWPZMAPL445GF","created_at":"2026-05-18T12:30:39Z"},{"alias_kind":"pith_short_8","alias_value":"PS6PWPZM","created_at":"2026-05-18T12:30:39Z"}],"graph_snapshots":[{"event_id":"sha256:c7d10893504177fd4cdefbeb1e1724b407be66d38766bd065f228c5389cde39e","target":"graph","created_at":"2026-05-18T01:22:04Z","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":"Community and cluster detection is a popular field of social network analysis. Most algorithms focus on static graphs or series of snapshots.\n  In this paper we present an algorithm, which detects communities in dynamic graphs. The method is based on shortest paths to high-connected nodes, so called hubs. Due to local message passing we can update the clustering results with low computational power.\n  The presented algorithm is compared with other for some static social networks. The reached modularity is not as high as the Louvain method, but even higher then spectral clustering. For large-sc","authors_text":"Pascal Held, Rudolf Kruse","cross_cats":["physics.soc-ph"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2016-01-25T09:41:43Z","title":"Online Community Detection by Using Nearest Hubs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1601.06527","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:47822ce9251d913d906de79ce626b28163bf09cd06bb91d5acb671a9ab0664e1","target":"record","created_at":"2026-05-18T01:22:04Z","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":"5a769799943965f45e5261d91aa4857f6831ab3bf9ec56a7d6bf864e79482293","cross_cats_sorted":["physics.soc-ph"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2016-01-25T09:41:43Z","title_canon_sha256":"200521288d5f5f6b6971b5838b067c6220a72c06f85f83277e388bbac8da2c46"},"schema_version":"1.0","source":{"id":"1601.06527","kind":"arxiv","version":1}},"canonical_sha256":"7cbcfb3f2c03d7ce74c554221c2f4eeea16357e99b825b419e19c6b8522eb2cb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7cbcfb3f2c03d7ce74c554221c2f4eeea16357e99b825b419e19c6b8522eb2cb","first_computed_at":"2026-05-18T01:22:04.246053Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:22:04.246053Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"iQ5JP06/QVS2gT4b69vIC4hAsLTXRRq14QRMHpSTD0MPlRE0ofIm/GcZ9bfTqSOjLE1c9d9Yvf1dblabl6J0CQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:22:04.246689Z","signed_message":"canonical_sha256_bytes"},"source_id":"1601.06527","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:47822ce9251d913d906de79ce626b28163bf09cd06bb91d5acb671a9ab0664e1","sha256:c7d10893504177fd4cdefbeb1e1724b407be66d38766bd065f228c5389cde39e"],"state_sha256":"8a17ce85dfe8268013efd70887eba8a4e97efc3a41a07cd5829183812c3647a9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xdOEFWPB+vSarY6ajdxMAuLmW+3OljL/dL492Fya5yfLMYYThibx0jzWsX5wWyBzk2sb4Sd3tGMaVTiJqXKTAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-22T14:23:01.184626Z","bundle_sha256":"1d0a2156cc45b6b864996eb2f184be0792f4c5b7c5ff86120aa87a8096f56446"}}