{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:B56D65SNSJAGZFMVXSAAII3ZRZ","short_pith_number":"pith:B56D65SN","schema_version":"1.0","canonical_sha256":"0f7c3f764d92406c9595bc800423798e7ee3271b53972d673d812dadd22e265d","source":{"kind":"arxiv","id":"2505.18043","version":1},"attestation_state":"computed","paper":{"title":"Improved Algorithms for Overlapping and Robust Clustering of Edge-Colored Hypergraphs: An LP-Based Combinatorial Approach","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DB","cs.DS"],"primary_cat":"cs.LG","authors_text":"Changyeol Lee, Hyung-Chan An, Yongho Shin","submitted_at":"2025-05-23T15:46:16Z","abstract_excerpt":"Clustering is a fundamental task in both machine learning and data mining. Among various methods, edge-colored clustering (ECC) has emerged as a useful approach for handling categorical data. Given a hypergraph with (hyper)edges labeled by colors, ECC aims to assign vertex colors to minimize the number of edges where the vertex color differs from the edge's color. However, traditional ECC has inherent limitations, as it enforces a nonoverlapping and exhaustive clustering. To tackle these limitations, three versions of ECC have been studied: Local ECC and Global ECC, which allow overlapping clu"},"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.18043","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2025-05-23T15:46:16Z","cross_cats_sorted":["cs.DB","cs.DS"],"title_canon_sha256":"d521c5db61ad43c2d4993c645b11f7be2a79896809d5d99ac1066abfee91e6ca","abstract_canon_sha256":"de4bcb58221055d798d990d10a26a3e87ce1b5f8b1d0a6d6eef7db3b748cf1c3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:08:35.857823Z","signature_b64":"lD0fOdZK1mAsxZa6aSH6cviOrVDUCE1jIM8EZYQwhhoJBXz/GhP1CxbBMw+r2WSTdLzG5gfSxBA5458eeMe5BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0f7c3f764d92406c9595bc800423798e7ee3271b53972d673d812dadd22e265d","last_reissued_at":"2026-07-05T11:08:35.857354Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:08:35.857354Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Improved Algorithms for Overlapping and Robust Clustering of Edge-Colored Hypergraphs: An LP-Based Combinatorial Approach","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DB","cs.DS"],"primary_cat":"cs.LG","authors_text":"Changyeol Lee, Hyung-Chan An, Yongho Shin","submitted_at":"2025-05-23T15:46:16Z","abstract_excerpt":"Clustering is a fundamental task in both machine learning and data mining. Among various methods, edge-colored clustering (ECC) has emerged as a useful approach for handling categorical data. Given a hypergraph with (hyper)edges labeled by colors, ECC aims to assign vertex colors to minimize the number of edges where the vertex color differs from the edge's color. However, traditional ECC has inherent limitations, as it enforces a nonoverlapping and exhaustive clustering. To tackle these limitations, three versions of ECC have been studied: Local ECC and Global ECC, which allow overlapping clu"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.18043","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.18043/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.18043","created_at":"2026-07-05T11:08:35.857414+00:00"},{"alias_kind":"arxiv_version","alias_value":"2505.18043v1","created_at":"2026-07-05T11:08:35.857414+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.18043","created_at":"2026-07-05T11:08:35.857414+00:00"},{"alias_kind":"pith_short_12","alias_value":"B56D65SNSJAG","created_at":"2026-07-05T11:08:35.857414+00:00"},{"alias_kind":"pith_short_16","alias_value":"B56D65SNSJAGZFMV","created_at":"2026-07-05T11:08:35.857414+00:00"},{"alias_kind":"pith_short_8","alias_value":"B56D65SN","created_at":"2026-07-05T11:08:35.857414+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/B56D65SNSJAGZFMVXSAAII3ZRZ","json":"https://pith.science/pith/B56D65SNSJAGZFMVXSAAII3ZRZ.json","graph_json":"https://pith.science/api/pith-number/B56D65SNSJAGZFMVXSAAII3ZRZ/graph.json","events_json":"https://pith.science/api/pith-number/B56D65SNSJAGZFMVXSAAII3ZRZ/events.json","paper":"https://pith.science/paper/B56D65SN"},"agent_actions":{"view_html":"https://pith.science/pith/B56D65SNSJAGZFMVXSAAII3ZRZ","download_json":"https://pith.science/pith/B56D65SNSJAGZFMVXSAAII3ZRZ.json","view_paper":"https://pith.science/paper/B56D65SN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2505.18043&json=true","fetch_graph":"https://pith.science/api/pith-number/B56D65SNSJAGZFMVXSAAII3ZRZ/graph.json","fetch_events":"https://pith.science/api/pith-number/B56D65SNSJAGZFMVXSAAII3ZRZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/B56D65SNSJAGZFMVXSAAII3ZRZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/B56D65SNSJAGZFMVXSAAII3ZRZ/action/storage_attestation","attest_author":"https://pith.science/pith/B56D65SNSJAGZFMVXSAAII3ZRZ/action/author_attestation","sign_citation":"https://pith.science/pith/B56D65SNSJAGZFMVXSAAII3ZRZ/action/citation_signature","submit_replication":"https://pith.science/pith/B56D65SNSJAGZFMVXSAAII3ZRZ/action/replication_record"}},"created_at":"2026-07-05T11:08:35.857414+00:00","updated_at":"2026-07-05T11:08:35.857414+00:00"}