{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:GVKRX7T6ZILRVWSKJLQHYLOXD2","short_pith_number":"pith:GVKRX7T6","canonical_record":{"source":{"id":"1501.05139","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.SI","submitted_at":"2015-01-21T11:41:40Z","cross_cats_sorted":["physics.soc-ph"],"title_canon_sha256":"ff86e45de739839994552fd993d75bd6f34b17dbd724d961995f55088395047f","abstract_canon_sha256":"3cd74b90d1129be2518f9e2e463868ace1f1f952070add850859349c5efa7704"},"schema_version":"1.0"},"canonical_sha256":"35551bfe7eca171ada4a4ae07c2dd71ebf50ca79976cd5ccbb777520e5d31efc","source":{"kind":"arxiv","id":"1501.05139","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1501.05139","created_at":"2026-05-18T01:12:00Z"},{"alias_kind":"arxiv_version","alias_value":"1501.05139v2","created_at":"2026-05-18T01:12:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.05139","created_at":"2026-05-18T01:12:00Z"},{"alias_kind":"pith_short_12","alias_value":"GVKRX7T6ZILR","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_16","alias_value":"GVKRX7T6ZILRVWSK","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_8","alias_value":"GVKRX7T6","created_at":"2026-05-18T12:29:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:GVKRX7T6ZILRVWSKJLQHYLOXD2","target":"record","payload":{"canonical_record":{"source":{"id":"1501.05139","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.SI","submitted_at":"2015-01-21T11:41:40Z","cross_cats_sorted":["physics.soc-ph"],"title_canon_sha256":"ff86e45de739839994552fd993d75bd6f34b17dbd724d961995f55088395047f","abstract_canon_sha256":"3cd74b90d1129be2518f9e2e463868ace1f1f952070add850859349c5efa7704"},"schema_version":"1.0"},"canonical_sha256":"35551bfe7eca171ada4a4ae07c2dd71ebf50ca79976cd5ccbb777520e5d31efc","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:12:00.437734Z","signature_b64":"xnH8bDN9zAOlyNSsnVx5n+REGRXGtvjN2wt7Ipyj+1wrhPjB6A9rTvq5zE2P3PLF++TR9/7J3STShqQp0pWSBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"35551bfe7eca171ada4a4ae07c2dd71ebf50ca79976cd5ccbb777520e5d31efc","last_reissued_at":"2026-05-18T01:12:00.437402Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:12:00.437402Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1501.05139","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-18T01:12:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"m8EQyNoSMzKRL60A3f4T1BCkl6UoEL+/FMJqeipEq76AmCqbdgHY6rp/F3KivqtiNzufWjpTG8tCUBl7qjzkAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T09:22:49.892748Z"},"content_sha256":"54bc1beb55629e6ccd312c8cdc23cfcef417fc2f34675847379263305fcad3cd","schema_version":"1.0","event_id":"sha256:54bc1beb55629e6ccd312c8cdc23cfcef417fc2f34675847379263305fcad3cd"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:GVKRX7T6ZILRVWSKJLQHYLOXD2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Detecting Overlapping Link Communities by Finding Local Minima of a Cost Function with a Memetic Algorithm. Part 1: Problem and Method","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["physics.soc-ph"],"primary_cat":"cs.SI","authors_text":"Frank Havemann, Jochen Gl\\\"aser, Michael Heinz","submitted_at":"2015-01-21T11:41:40Z","abstract_excerpt":"We propose an algorithm for detecting communities of links in networks which uses local information, is based on a new evaluation function, and allows for pervasive overlaps of communities. The complexity of the clustering task requires the application of a memetic algorithm that combines probabilistic evolutionary strategies with deterministic local searches. In Part 2 we will present results of experiments with with citation networks."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1501.05139","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-18T01:12:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"V+Dv83XAHDiTYcN1T2Eii4SWyTpGJSz6WoC5QJ2UwHb8pwq8x1GYvsy1Z2zyl31NhnpqIp4yE5c7nFa4G4MPAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T09:22:49.893140Z"},"content_sha256":"340eb404b5044bf946e5b950a839adfacf47f304acb2a607e9a52cad45a93210","schema_version":"1.0","event_id":"sha256:340eb404b5044bf946e5b950a839adfacf47f304acb2a607e9a52cad45a93210"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GVKRX7T6ZILRVWSKJLQHYLOXD2/bundle.json","state_url":"https://pith.science/pith/GVKRX7T6ZILRVWSKJLQHYLOXD2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GVKRX7T6ZILRVWSKJLQHYLOXD2/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-04T09:22:49Z","links":{"resolver":"https://pith.science/pith/GVKRX7T6ZILRVWSKJLQHYLOXD2","bundle":"https://pith.science/pith/GVKRX7T6ZILRVWSKJLQHYLOXD2/bundle.json","state":"https://pith.science/pith/GVKRX7T6ZILRVWSKJLQHYLOXD2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GVKRX7T6ZILRVWSKJLQHYLOXD2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:GVKRX7T6ZILRVWSKJLQHYLOXD2","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":"3cd74b90d1129be2518f9e2e463868ace1f1f952070add850859349c5efa7704","cross_cats_sorted":["physics.soc-ph"],"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.SI","submitted_at":"2015-01-21T11:41:40Z","title_canon_sha256":"ff86e45de739839994552fd993d75bd6f34b17dbd724d961995f55088395047f"},"schema_version":"1.0","source":{"id":"1501.05139","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1501.05139","created_at":"2026-05-18T01:12:00Z"},{"alias_kind":"arxiv_version","alias_value":"1501.05139v2","created_at":"2026-05-18T01:12:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.05139","created_at":"2026-05-18T01:12:00Z"},{"alias_kind":"pith_short_12","alias_value":"GVKRX7T6ZILR","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_16","alias_value":"GVKRX7T6ZILRVWSK","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_8","alias_value":"GVKRX7T6","created_at":"2026-05-18T12:29:22Z"}],"graph_snapshots":[{"event_id":"sha256:340eb404b5044bf946e5b950a839adfacf47f304acb2a607e9a52cad45a93210","target":"graph","created_at":"2026-05-18T01:12:00Z","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":"We propose an algorithm for detecting communities of links in networks which uses local information, is based on a new evaluation function, and allows for pervasive overlaps of communities. The complexity of the clustering task requires the application of a memetic algorithm that combines probabilistic evolutionary strategies with deterministic local searches. In Part 2 we will present results of experiments with with citation networks.","authors_text":"Frank Havemann, Jochen Gl\\\"aser, Michael Heinz","cross_cats":["physics.soc-ph"],"headline":"","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.SI","submitted_at":"2015-01-21T11:41:40Z","title":"Detecting Overlapping Link Communities by Finding Local Minima of a Cost Function with a Memetic Algorithm. Part 1: Problem and Method"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1501.05139","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:54bc1beb55629e6ccd312c8cdc23cfcef417fc2f34675847379263305fcad3cd","target":"record","created_at":"2026-05-18T01:12:00Z","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":"3cd74b90d1129be2518f9e2e463868ace1f1f952070add850859349c5efa7704","cross_cats_sorted":["physics.soc-ph"],"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.SI","submitted_at":"2015-01-21T11:41:40Z","title_canon_sha256":"ff86e45de739839994552fd993d75bd6f34b17dbd724d961995f55088395047f"},"schema_version":"1.0","source":{"id":"1501.05139","kind":"arxiv","version":2}},"canonical_sha256":"35551bfe7eca171ada4a4ae07c2dd71ebf50ca79976cd5ccbb777520e5d31efc","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"35551bfe7eca171ada4a4ae07c2dd71ebf50ca79976cd5ccbb777520e5d31efc","first_computed_at":"2026-05-18T01:12:00.437402Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:12:00.437402Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"xnH8bDN9zAOlyNSsnVx5n+REGRXGtvjN2wt7Ipyj+1wrhPjB6A9rTvq5zE2P3PLF++TR9/7J3STShqQp0pWSBg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:12:00.437734Z","signed_message":"canonical_sha256_bytes"},"source_id":"1501.05139","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:54bc1beb55629e6ccd312c8cdc23cfcef417fc2f34675847379263305fcad3cd","sha256:340eb404b5044bf946e5b950a839adfacf47f304acb2a607e9a52cad45a93210"],"state_sha256":"53e1fbc77c00a62ee965cf3492f158f2802f653a2ea6cc38c61c5ef520e1313b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WB2JH2gHcWEya8Vo3QzVIo1UYiiYoiz7VZDOJjW74q35u5F1ijLGRXhkd2c2s4y9G4ffzOqfRYDhvgIUFeySDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T09:22:49.895142Z","bundle_sha256":"d367c7c61ba30d66afe82fdebc8c1398245b75581f37b8317f7e3f02a4d308c1"}}