{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:F6XI2RFJSDXDSMWM2TBYFEER5O","short_pith_number":"pith:F6XI2RFJ","canonical_record":{"source":{"id":"1307.2715","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2013-07-10T08:54:00Z","cross_cats_sorted":[],"title_canon_sha256":"7e31811c429f0b3aa01b8ca1e2261469aa1369da38948985ab6f4721947bdd36","abstract_canon_sha256":"4d87720c89b600aa2d9b3d407976cf0bdc45def400333a587743e4c1ccf7e0e6"},"schema_version":"1.0"},"canonical_sha256":"2fae8d44a990ee3932ccd4c3829091eb8c73396adb983e0ffa670aaeea68b208","source":{"kind":"arxiv","id":"1307.2715","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1307.2715","created_at":"2026-05-18T03:18:50Z"},{"alias_kind":"arxiv_version","alias_value":"1307.2715v1","created_at":"2026-05-18T03:18:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1307.2715","created_at":"2026-05-18T03:18:50Z"},{"alias_kind":"pith_short_12","alias_value":"F6XI2RFJSDXD","created_at":"2026-05-18T12:27:45Z"},{"alias_kind":"pith_short_16","alias_value":"F6XI2RFJSDXDSMWM","created_at":"2026-05-18T12:27:45Z"},{"alias_kind":"pith_short_8","alias_value":"F6XI2RFJ","created_at":"2026-05-18T12:27:45Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:F6XI2RFJSDXDSMWM2TBYFEER5O","target":"record","payload":{"canonical_record":{"source":{"id":"1307.2715","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2013-07-10T08:54:00Z","cross_cats_sorted":[],"title_canon_sha256":"7e31811c429f0b3aa01b8ca1e2261469aa1369da38948985ab6f4721947bdd36","abstract_canon_sha256":"4d87720c89b600aa2d9b3d407976cf0bdc45def400333a587743e4c1ccf7e0e6"},"schema_version":"1.0"},"canonical_sha256":"2fae8d44a990ee3932ccd4c3829091eb8c73396adb983e0ffa670aaeea68b208","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:18:50.623145Z","signature_b64":"wP7DhEJ6nxo0dncul6yQiEhtTIMtBACasQMaF9cRKQEoCQSSEBmYUL/gDheG8+xF57eia0HOqzyJAQa5OfKfBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2fae8d44a990ee3932ccd4c3829091eb8c73396adb983e0ffa670aaeea68b208","last_reissued_at":"2026-05-18T03:18:50.622605Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:18:50.622605Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1307.2715","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-18T03:18:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UWa4BkRL+NY8zRcZHYGHEi5SJcGp37oHA8ukj4iMrYxIUQdO/6liOoZ4uNS0I/fFx477+z87fwtPhdDKvRAPDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T05:05:46.318420Z"},"content_sha256":"2dca09c8465a76a77715bc79e50de38264a0f96c336d58c17b976cf14a938916","schema_version":"1.0","event_id":"sha256:2dca09c8465a76a77715bc79e50de38264a0f96c336d58c17b976cf14a938916"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:F6XI2RFJSDXDSMWM2TBYFEER5O","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Optimisation dans la d\\'etection de communaut\\'es recouvrantes et \\'equilibre de Nash","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.ML","authors_text":"Marie Lopez, Michel Crampes, Michel Planti\\'e","submitted_at":"2013-07-10T08:54:00Z","abstract_excerpt":"Community detection in graphs has been the subject of many algorithms. Recent methods want to optimize a modularity function which shows a maximum of relationships within communities and found a minimum of inter-community relations. these algorithms are applied to unipartite, multipartite and directed graphs. However, given the NP-completeness of the problem, these algorithms are heuristics that do not guarantee an optimum. In this paper we introduce an algorithm which, based on an approximate solution obtained through a efficient detection algorithm, modifie it to achieve a local optimum base"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1307.2715","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-18T03:18:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bcZZEbe3k0l0gzEf/VrvppaV3bce6ZjJoUnkOvmAaQ/GiQxz/mRtBVnvAAdTQpZwpeU49IlvMdc7YS4LcH9vAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T05:05:46.319176Z"},"content_sha256":"e49aa7a9fa984f92caa158881abb7c71e59a6d3c636b7050d203369826fd1609","schema_version":"1.0","event_id":"sha256:e49aa7a9fa984f92caa158881abb7c71e59a6d3c636b7050d203369826fd1609"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/F6XI2RFJSDXDSMWM2TBYFEER5O/bundle.json","state_url":"https://pith.science/pith/F6XI2RFJSDXDSMWM2TBYFEER5O/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/F6XI2RFJSDXDSMWM2TBYFEER5O/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-31T05:05:46Z","links":{"resolver":"https://pith.science/pith/F6XI2RFJSDXDSMWM2TBYFEER5O","bundle":"https://pith.science/pith/F6XI2RFJSDXDSMWM2TBYFEER5O/bundle.json","state":"https://pith.science/pith/F6XI2RFJSDXDSMWM2TBYFEER5O/state.json","well_known_bundle":"https://pith.science/.well-known/pith/F6XI2RFJSDXDSMWM2TBYFEER5O/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:F6XI2RFJSDXDSMWM2TBYFEER5O","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":"4d87720c89b600aa2d9b3d407976cf0bdc45def400333a587743e4c1ccf7e0e6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2013-07-10T08:54:00Z","title_canon_sha256":"7e31811c429f0b3aa01b8ca1e2261469aa1369da38948985ab6f4721947bdd36"},"schema_version":"1.0","source":{"id":"1307.2715","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1307.2715","created_at":"2026-05-18T03:18:50Z"},{"alias_kind":"arxiv_version","alias_value":"1307.2715v1","created_at":"2026-05-18T03:18:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1307.2715","created_at":"2026-05-18T03:18:50Z"},{"alias_kind":"pith_short_12","alias_value":"F6XI2RFJSDXD","created_at":"2026-05-18T12:27:45Z"},{"alias_kind":"pith_short_16","alias_value":"F6XI2RFJSDXDSMWM","created_at":"2026-05-18T12:27:45Z"},{"alias_kind":"pith_short_8","alias_value":"F6XI2RFJ","created_at":"2026-05-18T12:27:45Z"}],"graph_snapshots":[{"event_id":"sha256:e49aa7a9fa984f92caa158881abb7c71e59a6d3c636b7050d203369826fd1609","target":"graph","created_at":"2026-05-18T03:18:50Z","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 detection in graphs has been the subject of many algorithms. Recent methods want to optimize a modularity function which shows a maximum of relationships within communities and found a minimum of inter-community relations. these algorithms are applied to unipartite, multipartite and directed graphs. However, given the NP-completeness of the problem, these algorithms are heuristics that do not guarantee an optimum. In this paper we introduce an algorithm which, based on an approximate solution obtained through a efficient detection algorithm, modifie it to achieve a local optimum base","authors_text":"Marie Lopez, Michel Crampes, Michel Planti\\'e","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2013-07-10T08:54:00Z","title":"Optimisation dans la d\\'etection de communaut\\'es recouvrantes et \\'equilibre de Nash"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1307.2715","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:2dca09c8465a76a77715bc79e50de38264a0f96c336d58c17b976cf14a938916","target":"record","created_at":"2026-05-18T03:18:50Z","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":"4d87720c89b600aa2d9b3d407976cf0bdc45def400333a587743e4c1ccf7e0e6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2013-07-10T08:54:00Z","title_canon_sha256":"7e31811c429f0b3aa01b8ca1e2261469aa1369da38948985ab6f4721947bdd36"},"schema_version":"1.0","source":{"id":"1307.2715","kind":"arxiv","version":1}},"canonical_sha256":"2fae8d44a990ee3932ccd4c3829091eb8c73396adb983e0ffa670aaeea68b208","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2fae8d44a990ee3932ccd4c3829091eb8c73396adb983e0ffa670aaeea68b208","first_computed_at":"2026-05-18T03:18:50.622605Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:18:50.622605Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"wP7DhEJ6nxo0dncul6yQiEhtTIMtBACasQMaF9cRKQEoCQSSEBmYUL/gDheG8+xF57eia0HOqzyJAQa5OfKfBg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:18:50.623145Z","signed_message":"canonical_sha256_bytes"},"source_id":"1307.2715","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2dca09c8465a76a77715bc79e50de38264a0f96c336d58c17b976cf14a938916","sha256:e49aa7a9fa984f92caa158881abb7c71e59a6d3c636b7050d203369826fd1609"],"state_sha256":"8077f4c31330f86196515adf0d7a1a3e384ecbddd7f7277b2dd205610aad430f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"thS3A/Kbl9BXmc+fc6YfbvFU6mQ8LvqfWskZOfASHkszWUrgkfE5KUJu8mAKRgjeFto3HyXy0UvolP0Kqo36DQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T05:05:46.323296Z","bundle_sha256":"70f47bf8c090dff9b613af83f3905d1018ca23c715447e9af1c578a253038674"}}