{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:RQ6F2U7IT6NWNVR7UX6UIJ7HP4","short_pith_number":"pith:RQ6F2U7I","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"},"canonical_sha256":"8c3c5d53e89f9b66d63fa5fd4427e77f124a105726631ed349669fe192882d14","source":{"kind":"arxiv","id":"1604.00377","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"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:RQ6F2U7IT6NWNVR7UX6UIJ7HP4","target":"record","payload":{"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"},"canonical_sha256":"8c3c5d53e89f9b66d63fa5fd4427e77f124a105726631ed349669fe192882d14","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"},"source_kind":"arxiv","source_id":"1604.00377","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:17:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lXKuwo96N75sV3fnxZylLlNwzQEpA4AuEqSIzWbdbagHCyvekHByd9GD1fQLgHCaT+9nNQHPU86XGuXwBblQAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T19:02:53.214554Z"},"content_sha256":"09c056b5d3545a565bf352c28696a7f844dbb09c1763b183f1836415b06d52b6","schema_version":"1.0","event_id":"sha256:09c056b5d3545a565bf352c28696a7f844dbb09c1763b183f1836415b06d52b6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:RQ6F2U7IT6NWNVR7UX6UIJ7HP4","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:17:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mzwOb4wqz5Uht7QaDQtlUBh3XzQT+n3LhCzRJxIX4LWTkRm7ttDUfDsiC/fU/0tUioPxbTWuGRmH55gTRkXVDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T19:02:53.214915Z"},"content_sha256":"47f8e488b8f23b9080416420cff75c0f54def7fe7438962110ab3c6400cf1676","schema_version":"1.0","event_id":"sha256:47f8e488b8f23b9080416420cff75c0f54def7fe7438962110ab3c6400cf1676"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RQ6F2U7IT6NWNVR7UX6UIJ7HP4/bundle.json","state_url":"https://pith.science/pith/RQ6F2U7IT6NWNVR7UX6UIJ7HP4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RQ6F2U7IT6NWNVR7UX6UIJ7HP4/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-01T19:02:53Z","links":{"resolver":"https://pith.science/pith/RQ6F2U7IT6NWNVR7UX6UIJ7HP4","bundle":"https://pith.science/pith/RQ6F2U7IT6NWNVR7UX6UIJ7HP4/bundle.json","state":"https://pith.science/pith/RQ6F2U7IT6NWNVR7UX6UIJ7HP4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RQ6F2U7IT6NWNVR7UX6UIJ7HP4/bundle.json"},"state":{"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"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"E/p41/ag2jSZu9vqrMNrPUCfarqCrhN48kb2CmJMfR6sQVBXPgWqUxJyuJ/VBcIBNdTIs4FVLimoDrvzIPgrBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T19:02:53.216842Z","bundle_sha256":"185355b39c5a62509bfa2ee7012e1f727d35f91b5b7801ef9f95d1379e948126"}}