{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:SKGKR3VCMXZOEKTQL7CL4US52Y","short_pith_number":"pith:SKGKR3VC","canonical_record":{"source":{"id":"1603.02413","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2016-03-08T08:28:56Z","cross_cats_sorted":["physics.soc-ph"],"title_canon_sha256":"e3396e7cb6447454b396c7617b7c308f5cb3faa3d19a49145a57da1c2eba525a","abstract_canon_sha256":"c106128b676e9d424dc09cef74da224a08030b793cff0a22493642834e1dddb3"},"schema_version":"1.0"},"canonical_sha256":"928ca8eea265f2e22a705fc4be525dd6233fc6d0e86865a1ac59ec483aef5b19","source":{"kind":"arxiv","id":"1603.02413","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1603.02413","created_at":"2026-05-18T01:19:23Z"},{"alias_kind":"arxiv_version","alias_value":"1603.02413v1","created_at":"2026-05-18T01:19:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.02413","created_at":"2026-05-18T01:19:23Z"},{"alias_kind":"pith_short_12","alias_value":"SKGKR3VCMXZO","created_at":"2026-05-18T12:30:44Z"},{"alias_kind":"pith_short_16","alias_value":"SKGKR3VCMXZOEKTQ","created_at":"2026-05-18T12:30:44Z"},{"alias_kind":"pith_short_8","alias_value":"SKGKR3VC","created_at":"2026-05-18T12:30:44Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:SKGKR3VCMXZOEKTQL7CL4US52Y","target":"record","payload":{"canonical_record":{"source":{"id":"1603.02413","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2016-03-08T08:28:56Z","cross_cats_sorted":["physics.soc-ph"],"title_canon_sha256":"e3396e7cb6447454b396c7617b7c308f5cb3faa3d19a49145a57da1c2eba525a","abstract_canon_sha256":"c106128b676e9d424dc09cef74da224a08030b793cff0a22493642834e1dddb3"},"schema_version":"1.0"},"canonical_sha256":"928ca8eea265f2e22a705fc4be525dd6233fc6d0e86865a1ac59ec483aef5b19","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:19:23.415523Z","signature_b64":"TAyDp/Ub8QP/NYwweaUM1u+BK/babOiwDjAhJchmDVYgY31E9Lb6lrgtF0TdyKr0fSyus6s9C/B3kFcB8djSAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"928ca8eea265f2e22a705fc4be525dd6233fc6d0e86865a1ac59ec483aef5b19","last_reissued_at":"2026-05-18T01:19:23.414734Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:19:23.414734Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1603.02413","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:19:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TjGQzS41oReJmPIRLEW9Okv6kqXSEdHLgJbLzE22aHRErBMQ93AMwL2mHQD8irNp/P4UQvJkqKzp1fjql3JCCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T15:26:10.517988Z"},"content_sha256":"46b8dbc5d0a61a13c5ae8be24a55b7bc52433d77c648ea3e122af64576844d50","schema_version":"1.0","event_id":"sha256:46b8dbc5d0a61a13c5ae8be24a55b7bc52433d77c648ea3e122af64576844d50"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:SKGKR3VCMXZOEKTQL7CL4US52Y","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Dynamic Clustering in Social Networks using Louvain and Infomap Method","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["physics.soc-ph"],"primary_cat":"cs.SI","authors_text":"Benjamin Krause, Pascal Held, Rudolf Kruse","submitted_at":"2016-03-08T08:28:56Z","abstract_excerpt":"Finding communities or clusters in social networks is a fa- mous topic in social network analysis. Most algorithms are limited to static snapshots, so they cannot handle dynamics within the underlying graph. In this paper we present a modification of the Louvain community detec- tion method to handle changes in the graph without rerunning the full algorithm. Also, we adapted the Louvain greedy approach to optimize the Infomap measure. The main idea is, to recalculate only a small area around the changes. Depending on the graph size and the amount of changes, this yields a massive runtime decre"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.02413","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:19:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CtL2jBIXHvXy26hvEPYlv5z/VlNTJhkm2F0RuFf2+iPyU1KwcI2uxFEFgaZNU4vQUUqhRiVvqhOp4hVsmACsDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T15:26:10.518760Z"},"content_sha256":"9f51e91a4dd60b4cd6e5050675f4e48fc243ecea2ec75a80080601f7950f6238","schema_version":"1.0","event_id":"sha256:9f51e91a4dd60b4cd6e5050675f4e48fc243ecea2ec75a80080601f7950f6238"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SKGKR3VCMXZOEKTQL7CL4US52Y/bundle.json","state_url":"https://pith.science/pith/SKGKR3VCMXZOEKTQL7CL4US52Y/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SKGKR3VCMXZOEKTQL7CL4US52Y/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-31T15:26:10Z","links":{"resolver":"https://pith.science/pith/SKGKR3VCMXZOEKTQL7CL4US52Y","bundle":"https://pith.science/pith/SKGKR3VCMXZOEKTQL7CL4US52Y/bundle.json","state":"https://pith.science/pith/SKGKR3VCMXZOEKTQL7CL4US52Y/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SKGKR3VCMXZOEKTQL7CL4US52Y/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:SKGKR3VCMXZOEKTQL7CL4US52Y","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":"c106128b676e9d424dc09cef74da224a08030b793cff0a22493642834e1dddb3","cross_cats_sorted":["physics.soc-ph"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2016-03-08T08:28:56Z","title_canon_sha256":"e3396e7cb6447454b396c7617b7c308f5cb3faa3d19a49145a57da1c2eba525a"},"schema_version":"1.0","source":{"id":"1603.02413","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1603.02413","created_at":"2026-05-18T01:19:23Z"},{"alias_kind":"arxiv_version","alias_value":"1603.02413v1","created_at":"2026-05-18T01:19:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.02413","created_at":"2026-05-18T01:19:23Z"},{"alias_kind":"pith_short_12","alias_value":"SKGKR3VCMXZO","created_at":"2026-05-18T12:30:44Z"},{"alias_kind":"pith_short_16","alias_value":"SKGKR3VCMXZOEKTQ","created_at":"2026-05-18T12:30:44Z"},{"alias_kind":"pith_short_8","alias_value":"SKGKR3VC","created_at":"2026-05-18T12:30:44Z"}],"graph_snapshots":[{"event_id":"sha256:9f51e91a4dd60b4cd6e5050675f4e48fc243ecea2ec75a80080601f7950f6238","target":"graph","created_at":"2026-05-18T01:19:23Z","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":"Finding communities or clusters in social networks is a fa- mous topic in social network analysis. Most algorithms are limited to static snapshots, so they cannot handle dynamics within the underlying graph. In this paper we present a modification of the Louvain community detec- tion method to handle changes in the graph without rerunning the full algorithm. Also, we adapted the Louvain greedy approach to optimize the Infomap measure. The main idea is, to recalculate only a small area around the changes. Depending on the graph size and the amount of changes, this yields a massive runtime decre","authors_text":"Benjamin Krause, 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-03-08T08:28:56Z","title":"Dynamic Clustering in Social Networks using Louvain and Infomap Method"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.02413","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:46b8dbc5d0a61a13c5ae8be24a55b7bc52433d77c648ea3e122af64576844d50","target":"record","created_at":"2026-05-18T01:19:23Z","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":"c106128b676e9d424dc09cef74da224a08030b793cff0a22493642834e1dddb3","cross_cats_sorted":["physics.soc-ph"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2016-03-08T08:28:56Z","title_canon_sha256":"e3396e7cb6447454b396c7617b7c308f5cb3faa3d19a49145a57da1c2eba525a"},"schema_version":"1.0","source":{"id":"1603.02413","kind":"arxiv","version":1}},"canonical_sha256":"928ca8eea265f2e22a705fc4be525dd6233fc6d0e86865a1ac59ec483aef5b19","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"928ca8eea265f2e22a705fc4be525dd6233fc6d0e86865a1ac59ec483aef5b19","first_computed_at":"2026-05-18T01:19:23.414734Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:19:23.414734Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"TAyDp/Ub8QP/NYwweaUM1u+BK/babOiwDjAhJchmDVYgY31E9Lb6lrgtF0TdyKr0fSyus6s9C/B3kFcB8djSAw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:19:23.415523Z","signed_message":"canonical_sha256_bytes"},"source_id":"1603.02413","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:46b8dbc5d0a61a13c5ae8be24a55b7bc52433d77c648ea3e122af64576844d50","sha256:9f51e91a4dd60b4cd6e5050675f4e48fc243ecea2ec75a80080601f7950f6238"],"state_sha256":"603e8f1a83b58e54fb32a7e38a7f544c8f874f1b3aae05f8a0c4d89c46c7acde"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6pscUFFZbd/fUpnMEfnl/zHoZadr4s4PtywFcjYY4ce6N1HumtHnuJhVQtGbf/R6wZOUtMQYJ2WQKixyvMJ4Dw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T15:26:10.522264Z","bundle_sha256":"4cf3e964a831c5159bc5f8a61a43989ac4ecbcbf0d9e78770400426b4d2547c3"}}