{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:ANVZZXTP2VNALHR2LZPGMXDUWE","short_pith_number":"pith:ANVZZXTP","schema_version":"1.0","canonical_sha256":"036b9cde6fd55a059e3a5e5e665c74b107c41b233b8773dc5559e37741736914","source":{"kind":"arxiv","id":"2408.09399","version":1},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2408.09399","created_at":"2026-07-05T08:56:31.996230+00:00"},{"alias_kind":"arxiv_version","alias_value":"2408.09399v1","created_at":"2026-07-05T08:56:31.996230+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2408.09399","created_at":"2026-07-05T08:56:31.996230+00:00"},{"alias_kind":"pith_short_12","alias_value":"ANVZZXTP2VNA","created_at":"2026-07-05T08:56:31.996230+00:00"},{"alias_kind":"pith_short_16","alias_value":"ANVZZXTP2VNALHR2","created_at":"2026-07-05T08:56:31.996230+00:00"},{"alias_kind":"pith_short_8","alias_value":"ANVZZXTP","created_at":"2026-07-05T08:56:31.996230+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2505.03812","citing_title":"Information Filtering Networks: Theoretical Foundations, Generative Methodologies, and Real-World Applications","ref_index":68,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/ANVZZXTP2VNALHR2LZPGMXDUWE","json":"https://pith.science/pith/ANVZZXTP2VNALHR2LZPGMXDUWE.json","graph_json":"https://pith.science/api/pith-number/ANVZZXTP2VNALHR2LZPGMXDUWE/graph.json","events_json":"https://pith.science/api/pith-number/ANVZZXTP2VNALHR2LZPGMXDUWE/events.json","paper":"https://pith.science/paper/ANVZZXTP"},"agent_actions":{"view_html":"https://pith.science/pith/ANVZZXTP2VNALHR2LZPGMXDUWE","download_json":"https://pith.science/pith/ANVZZXTP2VNALHR2LZPGMXDUWE.json","view_paper":"https://pith.science/paper/ANVZZXTP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2408.09399&json=true","fetch_graph":"https://pith.science/api/pith-number/ANVZZXTP2VNALHR2LZPGMXDUWE/graph.json","fetch_events":"https://pith.science/api/pith-number/ANVZZXTP2VNALHR2LZPGMXDUWE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ANVZZXTP2VNALHR2LZPGMXDUWE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ANVZZXTP2VNALHR2LZPGMXDUWE/action/storage_attestation","attest_author":"https://pith.science/pith/ANVZZXTP2VNALHR2LZPGMXDUWE/action/author_attestation","sign_citation":"https://pith.science/pith/ANVZZXTP2VNALHR2LZPGMXDUWE/action/citation_signature","submit_replication":"https://pith.science/pith/ANVZZXTP2VNALHR2LZPGMXDUWE/action/replication_record"}},"created_at":"2026-07-05T08:56:31.996230+00:00","updated_at":"2026-07-05T08:56:31.996230+00:00"}