{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2021:RFSBQLMNTMDXE5WOF3GRERUYJM","short_pith_number":"pith:RFSBQLMN","canonical_record":{"source":{"id":"2105.12093","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2021-05-25T17:21:21Z","cross_cats_sorted":[],"title_canon_sha256":"76c3f45cae51b2c066c5ad91a3e1f3a5252362564e28a1245cdc6115cbc4fa5f","abstract_canon_sha256":"fe28b2ce3af8922bbbe8a72765f0f1f7ef996cadca2a5802237daf4ae8b07ffc"},"schema_version":"1.0"},"canonical_sha256":"8964182d8d9b077276ce2ecd1246984b1c8233ccd13e8c5f94ceade1c5cbe2ea","source":{"kind":"arxiv","id":"2105.12093","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2105.12093","created_at":"2026-07-05T02:42:59Z"},{"alias_kind":"arxiv_version","alias_value":"2105.12093v1","created_at":"2026-07-05T02:42:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2105.12093","created_at":"2026-07-05T02:42:59Z"},{"alias_kind":"pith_short_12","alias_value":"RFSBQLMNTMDX","created_at":"2026-07-05T02:42:59Z"},{"alias_kind":"pith_short_16","alias_value":"RFSBQLMNTMDXE5WO","created_at":"2026-07-05T02:42:59Z"},{"alias_kind":"pith_short_8","alias_value":"RFSBQLMN","created_at":"2026-07-05T02:42:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2021:RFSBQLMNTMDXE5WOF3GRERUYJM","target":"record","payload":{"canonical_record":{"source":{"id":"2105.12093","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2021-05-25T17:21:21Z","cross_cats_sorted":[],"title_canon_sha256":"76c3f45cae51b2c066c5ad91a3e1f3a5252362564e28a1245cdc6115cbc4fa5f","abstract_canon_sha256":"fe28b2ce3af8922bbbe8a72765f0f1f7ef996cadca2a5802237daf4ae8b07ffc"},"schema_version":"1.0"},"canonical_sha256":"8964182d8d9b077276ce2ecd1246984b1c8233ccd13e8c5f94ceade1c5cbe2ea","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:42:59.945434Z","signature_b64":"wqAJQOU0JpPM7lK+GSU0gYojL1dMtCGVllrIBKYvLII/Oc46TQmpSu0o605ki0JHSb1LTJ6zwL4QAFSzeSTrBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8964182d8d9b077276ce2ecd1246984b1c8233ccd13e8c5f94ceade1c5cbe2ea","last_reissued_at":"2026-07-05T02:42:59.945027Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:42:59.945027Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2105.12093","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-05T02:42:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SNNqz9++8BfpJ4uYv7duYt3YWEDbJxQz7j0M48WqUDjfI2UQgZjUm40ps1im3Nz8GTz9RjlNAVZYFLDInyNJCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-11T17:32:39.714560Z"},"content_sha256":"d38e8b8952f7c09906dae9bed6a9d1e6e19e88986cc267500c1c315e0a52dd1b","schema_version":"1.0","event_id":"sha256:d38e8b8952f7c09906dae9bed6a9d1e6e19e88986cc267500c1c315e0a52dd1b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2021:RFSBQLMNTMDXE5WOF3GRERUYJM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On Dasgupta's hierarchical clustering objective and its relation to other graph parameters","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Benjamin Bergougnoux, Christophe Paul, Jan Arne Telle, Svein H{\\o}gemo, Ulrik Brandes","submitted_at":"2021-05-25T17:21:21Z","abstract_excerpt":"The minimum height of vertex and edge partition trees are well-studied graph parameters known as, for instance, vertex and edge ranking number. While they are NP-hard to determine in general, linear-time algorithms exist for trees. Motivated by a correspondence with Dasgupta's objective for hierarchical clustering we consider the total rather than maximum depth of vertices as an alternative objective for minimization. For vertex partition trees this leads to a new parameter with a natural interpretation as a measure of robustness against vertex removal.\n  As tools for the study of this family "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2105.12093","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/2105.12093/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-05T02:42:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"O8KTxvOd21NeyanyBSxZeEJr4q6RxaFplZEeaqnIQHqMxLFyhIsz7PYlCk5PMG3049jq6CHMdx5+Boz4mcaADg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-11T17:32:39.714938Z"},"content_sha256":"c1df8b1e6be83419d20334e5b7cf8f7ab83748c47c6666ccdaca5aec3eb683b9","schema_version":"1.0","event_id":"sha256:c1df8b1e6be83419d20334e5b7cf8f7ab83748c47c6666ccdaca5aec3eb683b9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RFSBQLMNTMDXE5WOF3GRERUYJM/bundle.json","state_url":"https://pith.science/pith/RFSBQLMNTMDXE5WOF3GRERUYJM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RFSBQLMNTMDXE5WOF3GRERUYJM/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-11T17:32:39Z","links":{"resolver":"https://pith.science/pith/RFSBQLMNTMDXE5WOF3GRERUYJM","bundle":"https://pith.science/pith/RFSBQLMNTMDXE5WOF3GRERUYJM/bundle.json","state":"https://pith.science/pith/RFSBQLMNTMDXE5WOF3GRERUYJM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RFSBQLMNTMDXE5WOF3GRERUYJM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2021:RFSBQLMNTMDXE5WOF3GRERUYJM","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":"fe28b2ce3af8922bbbe8a72765f0f1f7ef996cadca2a5802237daf4ae8b07ffc","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2021-05-25T17:21:21Z","title_canon_sha256":"76c3f45cae51b2c066c5ad91a3e1f3a5252362564e28a1245cdc6115cbc4fa5f"},"schema_version":"1.0","source":{"id":"2105.12093","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2105.12093","created_at":"2026-07-05T02:42:59Z"},{"alias_kind":"arxiv_version","alias_value":"2105.12093v1","created_at":"2026-07-05T02:42:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2105.12093","created_at":"2026-07-05T02:42:59Z"},{"alias_kind":"pith_short_12","alias_value":"RFSBQLMNTMDX","created_at":"2026-07-05T02:42:59Z"},{"alias_kind":"pith_short_16","alias_value":"RFSBQLMNTMDXE5WO","created_at":"2026-07-05T02:42:59Z"},{"alias_kind":"pith_short_8","alias_value":"RFSBQLMN","created_at":"2026-07-05T02:42:59Z"}],"graph_snapshots":[{"event_id":"sha256:c1df8b1e6be83419d20334e5b7cf8f7ab83748c47c6666ccdaca5aec3eb683b9","target":"graph","created_at":"2026-07-05T02:42:59Z","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/2105.12093/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The minimum height of vertex and edge partition trees are well-studied graph parameters known as, for instance, vertex and edge ranking number. While they are NP-hard to determine in general, linear-time algorithms exist for trees. Motivated by a correspondence with Dasgupta's objective for hierarchical clustering we consider the total rather than maximum depth of vertices as an alternative objective for minimization. For vertex partition trees this leads to a new parameter with a natural interpretation as a measure of robustness against vertex removal.\n  As tools for the study of this family ","authors_text":"Benjamin Bergougnoux, Christophe Paul, Jan Arne Telle, Svein H{\\o}gemo, Ulrik Brandes","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2021-05-25T17:21:21Z","title":"On Dasgupta's hierarchical clustering objective and its relation to other graph parameters"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2105.12093","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:d38e8b8952f7c09906dae9bed6a9d1e6e19e88986cc267500c1c315e0a52dd1b","target":"record","created_at":"2026-07-05T02:42:59Z","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":"fe28b2ce3af8922bbbe8a72765f0f1f7ef996cadca2a5802237daf4ae8b07ffc","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2021-05-25T17:21:21Z","title_canon_sha256":"76c3f45cae51b2c066c5ad91a3e1f3a5252362564e28a1245cdc6115cbc4fa5f"},"schema_version":"1.0","source":{"id":"2105.12093","kind":"arxiv","version":1}},"canonical_sha256":"8964182d8d9b077276ce2ecd1246984b1c8233ccd13e8c5f94ceade1c5cbe2ea","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8964182d8d9b077276ce2ecd1246984b1c8233ccd13e8c5f94ceade1c5cbe2ea","first_computed_at":"2026-07-05T02:42:59.945027Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T02:42:59.945027Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"wqAJQOU0JpPM7lK+GSU0gYojL1dMtCGVllrIBKYvLII/Oc46TQmpSu0o605ki0JHSb1LTJ6zwL4QAFSzeSTrBQ==","signature_status":"signed_v1","signed_at":"2026-07-05T02:42:59.945434Z","signed_message":"canonical_sha256_bytes"},"source_id":"2105.12093","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d38e8b8952f7c09906dae9bed6a9d1e6e19e88986cc267500c1c315e0a52dd1b","sha256:c1df8b1e6be83419d20334e5b7cf8f7ab83748c47c6666ccdaca5aec3eb683b9"],"state_sha256":"6606d82b78350dd22e44750ff1db74ddee5211dad6aaa483e39840ce5edf2400"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Na0VVxYuTHGGVYR8uDLaRq36JlL/t2/0glJH3OhWbqkIm/+ZbZtAyeVsfSvOGjEDAOfsyci44Y9V4QeteaAVDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-11T17:32:39.717124Z","bundle_sha256":"1217018239aabcd782365262c160be5f2f5c899535d3decffbf2a1096d671c38"}}