{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:MVA3ZNIQXXGZUK5QOW4EHRCW3W","short_pith_number":"pith:MVA3ZNIQ","canonical_record":{"source":{"id":"2308.03578","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2023-08-07T13:35:02Z","cross_cats_sorted":["cs.DB","cs.DC","cs.IR"],"title_canon_sha256":"81af2d11ffa5ec226dcb37da565745b9b2f56150ff605ab82963ccac6482a695","abstract_canon_sha256":"a6940d0127dd7f9685191b5ea41c6a3b5e5e6b5d9298146afb873bc34dbdf715"},"schema_version":"1.0"},"canonical_sha256":"6541bcb510bdcd9a2bb075b843c456dd86f8a5e8eb729257c7324a5212cfd46f","source":{"kind":"arxiv","id":"2308.03578","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2308.03578","created_at":"2026-07-05T08:30:04Z"},{"alias_kind":"arxiv_version","alias_value":"2308.03578v2","created_at":"2026-07-05T08:30:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2308.03578","created_at":"2026-07-05T08:30:04Z"},{"alias_kind":"pith_short_12","alias_value":"MVA3ZNIQXXGZ","created_at":"2026-07-05T08:30:04Z"},{"alias_kind":"pith_short_16","alias_value":"MVA3ZNIQXXGZUK5Q","created_at":"2026-07-05T08:30:04Z"},{"alias_kind":"pith_short_8","alias_value":"MVA3ZNIQ","created_at":"2026-07-05T08:30:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:MVA3ZNIQXXGZUK5QOW4EHRCW3W","target":"record","payload":{"canonical_record":{"source":{"id":"2308.03578","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2023-08-07T13:35:02Z","cross_cats_sorted":["cs.DB","cs.DC","cs.IR"],"title_canon_sha256":"81af2d11ffa5ec226dcb37da565745b9b2f56150ff605ab82963ccac6482a695","abstract_canon_sha256":"a6940d0127dd7f9685191b5ea41c6a3b5e5e6b5d9298146afb873bc34dbdf715"},"schema_version":"1.0"},"canonical_sha256":"6541bcb510bdcd9a2bb075b843c456dd86f8a5e8eb729257c7324a5212cfd46f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:30:04.275391Z","signature_b64":"y3Ia3xO22FQLNMbPhybfiaSzwoOqPt1BFQeFC/1K1pD6I7DniCbdd6E/1vj3Y/NzxWDGwpQ7b5mJqwIzmnhQDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6541bcb510bdcd9a2bb075b843c456dd86f8a5e8eb729257c7324a5212cfd46f","last_reissued_at":"2026-07-05T08:30:04.274914Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:30:04.274914Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2308.03578","source_version":2,"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-05T08:30:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ud1A/CWEjx6FcnQAwk8RS0ySt+SThSkf8JCf7Pyf+uN3sfcQnfSj+Pe1AmN1+AiwUC0B+ftaw1Nl7bGR4M2GBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-08T05:06:35.301288Z"},"content_sha256":"b2451d86e0725242f0b4b55868cb3ed4d3bc2621828ad12e5e98ce5f347d7ffb","schema_version":"1.0","event_id":"sha256:b2451d86e0725242f0b4b55868cb3ed4d3bc2621828ad12e5e98ce5f347d7ffb"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:MVA3ZNIQXXGZUK5QOW4EHRCW3W","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"TeraHAC: Hierarchical Agglomerative Clustering of Trillion-Edge Graphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DB","cs.DC","cs.IR"],"primary_cat":"cs.DS","authors_text":"Jakub {\\L}\\k{a}cki, Jason Lee, Laxman Dhulipala, Vahab Mirrokni","submitted_at":"2023-08-07T13:35:02Z","abstract_excerpt":"We introduce TeraHAC, a $(1+\\epsilon)$-approximate hierarchical agglomerative clustering (HAC) algorithm which scales to trillion-edge graphs. Our algorithm is based on a new approach to computing $(1+\\epsilon)$-approximate HAC, which is a novel combination of the nearest-neighbor chain algorithm and the notion of $(1+\\epsilon)$-approximate HAC. Our approach allows us to partition the graph among multiple machines and make significant progress in computing the clustering within each partition before any communication with other partitions is needed.\n  We evaluate TeraHAC on a number of real-wo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2308.03578","kind":"arxiv","version":2},"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/2308.03578/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-05T08:30:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ibWL3jh6FO5Nvkx2Eb1nVl3KEdsN72LHLgm3Zb5MCmkIWA7RJraOQewwA5pdz+8BZ9FJODTYePBad3CXhr4vCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-08T05:06:35.301697Z"},"content_sha256":"c1e738d5f047ab554ae1c4b326c762e76b1faf55c709f99f2249870fcb6eba5a","schema_version":"1.0","event_id":"sha256:c1e738d5f047ab554ae1c4b326c762e76b1faf55c709f99f2249870fcb6eba5a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MVA3ZNIQXXGZUK5QOW4EHRCW3W/bundle.json","state_url":"https://pith.science/pith/MVA3ZNIQXXGZUK5QOW4EHRCW3W/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MVA3ZNIQXXGZUK5QOW4EHRCW3W/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-07-08T05:06:35Z","links":{"resolver":"https://pith.science/pith/MVA3ZNIQXXGZUK5QOW4EHRCW3W","bundle":"https://pith.science/pith/MVA3ZNIQXXGZUK5QOW4EHRCW3W/bundle.json","state":"https://pith.science/pith/MVA3ZNIQXXGZUK5QOW4EHRCW3W/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MVA3ZNIQXXGZUK5QOW4EHRCW3W/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:MVA3ZNIQXXGZUK5QOW4EHRCW3W","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":"a6940d0127dd7f9685191b5ea41c6a3b5e5e6b5d9298146afb873bc34dbdf715","cross_cats_sorted":["cs.DB","cs.DC","cs.IR"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2023-08-07T13:35:02Z","title_canon_sha256":"81af2d11ffa5ec226dcb37da565745b9b2f56150ff605ab82963ccac6482a695"},"schema_version":"1.0","source":{"id":"2308.03578","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2308.03578","created_at":"2026-07-05T08:30:04Z"},{"alias_kind":"arxiv_version","alias_value":"2308.03578v2","created_at":"2026-07-05T08:30:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2308.03578","created_at":"2026-07-05T08:30:04Z"},{"alias_kind":"pith_short_12","alias_value":"MVA3ZNIQXXGZ","created_at":"2026-07-05T08:30:04Z"},{"alias_kind":"pith_short_16","alias_value":"MVA3ZNIQXXGZUK5Q","created_at":"2026-07-05T08:30:04Z"},{"alias_kind":"pith_short_8","alias_value":"MVA3ZNIQ","created_at":"2026-07-05T08:30:04Z"}],"graph_snapshots":[{"event_id":"sha256:c1e738d5f047ab554ae1c4b326c762e76b1faf55c709f99f2249870fcb6eba5a","target":"graph","created_at":"2026-07-05T08:30:04Z","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/2308.03578/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We introduce TeraHAC, a $(1+\\epsilon)$-approximate hierarchical agglomerative clustering (HAC) algorithm which scales to trillion-edge graphs. Our algorithm is based on a new approach to computing $(1+\\epsilon)$-approximate HAC, which is a novel combination of the nearest-neighbor chain algorithm and the notion of $(1+\\epsilon)$-approximate HAC. Our approach allows us to partition the graph among multiple machines and make significant progress in computing the clustering within each partition before any communication with other partitions is needed.\n  We evaluate TeraHAC on a number of real-wo","authors_text":"Jakub {\\L}\\k{a}cki, Jason Lee, Laxman Dhulipala, Vahab Mirrokni","cross_cats":["cs.DB","cs.DC","cs.IR"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2023-08-07T13:35:02Z","title":"TeraHAC: Hierarchical Agglomerative Clustering of Trillion-Edge Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2308.03578","kind":"arxiv","version":2},"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:b2451d86e0725242f0b4b55868cb3ed4d3bc2621828ad12e5e98ce5f347d7ffb","target":"record","created_at":"2026-07-05T08:30:04Z","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":"a6940d0127dd7f9685191b5ea41c6a3b5e5e6b5d9298146afb873bc34dbdf715","cross_cats_sorted":["cs.DB","cs.DC","cs.IR"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2023-08-07T13:35:02Z","title_canon_sha256":"81af2d11ffa5ec226dcb37da565745b9b2f56150ff605ab82963ccac6482a695"},"schema_version":"1.0","source":{"id":"2308.03578","kind":"arxiv","version":2}},"canonical_sha256":"6541bcb510bdcd9a2bb075b843c456dd86f8a5e8eb729257c7324a5212cfd46f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6541bcb510bdcd9a2bb075b843c456dd86f8a5e8eb729257c7324a5212cfd46f","first_computed_at":"2026-07-05T08:30:04.274914Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T08:30:04.274914Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"y3Ia3xO22FQLNMbPhybfiaSzwoOqPt1BFQeFC/1K1pD6I7DniCbdd6E/1vj3Y/NzxWDGwpQ7b5mJqwIzmnhQDw==","signature_status":"signed_v1","signed_at":"2026-07-05T08:30:04.275391Z","signed_message":"canonical_sha256_bytes"},"source_id":"2308.03578","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b2451d86e0725242f0b4b55868cb3ed4d3bc2621828ad12e5e98ce5f347d7ffb","sha256:c1e738d5f047ab554ae1c4b326c762e76b1faf55c709f99f2249870fcb6eba5a"],"state_sha256":"386962b3ca2b6f7eb687ffa0e9ae5626d8904ef603ffb111bf765401aac839a4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cbi+q4CQBBT4UzNPQO9rYNb2Ub8FWYLxGzICxZHVpjj8jAfjorFJTxBb/bbReEqh+0ewKVgCpYNf4VmozCiaDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-08T05:06:35.303758Z","bundle_sha256":"62b1b6864d0eb06aac091bc403d15326407219a88feb3746cdfaba6371ff97ed"}}