{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:DWLLL6OCRXZBUKQWCR4PIMHXLM","short_pith_number":"pith:DWLLL6OC","canonical_record":{"source":{"id":"1406.6832","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2014-06-26T10:28:36Z","cross_cats_sorted":["physics.soc-ph","stat.ML"],"title_canon_sha256":"1c1a47a40045df5c0114e181be308fd2ee1e4df3f4ec54719b353368c887218e","abstract_canon_sha256":"f18d3d6a348b72d57d6f4e63531c884dbbdac6aa0db69577da79c3a5678f7a4a"},"schema_version":"1.0"},"canonical_sha256":"1d96b5f9c28df21a2a161478f430f75b2d30ffa51a08944d9f7453cbd272f209","source":{"kind":"arxiv","id":"1406.6832","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1406.6832","created_at":"2026-05-18T02:48:55Z"},{"alias_kind":"arxiv_version","alias_value":"1406.6832v1","created_at":"2026-05-18T02:48:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1406.6832","created_at":"2026-05-18T02:48:55Z"},{"alias_kind":"pith_short_12","alias_value":"DWLLL6OCRXZB","created_at":"2026-05-18T12:28:25Z"},{"alias_kind":"pith_short_16","alias_value":"DWLLL6OCRXZBUKQW","created_at":"2026-05-18T12:28:25Z"},{"alias_kind":"pith_short_8","alias_value":"DWLLL6OC","created_at":"2026-05-18T12:28:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:DWLLL6OCRXZBUKQWCR4PIMHXLM","target":"record","payload":{"canonical_record":{"source":{"id":"1406.6832","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2014-06-26T10:28:36Z","cross_cats_sorted":["physics.soc-ph","stat.ML"],"title_canon_sha256":"1c1a47a40045df5c0114e181be308fd2ee1e4df3f4ec54719b353368c887218e","abstract_canon_sha256":"f18d3d6a348b72d57d6f4e63531c884dbbdac6aa0db69577da79c3a5678f7a4a"},"schema_version":"1.0"},"canonical_sha256":"1d96b5f9c28df21a2a161478f430f75b2d30ffa51a08944d9f7453cbd272f209","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:48:55.726548Z","signature_b64":"a28OBGLXB4sz5GuV7OhHjH5xsQ5SRQ0v4m/oXwkQChYogYK/4RPKK8ujn11FjWbxqkcBbic5xxuddM5l7rucCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1d96b5f9c28df21a2a161478f430f75b2d30ffa51a08944d9f7453cbd272f209","last_reissued_at":"2026-05-18T02:48:55.725998Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:48:55.725998Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1406.6832","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-18T02:48:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0LCftrCDH4HdJNC816Vh2JVY4C8Q9VNjL1coUx/pgri10G8tGif0GJJnG6zLjDWFGQt5RU9Yp07OE57b5oHzAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T13:58:30.978140Z"},"content_sha256":"4e003129d8464f696567243ffe35058ae6df2a52aabcfc3ccbca41a2f2aa9dd3","schema_version":"1.0","event_id":"sha256:4e003129d8464f696567243ffe35058ae6df2a52aabcfc3ccbca41a2f2aa9dd3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:DWLLL6OCRXZBUKQWCR4PIMHXLM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Overlapping Community Detection Optimization and Nash Equilibrium","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["physics.soc-ph","stat.ML"],"primary_cat":"cs.SI","authors_text":"Michel Crampes, Michel Planti\\'e","submitted_at":"2014-06-26T10:28:36Z","abstract_excerpt":"Community detection using both graphs and social networks is the focus of many algorithms. Recent methods aimed at optimizing the so-called modularity function proceed by maximizing relations within communities while minimizing inter-community relations.\n  However, given the NP-completeness of the problem, these algorithms are heuristics that do not guarantee an optimum. In this paper, we introduce a new algorithm along with a function that takes an approximate solution and modifies it in order to reach an optimum. This reassignment function is considered a 'potential function' and becomes a n"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1406.6832","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-18T02:48:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BQDjRUCw8Hc4p44YXgsDbnD2KTPCptfu5jgVK2gD2XTwVitpaxHb8Gjycs5fNUmOgF0i1/3Fu6FFfgt4Iil6BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T13:58:30.978800Z"},"content_sha256":"32831594afe189f3977d14acc3b893219d035432b9276abd37d2c0fcfa6563e3","schema_version":"1.0","event_id":"sha256:32831594afe189f3977d14acc3b893219d035432b9276abd37d2c0fcfa6563e3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DWLLL6OCRXZBUKQWCR4PIMHXLM/bundle.json","state_url":"https://pith.science/pith/DWLLL6OCRXZBUKQWCR4PIMHXLM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DWLLL6OCRXZBUKQWCR4PIMHXLM/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-31T13:58:30Z","links":{"resolver":"https://pith.science/pith/DWLLL6OCRXZBUKQWCR4PIMHXLM","bundle":"https://pith.science/pith/DWLLL6OCRXZBUKQWCR4PIMHXLM/bundle.json","state":"https://pith.science/pith/DWLLL6OCRXZBUKQWCR4PIMHXLM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DWLLL6OCRXZBUKQWCR4PIMHXLM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:DWLLL6OCRXZBUKQWCR4PIMHXLM","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":"f18d3d6a348b72d57d6f4e63531c884dbbdac6aa0db69577da79c3a5678f7a4a","cross_cats_sorted":["physics.soc-ph","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2014-06-26T10:28:36Z","title_canon_sha256":"1c1a47a40045df5c0114e181be308fd2ee1e4df3f4ec54719b353368c887218e"},"schema_version":"1.0","source":{"id":"1406.6832","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1406.6832","created_at":"2026-05-18T02:48:55Z"},{"alias_kind":"arxiv_version","alias_value":"1406.6832v1","created_at":"2026-05-18T02:48:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1406.6832","created_at":"2026-05-18T02:48:55Z"},{"alias_kind":"pith_short_12","alias_value":"DWLLL6OCRXZB","created_at":"2026-05-18T12:28:25Z"},{"alias_kind":"pith_short_16","alias_value":"DWLLL6OCRXZBUKQW","created_at":"2026-05-18T12:28:25Z"},{"alias_kind":"pith_short_8","alias_value":"DWLLL6OC","created_at":"2026-05-18T12:28:25Z"}],"graph_snapshots":[{"event_id":"sha256:32831594afe189f3977d14acc3b893219d035432b9276abd37d2c0fcfa6563e3","target":"graph","created_at":"2026-05-18T02:48:55Z","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 using both graphs and social networks is the focus of many algorithms. Recent methods aimed at optimizing the so-called modularity function proceed by maximizing relations within communities while minimizing inter-community relations.\n  However, given the NP-completeness of the problem, these algorithms are heuristics that do not guarantee an optimum. In this paper, we introduce a new algorithm along with a function that takes an approximate solution and modifies it in order to reach an optimum. This reassignment function is considered a 'potential function' and becomes a n","authors_text":"Michel Crampes, Michel Planti\\'e","cross_cats":["physics.soc-ph","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2014-06-26T10:28:36Z","title":"Overlapping Community Detection Optimization and Nash Equilibrium"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1406.6832","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:4e003129d8464f696567243ffe35058ae6df2a52aabcfc3ccbca41a2f2aa9dd3","target":"record","created_at":"2026-05-18T02:48:55Z","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":"f18d3d6a348b72d57d6f4e63531c884dbbdac6aa0db69577da79c3a5678f7a4a","cross_cats_sorted":["physics.soc-ph","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2014-06-26T10:28:36Z","title_canon_sha256":"1c1a47a40045df5c0114e181be308fd2ee1e4df3f4ec54719b353368c887218e"},"schema_version":"1.0","source":{"id":"1406.6832","kind":"arxiv","version":1}},"canonical_sha256":"1d96b5f9c28df21a2a161478f430f75b2d30ffa51a08944d9f7453cbd272f209","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1d96b5f9c28df21a2a161478f430f75b2d30ffa51a08944d9f7453cbd272f209","first_computed_at":"2026-05-18T02:48:55.725998Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:48:55.725998Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"a28OBGLXB4sz5GuV7OhHjH5xsQ5SRQ0v4m/oXwkQChYogYK/4RPKK8ujn11FjWbxqkcBbic5xxuddM5l7rucCA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:48:55.726548Z","signed_message":"canonical_sha256_bytes"},"source_id":"1406.6832","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4e003129d8464f696567243ffe35058ae6df2a52aabcfc3ccbca41a2f2aa9dd3","sha256:32831594afe189f3977d14acc3b893219d035432b9276abd37d2c0fcfa6563e3"],"state_sha256":"47e50b2f458485377e64393647e4cde64755d2df0ba3b2d2e98fbf9181ae5273"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dvmpVW7rxp/ISVWseeji8LufJPIjc9FAOE4vaDbx0jfshqzgc4fG8r9Tr+EUO8iQ7g7CVNZAjSgalDJvC9WGBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T13:58:30.982095Z","bundle_sha256":"ac260d92124b55889d16ce45b6895d6e85441bf2cb0080178446c2bc58db9e32"}}