{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:RQ6F2U7IT6NWNVR7UX6UIJ7HP4","short_pith_number":"pith:RQ6F2U7I","schema_version":"1.0","canonical_sha256":"8c3c5d53e89f9b66d63fa5fd4427e77f124a105726631ed349669fe192882d14","source":{"kind":"arxiv","id":"1604.00377","version":1},"attestation_state":"computed","paper":{"title":"Reinforcement learning based local search for grouping problems: A case study on graph coloring","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"B\\'eatrice Duval, Jin-Kao Hao, Yangming Zhou","submitted_at":"2016-04-01T19:38:35Z","abstract_excerpt":"Grouping problems aim to partition a set of items into multiple mutually disjoint subsets according to some specific criterion and constraints. Grouping problems cover a large class of important combinatorial optimization problems that are generally computationally difficult. In this paper, we propose a general solution approach for grouping problems, i.e., reinforcement learning based local search (RLS), which combines reinforcement learning techniques with descent-based local search. The viability of the proposed approach is verified on a well-known representative grouping problem (graph col"},"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":"1604.00377","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2016-04-01T19:38:35Z","cross_cats_sorted":[],"title_canon_sha256":"b07f4f0b6810a47c3d6f2b38ff65bf6136840d6cdfb0534425488d9bbacdf2c7","abstract_canon_sha256":"437c3e69138142ea3a247b9a1d683053676368d54634c0a3fe1afdf33d6e2097"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:17:53.792698Z","signature_b64":"ys42pvmqFBI+R4jP6Xdu0vYQbnPLAeadzlYknvWJ5kmFaUbZYSsQV+aeFbv7zeXo1Mf9gWgCaF2jU1zRFLbZAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8c3c5d53e89f9b66d63fa5fd4427e77f124a105726631ed349669fe192882d14","last_reissued_at":"2026-05-18T01:17:53.792090Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:17:53.792090Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Reinforcement learning based local search for grouping problems: A case study on graph coloring","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"B\\'eatrice Duval, Jin-Kao Hao, Yangming Zhou","submitted_at":"2016-04-01T19:38:35Z","abstract_excerpt":"Grouping problems aim to partition a set of items into multiple mutually disjoint subsets according to some specific criterion and constraints. Grouping problems cover a large class of important combinatorial optimization problems that are generally computationally difficult. In this paper, we propose a general solution approach for grouping problems, i.e., reinforcement learning based local search (RLS), which combines reinforcement learning techniques with descent-based local search. The viability of the proposed approach is verified on a well-known representative grouping problem (graph col"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.00377","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":""},"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":"1604.00377","created_at":"2026-05-18T01:17:53.792201+00:00"},{"alias_kind":"arxiv_version","alias_value":"1604.00377v1","created_at":"2026-05-18T01:17:53.792201+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.00377","created_at":"2026-05-18T01:17:53.792201+00:00"},{"alias_kind":"pith_short_12","alias_value":"RQ6F2U7IT6NW","created_at":"2026-05-18T12:30:41.710351+00:00"},{"alias_kind":"pith_short_16","alias_value":"RQ6F2U7IT6NWNVR7","created_at":"2026-05-18T12:30:41.710351+00:00"},{"alias_kind":"pith_short_8","alias_value":"RQ6F2U7I","created_at":"2026-05-18T12:30:41.710351+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/RQ6F2U7IT6NWNVR7UX6UIJ7HP4","json":"https://pith.science/pith/RQ6F2U7IT6NWNVR7UX6UIJ7HP4.json","graph_json":"https://pith.science/api/pith-number/RQ6F2U7IT6NWNVR7UX6UIJ7HP4/graph.json","events_json":"https://pith.science/api/pith-number/RQ6F2U7IT6NWNVR7UX6UIJ7HP4/events.json","paper":"https://pith.science/paper/RQ6F2U7I"},"agent_actions":{"view_html":"https://pith.science/pith/RQ6F2U7IT6NWNVR7UX6UIJ7HP4","download_json":"https://pith.science/pith/RQ6F2U7IT6NWNVR7UX6UIJ7HP4.json","view_paper":"https://pith.science/paper/RQ6F2U7I","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1604.00377&json=true","fetch_graph":"https://pith.science/api/pith-number/RQ6F2U7IT6NWNVR7UX6UIJ7HP4/graph.json","fetch_events":"https://pith.science/api/pith-number/RQ6F2U7IT6NWNVR7UX6UIJ7HP4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RQ6F2U7IT6NWNVR7UX6UIJ7HP4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RQ6F2U7IT6NWNVR7UX6UIJ7HP4/action/storage_attestation","attest_author":"https://pith.science/pith/RQ6F2U7IT6NWNVR7UX6UIJ7HP4/action/author_attestation","sign_citation":"https://pith.science/pith/RQ6F2U7IT6NWNVR7UX6UIJ7HP4/action/citation_signature","submit_replication":"https://pith.science/pith/RQ6F2U7IT6NWNVR7UX6UIJ7HP4/action/replication_record"}},"created_at":"2026-05-18T01:17:53.792201+00:00","updated_at":"2026-05-18T01:17:53.792201+00:00"}