{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:TUQGFFF6K44GZPWTQV2USEIIXN","short_pith_number":"pith:TUQGFFF6","canonical_record":{"source":{"id":"1104.0651","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2011-04-04T19:04:25Z","cross_cats_sorted":[],"title_canon_sha256":"2f971afc68db658826920362173563487507a496484796b182ade526b39ba277","abstract_canon_sha256":"3b98c7c1ba2d051116c5097a743af899be132541113ec9835a2d5693cf4e126a"},"schema_version":"1.0"},"canonical_sha256":"9d206294be57386cbed38575491108bb5a9c27ab3cf2fa766f2a61127d205bc2","source":{"kind":"arxiv","id":"1104.0651","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1104.0651","created_at":"2026-05-18T04:17:24Z"},{"alias_kind":"arxiv_version","alias_value":"1104.0651v3","created_at":"2026-05-18T04:17:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1104.0651","created_at":"2026-05-18T04:17:24Z"},{"alias_kind":"pith_short_12","alias_value":"TUQGFFF6K44G","created_at":"2026-05-18T12:26:42Z"},{"alias_kind":"pith_short_16","alias_value":"TUQGFFF6K44GZPWT","created_at":"2026-05-18T12:26:42Z"},{"alias_kind":"pith_short_8","alias_value":"TUQGFFF6","created_at":"2026-05-18T12:26:42Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:TUQGFFF6K44GZPWTQV2USEIIXN","target":"record","payload":{"canonical_record":{"source":{"id":"1104.0651","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2011-04-04T19:04:25Z","cross_cats_sorted":[],"title_canon_sha256":"2f971afc68db658826920362173563487507a496484796b182ade526b39ba277","abstract_canon_sha256":"3b98c7c1ba2d051116c5097a743af899be132541113ec9835a2d5693cf4e126a"},"schema_version":"1.0"},"canonical_sha256":"9d206294be57386cbed38575491108bb5a9c27ab3cf2fa766f2a61127d205bc2","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:17:24.800711Z","signature_b64":"2DEk7qZm3R6+m2vPi3CiZnFVnoaz/0Qh3OlMCTzdv/wqQUpMUO1TNvbFUDZAOfnRXtxxdRmBaYvyonv0P8J4Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9d206294be57386cbed38575491108bb5a9c27ab3cf2fa766f2a61127d205bc2","last_reissued_at":"2026-05-18T04:17:24.799930Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:17:24.799930Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1104.0651","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-18T04:17:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"evaGFYVqiRez84IsPhLFN2vLBmP3B5zOMzRs7hrf8Apwro9+q8gVaH+4stPwsfhae5H0v22kIkp54/7/yjT7Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T13:32:21.076145Z"},"content_sha256":"7aa0c74addabbb85a5c096aca893f6a869d378fc334c9dd3152276799f414eeb","schema_version":"1.0","event_id":"sha256:7aa0c74addabbb85a5c096aca893f6a869d378fc334c9dd3152276799f414eeb"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:TUQGFFF6K44GZPWTQV2USEIIXN","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Meaningful Clustered Forest: an Automatic and Robust Clustering Algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Andr\\'es Almansa, Mariano Tepper, Pablo Mus\\'e","submitted_at":"2011-04-04T19:04:25Z","abstract_excerpt":"We propose a new clustering technique that can be regarded as a numerical method to compute the proximity gestalt. The method analyzes edge length statistics in the MST of the dataset and provides an a contrario cluster detection criterion. The approach is fully parametric on the chosen distance and can detect arbitrarily shaped clusters. The method is also automatic, in the sense that only a single parameter is left to the user. This parameter has an intuitive interpretation as it controls the expected number of false detections. We show that the iterative application of our method can (1) pr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1104.0651","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-18T04:17:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"J6aX6PHwYDQGgHZ6T3XLbs91KFld5f1GcfUds+FRRdJ/j/uc7IFRq/jUVX+3GLfOXLedXvEytfa7deCqaxVmDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T13:32:21.076502Z"},"content_sha256":"e86c09c05ba2e5106a88bf61da02e97293d6bd5214b3893469309597125c37ec","schema_version":"1.0","event_id":"sha256:e86c09c05ba2e5106a88bf61da02e97293d6bd5214b3893469309597125c37ec"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TUQGFFF6K44GZPWTQV2USEIIXN/bundle.json","state_url":"https://pith.science/pith/TUQGFFF6K44GZPWTQV2USEIIXN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TUQGFFF6K44GZPWTQV2USEIIXN/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-27T13:32:21Z","links":{"resolver":"https://pith.science/pith/TUQGFFF6K44GZPWTQV2USEIIXN","bundle":"https://pith.science/pith/TUQGFFF6K44GZPWTQV2USEIIXN/bundle.json","state":"https://pith.science/pith/TUQGFFF6K44GZPWTQV2USEIIXN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TUQGFFF6K44GZPWTQV2USEIIXN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:TUQGFFF6K44GZPWTQV2USEIIXN","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":"3b98c7c1ba2d051116c5097a743af899be132541113ec9835a2d5693cf4e126a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2011-04-04T19:04:25Z","title_canon_sha256":"2f971afc68db658826920362173563487507a496484796b182ade526b39ba277"},"schema_version":"1.0","source":{"id":"1104.0651","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1104.0651","created_at":"2026-05-18T04:17:24Z"},{"alias_kind":"arxiv_version","alias_value":"1104.0651v3","created_at":"2026-05-18T04:17:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1104.0651","created_at":"2026-05-18T04:17:24Z"},{"alias_kind":"pith_short_12","alias_value":"TUQGFFF6K44G","created_at":"2026-05-18T12:26:42Z"},{"alias_kind":"pith_short_16","alias_value":"TUQGFFF6K44GZPWT","created_at":"2026-05-18T12:26:42Z"},{"alias_kind":"pith_short_8","alias_value":"TUQGFFF6","created_at":"2026-05-18T12:26:42Z"}],"graph_snapshots":[{"event_id":"sha256:e86c09c05ba2e5106a88bf61da02e97293d6bd5214b3893469309597125c37ec","target":"graph","created_at":"2026-05-18T04:17:24Z","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 propose a new clustering technique that can be regarded as a numerical method to compute the proximity gestalt. The method analyzes edge length statistics in the MST of the dataset and provides an a contrario cluster detection criterion. The approach is fully parametric on the chosen distance and can detect arbitrarily shaped clusters. The method is also automatic, in the sense that only a single parameter is left to the user. This parameter has an intuitive interpretation as it controls the expected number of false detections. We show that the iterative application of our method can (1) pr","authors_text":"Andr\\'es Almansa, Mariano Tepper, Pablo Mus\\'e","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2011-04-04T19:04:25Z","title":"Meaningful Clustered Forest: an Automatic and Robust Clustering Algorithm"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1104.0651","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:7aa0c74addabbb85a5c096aca893f6a869d378fc334c9dd3152276799f414eeb","target":"record","created_at":"2026-05-18T04:17:24Z","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":"3b98c7c1ba2d051116c5097a743af899be132541113ec9835a2d5693cf4e126a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2011-04-04T19:04:25Z","title_canon_sha256":"2f971afc68db658826920362173563487507a496484796b182ade526b39ba277"},"schema_version":"1.0","source":{"id":"1104.0651","kind":"arxiv","version":3}},"canonical_sha256":"9d206294be57386cbed38575491108bb5a9c27ab3cf2fa766f2a61127d205bc2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9d206294be57386cbed38575491108bb5a9c27ab3cf2fa766f2a61127d205bc2","first_computed_at":"2026-05-18T04:17:24.799930Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:17:24.799930Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"2DEk7qZm3R6+m2vPi3CiZnFVnoaz/0Qh3OlMCTzdv/wqQUpMUO1TNvbFUDZAOfnRXtxxdRmBaYvyonv0P8J4Bw==","signature_status":"signed_v1","signed_at":"2026-05-18T04:17:24.800711Z","signed_message":"canonical_sha256_bytes"},"source_id":"1104.0651","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7aa0c74addabbb85a5c096aca893f6a869d378fc334c9dd3152276799f414eeb","sha256:e86c09c05ba2e5106a88bf61da02e97293d6bd5214b3893469309597125c37ec"],"state_sha256":"4b1ec579f0239259a20027ad04c097c6bf40fcf4b124b757098a71c87df2e014"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"l8XORBuxGLsAQ2vUHEsZzf8upyiu4okP/YC8zPJLBPsAVQrpjyDiUdEzyR9z6BeHgvToNXPvIv8l7UoX44HnBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-27T13:32:21.078515Z","bundle_sha256":"051ebe4504eafef2f1aac88a427364ba00a27d82a5d2d31422bf80245718737c"}}