{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:ANVZZXTP2VNALHR2LZPGMXDUWE","short_pith_number":"pith:ANVZZXTP","canonical_record":{"source":{"id":"2408.09399","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.DC","submitted_at":"2024-08-18T08:06:24Z","cross_cats_sorted":[],"title_canon_sha256":"cc96ab38055208839ea1079973e73d672591d294083f259c008b4c0d10bc3d9d","abstract_canon_sha256":"74de00739e7d4a6a3f7371464b74ee86e1df069e76e50a07e6cb0945aa49793d"},"schema_version":"1.0"},"canonical_sha256":"036b9cde6fd55a059e3a5e5e665c74b107c41b233b8773dc5559e37741736914","source":{"kind":"arxiv","id":"2408.09399","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2408.09399","created_at":"2026-07-05T08:56:31Z"},{"alias_kind":"arxiv_version","alias_value":"2408.09399v1","created_at":"2026-07-05T08:56:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2408.09399","created_at":"2026-07-05T08:56:31Z"},{"alias_kind":"pith_short_12","alias_value":"ANVZZXTP2VNA","created_at":"2026-07-05T08:56:31Z"},{"alias_kind":"pith_short_16","alias_value":"ANVZZXTP2VNALHR2","created_at":"2026-07-05T08:56:31Z"},{"alias_kind":"pith_short_8","alias_value":"ANVZZXTP","created_at":"2026-07-05T08:56:31Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:ANVZZXTP2VNALHR2LZPGMXDUWE","target":"record","payload":{"canonical_record":{"source":{"id":"2408.09399","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.DC","submitted_at":"2024-08-18T08:06:24Z","cross_cats_sorted":[],"title_canon_sha256":"cc96ab38055208839ea1079973e73d672591d294083f259c008b4c0d10bc3d9d","abstract_canon_sha256":"74de00739e7d4a6a3f7371464b74ee86e1df069e76e50a07e6cb0945aa49793d"},"schema_version":"1.0"},"canonical_sha256":"036b9cde6fd55a059e3a5e5e665c74b107c41b233b8773dc5559e37741736914","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:56:31.996677Z","signature_b64":"T8bhI9qltWeh3XWmAgUHlcs861YmrtdAwD9547hqtch1SFdOJANlAOHe/zR+TojtnGE1lqm/tt0fdRBqjII3Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"036b9cde6fd55a059e3a5e5e665c74b107c41b233b8773dc5559e37741736914","last_reissued_at":"2026-07-05T08:56:31.996173Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:56:31.996173Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2408.09399","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-05T08:56:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+lSnQb0PTYY9KShHIfEuAGPeNUlWq8SqthZo47Xju25R8D4O7WtvOJjOWA2b+F2wKNmF9x6xUutnHk7lkfxRCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-18T07:53:12.375934Z"},"content_sha256":"ba9e0520c0c95a9f287e46618a775de3309bfb113a79f135fa35f41cc613ebdc","schema_version":"1.0","event_id":"sha256:ba9e0520c0c95a9f287e46618a775de3309bfb113a79f135fa35f41cc613ebdc"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:ANVZZXTP2VNALHR2LZPGMXDUWE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Faster Parallel Triangular Maximally Filtered Graphs and Hierarchical Clustering","license":"http://creativecommons.org/licenses/by-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Julian Shun, Steven Raphael","submitted_at":"2024-08-18T08:06:24Z","abstract_excerpt":"Filtered graphs provide a powerful tool for data clustering. The triangular maximally filtered graph (TMFG) method, when combined with the directed bubble hierarchy tree (DBHT) method, defines a useful algorithm for hierarchical data clustering. This combined TMFG-DBHT algorithm has been shown to produce clusters with good accuracy for time series data, but the previous state-of-the-art parallel algorithm has limited parallelism. This paper presents an improved parallel algorithm for TMFG-DBHT. Our algorithm increases the amount of parallelism by aggregating the bulk of the work of TMFG constr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2408.09399","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/2408.09399/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:56:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"o4tdELk5qGWYI1A5Esh/NuIRzws0Q7VW8JtRVsX2GrHyAOGHAEY90ktkRk09syPPOJKO7Sin+Fbt3yWKumSKBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-18T07:53:12.376437Z"},"content_sha256":"8b7e7822e857e0be3f1f7871b392928b17ab97d4983a707bf11f2d98de9a51e8","schema_version":"1.0","event_id":"sha256:8b7e7822e857e0be3f1f7871b392928b17ab97d4983a707bf11f2d98de9a51e8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ANVZZXTP2VNALHR2LZPGMXDUWE/bundle.json","state_url":"https://pith.science/pith/ANVZZXTP2VNALHR2LZPGMXDUWE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ANVZZXTP2VNALHR2LZPGMXDUWE/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-18T07:53:12Z","links":{"resolver":"https://pith.science/pith/ANVZZXTP2VNALHR2LZPGMXDUWE","bundle":"https://pith.science/pith/ANVZZXTP2VNALHR2LZPGMXDUWE/bundle.json","state":"https://pith.science/pith/ANVZZXTP2VNALHR2LZPGMXDUWE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ANVZZXTP2VNALHR2LZPGMXDUWE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:ANVZZXTP2VNALHR2LZPGMXDUWE","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":"74de00739e7d4a6a3f7371464b74ee86e1df069e76e50a07e6cb0945aa49793d","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.DC","submitted_at":"2024-08-18T08:06:24Z","title_canon_sha256":"cc96ab38055208839ea1079973e73d672591d294083f259c008b4c0d10bc3d9d"},"schema_version":"1.0","source":{"id":"2408.09399","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2408.09399","created_at":"2026-07-05T08:56:31Z"},{"alias_kind":"arxiv_version","alias_value":"2408.09399v1","created_at":"2026-07-05T08:56:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2408.09399","created_at":"2026-07-05T08:56:31Z"},{"alias_kind":"pith_short_12","alias_value":"ANVZZXTP2VNA","created_at":"2026-07-05T08:56:31Z"},{"alias_kind":"pith_short_16","alias_value":"ANVZZXTP2VNALHR2","created_at":"2026-07-05T08:56:31Z"},{"alias_kind":"pith_short_8","alias_value":"ANVZZXTP","created_at":"2026-07-05T08:56:31Z"}],"graph_snapshots":[{"event_id":"sha256:8b7e7822e857e0be3f1f7871b392928b17ab97d4983a707bf11f2d98de9a51e8","target":"graph","created_at":"2026-07-05T08:56:31Z","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/2408.09399/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Filtered graphs provide a powerful tool for data clustering. The triangular maximally filtered graph (TMFG) method, when combined with the directed bubble hierarchy tree (DBHT) method, defines a useful algorithm for hierarchical data clustering. This combined TMFG-DBHT algorithm has been shown to produce clusters with good accuracy for time series data, but the previous state-of-the-art parallel algorithm has limited parallelism. This paper presents an improved parallel algorithm for TMFG-DBHT. Our algorithm increases the amount of parallelism by aggregating the bulk of the work of TMFG constr","authors_text":"Julian Shun, Steven Raphael","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.DC","submitted_at":"2024-08-18T08:06:24Z","title":"Faster Parallel Triangular Maximally Filtered Graphs and Hierarchical Clustering"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2408.09399","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:ba9e0520c0c95a9f287e46618a775de3309bfb113a79f135fa35f41cc613ebdc","target":"record","created_at":"2026-07-05T08:56:31Z","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":"74de00739e7d4a6a3f7371464b74ee86e1df069e76e50a07e6cb0945aa49793d","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.DC","submitted_at":"2024-08-18T08:06:24Z","title_canon_sha256":"cc96ab38055208839ea1079973e73d672591d294083f259c008b4c0d10bc3d9d"},"schema_version":"1.0","source":{"id":"2408.09399","kind":"arxiv","version":1}},"canonical_sha256":"036b9cde6fd55a059e3a5e5e665c74b107c41b233b8773dc5559e37741736914","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"036b9cde6fd55a059e3a5e5e665c74b107c41b233b8773dc5559e37741736914","first_computed_at":"2026-07-05T08:56:31.996173Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T08:56:31.996173Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"T8bhI9qltWeh3XWmAgUHlcs861YmrtdAwD9547hqtch1SFdOJANlAOHe/zR+TojtnGE1lqm/tt0fdRBqjII3Cg==","signature_status":"signed_v1","signed_at":"2026-07-05T08:56:31.996677Z","signed_message":"canonical_sha256_bytes"},"source_id":"2408.09399","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ba9e0520c0c95a9f287e46618a775de3309bfb113a79f135fa35f41cc613ebdc","sha256:8b7e7822e857e0be3f1f7871b392928b17ab97d4983a707bf11f2d98de9a51e8"],"state_sha256":"a1455b4d160744549de82b7e68626580aa0fbfc473ecf44e6ce7a6f74aa6a64e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3JeLJFQmcJ9//426Hk3ecSmXLVs8PW7s+BeGLXVBovsYm74cRCOFRYLzndTckaYD9Cz96sGGUSBSRAwZYxJ1Dw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-18T07:53:12.381237Z","bundle_sha256":"d150f940c3400cb196c23b5b57fc9993db5442943b3fd658ae3644918a920fa5"}}