{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:544LXJYT5LWH2I34IGMTJKMJZE","short_pith_number":"pith:544LXJYT","canonical_record":{"source":{"id":"2607.29296","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"stat.ME","submitted_at":"2026-07-31T11:14:44Z","cross_cats_sorted":[],"title_canon_sha256":"44ba9083c3dc4704199dd5d2b0778b1b3238a975673be34b2af86eb7d453478a","abstract_canon_sha256":"dcf69a635444cfb42918a96e4c0013162e3890cc9b1e8d7baed4011a20f38325"},"schema_version":"1.0"},"canonical_sha256":"ef38bba713eaec7d237c419934a989c93ff1be0b839488f1f0e7fcdfa35a9bba","source":{"kind":"arxiv","id":"2607.29296","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.29296","created_at":"2026-08-03T01:24:02Z"},{"alias_kind":"arxiv_version","alias_value":"2607.29296v1","created_at":"2026-08-03T01:24:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.29296","created_at":"2026-08-03T01:24:02Z"},{"alias_kind":"pith_short_12","alias_value":"544LXJYT5LWH","created_at":"2026-08-03T01:24:02Z"},{"alias_kind":"pith_short_16","alias_value":"544LXJYT5LWH2I34","created_at":"2026-08-03T01:24:02Z"},{"alias_kind":"pith_short_8","alias_value":"544LXJYT","created_at":"2026-08-03T01:24:02Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:544LXJYT5LWH2I34IGMTJKMJZE","target":"record","payload":{"canonical_record":{"source":{"id":"2607.29296","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"stat.ME","submitted_at":"2026-07-31T11:14:44Z","cross_cats_sorted":[],"title_canon_sha256":"44ba9083c3dc4704199dd5d2b0778b1b3238a975673be34b2af86eb7d453478a","abstract_canon_sha256":"dcf69a635444cfb42918a96e4c0013162e3890cc9b1e8d7baed4011a20f38325"},"schema_version":"1.0"},"canonical_sha256":"ef38bba713eaec7d237c419934a989c93ff1be0b839488f1f0e7fcdfa35a9bba","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-08-03T01:24:02.662137Z","signature_b64":"LNDDHd2++ebk1GLqcBTy8ZKoy+v83H0xs5420TILKa72HEH0/dDG7hXXLA5dY2HiMGjRsYwHXEAiPoLdB5cZCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ef38bba713eaec7d237c419934a989c93ff1be0b839488f1f0e7fcdfa35a9bba","last_reissued_at":"2026-08-03T01:24:02.660586Z","signature_status":"signed_v1","first_computed_at":"2026-08-03T01:24:02.660586Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2607.29296","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-08-03T01:24:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TZI8vrJMSzH1lqlvhRBM7kS8BY7+bwELXM/t/DnJyJOv1WWokePhovH6F94eXXkNsgzy4rp+ZKW7PpvxCOCfDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-20T09:47:49.275384Z"},"content_sha256":"b6c9d943bc29b1e6ebb859300a80e10be3d8013d1c532028d100ea4c5ca018d7","schema_version":"1.0","event_id":"sha256:b6c9d943bc29b1e6ebb859300a80e10be3d8013d1c532028d100ea4c5ca018d7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:544LXJYT5LWH2I34IGMTJKMJZE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Hierarchical Clustering of Networks via Hierarchical Distance Matrices","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"stat.ME","authors_text":"Eric D. Kolaczyk, Li Chen, Lizhen Lin, Nathaniel Josephs","submitted_at":"2026-07-31T11:14:44Z","abstract_excerpt":"Clustering populations of networks while recovering their latent hierarchical organization is a fundamental yet largely unexplored problem in network analysis.\n  To formalize this, we introduce the Hierarchical Distance Matrix, a specific class of population-level distance matrices that encodes latent hierarchical organization through recursively nested distance separation, accommodating unbalanced tree depths.\n  Building on this framework, we propose a fully data-driven top-down procedure: network hierarchical clustering based on two-sample testing (NHC-TST). The algorithm recursively splits "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.29296","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/2607.29296/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-08-03T01:24:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EiQZhe+VCX0Fa4aNhaVYXNxh+EchI7jkGbEeacU7Tz93E+cnRE38p8wCwsNWtg0PE7UR+kh15VP0QCJROAiUCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-20T09:47:49.276021Z"},"content_sha256":"74ee22f061111d7ff72b914798c92bffeeb8eb0d2b16fca112bb8a3b3de12dcf","schema_version":"1.0","event_id":"sha256:74ee22f061111d7ff72b914798c92bffeeb8eb0d2b16fca112bb8a3b3de12dcf"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/544LXJYT5LWH2I34IGMTJKMJZE/bundle.json","state_url":"https://pith.science/pith/544LXJYT5LWH2I34IGMTJKMJZE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/544LXJYT5LWH2I34IGMTJKMJZE/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-20T09:47:49Z","links":{"resolver":"https://pith.science/pith/544LXJYT5LWH2I34IGMTJKMJZE","bundle":"https://pith.science/pith/544LXJYT5LWH2I34IGMTJKMJZE/bundle.json","state":"https://pith.science/pith/544LXJYT5LWH2I34IGMTJKMJZE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/544LXJYT5LWH2I34IGMTJKMJZE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:544LXJYT5LWH2I34IGMTJKMJZE","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":"dcf69a635444cfb42918a96e4c0013162e3890cc9b1e8d7baed4011a20f38325","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"stat.ME","submitted_at":"2026-07-31T11:14:44Z","title_canon_sha256":"44ba9083c3dc4704199dd5d2b0778b1b3238a975673be34b2af86eb7d453478a"},"schema_version":"1.0","source":{"id":"2607.29296","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.29296","created_at":"2026-08-03T01:24:02Z"},{"alias_kind":"arxiv_version","alias_value":"2607.29296v1","created_at":"2026-08-03T01:24:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.29296","created_at":"2026-08-03T01:24:02Z"},{"alias_kind":"pith_short_12","alias_value":"544LXJYT5LWH","created_at":"2026-08-03T01:24:02Z"},{"alias_kind":"pith_short_16","alias_value":"544LXJYT5LWH2I34","created_at":"2026-08-03T01:24:02Z"},{"alias_kind":"pith_short_8","alias_value":"544LXJYT","created_at":"2026-08-03T01:24:02Z"}],"graph_snapshots":[{"event_id":"sha256:74ee22f061111d7ff72b914798c92bffeeb8eb0d2b16fca112bb8a3b3de12dcf","target":"graph","created_at":"2026-08-03T01:24:02Z","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/2607.29296/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Clustering populations of networks while recovering their latent hierarchical organization is a fundamental yet largely unexplored problem in network analysis.\n  To formalize this, we introduce the Hierarchical Distance Matrix, a specific class of population-level distance matrices that encodes latent hierarchical organization through recursively nested distance separation, accommodating unbalanced tree depths.\n  Building on this framework, we propose a fully data-driven top-down procedure: network hierarchical clustering based on two-sample testing (NHC-TST). The algorithm recursively splits ","authors_text":"Eric D. Kolaczyk, Li Chen, Lizhen Lin, Nathaniel Josephs","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"stat.ME","submitted_at":"2026-07-31T11:14:44Z","title":"Hierarchical Clustering of Networks via Hierarchical Distance Matrices"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.29296","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:b6c9d943bc29b1e6ebb859300a80e10be3d8013d1c532028d100ea4c5ca018d7","target":"record","created_at":"2026-08-03T01:24:02Z","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":"dcf69a635444cfb42918a96e4c0013162e3890cc9b1e8d7baed4011a20f38325","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"stat.ME","submitted_at":"2026-07-31T11:14:44Z","title_canon_sha256":"44ba9083c3dc4704199dd5d2b0778b1b3238a975673be34b2af86eb7d453478a"},"schema_version":"1.0","source":{"id":"2607.29296","kind":"arxiv","version":1}},"canonical_sha256":"ef38bba713eaec7d237c419934a989c93ff1be0b839488f1f0e7fcdfa35a9bba","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ef38bba713eaec7d237c419934a989c93ff1be0b839488f1f0e7fcdfa35a9bba","first_computed_at":"2026-08-03T01:24:02.660586Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-08-03T01:24:02.660586Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"LNDDHd2++ebk1GLqcBTy8ZKoy+v83H0xs5420TILKa72HEH0/dDG7hXXLA5dY2HiMGjRsYwHXEAiPoLdB5cZCw==","signature_status":"signed_v1","signed_at":"2026-08-03T01:24:02.662137Z","signed_message":"canonical_sha256_bytes"},"source_id":"2607.29296","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b6c9d943bc29b1e6ebb859300a80e10be3d8013d1c532028d100ea4c5ca018d7","sha256:74ee22f061111d7ff72b914798c92bffeeb8eb0d2b16fca112bb8a3b3de12dcf"],"state_sha256":"202b1cb27b35b166e6fa7b3f735ab792e2def045db7e4d115e18f357afb53194"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QU8h069N/6LDX+4t9nFhGa1892MJKQcZlz3FkfGZ74FW/JFskOl/NiTIVtp4gUcjcDM49AQuA9NDRzoq4DzRBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-20T09:47:49.280892Z","bundle_sha256":"aab04204274758ee49d9d25e5024e32e3e3b59342d21199ba968f7110cccc528"}}