{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:ZLDCECOJU6SBWKQ3WCWTPDOUIM","short_pith_number":"pith:ZLDCECOJ","canonical_record":{"source":{"id":"1208.3432","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"cs.GT","submitted_at":"2012-08-15T14:58:55Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"fd51f2b2d8bb906175a07bfc3d14996ad46699e459ec69eab6b76ed16039d051","abstract_canon_sha256":"32f3d691b9b88d24f82aaef7af21551caa325902fa68b3df971fdbe1a7e1015b"},"schema_version":"1.0"},"canonical_sha256":"cac62209c9a7a41b2a1bb0ad378dd4431dbd37047dda917888967c1425904470","source":{"kind":"arxiv","id":"1208.3432","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1208.3432","created_at":"2026-05-18T02:25:05Z"},{"alias_kind":"arxiv_version","alias_value":"1208.3432v1","created_at":"2026-05-18T02:25:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1208.3432","created_at":"2026-05-18T02:25:05Z"},{"alias_kind":"pith_short_12","alias_value":"ZLDCECOJU6SB","created_at":"2026-05-18T12:27:30Z"},{"alias_kind":"pith_short_16","alias_value":"ZLDCECOJU6SBWKQ3","created_at":"2026-05-18T12:27:30Z"},{"alias_kind":"pith_short_8","alias_value":"ZLDCECOJ","created_at":"2026-05-18T12:27:30Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:ZLDCECOJU6SBWKQ3WCWTPDOUIM","target":"record","payload":{"canonical_record":{"source":{"id":"1208.3432","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"cs.GT","submitted_at":"2012-08-15T14:58:55Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"fd51f2b2d8bb906175a07bfc3d14996ad46699e459ec69eab6b76ed16039d051","abstract_canon_sha256":"32f3d691b9b88d24f82aaef7af21551caa325902fa68b3df971fdbe1a7e1015b"},"schema_version":"1.0"},"canonical_sha256":"cac62209c9a7a41b2a1bb0ad378dd4431dbd37047dda917888967c1425904470","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:25:05.972057Z","signature_b64":"ZaWRj/VeVoPejTdbyH1Z0IHPe0Q0TplDNSvnYlAWRCKulsG9ya9hCxRtdoZY7u0r/qfXz0pE6t4sGjDREiByCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cac62209c9a7a41b2a1bb0ad378dd4431dbd37047dda917888967c1425904470","last_reissued_at":"2026-05-18T02:25:05.971548Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:25:05.971548Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1208.3432","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:25:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eQd+fhfUpY6Qkl27IVskvHvyFS+ngkALir3JmxmxfOvxrV27FffbtDclxGxMtqKYjI4ac8UK1SQeqa56LY/gDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T07:26:58.143692Z"},"content_sha256":"4156711de6de118388b2d3c5137f5300a81fac99d7cdfaf49751a959000d309b","schema_version":"1.0","event_id":"sha256:4156711de6de118388b2d3c5137f5300a81fac99d7cdfaf49751a959000d309b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:ZLDCECOJU6SBWKQ3WCWTPDOUIM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Novel Strategy Selection Method for Multi-Objective Clustering Algorithms Using Game Theory","license":"http://creativecommons.org/licenses/by/3.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.GT","authors_text":"Ali Hamzeh, Mahsa Badami, Sattar Hashemi","submitted_at":"2012-08-15T14:58:55Z","abstract_excerpt":"The most important factors which contribute to the efficiency of game-theoretical algorithms are time and game complexity. In this study, we have offered an elegant method to deal with high complexity of game theoretic multi-objective clustering methods in large-sized data sets. Here, we have developed a method which selects a subset of strategies from strategies profile for each player. In this case, the size of payoff matrices reduces significantly which has a remarkable impact on time complexity. Therefore, practical problems with more data are tractable with less computational complexity. "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1208.3432","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:25:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZbdzqVBKDWBplhPHd1df40fqMJOwqKbaswXLCvdJfRicLjctmtiNF4hxtbEQwlYbbXVA+Hu4OCwA4kQdSeGTBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T07:26:58.144138Z"},"content_sha256":"ae876f41e47cae6ecbf64a11bf65d687f4632ab7f02e374beea6c96d859a2673","schema_version":"1.0","event_id":"sha256:ae876f41e47cae6ecbf64a11bf65d687f4632ab7f02e374beea6c96d859a2673"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZLDCECOJU6SBWKQ3WCWTPDOUIM/bundle.json","state_url":"https://pith.science/pith/ZLDCECOJU6SBWKQ3WCWTPDOUIM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZLDCECOJU6SBWKQ3WCWTPDOUIM/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-23T07:26:58Z","links":{"resolver":"https://pith.science/pith/ZLDCECOJU6SBWKQ3WCWTPDOUIM","bundle":"https://pith.science/pith/ZLDCECOJU6SBWKQ3WCWTPDOUIM/bundle.json","state":"https://pith.science/pith/ZLDCECOJU6SBWKQ3WCWTPDOUIM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZLDCECOJU6SBWKQ3WCWTPDOUIM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:ZLDCECOJU6SBWKQ3WCWTPDOUIM","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":"32f3d691b9b88d24f82aaef7af21551caa325902fa68b3df971fdbe1a7e1015b","cross_cats_sorted":["cs.AI"],"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"cs.GT","submitted_at":"2012-08-15T14:58:55Z","title_canon_sha256":"fd51f2b2d8bb906175a07bfc3d14996ad46699e459ec69eab6b76ed16039d051"},"schema_version":"1.0","source":{"id":"1208.3432","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1208.3432","created_at":"2026-05-18T02:25:05Z"},{"alias_kind":"arxiv_version","alias_value":"1208.3432v1","created_at":"2026-05-18T02:25:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1208.3432","created_at":"2026-05-18T02:25:05Z"},{"alias_kind":"pith_short_12","alias_value":"ZLDCECOJU6SB","created_at":"2026-05-18T12:27:30Z"},{"alias_kind":"pith_short_16","alias_value":"ZLDCECOJU6SBWKQ3","created_at":"2026-05-18T12:27:30Z"},{"alias_kind":"pith_short_8","alias_value":"ZLDCECOJ","created_at":"2026-05-18T12:27:30Z"}],"graph_snapshots":[{"event_id":"sha256:ae876f41e47cae6ecbf64a11bf65d687f4632ab7f02e374beea6c96d859a2673","target":"graph","created_at":"2026-05-18T02:25:05Z","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 most important factors which contribute to the efficiency of game-theoretical algorithms are time and game complexity. In this study, we have offered an elegant method to deal with high complexity of game theoretic multi-objective clustering methods in large-sized data sets. Here, we have developed a method which selects a subset of strategies from strategies profile for each player. In this case, the size of payoff matrices reduces significantly which has a remarkable impact on time complexity. Therefore, practical problems with more data are tractable with less computational complexity. ","authors_text":"Ali Hamzeh, Mahsa Badami, Sattar Hashemi","cross_cats":["cs.AI"],"headline":"","license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"cs.GT","submitted_at":"2012-08-15T14:58:55Z","title":"A Novel Strategy Selection Method for Multi-Objective Clustering Algorithms Using Game Theory"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1208.3432","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:4156711de6de118388b2d3c5137f5300a81fac99d7cdfaf49751a959000d309b","target":"record","created_at":"2026-05-18T02:25:05Z","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":"32f3d691b9b88d24f82aaef7af21551caa325902fa68b3df971fdbe1a7e1015b","cross_cats_sorted":["cs.AI"],"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"cs.GT","submitted_at":"2012-08-15T14:58:55Z","title_canon_sha256":"fd51f2b2d8bb906175a07bfc3d14996ad46699e459ec69eab6b76ed16039d051"},"schema_version":"1.0","source":{"id":"1208.3432","kind":"arxiv","version":1}},"canonical_sha256":"cac62209c9a7a41b2a1bb0ad378dd4431dbd37047dda917888967c1425904470","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"cac62209c9a7a41b2a1bb0ad378dd4431dbd37047dda917888967c1425904470","first_computed_at":"2026-05-18T02:25:05.971548Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:25:05.971548Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ZaWRj/VeVoPejTdbyH1Z0IHPe0Q0TplDNSvnYlAWRCKulsG9ya9hCxRtdoZY7u0r/qfXz0pE6t4sGjDREiByCg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:25:05.972057Z","signed_message":"canonical_sha256_bytes"},"source_id":"1208.3432","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4156711de6de118388b2d3c5137f5300a81fac99d7cdfaf49751a959000d309b","sha256:ae876f41e47cae6ecbf64a11bf65d687f4632ab7f02e374beea6c96d859a2673"],"state_sha256":"00d25b585fd3c70bef6f8d6fffc9ad9925a0b35a4e533bf255729634149591ba"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"owBQdEcXLekacKyBVH1JhLRJ9zOf/pTFW+oDYWQmUHiJW8g5Yb/JJ7YYmuwcR+AbrihdyR5ZfRI4VEKegs+vCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-23T07:26:58.146548Z","bundle_sha256":"4aae7ff773c9b7ffcb8abf3e2172f3749d033e80dd8b83002c89b6fcafc60a1d"}}