{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:2W2XGJKORCWVP5LRI3HRHK2P74","short_pith_number":"pith:2W2XGJKO","canonical_record":{"source":{"id":"1201.1979","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2012-01-10T07:47:02Z","cross_cats_sorted":[],"title_canon_sha256":"f35aba602905600de24bc273f7061ef623e8f058978728d271c98466ec1ece0a","abstract_canon_sha256":"6c3c7c8291df772e9f52da77fc7bc62e397b78e1b1b72eafcfed04fdc259ec64"},"schema_version":"1.0"},"canonical_sha256":"d5b573254e88ad57f57146cf13ab4fff2220e94dc52e51629c128375e91e8d8c","source":{"kind":"arxiv","id":"1201.1979","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1201.1979","created_at":"2026-05-18T01:35:01Z"},{"alias_kind":"arxiv_version","alias_value":"1201.1979v4","created_at":"2026-05-18T01:35:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1201.1979","created_at":"2026-05-18T01:35:01Z"},{"alias_kind":"pith_short_12","alias_value":"2W2XGJKORCWV","created_at":"2026-05-18T12:26:50Z"},{"alias_kind":"pith_short_16","alias_value":"2W2XGJKORCWVP5LR","created_at":"2026-05-18T12:26:50Z"},{"alias_kind":"pith_short_8","alias_value":"2W2XGJKO","created_at":"2026-05-18T12:26:50Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:2W2XGJKORCWVP5LRI3HRHK2P74","target":"record","payload":{"canonical_record":{"source":{"id":"1201.1979","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2012-01-10T07:47:02Z","cross_cats_sorted":[],"title_canon_sha256":"f35aba602905600de24bc273f7061ef623e8f058978728d271c98466ec1ece0a","abstract_canon_sha256":"6c3c7c8291df772e9f52da77fc7bc62e397b78e1b1b72eafcfed04fdc259ec64"},"schema_version":"1.0"},"canonical_sha256":"d5b573254e88ad57f57146cf13ab4fff2220e94dc52e51629c128375e91e8d8c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:35:01.815195Z","signature_b64":"iYAQp8z5m55BcwhxC6SsqAc/QWvqaekAFFdfdkuwtvBddknZJC59wazSErksi4GAGb8Pmi5y2ibiDjEkqVlUBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d5b573254e88ad57f57146cf13ab4fff2220e94dc52e51629c128375e91e8d8c","last_reissued_at":"2026-05-18T01:35:01.814579Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:35:01.814579Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1201.1979","source_version":4,"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-18T01:35:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vbalBWJNjIP00FbwA1yxPvYMy5hLqHyOAqoRxzqkX830eUlW9C8QqmS+EV8QYiXuxmauVc58K9ZlWeUT32z2Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T22:55:47.664154Z"},"content_sha256":"0c3ce4e71f3844fd979af402f9fc055e624f25fbbac7b0039f46fe53201b7d17","schema_version":"1.0","event_id":"sha256:0c3ce4e71f3844fd979af402f9fc055e624f25fbbac7b0039f46fe53201b7d17"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:2W2XGJKORCWVP5LRI3HRHK2P74","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the strengths of the self-updating process clustering algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.ME","authors_text":"Shang-Ying Shiu, Ting-Li Chen","submitted_at":"2012-01-10T07:47:02Z","abstract_excerpt":"We introduce a simple, intuitive and yet powerful algorithm for clustering analysis. This algorithm is an iterative process on the sample space, which arises as an extension of the iteratively generated correlation matrices. It allows for both time-varying and time-invariant operators, therefore can be considered more general than the blurring mean-shift algorithm in which operators are time-invariant. The algorithm stands from the viewpoint of data points and simulates the process how data points move and perform self-clustering, therefore is named Self-Updating Process (SUP). It is particula"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1201.1979","kind":"arxiv","version":4},"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-18T01:35:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RieE54ALRececziQUhgTHF4sJwmiisLYSFhDoWJpbZaXwkAmm1phkxo3HVXI3yUvVA+jR0zq/2AEtNLuDFL2BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T22:55:47.664655Z"},"content_sha256":"579f1f3111f4ba46374b9ce63d4e1064a2adc57b4a57adecc9f74867276925d6","schema_version":"1.0","event_id":"sha256:579f1f3111f4ba46374b9ce63d4e1064a2adc57b4a57adecc9f74867276925d6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2W2XGJKORCWVP5LRI3HRHK2P74/bundle.json","state_url":"https://pith.science/pith/2W2XGJKORCWVP5LRI3HRHK2P74/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2W2XGJKORCWVP5LRI3HRHK2P74/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-10T22:55:47Z","links":{"resolver":"https://pith.science/pith/2W2XGJKORCWVP5LRI3HRHK2P74","bundle":"https://pith.science/pith/2W2XGJKORCWVP5LRI3HRHK2P74/bundle.json","state":"https://pith.science/pith/2W2XGJKORCWVP5LRI3HRHK2P74/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2W2XGJKORCWVP5LRI3HRHK2P74/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:2W2XGJKORCWVP5LRI3HRHK2P74","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":"6c3c7c8291df772e9f52da77fc7bc62e397b78e1b1b72eafcfed04fdc259ec64","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2012-01-10T07:47:02Z","title_canon_sha256":"f35aba602905600de24bc273f7061ef623e8f058978728d271c98466ec1ece0a"},"schema_version":"1.0","source":{"id":"1201.1979","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1201.1979","created_at":"2026-05-18T01:35:01Z"},{"alias_kind":"arxiv_version","alias_value":"1201.1979v4","created_at":"2026-05-18T01:35:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1201.1979","created_at":"2026-05-18T01:35:01Z"},{"alias_kind":"pith_short_12","alias_value":"2W2XGJKORCWV","created_at":"2026-05-18T12:26:50Z"},{"alias_kind":"pith_short_16","alias_value":"2W2XGJKORCWVP5LR","created_at":"2026-05-18T12:26:50Z"},{"alias_kind":"pith_short_8","alias_value":"2W2XGJKO","created_at":"2026-05-18T12:26:50Z"}],"graph_snapshots":[{"event_id":"sha256:579f1f3111f4ba46374b9ce63d4e1064a2adc57b4a57adecc9f74867276925d6","target":"graph","created_at":"2026-05-18T01:35:01Z","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":"We introduce a simple, intuitive and yet powerful algorithm for clustering analysis. This algorithm is an iterative process on the sample space, which arises as an extension of the iteratively generated correlation matrices. It allows for both time-varying and time-invariant operators, therefore can be considered more general than the blurring mean-shift algorithm in which operators are time-invariant. The algorithm stands from the viewpoint of data points and simulates the process how data points move and perform self-clustering, therefore is named Self-Updating Process (SUP). It is particula","authors_text":"Shang-Ying Shiu, Ting-Li Chen","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2012-01-10T07:47:02Z","title":"On the strengths of the self-updating process clustering algorithm"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1201.1979","kind":"arxiv","version":4},"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:0c3ce4e71f3844fd979af402f9fc055e624f25fbbac7b0039f46fe53201b7d17","target":"record","created_at":"2026-05-18T01:35:01Z","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":"6c3c7c8291df772e9f52da77fc7bc62e397b78e1b1b72eafcfed04fdc259ec64","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2012-01-10T07:47:02Z","title_canon_sha256":"f35aba602905600de24bc273f7061ef623e8f058978728d271c98466ec1ece0a"},"schema_version":"1.0","source":{"id":"1201.1979","kind":"arxiv","version":4}},"canonical_sha256":"d5b573254e88ad57f57146cf13ab4fff2220e94dc52e51629c128375e91e8d8c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d5b573254e88ad57f57146cf13ab4fff2220e94dc52e51629c128375e91e8d8c","first_computed_at":"2026-05-18T01:35:01.814579Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:35:01.814579Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"iYAQp8z5m55BcwhxC6SsqAc/QWvqaekAFFdfdkuwtvBddknZJC59wazSErksi4GAGb8Pmi5y2ibiDjEkqVlUBw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:35:01.815195Z","signed_message":"canonical_sha256_bytes"},"source_id":"1201.1979","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0c3ce4e71f3844fd979af402f9fc055e624f25fbbac7b0039f46fe53201b7d17","sha256:579f1f3111f4ba46374b9ce63d4e1064a2adc57b4a57adecc9f74867276925d6"],"state_sha256":"be85f53d44a97353fb7f617c843719598973efd31f66e61dcecb4189e4c4a765"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6bclehZNUziiTcSDN3YHrMBRiowPF8dTwNOFm/SfzkXtMmOcPzEH+tq6zYsZkifJgO1VY4srzEEECniaTIV2AQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-10T22:55:47.667303Z","bundle_sha256":"bb16e366308400746ae22842381ec6919796484fcb9f0201db8a9e0d49a0fe52"}}