{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:XUYE4BVUOVO5CUQYAKE5IID7HL","short_pith_number":"pith:XUYE4BVU","canonical_record":{"source":{"id":"1610.09269","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-10-28T15:30:21Z","cross_cats_sorted":[],"title_canon_sha256":"2d71b6b7eff3139a480c99069c0b52e954fbaf292055689fa3e448ddf12106b5","abstract_canon_sha256":"02bf1e29e65e9231a2f3753db25000705cc6bcb0b93afd0973f3a4c870beacc5"},"schema_version":"1.0"},"canonical_sha256":"bd304e06b4755dd152180289d4207f3ad929045d4479bd183556a1af76ba53cc","source":{"kind":"arxiv","id":"1610.09269","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1610.09269","created_at":"2026-05-18T01:00:58Z"},{"alias_kind":"arxiv_version","alias_value":"1610.09269v1","created_at":"2026-05-18T01:00:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.09269","created_at":"2026-05-18T01:00:58Z"},{"alias_kind":"pith_short_12","alias_value":"XUYE4BVUOVO5","created_at":"2026-05-18T12:30:51Z"},{"alias_kind":"pith_short_16","alias_value":"XUYE4BVUOVO5CUQY","created_at":"2026-05-18T12:30:51Z"},{"alias_kind":"pith_short_8","alias_value":"XUYE4BVU","created_at":"2026-05-18T12:30:51Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:XUYE4BVUOVO5CUQYAKE5IID7HL","target":"record","payload":{"canonical_record":{"source":{"id":"1610.09269","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-10-28T15:30:21Z","cross_cats_sorted":[],"title_canon_sha256":"2d71b6b7eff3139a480c99069c0b52e954fbaf292055689fa3e448ddf12106b5","abstract_canon_sha256":"02bf1e29e65e9231a2f3753db25000705cc6bcb0b93afd0973f3a4c870beacc5"},"schema_version":"1.0"},"canonical_sha256":"bd304e06b4755dd152180289d4207f3ad929045d4479bd183556a1af76ba53cc","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:00:58.600028Z","signature_b64":"IPKcOd+9iw0yCRV2CwtT2WTEkEceMrOwRErcqJ7lj1Vguwdv5PDeRI2ahrweyWJMnHfceYhplfRSqR7qN02KCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bd304e06b4755dd152180289d4207f3ad929045d4479bd183556a1af76ba53cc","last_reissued_at":"2026-05-18T01:00:58.599527Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:00:58.599527Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1610.09269","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-18T01:00:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EbDufC5yExU8/2oFETHkx7TKD3Ku43RVw8nFRd2hqDk0wg6Hx9LNc7zALRD/aJyiVgQUGztUQy4UWQmIj3YpCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T23:11:04.953565Z"},"content_sha256":"538ed5e1b6ffc9ee2e1df5b014693c9ee60179ce83549cc25cbc4bc4be212b9d","schema_version":"1.0","event_id":"sha256:538ed5e1b6ffc9ee2e1df5b014693c9ee60179ce83549cc25cbc4bc4be212b9d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:XUYE4BVUOVO5CUQYAKE5IID7HL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Hierarchical Clustering via Spreading Metrics","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Aurko Roy, Sebastian Pokutta","submitted_at":"2016-10-28T15:30:21Z","abstract_excerpt":"We study the cost function for hierarchical clusterings introduced by [arXiv:1510.05043] where hierarchies are treated as first-class objects rather than deriving their cost from projections into flat clusters. It was also shown in [arXiv:1510.05043] that a top-down algorithm returns a hierarchical clustering of cost at most $O\\left(\\alpha_n \\log n\\right)$ times the cost of the optimal hierarchical clustering, where $\\alpha_n$ is the approximation ratio of the Sparsest Cut subroutine used. Thus using the best known approximation algorithm for Sparsest Cut due to Arora-Rao-Vazirani, the top dow"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.09269","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-18T01:00:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SIV3A8s2Pe75hxuusB4SCW/udK47Xh0S/zFEWRccM9E94fye6T7EY9fKjI6s9Nb2A7c8MxEDwHjKnerj/bB3Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T23:11:04.953909Z"},"content_sha256":"0b0cc2b8a3211587f6923f129f8181da6314ecc7f4581fef709242e6226db927","schema_version":"1.0","event_id":"sha256:0b0cc2b8a3211587f6923f129f8181da6314ecc7f4581fef709242e6226db927"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XUYE4BVUOVO5CUQYAKE5IID7HL/bundle.json","state_url":"https://pith.science/pith/XUYE4BVUOVO5CUQYAKE5IID7HL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XUYE4BVUOVO5CUQYAKE5IID7HL/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-07T23:11:04Z","links":{"resolver":"https://pith.science/pith/XUYE4BVUOVO5CUQYAKE5IID7HL","bundle":"https://pith.science/pith/XUYE4BVUOVO5CUQYAKE5IID7HL/bundle.json","state":"https://pith.science/pith/XUYE4BVUOVO5CUQYAKE5IID7HL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XUYE4BVUOVO5CUQYAKE5IID7HL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:XUYE4BVUOVO5CUQYAKE5IID7HL","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":"02bf1e29e65e9231a2f3753db25000705cc6bcb0b93afd0973f3a4c870beacc5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-10-28T15:30:21Z","title_canon_sha256":"2d71b6b7eff3139a480c99069c0b52e954fbaf292055689fa3e448ddf12106b5"},"schema_version":"1.0","source":{"id":"1610.09269","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1610.09269","created_at":"2026-05-18T01:00:58Z"},{"alias_kind":"arxiv_version","alias_value":"1610.09269v1","created_at":"2026-05-18T01:00:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.09269","created_at":"2026-05-18T01:00:58Z"},{"alias_kind":"pith_short_12","alias_value":"XUYE4BVUOVO5","created_at":"2026-05-18T12:30:51Z"},{"alias_kind":"pith_short_16","alias_value":"XUYE4BVUOVO5CUQY","created_at":"2026-05-18T12:30:51Z"},{"alias_kind":"pith_short_8","alias_value":"XUYE4BVU","created_at":"2026-05-18T12:30:51Z"}],"graph_snapshots":[{"event_id":"sha256:0b0cc2b8a3211587f6923f129f8181da6314ecc7f4581fef709242e6226db927","target":"graph","created_at":"2026-05-18T01:00:58Z","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 study the cost function for hierarchical clusterings introduced by [arXiv:1510.05043] where hierarchies are treated as first-class objects rather than deriving their cost from projections into flat clusters. It was also shown in [arXiv:1510.05043] that a top-down algorithm returns a hierarchical clustering of cost at most $O\\left(\\alpha_n \\log n\\right)$ times the cost of the optimal hierarchical clustering, where $\\alpha_n$ is the approximation ratio of the Sparsest Cut subroutine used. Thus using the best known approximation algorithm for Sparsest Cut due to Arora-Rao-Vazirani, the top dow","authors_text":"Aurko Roy, Sebastian Pokutta","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-10-28T15:30:21Z","title":"Hierarchical Clustering via Spreading Metrics"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.09269","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:538ed5e1b6ffc9ee2e1df5b014693c9ee60179ce83549cc25cbc4bc4be212b9d","target":"record","created_at":"2026-05-18T01:00:58Z","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":"02bf1e29e65e9231a2f3753db25000705cc6bcb0b93afd0973f3a4c870beacc5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-10-28T15:30:21Z","title_canon_sha256":"2d71b6b7eff3139a480c99069c0b52e954fbaf292055689fa3e448ddf12106b5"},"schema_version":"1.0","source":{"id":"1610.09269","kind":"arxiv","version":1}},"canonical_sha256":"bd304e06b4755dd152180289d4207f3ad929045d4479bd183556a1af76ba53cc","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"bd304e06b4755dd152180289d4207f3ad929045d4479bd183556a1af76ba53cc","first_computed_at":"2026-05-18T01:00:58.599527Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:00:58.599527Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"IPKcOd+9iw0yCRV2CwtT2WTEkEceMrOwRErcqJ7lj1Vguwdv5PDeRI2ahrweyWJMnHfceYhplfRSqR7qN02KCg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:00:58.600028Z","signed_message":"canonical_sha256_bytes"},"source_id":"1610.09269","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:538ed5e1b6ffc9ee2e1df5b014693c9ee60179ce83549cc25cbc4bc4be212b9d","sha256:0b0cc2b8a3211587f6923f129f8181da6314ecc7f4581fef709242e6226db927"],"state_sha256":"890da83b8d447f8bac47785b5734161446d528c64651381d3f131f39b450b788"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+WhiYhaOZCPUVguMTpChid8sfDqWRUdPTEXfrY0O8Q5B/B8cceaReLtNZOUqtAx1Zllqe9fGZGQ0tE+0XEt6Cg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T23:11:04.956867Z","bundle_sha256":"a8891394b94db7698a3abd8df36f99692092b323794b0983a0dc49f76edb867b"}}