{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:22XPIUEIOYY4Q3EY6RSQBB2OZU","short_pith_number":"pith:22XPIUEI","canonical_record":{"source":{"id":"1703.02883","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2017-03-08T15:50:35Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"c43e7e0530d849c4c84cf53cd53483260cc034eb4061bd4b0e891d7cb4733b32","abstract_canon_sha256":"70a30411e991484f73746e44cc673b3cb69078494c70aba44e3cac1db983e4ee"},"schema_version":"1.0"},"canonical_sha256":"d6aef450887631c86c98f46500874ecd38f2bd5d8ddfe784b0985b975ede151c","source":{"kind":"arxiv","id":"1703.02883","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1703.02883","created_at":"2026-05-18T00:49:05Z"},{"alias_kind":"arxiv_version","alias_value":"1703.02883v1","created_at":"2026-05-18T00:49:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.02883","created_at":"2026-05-18T00:49:05Z"},{"alias_kind":"pith_short_12","alias_value":"22XPIUEIOYY4","created_at":"2026-05-18T12:30:55Z"},{"alias_kind":"pith_short_16","alias_value":"22XPIUEIOYY4Q3EY","created_at":"2026-05-18T12:30:55Z"},{"alias_kind":"pith_short_8","alias_value":"22XPIUEI","created_at":"2026-05-18T12:30:55Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:22XPIUEIOYY4Q3EY6RSQBB2OZU","target":"record","payload":{"canonical_record":{"source":{"id":"1703.02883","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2017-03-08T15:50:35Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"c43e7e0530d849c4c84cf53cd53483260cc034eb4061bd4b0e891d7cb4733b32","abstract_canon_sha256":"70a30411e991484f73746e44cc673b3cb69078494c70aba44e3cac1db983e4ee"},"schema_version":"1.0"},"canonical_sha256":"d6aef450887631c86c98f46500874ecd38f2bd5d8ddfe784b0985b975ede151c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:49:05.411241Z","signature_b64":"db0Ppl2c311R975yzsrQjsmIortkFL0HusTo3nWnjceLa3MnMA0nOpHKbBTDTG0Hcbme+e1vn2gpQ3NlBEqlDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d6aef450887631c86c98f46500874ecd38f2bd5d8ddfe784b0985b975ede151c","last_reissued_at":"2026-05-18T00:49:05.410694Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:49:05.410694Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1703.02883","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-18T00:49:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sEm9AHAxNIg8tyI6hzKjdv0R8n2qZzkf+EhWOzs1dVkCnX8ZfxOWnOw29JkjB7LGU+naBYRTdL9JRQOgawJJCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-02T12:34:21.780993Z"},"content_sha256":"d1b6b970a74987e2d5c9d3e42c402da8ab774068c0c43224fd91649d677a7475","schema_version":"1.0","event_id":"sha256:d1b6b970a74987e2d5c9d3e42c402da8ab774068c0c43224fd91649d677a7475"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:22XPIUEIOYY4Q3EY6RSQBB2OZU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Memory Enriched Big Bang Big Crunch Optimization Algorithm for Data Clustering","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.AI","authors_text":"Hadi Veisi, Hadi Zare, Hossein Bobarshad, Kayvan Bijari","submitted_at":"2017-03-08T15:50:35Z","abstract_excerpt":"Cluster analysis plays an important role in decision making process for many knowledge-based systems. There exist a wide variety of different approaches for clustering applications including the heuristic techniques, probabilistic models, and traditional hierarchical algorithms. In this paper, a novel heuristic approach based on big bang-big crunch algorithm is proposed for clustering problems. The proposed method not only takes advantage of heuristic nature to alleviate typical clustering algorithms such as k-means, but it also benefits from the memory based scheme as compared to its similar "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.02883","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-18T00:49:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DVYHs1LuV8Ys9ezWm5LT2PZXz6pUmVOJSs47ko8hhLiODnld/SkLH/4RkaQAQ4zwIc12M77ZO1ZWxINaS4nGAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-02T12:34:21.781350Z"},"content_sha256":"c382e61f0d5b84c098020321f49f5021c45c0e4fda217ce19b5a4ba7463644a0","schema_version":"1.0","event_id":"sha256:c382e61f0d5b84c098020321f49f5021c45c0e4fda217ce19b5a4ba7463644a0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/22XPIUEIOYY4Q3EY6RSQBB2OZU/bundle.json","state_url":"https://pith.science/pith/22XPIUEIOYY4Q3EY6RSQBB2OZU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/22XPIUEIOYY4Q3EY6RSQBB2OZU/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-07-02T12:34:21Z","links":{"resolver":"https://pith.science/pith/22XPIUEIOYY4Q3EY6RSQBB2OZU","bundle":"https://pith.science/pith/22XPIUEIOYY4Q3EY6RSQBB2OZU/bundle.json","state":"https://pith.science/pith/22XPIUEIOYY4Q3EY6RSQBB2OZU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/22XPIUEIOYY4Q3EY6RSQBB2OZU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:22XPIUEIOYY4Q3EY6RSQBB2OZU","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":"70a30411e991484f73746e44cc673b3cb69078494c70aba44e3cac1db983e4ee","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2017-03-08T15:50:35Z","title_canon_sha256":"c43e7e0530d849c4c84cf53cd53483260cc034eb4061bd4b0e891d7cb4733b32"},"schema_version":"1.0","source":{"id":"1703.02883","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1703.02883","created_at":"2026-05-18T00:49:05Z"},{"alias_kind":"arxiv_version","alias_value":"1703.02883v1","created_at":"2026-05-18T00:49:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.02883","created_at":"2026-05-18T00:49:05Z"},{"alias_kind":"pith_short_12","alias_value":"22XPIUEIOYY4","created_at":"2026-05-18T12:30:55Z"},{"alias_kind":"pith_short_16","alias_value":"22XPIUEIOYY4Q3EY","created_at":"2026-05-18T12:30:55Z"},{"alias_kind":"pith_short_8","alias_value":"22XPIUEI","created_at":"2026-05-18T12:30:55Z"}],"graph_snapshots":[{"event_id":"sha256:c382e61f0d5b84c098020321f49f5021c45c0e4fda217ce19b5a4ba7463644a0","target":"graph","created_at":"2026-05-18T00:49: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":"Cluster analysis plays an important role in decision making process for many knowledge-based systems. There exist a wide variety of different approaches for clustering applications including the heuristic techniques, probabilistic models, and traditional hierarchical algorithms. In this paper, a novel heuristic approach based on big bang-big crunch algorithm is proposed for clustering problems. The proposed method not only takes advantage of heuristic nature to alleviate typical clustering algorithms such as k-means, but it also benefits from the memory based scheme as compared to its similar ","authors_text":"Hadi Veisi, Hadi Zare, Hossein Bobarshad, Kayvan Bijari","cross_cats":["cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2017-03-08T15:50:35Z","title":"Memory Enriched Big Bang Big Crunch Optimization Algorithm for Data Clustering"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.02883","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:d1b6b970a74987e2d5c9d3e42c402da8ab774068c0c43224fd91649d677a7475","target":"record","created_at":"2026-05-18T00:49: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":"70a30411e991484f73746e44cc673b3cb69078494c70aba44e3cac1db983e4ee","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2017-03-08T15:50:35Z","title_canon_sha256":"c43e7e0530d849c4c84cf53cd53483260cc034eb4061bd4b0e891d7cb4733b32"},"schema_version":"1.0","source":{"id":"1703.02883","kind":"arxiv","version":1}},"canonical_sha256":"d6aef450887631c86c98f46500874ecd38f2bd5d8ddfe784b0985b975ede151c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d6aef450887631c86c98f46500874ecd38f2bd5d8ddfe784b0985b975ede151c","first_computed_at":"2026-05-18T00:49:05.410694Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:49:05.410694Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"db0Ppl2c311R975yzsrQjsmIortkFL0HusTo3nWnjceLa3MnMA0nOpHKbBTDTG0Hcbme+e1vn2gpQ3NlBEqlDw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:49:05.411241Z","signed_message":"canonical_sha256_bytes"},"source_id":"1703.02883","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d1b6b970a74987e2d5c9d3e42c402da8ab774068c0c43224fd91649d677a7475","sha256:c382e61f0d5b84c098020321f49f5021c45c0e4fda217ce19b5a4ba7463644a0"],"state_sha256":"ab32a87c842e3ee54fb48c33bf5c1cbc622de061bea03cbc4a9c1fc5fc29202c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QyOxMVSqx//YECUM1147cNPN4d7YUuBICqHaT8gomS8ce3CnE/2lY6mSaTiQ+YlE4naQTg6u3/wPrFhy8PjSBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-02T12:34:21.783397Z","bundle_sha256":"3896cfdcdbbed0a4cecb20065aa3954037e56e454aeaebd4e1f0ea578c15a104"}}