{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:4WPA4MYAXZCBIX7GAIUX567WYH","short_pith_number":"pith:4WPA4MYA","schema_version":"1.0","canonical_sha256":"e59e0e3300be44145fe602297efbf6c1da4b0752fcdb614c7d317dc36e76f9ac","source":{"kind":"arxiv","id":"2505.20972","version":1},"attestation_state":"computed","paper":{"title":"Deep k-grouping: An Unsupervised Learning Framework for Combinatorial Optimization on Graphs and Hypergraphs","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Chunqi Yang, Sen Bai, Xin Bai, Xin Zhang, Zhengang Jiang","submitted_at":"2025-05-27T10:04:54Z","abstract_excerpt":"Along with AI computing shining in scientific discovery, its potential in the combinatorial optimization (CO) domain has also emerged in recent years. Yet, existing unsupervised neural network solvers struggle to solve $k$-grouping problems (e.g., coloring, partitioning) on large-scale graphs and hypergraphs, due to limited computational frameworks. In this work, we propose Deep $k$-grouping, an unsupervised learning-based CO framework. Specifically, we contribute: Novel one-hot encoded polynomial unconstrained binary optimization (OH-PUBO), a formulation for modeling k-grouping problems on gr"},"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.20972","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.LG","submitted_at":"2025-05-27T10:04:54Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"413fa72e667459b0b72dea939530dde972c808e44c6cf482f79348ef51e967f7","abstract_canon_sha256":"0448f95c48ea1f2a9f2a1d8ad9bbd09f8c4d12bd006918bdee5196dccd3f6b89"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:10:21.826614Z","signature_b64":"rM8gY+uOjwh6UqZBQowxSWCrH5SSfGI/KlxLc0NbQHtWhcWaSXphzDWQkEVwvVCGOCAqgSijRBkNpxJRmwcHDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e59e0e3300be44145fe602297efbf6c1da4b0752fcdb614c7d317dc36e76f9ac","last_reissued_at":"2026-07-05T11:10:21.826084Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:10:21.826084Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Deep k-grouping: An Unsupervised Learning Framework for Combinatorial Optimization on Graphs and Hypergraphs","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Chunqi Yang, Sen Bai, Xin Bai, Xin Zhang, Zhengang Jiang","submitted_at":"2025-05-27T10:04:54Z","abstract_excerpt":"Along with AI computing shining in scientific discovery, its potential in the combinatorial optimization (CO) domain has also emerged in recent years. Yet, existing unsupervised neural network solvers struggle to solve $k$-grouping problems (e.g., coloring, partitioning) on large-scale graphs and hypergraphs, due to limited computational frameworks. In this work, we propose Deep $k$-grouping, an unsupervised learning-based CO framework. Specifically, we contribute: Novel one-hot encoded polynomial unconstrained binary optimization (OH-PUBO), a formulation for modeling k-grouping problems on gr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.20972","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.20972/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.20972","created_at":"2026-07-05T11:10:21.826152+00:00"},{"alias_kind":"arxiv_version","alias_value":"2505.20972v1","created_at":"2026-07-05T11:10:21.826152+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.20972","created_at":"2026-07-05T11:10:21.826152+00:00"},{"alias_kind":"pith_short_12","alias_value":"4WPA4MYAXZCB","created_at":"2026-07-05T11:10:21.826152+00:00"},{"alias_kind":"pith_short_16","alias_value":"4WPA4MYAXZCBIX7G","created_at":"2026-07-05T11:10:21.826152+00:00"},{"alias_kind":"pith_short_8","alias_value":"4WPA4MYA","created_at":"2026-07-05T11:10:21.826152+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/4WPA4MYAXZCBIX7GAIUX567WYH","json":"https://pith.science/pith/4WPA4MYAXZCBIX7GAIUX567WYH.json","graph_json":"https://pith.science/api/pith-number/4WPA4MYAXZCBIX7GAIUX567WYH/graph.json","events_json":"https://pith.science/api/pith-number/4WPA4MYAXZCBIX7GAIUX567WYH/events.json","paper":"https://pith.science/paper/4WPA4MYA"},"agent_actions":{"view_html":"https://pith.science/pith/4WPA4MYAXZCBIX7GAIUX567WYH","download_json":"https://pith.science/pith/4WPA4MYAXZCBIX7GAIUX567WYH.json","view_paper":"https://pith.science/paper/4WPA4MYA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2505.20972&json=true","fetch_graph":"https://pith.science/api/pith-number/4WPA4MYAXZCBIX7GAIUX567WYH/graph.json","fetch_events":"https://pith.science/api/pith-number/4WPA4MYAXZCBIX7GAIUX567WYH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4WPA4MYAXZCBIX7GAIUX567WYH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4WPA4MYAXZCBIX7GAIUX567WYH/action/storage_attestation","attest_author":"https://pith.science/pith/4WPA4MYAXZCBIX7GAIUX567WYH/action/author_attestation","sign_citation":"https://pith.science/pith/4WPA4MYAXZCBIX7GAIUX567WYH/action/citation_signature","submit_replication":"https://pith.science/pith/4WPA4MYAXZCBIX7GAIUX567WYH/action/replication_record"}},"created_at":"2026-07-05T11:10:21.826152+00:00","updated_at":"2026-07-05T11:10:21.826152+00:00"}