{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:QFYRB4GNAVFURAIIJA3OBH3JEV","short_pith_number":"pith:QFYRB4GN","schema_version":"1.0","canonical_sha256":"817110f0cd054b4881084836e09f69254cc98fb3ca696f3de01a413b98fccd37","source":{"kind":"arxiv","id":"2504.19419","version":3},"attestation_state":"computed","paper":{"title":"Advancing Local Clustering on Graphs via Compressive Sensing: Semi-supervised and Unsupervised Methods","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Sung Ha Kang, Zhaiming Shen","submitted_at":"2025-04-28T02:10:18Z","abstract_excerpt":"Local clustering aims to identify specific substructures within a large graph without any additional structural information of the graph. These substructures are typically small compared to the overall graph, enabling the problem to be approached by finding a sparse solution to a linear system associated with the graph Laplacian. In this work, we first propose a method for identifying specific local clusters when very few labeled data are given, which we term semi-supervised local clustering. We then extend this approach to the unsupervised setting when no prior information on labels is availa"},"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":"2504.19419","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2025-04-28T02:10:18Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"62490c1cb651bad1c054bd6ba2e4916902d450a564ac4ff4b02c375fc8bfe564","abstract_canon_sha256":"5032c5d384229fda413f38e8477d1f78eca4077ab0187d8eff080107417be6d2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-02T01:03:31.364697Z","signature_b64":"3woWjKdUYuUnJUcC4QQ/8rPdTxVRyvVpZ5jJRS6Xe6HfHiNZCdOrAzeywcv7gGDqptqKUIgKet9ET4LSt82DCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"817110f0cd054b4881084836e09f69254cc98fb3ca696f3de01a413b98fccd37","last_reissued_at":"2026-06-02T01:03:31.364197Z","signature_status":"signed_v1","first_computed_at":"2026-06-02T01:03:31.364197Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Advancing Local Clustering on Graphs via Compressive Sensing: Semi-supervised and Unsupervised Methods","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Sung Ha Kang, Zhaiming Shen","submitted_at":"2025-04-28T02:10:18Z","abstract_excerpt":"Local clustering aims to identify specific substructures within a large graph without any additional structural information of the graph. These substructures are typically small compared to the overall graph, enabling the problem to be approached by finding a sparse solution to a linear system associated with the graph Laplacian. In this work, we first propose a method for identifying specific local clusters when very few labeled data are given, which we term semi-supervised local clustering. We then extend this approach to the unsupervised setting when no prior information on labels is availa"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2504.19419","kind":"arxiv","version":3},"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/2504.19419/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":"2504.19419","created_at":"2026-06-02T01:03:31.364255+00:00"},{"alias_kind":"arxiv_version","alias_value":"2504.19419v3","created_at":"2026-06-02T01:03:31.364255+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2504.19419","created_at":"2026-06-02T01:03:31.364255+00:00"},{"alias_kind":"pith_short_12","alias_value":"QFYRB4GNAVFU","created_at":"2026-06-02T01:03:31.364255+00:00"},{"alias_kind":"pith_short_16","alias_value":"QFYRB4GNAVFURAII","created_at":"2026-06-02T01:03:31.364255+00:00"},{"alias_kind":"pith_short_8","alias_value":"QFYRB4GN","created_at":"2026-06-02T01:03:31.364255+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/QFYRB4GNAVFURAIIJA3OBH3JEV","json":"https://pith.science/pith/QFYRB4GNAVFURAIIJA3OBH3JEV.json","graph_json":"https://pith.science/api/pith-number/QFYRB4GNAVFURAIIJA3OBH3JEV/graph.json","events_json":"https://pith.science/api/pith-number/QFYRB4GNAVFURAIIJA3OBH3JEV/events.json","paper":"https://pith.science/paper/QFYRB4GN"},"agent_actions":{"view_html":"https://pith.science/pith/QFYRB4GNAVFURAIIJA3OBH3JEV","download_json":"https://pith.science/pith/QFYRB4GNAVFURAIIJA3OBH3JEV.json","view_paper":"https://pith.science/paper/QFYRB4GN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2504.19419&json=true","fetch_graph":"https://pith.science/api/pith-number/QFYRB4GNAVFURAIIJA3OBH3JEV/graph.json","fetch_events":"https://pith.science/api/pith-number/QFYRB4GNAVFURAIIJA3OBH3JEV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QFYRB4GNAVFURAIIJA3OBH3JEV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QFYRB4GNAVFURAIIJA3OBH3JEV/action/storage_attestation","attest_author":"https://pith.science/pith/QFYRB4GNAVFURAIIJA3OBH3JEV/action/author_attestation","sign_citation":"https://pith.science/pith/QFYRB4GNAVFURAIIJA3OBH3JEV/action/citation_signature","submit_replication":"https://pith.science/pith/QFYRB4GNAVFURAIIJA3OBH3JEV/action/replication_record"}},"created_at":"2026-06-02T01:03:31.364255+00:00","updated_at":"2026-06-02T01:03:31.364255+00:00"}