{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:VO7VLRDWDOPWYBSUACTJT6AL7V","short_pith_number":"pith:VO7VLRDW","schema_version":"1.0","canonical_sha256":"abbf55c4761b9f6c065400a699f80bfd4db6564ad336d74e57fc171429fe93e5","source":{"kind":"arxiv","id":"2606.10781","version":1},"attestation_state":"computed","paper":{"title":"Recovering the Zipfian Distribution in Unsupervised Term Discovery","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CL"],"primary_cat":"eess.AS","authors_text":"Danel Slabbert, Herman Kamper, Simon Malan","submitted_at":"2026-06-09T12:33:59Z","abstract_excerpt":"Unsupervised term discovery involves segmenting unlabelled speech into word- or syllable-like units and clustering these into a lexicon of candidate types. True lexicons follow a Zipfian distribution, yet the dominant centre-based clustering approach -- K-means -- produces a more uniform distribution due to an inductive bias toward spherical clusters. In this paper we revisit graph-based clustering as a bottom-up alternative, where segment embeddings are connected by pairwise similarity and partitioned using the Leiden algorithm. We show that graph clustering substantially outperforms centre-b"},"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":"2606.10781","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"eess.AS","submitted_at":"2026-06-09T12:33:59Z","cross_cats_sorted":["cs.CL"],"title_canon_sha256":"a6718d15b4a9da78705cd9ab8b2da71193a9262d8f0497c6dd8539fa3c9d662e","abstract_canon_sha256":"0c755893387ac00cca9bb51677bb47f458c59684aa7e1b39129d566986f97d19"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-10T01:10:40.317956Z","signature_b64":"KlfEqCNvWs1ZEaRn7yFADLVHAPpSzmNTDTMlVW2qBs26lIJy7sS0CkYSstitcnI5uUpgYtKz8Fon10rencBBAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"abbf55c4761b9f6c065400a699f80bfd4db6564ad336d74e57fc171429fe93e5","last_reissued_at":"2026-06-10T01:10:40.317044Z","signature_status":"signed_v1","first_computed_at":"2026-06-10T01:10:40.317044Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Recovering the Zipfian Distribution in Unsupervised Term Discovery","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CL"],"primary_cat":"eess.AS","authors_text":"Danel Slabbert, Herman Kamper, Simon Malan","submitted_at":"2026-06-09T12:33:59Z","abstract_excerpt":"Unsupervised term discovery involves segmenting unlabelled speech into word- or syllable-like units and clustering these into a lexicon of candidate types. True lexicons follow a Zipfian distribution, yet the dominant centre-based clustering approach -- K-means -- produces a more uniform distribution due to an inductive bias toward spherical clusters. In this paper we revisit graph-based clustering as a bottom-up alternative, where segment embeddings are connected by pairwise similarity and partitioned using the Leiden algorithm. We show that graph clustering substantially outperforms centre-b"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.10781","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/2606.10781/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":"2606.10781","created_at":"2026-06-10T01:10:40.317189+00:00"},{"alias_kind":"arxiv_version","alias_value":"2606.10781v1","created_at":"2026-06-10T01:10:40.317189+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.10781","created_at":"2026-06-10T01:10:40.317189+00:00"},{"alias_kind":"pith_short_12","alias_value":"VO7VLRDWDOPW","created_at":"2026-06-10T01:10:40.317189+00:00"},{"alias_kind":"pith_short_16","alias_value":"VO7VLRDWDOPWYBSU","created_at":"2026-06-10T01:10:40.317189+00:00"},{"alias_kind":"pith_short_8","alias_value":"VO7VLRDW","created_at":"2026-06-10T01:10:40.317189+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/VO7VLRDWDOPWYBSUACTJT6AL7V","json":"https://pith.science/pith/VO7VLRDWDOPWYBSUACTJT6AL7V.json","graph_json":"https://pith.science/api/pith-number/VO7VLRDWDOPWYBSUACTJT6AL7V/graph.json","events_json":"https://pith.science/api/pith-number/VO7VLRDWDOPWYBSUACTJT6AL7V/events.json","paper":"https://pith.science/paper/VO7VLRDW"},"agent_actions":{"view_html":"https://pith.science/pith/VO7VLRDWDOPWYBSUACTJT6AL7V","download_json":"https://pith.science/pith/VO7VLRDWDOPWYBSUACTJT6AL7V.json","view_paper":"https://pith.science/paper/VO7VLRDW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2606.10781&json=true","fetch_graph":"https://pith.science/api/pith-number/VO7VLRDWDOPWYBSUACTJT6AL7V/graph.json","fetch_events":"https://pith.science/api/pith-number/VO7VLRDWDOPWYBSUACTJT6AL7V/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VO7VLRDWDOPWYBSUACTJT6AL7V/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VO7VLRDWDOPWYBSUACTJT6AL7V/action/storage_attestation","attest_author":"https://pith.science/pith/VO7VLRDWDOPWYBSUACTJT6AL7V/action/author_attestation","sign_citation":"https://pith.science/pith/VO7VLRDWDOPWYBSUACTJT6AL7V/action/citation_signature","submit_replication":"https://pith.science/pith/VO7VLRDWDOPWYBSUACTJT6AL7V/action/replication_record"}},"created_at":"2026-06-10T01:10:40.317189+00:00","updated_at":"2026-06-10T01:10:40.317189+00:00"}