{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:ZLDCECOJU6SBWKQ3WCWTPDOUIM","short_pith_number":"pith:ZLDCECOJ","schema_version":"1.0","canonical_sha256":"cac62209c9a7a41b2a1bb0ad378dd4431dbd37047dda917888967c1425904470","source":{"kind":"arxiv","id":"1208.3432","version":1},"attestation_state":"computed","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. "},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1208.3432","created_at":"2026-05-18T02:25:05.971631+00:00"},{"alias_kind":"arxiv_version","alias_value":"1208.3432v1","created_at":"2026-05-18T02:25:05.971631+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1208.3432","created_at":"2026-05-18T02:25:05.971631+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZLDCECOJU6SB","created_at":"2026-05-18T12:27:30.460161+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZLDCECOJU6SBWKQ3","created_at":"2026-05-18T12:27:30.460161+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZLDCECOJ","created_at":"2026-05-18T12:27:30.460161+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/ZLDCECOJU6SBWKQ3WCWTPDOUIM","json":"https://pith.science/pith/ZLDCECOJU6SBWKQ3WCWTPDOUIM.json","graph_json":"https://pith.science/api/pith-number/ZLDCECOJU6SBWKQ3WCWTPDOUIM/graph.json","events_json":"https://pith.science/api/pith-number/ZLDCECOJU6SBWKQ3WCWTPDOUIM/events.json","paper":"https://pith.science/paper/ZLDCECOJ"},"agent_actions":{"view_html":"https://pith.science/pith/ZLDCECOJU6SBWKQ3WCWTPDOUIM","download_json":"https://pith.science/pith/ZLDCECOJU6SBWKQ3WCWTPDOUIM.json","view_paper":"https://pith.science/paper/ZLDCECOJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1208.3432&json=true","fetch_graph":"https://pith.science/api/pith-number/ZLDCECOJU6SBWKQ3WCWTPDOUIM/graph.json","fetch_events":"https://pith.science/api/pith-number/ZLDCECOJU6SBWKQ3WCWTPDOUIM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZLDCECOJU6SBWKQ3WCWTPDOUIM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZLDCECOJU6SBWKQ3WCWTPDOUIM/action/storage_attestation","attest_author":"https://pith.science/pith/ZLDCECOJU6SBWKQ3WCWTPDOUIM/action/author_attestation","sign_citation":"https://pith.science/pith/ZLDCECOJU6SBWKQ3WCWTPDOUIM/action/citation_signature","submit_replication":"https://pith.science/pith/ZLDCECOJU6SBWKQ3WCWTPDOUIM/action/replication_record"}},"created_at":"2026-05-18T02:25:05.971631+00:00","updated_at":"2026-05-18T02:25:05.971631+00:00"}