{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:GVKRX7T6ZILRVWSKJLQHYLOXD2","short_pith_number":"pith:GVKRX7T6","schema_version":"1.0","canonical_sha256":"35551bfe7eca171ada4a4ae07c2dd71ebf50ca79976cd5ccbb777520e5d31efc","source":{"kind":"arxiv","id":"1501.05139","version":2},"attestation_state":"computed","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."},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1501.05139","created_at":"2026-05-18T01:12:00.437455+00:00"},{"alias_kind":"arxiv_version","alias_value":"1501.05139v2","created_at":"2026-05-18T01:12:00.437455+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.05139","created_at":"2026-05-18T01:12:00.437455+00:00"},{"alias_kind":"pith_short_12","alias_value":"GVKRX7T6ZILR","created_at":"2026-05-18T12:29:22.688609+00:00"},{"alias_kind":"pith_short_16","alias_value":"GVKRX7T6ZILRVWSK","created_at":"2026-05-18T12:29:22.688609+00:00"},{"alias_kind":"pith_short_8","alias_value":"GVKRX7T6","created_at":"2026-05-18T12:29:22.688609+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/GVKRX7T6ZILRVWSKJLQHYLOXD2","json":"https://pith.science/pith/GVKRX7T6ZILRVWSKJLQHYLOXD2.json","graph_json":"https://pith.science/api/pith-number/GVKRX7T6ZILRVWSKJLQHYLOXD2/graph.json","events_json":"https://pith.science/api/pith-number/GVKRX7T6ZILRVWSKJLQHYLOXD2/events.json","paper":"https://pith.science/paper/GVKRX7T6"},"agent_actions":{"view_html":"https://pith.science/pith/GVKRX7T6ZILRVWSKJLQHYLOXD2","download_json":"https://pith.science/pith/GVKRX7T6ZILRVWSKJLQHYLOXD2.json","view_paper":"https://pith.science/paper/GVKRX7T6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1501.05139&json=true","fetch_graph":"https://pith.science/api/pith-number/GVKRX7T6ZILRVWSKJLQHYLOXD2/graph.json","fetch_events":"https://pith.science/api/pith-number/GVKRX7T6ZILRVWSKJLQHYLOXD2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GVKRX7T6ZILRVWSKJLQHYLOXD2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GVKRX7T6ZILRVWSKJLQHYLOXD2/action/storage_attestation","attest_author":"https://pith.science/pith/GVKRX7T6ZILRVWSKJLQHYLOXD2/action/author_attestation","sign_citation":"https://pith.science/pith/GVKRX7T6ZILRVWSKJLQHYLOXD2/action/citation_signature","submit_replication":"https://pith.science/pith/GVKRX7T6ZILRVWSKJLQHYLOXD2/action/replication_record"}},"created_at":"2026-05-18T01:12:00.437455+00:00","updated_at":"2026-05-18T01:12:00.437455+00:00"}