{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:ZHWN7D76ZH72E4WXCBVQ5QVK4G","short_pith_number":"pith:ZHWN7D76","schema_version":"1.0","canonical_sha256":"c9ecdf8ffec9ffa272d7106b0ec2aae1aa0e323add9375d20a879a8e7c75560b","source":{"kind":"arxiv","id":"1903.05537","version":1},"attestation_state":"computed","paper":{"title":"Effective reinforcement learning based local search for the maximum k-plex problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.NE","authors_text":"John H. Drake, Kun He, Una Benlic, Yan Jin","submitted_at":"2019-03-13T15:11:35Z","abstract_excerpt":"The maximum k-plex problem is a computationally complex problem, which emerged from graph-theoretic social network studies. This paper presents an effective hybrid local search for solving the maximum k-plex problem that combines the recently proposed breakout local search algorithm with a reinforcement learning strategy. The proposed approach includes distinguishing features such as: a unified neighborhood search based on the swapping operator, a distance-and-quality reward for actions and a new parameter control mechanism based on reinforcement learning. Extensive experiments for the maximum"},"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":"1903.05537","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2019-03-13T15:11:35Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"9eb675decb183ef6549d7adcda4b61dcb6e2d2ce72d450f3bf7f54d7a296e085","abstract_canon_sha256":"30ce31eea8bb58b1f0cfa7c9eafb9e749a014abd3f561f26374197184b68c69b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:51:20.676092Z","signature_b64":"bp1lflmTtV0ADoXbAeVS2gfx2Lf6AXCHE/BRItiLvynS4bT37guve/5c70wqxEG7y6KVkm5y7HqXK/A5lEhDCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c9ecdf8ffec9ffa272d7106b0ec2aae1aa0e323add9375d20a879a8e7c75560b","last_reissued_at":"2026-05-17T23:51:20.675483Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:51:20.675483Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Effective reinforcement learning based local search for the maximum k-plex problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.NE","authors_text":"John H. Drake, Kun He, Una Benlic, Yan Jin","submitted_at":"2019-03-13T15:11:35Z","abstract_excerpt":"The maximum k-plex problem is a computationally complex problem, which emerged from graph-theoretic social network studies. This paper presents an effective hybrid local search for solving the maximum k-plex problem that combines the recently proposed breakout local search algorithm with a reinforcement learning strategy. The proposed approach includes distinguishing features such as: a unified neighborhood search based on the swapping operator, a distance-and-quality reward for actions and a new parameter control mechanism based on reinforcement learning. Extensive experiments for the maximum"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.05537","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":"1903.05537","created_at":"2026-05-17T23:51:20.675555+00:00"},{"alias_kind":"arxiv_version","alias_value":"1903.05537v1","created_at":"2026-05-17T23:51:20.675555+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.05537","created_at":"2026-05-17T23:51:20.675555+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZHWN7D76ZH72","created_at":"2026-05-18T12:33:33.725879+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZHWN7D76ZH72E4WX","created_at":"2026-05-18T12:33:33.725879+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZHWN7D76","created_at":"2026-05-18T12:33:33.725879+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/ZHWN7D76ZH72E4WXCBVQ5QVK4G","json":"https://pith.science/pith/ZHWN7D76ZH72E4WXCBVQ5QVK4G.json","graph_json":"https://pith.science/api/pith-number/ZHWN7D76ZH72E4WXCBVQ5QVK4G/graph.json","events_json":"https://pith.science/api/pith-number/ZHWN7D76ZH72E4WXCBVQ5QVK4G/events.json","paper":"https://pith.science/paper/ZHWN7D76"},"agent_actions":{"view_html":"https://pith.science/pith/ZHWN7D76ZH72E4WXCBVQ5QVK4G","download_json":"https://pith.science/pith/ZHWN7D76ZH72E4WXCBVQ5QVK4G.json","view_paper":"https://pith.science/paper/ZHWN7D76","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1903.05537&json=true","fetch_graph":"https://pith.science/api/pith-number/ZHWN7D76ZH72E4WXCBVQ5QVK4G/graph.json","fetch_events":"https://pith.science/api/pith-number/ZHWN7D76ZH72E4WXCBVQ5QVK4G/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZHWN7D76ZH72E4WXCBVQ5QVK4G/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZHWN7D76ZH72E4WXCBVQ5QVK4G/action/storage_attestation","attest_author":"https://pith.science/pith/ZHWN7D76ZH72E4WXCBVQ5QVK4G/action/author_attestation","sign_citation":"https://pith.science/pith/ZHWN7D76ZH72E4WXCBVQ5QVK4G/action/citation_signature","submit_replication":"https://pith.science/pith/ZHWN7D76ZH72E4WXCBVQ5QVK4G/action/replication_record"}},"created_at":"2026-05-17T23:51:20.675555+00:00","updated_at":"2026-05-17T23:51:20.675555+00:00"}