{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:IEVQPZBQ63PIJJOTZQPFX5ZLNG","short_pith_number":"pith:IEVQPZBQ","canonical_record":{"source":{"id":"1101.4179","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2011-01-21T16:48:51Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"8203c1a6147e909f2cb1473745be8ad6a3ec78b5dc9fd2635c7875dda36fb5ea","abstract_canon_sha256":"e19ea109f97dc0849ffd650a1d27ff5d832a97695509ebddac2cdb9da7d9838c"},"schema_version":"1.0"},"canonical_sha256":"412b07e430f6de84a5d3cc1e5bf72b698eec8693335791ff32dd746c4dc03182","source":{"kind":"arxiv","id":"1101.4179","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1101.4179","created_at":"2026-05-18T02:22:50Z"},{"alias_kind":"arxiv_version","alias_value":"1101.4179v3","created_at":"2026-05-18T02:22:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1101.4179","created_at":"2026-05-18T02:22:50Z"},{"alias_kind":"pith_short_12","alias_value":"IEVQPZBQ63PI","created_at":"2026-05-18T12:26:30Z"},{"alias_kind":"pith_short_16","alias_value":"IEVQPZBQ63PIJJOT","created_at":"2026-05-18T12:26:30Z"},{"alias_kind":"pith_short_8","alias_value":"IEVQPZBQ","created_at":"2026-05-18T12:26:30Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:IEVQPZBQ63PIJJOTZQPFX5ZLNG","target":"record","payload":{"canonical_record":{"source":{"id":"1101.4179","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2011-01-21T16:48:51Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"8203c1a6147e909f2cb1473745be8ad6a3ec78b5dc9fd2635c7875dda36fb5ea","abstract_canon_sha256":"e19ea109f97dc0849ffd650a1d27ff5d832a97695509ebddac2cdb9da7d9838c"},"schema_version":"1.0"},"canonical_sha256":"412b07e430f6de84a5d3cc1e5bf72b698eec8693335791ff32dd746c4dc03182","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:22:50.654159Z","signature_b64":"zcWXavf+cgj9knRx8aXLJIKPO46+qGuYhYaLo4XiDNZun6exeVU3XB2T3IqobvKeDHhSPDDkZbFuil3Y2A9gBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"412b07e430f6de84a5d3cc1e5bf72b698eec8693335791ff32dd746c4dc03182","last_reissued_at":"2026-05-18T02:22:50.653584Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:22:50.653584Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1101.4179","source_version":3,"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:22:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NRV83Pb1rcdpQ2WfI5Zewvwhi+y06C+tp/hNGBIeYFL4w/DaO5IT9zCSlrowNKthYhEprODJbZUexhUoicI9Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T09:41:47.996235Z"},"content_sha256":"b6685b17f9d3e13bce4104f75350a456594b8d1365bc244f63895f2e928573c7","schema_version":"1.0","event_id":"sha256:b6685b17f9d3e13bce4104f75350a456594b8d1365bc244f63895f2e928573c7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:IEVQPZBQ63PIJJOTZQPFX5ZLNG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A fast and recursive algorithm for clustering large datasets with $k$-medians","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"stat.CO","authors_text":"Herv\\'e Cardot, Jean-Marie Monnez, Peggy C\\'enac","submitted_at":"2011-01-21T16:48:51Z","abstract_excerpt":"Clustering with fast algorithms large samples of high dimensional data is an important challenge in computational statistics. Borrowing ideas from MacQueen (1967) who introduced a sequential version of the $k$-means algorithm, a new class of recursive stochastic gradient algorithms designed for the $k$-medians loss criterion is proposed. By their recursive nature, these algorithms are very fast and are well adapted to deal with large samples of data that are allowed to arrive sequentially. It is proved that the stochastic gradient algorithm converges almost surely to the set of stationary poin"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1101.4179","kind":"arxiv","version":3},"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:22:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4T/PLKhshp1BJwadYPMeNZRCslc6cWkjIYW2pieMyKLcXYslRFIRavW9JXy+nRq8vQY14YWIjgwOr/5l0779AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T09:41:47.996625Z"},"content_sha256":"69bf770a00e6d0c2f3e1a2565a1e7b8171b3667358c248f865df95b4fc2c3dd0","schema_version":"1.0","event_id":"sha256:69bf770a00e6d0c2f3e1a2565a1e7b8171b3667358c248f865df95b4fc2c3dd0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IEVQPZBQ63PIJJOTZQPFX5ZLNG/bundle.json","state_url":"https://pith.science/pith/IEVQPZBQ63PIJJOTZQPFX5ZLNG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IEVQPZBQ63PIJJOTZQPFX5ZLNG/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-05-26T09:41:47Z","links":{"resolver":"https://pith.science/pith/IEVQPZBQ63PIJJOTZQPFX5ZLNG","bundle":"https://pith.science/pith/IEVQPZBQ63PIJJOTZQPFX5ZLNG/bundle.json","state":"https://pith.science/pith/IEVQPZBQ63PIJJOTZQPFX5ZLNG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IEVQPZBQ63PIJJOTZQPFX5ZLNG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:IEVQPZBQ63PIJJOTZQPFX5ZLNG","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":"e19ea109f97dc0849ffd650a1d27ff5d832a97695509ebddac2cdb9da7d9838c","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2011-01-21T16:48:51Z","title_canon_sha256":"8203c1a6147e909f2cb1473745be8ad6a3ec78b5dc9fd2635c7875dda36fb5ea"},"schema_version":"1.0","source":{"id":"1101.4179","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1101.4179","created_at":"2026-05-18T02:22:50Z"},{"alias_kind":"arxiv_version","alias_value":"1101.4179v3","created_at":"2026-05-18T02:22:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1101.4179","created_at":"2026-05-18T02:22:50Z"},{"alias_kind":"pith_short_12","alias_value":"IEVQPZBQ63PI","created_at":"2026-05-18T12:26:30Z"},{"alias_kind":"pith_short_16","alias_value":"IEVQPZBQ63PIJJOT","created_at":"2026-05-18T12:26:30Z"},{"alias_kind":"pith_short_8","alias_value":"IEVQPZBQ","created_at":"2026-05-18T12:26:30Z"}],"graph_snapshots":[{"event_id":"sha256:69bf770a00e6d0c2f3e1a2565a1e7b8171b3667358c248f865df95b4fc2c3dd0","target":"graph","created_at":"2026-05-18T02:22:50Z","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":"Clustering with fast algorithms large samples of high dimensional data is an important challenge in computational statistics. Borrowing ideas from MacQueen (1967) who introduced a sequential version of the $k$-means algorithm, a new class of recursive stochastic gradient algorithms designed for the $k$-medians loss criterion is proposed. By their recursive nature, these algorithms are very fast and are well adapted to deal with large samples of data that are allowed to arrive sequentially. It is proved that the stochastic gradient algorithm converges almost surely to the set of stationary poin","authors_text":"Herv\\'e Cardot, Jean-Marie Monnez, Peggy C\\'enac","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2011-01-21T16:48:51Z","title":"A fast and recursive algorithm for clustering large datasets with $k$-medians"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1101.4179","kind":"arxiv","version":3},"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:b6685b17f9d3e13bce4104f75350a456594b8d1365bc244f63895f2e928573c7","target":"record","created_at":"2026-05-18T02:22:50Z","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":"e19ea109f97dc0849ffd650a1d27ff5d832a97695509ebddac2cdb9da7d9838c","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2011-01-21T16:48:51Z","title_canon_sha256":"8203c1a6147e909f2cb1473745be8ad6a3ec78b5dc9fd2635c7875dda36fb5ea"},"schema_version":"1.0","source":{"id":"1101.4179","kind":"arxiv","version":3}},"canonical_sha256":"412b07e430f6de84a5d3cc1e5bf72b698eec8693335791ff32dd746c4dc03182","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"412b07e430f6de84a5d3cc1e5bf72b698eec8693335791ff32dd746c4dc03182","first_computed_at":"2026-05-18T02:22:50.653584Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:22:50.653584Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"zcWXavf+cgj9knRx8aXLJIKPO46+qGuYhYaLo4XiDNZun6exeVU3XB2T3IqobvKeDHhSPDDkZbFuil3Y2A9gBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:22:50.654159Z","signed_message":"canonical_sha256_bytes"},"source_id":"1101.4179","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b6685b17f9d3e13bce4104f75350a456594b8d1365bc244f63895f2e928573c7","sha256:69bf770a00e6d0c2f3e1a2565a1e7b8171b3667358c248f865df95b4fc2c3dd0"],"state_sha256":"833f3c1307951a43ba5eb73046816d6024bfcf54bd4b99271e97a5907d33202b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/U7ZjfSrBt7gjB0erFZRSkP7hxoSrAKL1xFoA54xc/jesmnytpTQ2yoc8YBkodeVetV0UY9p7LlQ8hbqPnlYCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T09:41:47.999330Z","bundle_sha256":"6acc0248f002da4f2627d40ff2795f02a81b5ae7baf487d790978d500d621066"}}