{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:6ZTFWBON4E3LFM7LRSYVR4YOSJ","short_pith_number":"pith:6ZTFWBON","schema_version":"1.0","canonical_sha256":"f6665b05cde136b2b3eb8cb158f30e925dc0f4ab4442107c5b36b456eb87d463","source":{"kind":"arxiv","id":"2605.22410","version":1},"attestation_state":"computed","paper":{"title":"Minimum Description Length based Granular-Ball Tree Regularization for Spectral Clustering","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Caihui Liu, Wenjing Qiu, Yong Zhang, Zeqiang Xian","submitted_at":"2026-05-21T12:36:24Z","abstract_excerpt":"Spectral clustering largely depends on the affinity graph, yet constructing a graph that preserves reliable local connectivity while adapting to heterogeneous data structures remains challenging. Existing granular-ball-based spectral clustering methods usually reduce graph complexity by using coarse-grained representatives. However, the learned local regions are often treated as graph nodes or anchors, and their structural information is not sufficiently used to regularize the original sample-level graph. To address this issue, this paper proposes a Minimum Description Length based Granular-Ba"},"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":"2605.22410","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2026-05-21T12:36:24Z","cross_cats_sorted":[],"title_canon_sha256":"46f314674e1b13aa6f5b7b823750f144e8fb83dc3d59e90df94622b95e6e51bb","abstract_canon_sha256":"3db47fe29ea9b915358eaf68d3cf2c33d04898ac2baeb9797aa759efc1577828"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-22T01:04:42.087170Z","signature_b64":"ig9FdGlpIs3/Ke4L2hGG/VVGWcfMabl9bcB4N5R7XAMgj+vg7BZTMJfPWWMjTYR6EtHJbHNg/zYiqC0a6QerCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f6665b05cde136b2b3eb8cb158f30e925dc0f4ab4442107c5b36b456eb87d463","last_reissued_at":"2026-05-22T01:04:42.082902Z","signature_status":"signed_v1","first_computed_at":"2026-05-22T01:04:42.082902Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Minimum Description Length based Granular-Ball Tree Regularization for Spectral Clustering","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Caihui Liu, Wenjing Qiu, Yong Zhang, Zeqiang Xian","submitted_at":"2026-05-21T12:36:24Z","abstract_excerpt":"Spectral clustering largely depends on the affinity graph, yet constructing a graph that preserves reliable local connectivity while adapting to heterogeneous data structures remains challenging. Existing granular-ball-based spectral clustering methods usually reduce graph complexity by using coarse-grained representatives. However, the learned local regions are often treated as graph nodes or anchors, and their structural information is not sufficiently used to regularize the original sample-level graph. To address this issue, this paper proposes a Minimum Description Length based Granular-Ba"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.22410","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/2605.22410/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":"2605.22410","created_at":"2026-05-22T01:04:42.086344+00:00"},{"alias_kind":"arxiv_version","alias_value":"2605.22410v1","created_at":"2026-05-22T01:04:42.086344+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.22410","created_at":"2026-05-22T01:04:42.086344+00:00"},{"alias_kind":"pith_short_12","alias_value":"6ZTFWBON4E3L","created_at":"2026-05-22T01:04:42.086344+00:00"},{"alias_kind":"pith_short_16","alias_value":"6ZTFWBON4E3LFM7L","created_at":"2026-05-22T01:04:42.086344+00:00"},{"alias_kind":"pith_short_8","alias_value":"6ZTFWBON","created_at":"2026-05-22T01:04:42.086344+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/6ZTFWBON4E3LFM7LRSYVR4YOSJ","json":"https://pith.science/pith/6ZTFWBON4E3LFM7LRSYVR4YOSJ.json","graph_json":"https://pith.science/api/pith-number/6ZTFWBON4E3LFM7LRSYVR4YOSJ/graph.json","events_json":"https://pith.science/api/pith-number/6ZTFWBON4E3LFM7LRSYVR4YOSJ/events.json","paper":"https://pith.science/paper/6ZTFWBON"},"agent_actions":{"view_html":"https://pith.science/pith/6ZTFWBON4E3LFM7LRSYVR4YOSJ","download_json":"https://pith.science/pith/6ZTFWBON4E3LFM7LRSYVR4YOSJ.json","view_paper":"https://pith.science/paper/6ZTFWBON","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2605.22410&json=true","fetch_graph":"https://pith.science/api/pith-number/6ZTFWBON4E3LFM7LRSYVR4YOSJ/graph.json","fetch_events":"https://pith.science/api/pith-number/6ZTFWBON4E3LFM7LRSYVR4YOSJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6ZTFWBON4E3LFM7LRSYVR4YOSJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6ZTFWBON4E3LFM7LRSYVR4YOSJ/action/storage_attestation","attest_author":"https://pith.science/pith/6ZTFWBON4E3LFM7LRSYVR4YOSJ/action/author_attestation","sign_citation":"https://pith.science/pith/6ZTFWBON4E3LFM7LRSYVR4YOSJ/action/citation_signature","submit_replication":"https://pith.science/pith/6ZTFWBON4E3LFM7LRSYVR4YOSJ/action/replication_record"}},"created_at":"2026-05-22T01:04:42.086344+00:00","updated_at":"2026-05-22T01:04:42.086344+00:00"}