{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:QVTESJF5DWAARIIEVQTOQCOER6","short_pith_number":"pith:QVTESJF5","schema_version":"1.0","canonical_sha256":"85664924bd1d8008a104ac26e809c48f93237af39a87e71bdaae861294cab9b1","source":{"kind":"arxiv","id":"2505.08594","version":1},"attestation_state":"computed","paper":{"title":"Clustering of Incomplete Data via a Bipartite Graph Structure","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Amirhossein Javaheri, Daniel P. Palomar","submitted_at":"2025-05-13T14:06:13Z","abstract_excerpt":"There are various approaches to graph learning for data clustering, incorporating different spectral and structural constraints through diverse graph structures. Some methods rely on bipartite graph models, where nodes are divided into two classes: centers and members. These models typically require access to data for the center nodes in addition to observations from the member nodes. However, such additional data may not always be available in many practical scenarios. Moreover, popular Gaussian models for graph learning have demonstrated limited effectiveness in modeling data with heavy-tail"},"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":"2505.08594","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2025-05-13T14:06:13Z","cross_cats_sorted":[],"title_canon_sha256":"1095e206fd6f69b365eaed3280cb1eade5611d29c5be6c053595259e66cf08e6","abstract_canon_sha256":"d5fbed1005df6ab9a23116b42fbc826829357ce5b0a964a886ee9ee4e5d9e557"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:02:33.228180Z","signature_b64":"xRXPw+YJeQfrNGAOlHFbI8O7oFMQhmgvget+OTXIQe1ZZbFDuzd1ZBCzGMtA/2BRKC2nlMx4nkmWn89h2k3gDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"85664924bd1d8008a104ac26e809c48f93237af39a87e71bdaae861294cab9b1","last_reissued_at":"2026-07-05T11:02:33.227626Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:02:33.227626Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Clustering of Incomplete Data via a Bipartite Graph Structure","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Amirhossein Javaheri, Daniel P. Palomar","submitted_at":"2025-05-13T14:06:13Z","abstract_excerpt":"There are various approaches to graph learning for data clustering, incorporating different spectral and structural constraints through diverse graph structures. Some methods rely on bipartite graph models, where nodes are divided into two classes: centers and members. These models typically require access to data for the center nodes in addition to observations from the member nodes. However, such additional data may not always be available in many practical scenarios. Moreover, popular Gaussian models for graph learning have demonstrated limited effectiveness in modeling data with heavy-tail"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.08594","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/2505.08594/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":"2505.08594","created_at":"2026-07-05T11:02:33.227683+00:00"},{"alias_kind":"arxiv_version","alias_value":"2505.08594v1","created_at":"2026-07-05T11:02:33.227683+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.08594","created_at":"2026-07-05T11:02:33.227683+00:00"},{"alias_kind":"pith_short_12","alias_value":"QVTESJF5DWAA","created_at":"2026-07-05T11:02:33.227683+00:00"},{"alias_kind":"pith_short_16","alias_value":"QVTESJF5DWAARIIE","created_at":"2026-07-05T11:02:33.227683+00:00"},{"alias_kind":"pith_short_8","alias_value":"QVTESJF5","created_at":"2026-07-05T11:02:33.227683+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/QVTESJF5DWAARIIEVQTOQCOER6","json":"https://pith.science/pith/QVTESJF5DWAARIIEVQTOQCOER6.json","graph_json":"https://pith.science/api/pith-number/QVTESJF5DWAARIIEVQTOQCOER6/graph.json","events_json":"https://pith.science/api/pith-number/QVTESJF5DWAARIIEVQTOQCOER6/events.json","paper":"https://pith.science/paper/QVTESJF5"},"agent_actions":{"view_html":"https://pith.science/pith/QVTESJF5DWAARIIEVQTOQCOER6","download_json":"https://pith.science/pith/QVTESJF5DWAARIIEVQTOQCOER6.json","view_paper":"https://pith.science/paper/QVTESJF5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2505.08594&json=true","fetch_graph":"https://pith.science/api/pith-number/QVTESJF5DWAARIIEVQTOQCOER6/graph.json","fetch_events":"https://pith.science/api/pith-number/QVTESJF5DWAARIIEVQTOQCOER6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QVTESJF5DWAARIIEVQTOQCOER6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QVTESJF5DWAARIIEVQTOQCOER6/action/storage_attestation","attest_author":"https://pith.science/pith/QVTESJF5DWAARIIEVQTOQCOER6/action/author_attestation","sign_citation":"https://pith.science/pith/QVTESJF5DWAARIIEVQTOQCOER6/action/citation_signature","submit_replication":"https://pith.science/pith/QVTESJF5DWAARIIEVQTOQCOER6/action/replication_record"}},"created_at":"2026-07-05T11:02:33.227683+00:00","updated_at":"2026-07-05T11:02:33.227683+00:00"}