{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:5UJNKI4JAGTEFWSF2EUGBWKYJQ","short_pith_number":"pith:5UJNKI4J","canonical_record":{"source":{"id":"1707.03587","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2017-07-12T08:10:56Z","cross_cats_sorted":["cs.GT","cs.NI"],"title_canon_sha256":"6eaa17a46f01eea48c92a32de793acbb4beab8dce745e180998a1024cc6b8484","abstract_canon_sha256":"5718c1e5656f2c1719a359c2e46f210cb5b6bec1a262eae70f2ef3968afefc06"},"schema_version":"1.0"},"canonical_sha256":"ed12d5238901a642da45d12860d9584c356491697638ae0044818e7f896ef438","source":{"kind":"arxiv","id":"1707.03587","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1707.03587","created_at":"2026-05-18T00:39:22Z"},{"alias_kind":"arxiv_version","alias_value":"1707.03587v2","created_at":"2026-05-18T00:39:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.03587","created_at":"2026-05-18T00:39:22Z"},{"alias_kind":"pith_short_12","alias_value":"5UJNKI4JAGTE","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_16","alias_value":"5UJNKI4JAGTEFWSF","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_8","alias_value":"5UJNKI4J","created_at":"2026-05-18T12:31:00Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:5UJNKI4JAGTEFWSF2EUGBWKYJQ","target":"record","payload":{"canonical_record":{"source":{"id":"1707.03587","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2017-07-12T08:10:56Z","cross_cats_sorted":["cs.GT","cs.NI"],"title_canon_sha256":"6eaa17a46f01eea48c92a32de793acbb4beab8dce745e180998a1024cc6b8484","abstract_canon_sha256":"5718c1e5656f2c1719a359c2e46f210cb5b6bec1a262eae70f2ef3968afefc06"},"schema_version":"1.0"},"canonical_sha256":"ed12d5238901a642da45d12860d9584c356491697638ae0044818e7f896ef438","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:39:22.405465Z","signature_b64":"g1YEXOd7NdVK/kG8wtpNvixkbriLByVAv2fPuQrhrExZ8yTgqTy1MhvwitWg/SF5TzTVwMtTLcjphRhHppNXCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ed12d5238901a642da45d12860d9584c356491697638ae0044818e7f896ef438","last_reissued_at":"2026-05-18T00:39:22.404718Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:39:22.404718Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1707.03587","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-18T00:39:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ia+59REcoaZ12iIH/Um6HnE/S0rJq8kThRCwYrknuX5TqQDPA3MH2ibo6rFMIDuURovkt86yl+aQHFtB9c+4CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T10:42:52.815168Z"},"content_sha256":"f696f16b587cf98c593bb38526344be60e84bf45a8717168d41e827bd29ae7b3","schema_version":"1.0","event_id":"sha256:f696f16b587cf98c593bb38526344be60e84bf45a8717168d41e827bd29ae7b3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:5UJNKI4JAGTEFWSF2EUGBWKYJQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Cooperative Game Theory Approaches for Network Partitioning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.GT","cs.NI"],"primary_cat":"cs.SI","authors_text":"Aleksei Kondratev, Konstantin Avrachenkov (NEO), Vladimir Mazalov","submitted_at":"2017-07-12T08:10:56Z","abstract_excerpt":"The paper is devoted to game-theoretic methods for community detection in networks. The traditional methods for detecting community structure are based on selecting denser subgraphs inside the network. Here we propose to use the methods of cooperative game theory that highlight not only the link density but also the mechanisms of cluster formation. Specifically, we suggest two approaches from cooperative game theory: the first approach is based on the Myerson value, whereas the second approach is based on hedonic games. Both approaches allow to detect clusters with various resolution. However,"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.03587","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-18T00:39:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iUVgJda4r1+TgfGhlzd2KHPR7IFfyHvmT5SjXQjTNDkx591XlhoXy/k4D/dgo/G+EO02Y9H250Z0+S0doQqEDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T10:42:52.815535Z"},"content_sha256":"f138acc1bb88be4b2d6505aed05138e7acecf0c5a574bd97bb9bd9827dbcef7d","schema_version":"1.0","event_id":"sha256:f138acc1bb88be4b2d6505aed05138e7acecf0c5a574bd97bb9bd9827dbcef7d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5UJNKI4JAGTEFWSF2EUGBWKYJQ/bundle.json","state_url":"https://pith.science/pith/5UJNKI4JAGTEFWSF2EUGBWKYJQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5UJNKI4JAGTEFWSF2EUGBWKYJQ/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-20T10:42:52Z","links":{"resolver":"https://pith.science/pith/5UJNKI4JAGTEFWSF2EUGBWKYJQ","bundle":"https://pith.science/pith/5UJNKI4JAGTEFWSF2EUGBWKYJQ/bundle.json","state":"https://pith.science/pith/5UJNKI4JAGTEFWSF2EUGBWKYJQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5UJNKI4JAGTEFWSF2EUGBWKYJQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:5UJNKI4JAGTEFWSF2EUGBWKYJQ","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":"5718c1e5656f2c1719a359c2e46f210cb5b6bec1a262eae70f2ef3968afefc06","cross_cats_sorted":["cs.GT","cs.NI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2017-07-12T08:10:56Z","title_canon_sha256":"6eaa17a46f01eea48c92a32de793acbb4beab8dce745e180998a1024cc6b8484"},"schema_version":"1.0","source":{"id":"1707.03587","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1707.03587","created_at":"2026-05-18T00:39:22Z"},{"alias_kind":"arxiv_version","alias_value":"1707.03587v2","created_at":"2026-05-18T00:39:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.03587","created_at":"2026-05-18T00:39:22Z"},{"alias_kind":"pith_short_12","alias_value":"5UJNKI4JAGTE","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_16","alias_value":"5UJNKI4JAGTEFWSF","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_8","alias_value":"5UJNKI4J","created_at":"2026-05-18T12:31:00Z"}],"graph_snapshots":[{"event_id":"sha256:f138acc1bb88be4b2d6505aed05138e7acecf0c5a574bd97bb9bd9827dbcef7d","target":"graph","created_at":"2026-05-18T00:39:22Z","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":"The paper is devoted to game-theoretic methods for community detection in networks. The traditional methods for detecting community structure are based on selecting denser subgraphs inside the network. Here we propose to use the methods of cooperative game theory that highlight not only the link density but also the mechanisms of cluster formation. Specifically, we suggest two approaches from cooperative game theory: the first approach is based on the Myerson value, whereas the second approach is based on hedonic games. Both approaches allow to detect clusters with various resolution. However,","authors_text":"Aleksei Kondratev, Konstantin Avrachenkov (NEO), Vladimir Mazalov","cross_cats":["cs.GT","cs.NI"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2017-07-12T08:10:56Z","title":"Cooperative Game Theory Approaches for Network Partitioning"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.03587","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:f696f16b587cf98c593bb38526344be60e84bf45a8717168d41e827bd29ae7b3","target":"record","created_at":"2026-05-18T00:39:22Z","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":"5718c1e5656f2c1719a359c2e46f210cb5b6bec1a262eae70f2ef3968afefc06","cross_cats_sorted":["cs.GT","cs.NI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2017-07-12T08:10:56Z","title_canon_sha256":"6eaa17a46f01eea48c92a32de793acbb4beab8dce745e180998a1024cc6b8484"},"schema_version":"1.0","source":{"id":"1707.03587","kind":"arxiv","version":2}},"canonical_sha256":"ed12d5238901a642da45d12860d9584c356491697638ae0044818e7f896ef438","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ed12d5238901a642da45d12860d9584c356491697638ae0044818e7f896ef438","first_computed_at":"2026-05-18T00:39:22.404718Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:39:22.404718Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"g1YEXOd7NdVK/kG8wtpNvixkbriLByVAv2fPuQrhrExZ8yTgqTy1MhvwitWg/SF5TzTVwMtTLcjphRhHppNXCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:39:22.405465Z","signed_message":"canonical_sha256_bytes"},"source_id":"1707.03587","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f696f16b587cf98c593bb38526344be60e84bf45a8717168d41e827bd29ae7b3","sha256:f138acc1bb88be4b2d6505aed05138e7acecf0c5a574bd97bb9bd9827dbcef7d"],"state_sha256":"b8fef0aeb94777000d4dd1c5242a529ee4218277aacb149399e2ff3864c7b401"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"E0+aVUJtoOM18hif1Ei8fFSEEhGX/Ephg9tk5zYKRI68gM/7s9kuR3qwFhZvO9J/Vb3TE02m87hnnjxiPqwsDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-20T10:42:52.817554Z","bundle_sha256":"6550259a0ffb0489d9bbed0cecedc40f19a28732e59e5f699f5ec5a2c3315809"}}