{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:4I2UN5ZRL3SZOZPZD6J6CJEMUB","short_pith_number":"pith:4I2UN5ZR","canonical_record":{"source":{"id":"1109.2378","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2011-09-12T05:49:11Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"85c060be32bc1a426f52431916f1b54a479ba0bb1937f5654c9f3b4ffcb90f20","abstract_canon_sha256":"fbdbc5185596e25281a7dbffd5f82b60d1d81710e15995346679cead7c9cec79"},"schema_version":"1.0"},"canonical_sha256":"e23546f7315ee59765f91f93e1248ca071661366c72f0f824f4295294b545556","source":{"kind":"arxiv","id":"1109.2378","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1109.2378","created_at":"2026-05-18T04:13:37Z"},{"alias_kind":"arxiv_version","alias_value":"1109.2378v1","created_at":"2026-05-18T04:13:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1109.2378","created_at":"2026-05-18T04:13:37Z"},{"alias_kind":"pith_short_12","alias_value":"4I2UN5ZRL3SZ","created_at":"2026-05-18T12:26:20Z"},{"alias_kind":"pith_short_16","alias_value":"4I2UN5ZRL3SZOZPZ","created_at":"2026-05-18T12:26:20Z"},{"alias_kind":"pith_short_8","alias_value":"4I2UN5ZR","created_at":"2026-05-18T12:26:20Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:4I2UN5ZRL3SZOZPZD6J6CJEMUB","target":"record","payload":{"canonical_record":{"source":{"id":"1109.2378","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2011-09-12T05:49:11Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"85c060be32bc1a426f52431916f1b54a479ba0bb1937f5654c9f3b4ffcb90f20","abstract_canon_sha256":"fbdbc5185596e25281a7dbffd5f82b60d1d81710e15995346679cead7c9cec79"},"schema_version":"1.0"},"canonical_sha256":"e23546f7315ee59765f91f93e1248ca071661366c72f0f824f4295294b545556","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:13:37.820325Z","signature_b64":"PVWSiKpZ6pYjEGLTCGQrimvBlfal78VemkTYeHOTf6geNapFnlnP86X7ngf+QzWSU8jJhiJ0IjY6XzxGSgOUAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e23546f7315ee59765f91f93e1248ca071661366c72f0f824f4295294b545556","last_reissued_at":"2026-05-18T04:13:37.819571Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:13:37.819571Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1109.2378","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-18T04:13:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gu80UsRNvkkE4Fdo3wm2WLA6O9xcTZpaIvkKWApIBBFS1k9XigKbLnr6c7lTuOJvbuAKKzWs/sJUYNvhWHiyDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T10:44:41.695754Z"},"content_sha256":"f7f70829fcfd50f3cc9b8845063f9f977e7d6287c570a6d8cbd6bc1247159a08","schema_version":"1.0","event_id":"sha256:f7f70829fcfd50f3cc9b8845063f9f977e7d6287c570a6d8cbd6bc1247159a08"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:4I2UN5ZRL3SZOZPZD6J6CJEMUB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Modern hierarchical, agglomerative clustering algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"stat.ML","authors_text":"Daniel M\\\"ullner","submitted_at":"2011-09-12T05:49:11Z","abstract_excerpt":"This paper presents algorithms for hierarchical, agglomerative clustering which perform most efficiently in the general-purpose setup that is given in modern standard software. Requirements are: (1) the input data is given by pairwise dissimilarities between data points, but extensions to vector data are also discussed (2) the output is a \"stepwise dendrogram\", a data structure which is shared by all implementations in current standard software. We present algorithms (old and new) which perform clustering in this setting efficiently, both in an asymptotic worst-case analysis and from a practic"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1109.2378","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-18T04:13:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4PVQ5pzJi/6wVqDobjGMF3JvPqDuwsjTXnTcQEz0zAdpCz3UIfmMK5XGaJ6u8XI4Elx/H1Gfj3e4jfnqvcgvCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T10:44:41.696105Z"},"content_sha256":"58e9c5fc9f7a9887ecbb1ee15c3267c2dab73ed192ab947feafe936d0c4bd95b","schema_version":"1.0","event_id":"sha256:58e9c5fc9f7a9887ecbb1ee15c3267c2dab73ed192ab947feafe936d0c4bd95b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4I2UN5ZRL3SZOZPZD6J6CJEMUB/bundle.json","state_url":"https://pith.science/pith/4I2UN5ZRL3SZOZPZD6J6CJEMUB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4I2UN5ZRL3SZOZPZD6J6CJEMUB/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-05T10:44:41Z","links":{"resolver":"https://pith.science/pith/4I2UN5ZRL3SZOZPZD6J6CJEMUB","bundle":"https://pith.science/pith/4I2UN5ZRL3SZOZPZD6J6CJEMUB/bundle.json","state":"https://pith.science/pith/4I2UN5ZRL3SZOZPZD6J6CJEMUB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4I2UN5ZRL3SZOZPZD6J6CJEMUB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:4I2UN5ZRL3SZOZPZD6J6CJEMUB","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":"fbdbc5185596e25281a7dbffd5f82b60d1d81710e15995346679cead7c9cec79","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2011-09-12T05:49:11Z","title_canon_sha256":"85c060be32bc1a426f52431916f1b54a479ba0bb1937f5654c9f3b4ffcb90f20"},"schema_version":"1.0","source":{"id":"1109.2378","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1109.2378","created_at":"2026-05-18T04:13:37Z"},{"alias_kind":"arxiv_version","alias_value":"1109.2378v1","created_at":"2026-05-18T04:13:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1109.2378","created_at":"2026-05-18T04:13:37Z"},{"alias_kind":"pith_short_12","alias_value":"4I2UN5ZRL3SZ","created_at":"2026-05-18T12:26:20Z"},{"alias_kind":"pith_short_16","alias_value":"4I2UN5ZRL3SZOZPZ","created_at":"2026-05-18T12:26:20Z"},{"alias_kind":"pith_short_8","alias_value":"4I2UN5ZR","created_at":"2026-05-18T12:26:20Z"}],"graph_snapshots":[{"event_id":"sha256:58e9c5fc9f7a9887ecbb1ee15c3267c2dab73ed192ab947feafe936d0c4bd95b","target":"graph","created_at":"2026-05-18T04:13:37Z","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":"This paper presents algorithms for hierarchical, agglomerative clustering which perform most efficiently in the general-purpose setup that is given in modern standard software. Requirements are: (1) the input data is given by pairwise dissimilarities between data points, but extensions to vector data are also discussed (2) the output is a \"stepwise dendrogram\", a data structure which is shared by all implementations in current standard software. We present algorithms (old and new) which perform clustering in this setting efficiently, both in an asymptotic worst-case analysis and from a practic","authors_text":"Daniel M\\\"ullner","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2011-09-12T05:49:11Z","title":"Modern hierarchical, agglomerative clustering algorithms"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1109.2378","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:f7f70829fcfd50f3cc9b8845063f9f977e7d6287c570a6d8cbd6bc1247159a08","target":"record","created_at":"2026-05-18T04:13:37Z","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":"fbdbc5185596e25281a7dbffd5f82b60d1d81710e15995346679cead7c9cec79","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2011-09-12T05:49:11Z","title_canon_sha256":"85c060be32bc1a426f52431916f1b54a479ba0bb1937f5654c9f3b4ffcb90f20"},"schema_version":"1.0","source":{"id":"1109.2378","kind":"arxiv","version":1}},"canonical_sha256":"e23546f7315ee59765f91f93e1248ca071661366c72f0f824f4295294b545556","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e23546f7315ee59765f91f93e1248ca071661366c72f0f824f4295294b545556","first_computed_at":"2026-05-18T04:13:37.819571Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:13:37.819571Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"PVWSiKpZ6pYjEGLTCGQrimvBlfal78VemkTYeHOTf6geNapFnlnP86X7ngf+QzWSU8jJhiJ0IjY6XzxGSgOUAA==","signature_status":"signed_v1","signed_at":"2026-05-18T04:13:37.820325Z","signed_message":"canonical_sha256_bytes"},"source_id":"1109.2378","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f7f70829fcfd50f3cc9b8845063f9f977e7d6287c570a6d8cbd6bc1247159a08","sha256:58e9c5fc9f7a9887ecbb1ee15c3267c2dab73ed192ab947feafe936d0c4bd95b"],"state_sha256":"da8d63d1b035975206a7e40a3bec6ce6ce0c5d10198cdbe921185c4f4faa3a1b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yLbwgaT/QBsCEcA95LfEWwkLajssbRmtmpjFA/MpRdKDzwwoQGeNCtsHKz06Q9175vVf+4fZ4lsXkyZiKLb3Dg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T10:44:41.698074Z","bundle_sha256":"7763820390c212cec2f4c49fc8599a6d26f7914356cc1c986eb90d2ea9ae85c5"}}