{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:RQ6F2U7IT6NWNVR7UX6UIJ7HP4","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"437c3e69138142ea3a247b9a1d683053676368d54634c0a3fe1afdf33d6e2097","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2016-04-01T19:38:35Z","title_canon_sha256":"b07f4f0b6810a47c3d6f2b38ff65bf6136840d6cdfb0534425488d9bbacdf2c7"},"schema_version":"1.0","source":{"id":"1604.00377","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1604.00377","created_at":"2026-05-18T01:17:53Z"},{"alias_kind":"arxiv_version","alias_value":"1604.00377v1","created_at":"2026-05-18T01:17:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.00377","created_at":"2026-05-18T01:17:53Z"},{"alias_kind":"pith_short_12","alias_value":"RQ6F2U7IT6NW","created_at":"2026-05-18T12:30:41Z"},{"alias_kind":"pith_short_16","alias_value":"RQ6F2U7IT6NWNVR7","created_at":"2026-05-18T12:30:41Z"},{"alias_kind":"pith_short_8","alias_value":"RQ6F2U7I","created_at":"2026-05-18T12:30:41Z"}],"graph_snapshots":[{"event_id":"sha256:47f8e488b8f23b9080416420cff75c0f54def7fe7438962110ab3c6400cf1676","target":"graph","created_at":"2026-05-18T01:17:53Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"B\\'eatrice Duval, Jin-Kao Hao, Yangming Zhou","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2016-04-01T19:38:35Z","title":"Reinforcement learning based local search for grouping problems: A case study on graph coloring"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.00377","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:09c056b5d3545a565bf352c28696a7f844dbb09c1763b183f1836415b06d52b6","target":"record","created_at":"2026-05-18T01:17:53Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"437c3e69138142ea3a247b9a1d683053676368d54634c0a3fe1afdf33d6e2097","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2016-04-01T19:38:35Z","title_canon_sha256":"b07f4f0b6810a47c3d6f2b38ff65bf6136840d6cdfb0534425488d9bbacdf2c7"},"schema_version":"1.0","source":{"id":"1604.00377","kind":"arxiv","version":1}},"canonical_sha256":"8c3c5d53e89f9b66d63fa5fd4427e77f124a105726631ed349669fe192882d14","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8c3c5d53e89f9b66d63fa5fd4427e77f124a105726631ed349669fe192882d14","first_computed_at":"2026-05-18T01:17:53.792090Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:17:53.792090Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ys42pvmqFBI+R4jP6Xdu0vYQbnPLAeadzlYknvWJ5kmFaUbZYSsQV+aeFbv7zeXo1Mf9gWgCaF2jU1zRFLbZAw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:17:53.792698Z","signed_message":"canonical_sha256_bytes"},"source_id":"1604.00377","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:09c056b5d3545a565bf352c28696a7f844dbb09c1763b183f1836415b06d52b6","sha256:47f8e488b8f23b9080416420cff75c0f54def7fe7438962110ab3c6400cf1676"],"state_sha256":"4ff45354a2ee31146e689ff3932cd9dc8705c389c0a5377e02cc7e2f0bf52e8d"}