{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:NZEAY7GSZM5EKZE4ZLV3EA2VDO","short_pith_number":"pith:NZEAY7GS","canonical_record":{"source":{"id":"2506.05495","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2025-06-05T18:22:40Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"b59a10bb43bd305465588b858f3bcde2c477e409e5929c020f1f9de86205160c","abstract_canon_sha256":"9cfc2d65e1c57569bf659ea5608348e36ca4111d8482d09ac6abc7420232e0b3"},"schema_version":"1.0"},"canonical_sha256":"6e480c7cd2cb3a45649ccaebb203551bbbc14812f053c2d8c936830fa7e63c86","source":{"kind":"arxiv","id":"2506.05495","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2506.05495","created_at":"2026-07-05T11:17:03Z"},{"alias_kind":"arxiv_version","alias_value":"2506.05495v1","created_at":"2026-07-05T11:17:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.05495","created_at":"2026-07-05T11:17:03Z"},{"alias_kind":"pith_short_12","alias_value":"NZEAY7GSZM5E","created_at":"2026-07-05T11:17:03Z"},{"alias_kind":"pith_short_16","alias_value":"NZEAY7GSZM5EKZE4","created_at":"2026-07-05T11:17:03Z"},{"alias_kind":"pith_short_8","alias_value":"NZEAY7GS","created_at":"2026-07-05T11:17:03Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:NZEAY7GSZM5EKZE4ZLV3EA2VDO","target":"record","payload":{"canonical_record":{"source":{"id":"2506.05495","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2025-06-05T18:22:40Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"b59a10bb43bd305465588b858f3bcde2c477e409e5929c020f1f9de86205160c","abstract_canon_sha256":"9cfc2d65e1c57569bf659ea5608348e36ca4111d8482d09ac6abc7420232e0b3"},"schema_version":"1.0"},"canonical_sha256":"6e480c7cd2cb3a45649ccaebb203551bbbc14812f053c2d8c936830fa7e63c86","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:17:03.723428Z","signature_b64":"ny0P3fqWfeq7VP+r2Qz81FcPLVWrXd4rKRh/AITr4Sfk25YrpVmvlg12+lJuEZY9uO5XWLhYd1hqyG4bhWDaCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6e480c7cd2cb3a45649ccaebb203551bbbc14812f053c2d8c936830fa7e63c86","last_reissued_at":"2026-07-05T11:17:03.722795Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:17:03.722795Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2506.05495","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-07-05T11:17:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"K96k3LU8mjrPD6z8m25PA3GmPYa4xo99hpOEV+3FAjtMWk68KrMK9jWb1erG32K5RyNvIHSzqRgzxA7WjKsgDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-17T20:25:42.431189Z"},"content_sha256":"b5bcd29a1297c37c820967aedd992721896fecf0e1a83e754487be72fbf4d8f4","schema_version":"1.0","event_id":"sha256:b5bcd29a1297c37c820967aedd992721896fecf0e1a83e754487be72fbf4d8f4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:NZEAY7GSZM5EKZE4ZLV3EA2VDO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Learning-Augmented Hierarchical Clustering","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.DS","authors_text":"Chen Wang, Jon C. Ergun, Samson Zhou, Vladimir Braverman","submitted_at":"2025-06-05T18:22:40Z","abstract_excerpt":"Hierarchical clustering (HC) is an important data analysis technique in which the goal is to recursively partition a dataset into a tree-like structure while grouping together similar data points at each level of granularity. Unfortunately, for many of the proposed HC objectives, there exist strong barriers to approximation algorithms with the hardness of approximation. Thus, we consider the problem of hierarchical clustering given auxiliary information from natural oracles. Specifically, we focus on a *splitting oracle* which, when provided with a triplet of vertices $(u,v,w)$, answers (possi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.05495","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2506.05495/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T11:17:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gR/RyZFtbrLprHcmlA8T3nyA+htNAvAB1gU2jK3h2FuPXV+F5T/E2goh6Y8XRLDgWO4FGBV1dKdH0TLqEHjBDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-17T20:25:42.431591Z"},"content_sha256":"fb01c2a92e5b7961a64198add876e48a2c0333350c42d8b7f5eee7cfad4ae396","schema_version":"1.0","event_id":"sha256:fb01c2a92e5b7961a64198add876e48a2c0333350c42d8b7f5eee7cfad4ae396"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NZEAY7GSZM5EKZE4ZLV3EA2VDO/bundle.json","state_url":"https://pith.science/pith/NZEAY7GSZM5EKZE4ZLV3EA2VDO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NZEAY7GSZM5EKZE4ZLV3EA2VDO/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-08-17T20:25:42Z","links":{"resolver":"https://pith.science/pith/NZEAY7GSZM5EKZE4ZLV3EA2VDO","bundle":"https://pith.science/pith/NZEAY7GSZM5EKZE4ZLV3EA2VDO/bundle.json","state":"https://pith.science/pith/NZEAY7GSZM5EKZE4ZLV3EA2VDO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NZEAY7GSZM5EKZE4ZLV3EA2VDO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:NZEAY7GSZM5EKZE4ZLV3EA2VDO","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":"9cfc2d65e1c57569bf659ea5608348e36ca4111d8482d09ac6abc7420232e0b3","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2025-06-05T18:22:40Z","title_canon_sha256":"b59a10bb43bd305465588b858f3bcde2c477e409e5929c020f1f9de86205160c"},"schema_version":"1.0","source":{"id":"2506.05495","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2506.05495","created_at":"2026-07-05T11:17:03Z"},{"alias_kind":"arxiv_version","alias_value":"2506.05495v1","created_at":"2026-07-05T11:17:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.05495","created_at":"2026-07-05T11:17:03Z"},{"alias_kind":"pith_short_12","alias_value":"NZEAY7GSZM5E","created_at":"2026-07-05T11:17:03Z"},{"alias_kind":"pith_short_16","alias_value":"NZEAY7GSZM5EKZE4","created_at":"2026-07-05T11:17:03Z"},{"alias_kind":"pith_short_8","alias_value":"NZEAY7GS","created_at":"2026-07-05T11:17:03Z"}],"graph_snapshots":[{"event_id":"sha256:fb01c2a92e5b7961a64198add876e48a2c0333350c42d8b7f5eee7cfad4ae396","target":"graph","created_at":"2026-07-05T11:17:03Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2506.05495/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Hierarchical clustering (HC) is an important data analysis technique in which the goal is to recursively partition a dataset into a tree-like structure while grouping together similar data points at each level of granularity. Unfortunately, for many of the proposed HC objectives, there exist strong barriers to approximation algorithms with the hardness of approximation. Thus, we consider the problem of hierarchical clustering given auxiliary information from natural oracles. Specifically, we focus on a *splitting oracle* which, when provided with a triplet of vertices $(u,v,w)$, answers (possi","authors_text":"Chen Wang, Jon C. Ergun, Samson Zhou, Vladimir Braverman","cross_cats":["cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2025-06-05T18:22:40Z","title":"Learning-Augmented Hierarchical Clustering"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.05495","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:b5bcd29a1297c37c820967aedd992721896fecf0e1a83e754487be72fbf4d8f4","target":"record","created_at":"2026-07-05T11:17:03Z","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":"9cfc2d65e1c57569bf659ea5608348e36ca4111d8482d09ac6abc7420232e0b3","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2025-06-05T18:22:40Z","title_canon_sha256":"b59a10bb43bd305465588b858f3bcde2c477e409e5929c020f1f9de86205160c"},"schema_version":"1.0","source":{"id":"2506.05495","kind":"arxiv","version":1}},"canonical_sha256":"6e480c7cd2cb3a45649ccaebb203551bbbc14812f053c2d8c936830fa7e63c86","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6e480c7cd2cb3a45649ccaebb203551bbbc14812f053c2d8c936830fa7e63c86","first_computed_at":"2026-07-05T11:17:03.722795Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:17:03.722795Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ny0P3fqWfeq7VP+r2Qz81FcPLVWrXd4rKRh/AITr4Sfk25YrpVmvlg12+lJuEZY9uO5XWLhYd1hqyG4bhWDaCA==","signature_status":"signed_v1","signed_at":"2026-07-05T11:17:03.723428Z","signed_message":"canonical_sha256_bytes"},"source_id":"2506.05495","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b5bcd29a1297c37c820967aedd992721896fecf0e1a83e754487be72fbf4d8f4","sha256:fb01c2a92e5b7961a64198add876e48a2c0333350c42d8b7f5eee7cfad4ae396"],"state_sha256":"7d09c257b3b1cf75f5f0f8b1a45917c187e714f1fe6f9a41f11d78f576a9978f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"81HFUE24Vz+sownJGj5EzvqBeFGVTmGceYirs9l8glp3w0+TahAmVpSs2jcdwaPZagNx44au9XP3VtG0A/8kDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-17T20:25:42.434800Z","bundle_sha256":"8f2b01cea09a44bebaa7823de13de00f7d32d1fa1a440c99d3ef935699b2af6f"}}