{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:JVF3LNLRJEVXICZARE5L2KNCHE","short_pith_number":"pith:JVF3LNLR","canonical_record":{"source":{"id":"1605.03915","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.HC","submitted_at":"2016-05-12T18:03:38Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"9779a3221fc331ee1b463cdff6d519b0a6e50010f3f272227d5be94626dd5b0c","abstract_canon_sha256":"f4ff29685feac56b9f4d095404dc4c43ab87320d328fc08f3e36b747087eab44"},"schema_version":"1.0"},"canonical_sha256":"4d4bb5b571492b740b20893abd29a23939a4001f7d58fa26138fb2d22c4bb8ee","source":{"kind":"arxiv","id":"1605.03915","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1605.03915","created_at":"2026-05-18T00:57:49Z"},{"alias_kind":"arxiv_version","alias_value":"1605.03915v2","created_at":"2026-05-18T00:57:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.03915","created_at":"2026-05-18T00:57:49Z"},{"alias_kind":"pith_short_12","alias_value":"JVF3LNLRJEVX","created_at":"2026-05-18T12:30:25Z"},{"alias_kind":"pith_short_16","alias_value":"JVF3LNLRJEVXICZA","created_at":"2026-05-18T12:30:25Z"},{"alias_kind":"pith_short_8","alias_value":"JVF3LNLR","created_at":"2026-05-18T12:30:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:JVF3LNLRJEVXICZARE5L2KNCHE","target":"record","payload":{"canonical_record":{"source":{"id":"1605.03915","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.HC","submitted_at":"2016-05-12T18:03:38Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"9779a3221fc331ee1b463cdff6d519b0a6e50010f3f272227d5be94626dd5b0c","abstract_canon_sha256":"f4ff29685feac56b9f4d095404dc4c43ab87320d328fc08f3e36b747087eab44"},"schema_version":"1.0"},"canonical_sha256":"4d4bb5b571492b740b20893abd29a23939a4001f7d58fa26138fb2d22c4bb8ee","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:57:49.645735Z","signature_b64":"9GI/+D7bT/0lrR2edm81/+aHuBV9bDn0VvILERxAP0Pat5s8g7Ms8LsU1Db/sGvV62mAF0f1uD9Xu8lAVjshAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4d4bb5b571492b740b20893abd29a23939a4001f7d58fa26138fb2d22c4bb8ee","last_reissued_at":"2026-05-18T00:57:49.645241Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:57:49.645241Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1605.03915","source_version":2,"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-18T00:57:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jUa7D3OduXoVn8CVgI9/hnMAD91OIPUb+t4wnEcCoX1bpN+nc5b45wsHJS/8dwZ7fWgMOwF3bcij/IypTtrICQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-29T20:46:19.539542Z"},"content_sha256":"111dedff0939db18ddab3f0a3a48981664e74e0fab5633407ceb56d6a904cddd","schema_version":"1.0","event_id":"sha256:111dedff0939db18ddab3f0a3a48981664e74e0fab5633407ceb56d6a904cddd"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:JVF3LNLRJEVXICZARE5L2KNCHE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Optimizing human-interpretable dialog management policy using Genetic Algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.HC","authors_text":"Hang Ren, Weiqun Xu, Yonghong Yan","submitted_at":"2016-05-12T18:03:38Z","abstract_excerpt":"Automatic optimization of spoken dialog management policies that are robust to environmental noise has long been the goal for both academia and industry. Approaches based on reinforcement learning have been proved to be effective. However, the numerical representation of dialog policy is human-incomprehensible and difficult for dialog system designers to verify or modify, which limits its practical application. In this paper we propose a novel framework for optimizing dialog policies specified in domain language using genetic algorithm. The human-interpretable representation of policy makes th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.03915","kind":"arxiv","version":2},"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-18T00:57:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/mKyBW3fCP820loHNGqvZSSCIwmnn4zltXds/OnjanYxkNuehkuomVGskdoC4sBCtKimGxOmtj0gBths9O1RDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-29T20:46:19.539879Z"},"content_sha256":"12f7d974219ad61c6431477ba6cf8cf4d10f62dc45177d096cafa2ec0e13ae2e","schema_version":"1.0","event_id":"sha256:12f7d974219ad61c6431477ba6cf8cf4d10f62dc45177d096cafa2ec0e13ae2e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JVF3LNLRJEVXICZARE5L2KNCHE/bundle.json","state_url":"https://pith.science/pith/JVF3LNLRJEVXICZARE5L2KNCHE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JVF3LNLRJEVXICZARE5L2KNCHE/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-29T20:46:19Z","links":{"resolver":"https://pith.science/pith/JVF3LNLRJEVXICZARE5L2KNCHE","bundle":"https://pith.science/pith/JVF3LNLRJEVXICZARE5L2KNCHE/bundle.json","state":"https://pith.science/pith/JVF3LNLRJEVXICZARE5L2KNCHE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JVF3LNLRJEVXICZARE5L2KNCHE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:JVF3LNLRJEVXICZARE5L2KNCHE","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":"f4ff29685feac56b9f4d095404dc4c43ab87320d328fc08f3e36b747087eab44","cross_cats_sorted":["cs.AI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.HC","submitted_at":"2016-05-12T18:03:38Z","title_canon_sha256":"9779a3221fc331ee1b463cdff6d519b0a6e50010f3f272227d5be94626dd5b0c"},"schema_version":"1.0","source":{"id":"1605.03915","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1605.03915","created_at":"2026-05-18T00:57:49Z"},{"alias_kind":"arxiv_version","alias_value":"1605.03915v2","created_at":"2026-05-18T00:57:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.03915","created_at":"2026-05-18T00:57:49Z"},{"alias_kind":"pith_short_12","alias_value":"JVF3LNLRJEVX","created_at":"2026-05-18T12:30:25Z"},{"alias_kind":"pith_short_16","alias_value":"JVF3LNLRJEVXICZA","created_at":"2026-05-18T12:30:25Z"},{"alias_kind":"pith_short_8","alias_value":"JVF3LNLR","created_at":"2026-05-18T12:30:25Z"}],"graph_snapshots":[{"event_id":"sha256:12f7d974219ad61c6431477ba6cf8cf4d10f62dc45177d096cafa2ec0e13ae2e","target":"graph","created_at":"2026-05-18T00:57:49Z","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":"Automatic optimization of spoken dialog management policies that are robust to environmental noise has long been the goal for both academia and industry. Approaches based on reinforcement learning have been proved to be effective. However, the numerical representation of dialog policy is human-incomprehensible and difficult for dialog system designers to verify or modify, which limits its practical application. In this paper we propose a novel framework for optimizing dialog policies specified in domain language using genetic algorithm. The human-interpretable representation of policy makes th","authors_text":"Hang Ren, Weiqun Xu, Yonghong Yan","cross_cats":["cs.AI"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.HC","submitted_at":"2016-05-12T18:03:38Z","title":"Optimizing human-interpretable dialog management policy using Genetic Algorithm"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.03915","kind":"arxiv","version":2},"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:111dedff0939db18ddab3f0a3a48981664e74e0fab5633407ceb56d6a904cddd","target":"record","created_at":"2026-05-18T00:57:49Z","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":"f4ff29685feac56b9f4d095404dc4c43ab87320d328fc08f3e36b747087eab44","cross_cats_sorted":["cs.AI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.HC","submitted_at":"2016-05-12T18:03:38Z","title_canon_sha256":"9779a3221fc331ee1b463cdff6d519b0a6e50010f3f272227d5be94626dd5b0c"},"schema_version":"1.0","source":{"id":"1605.03915","kind":"arxiv","version":2}},"canonical_sha256":"4d4bb5b571492b740b20893abd29a23939a4001f7d58fa26138fb2d22c4bb8ee","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4d4bb5b571492b740b20893abd29a23939a4001f7d58fa26138fb2d22c4bb8ee","first_computed_at":"2026-05-18T00:57:49.645241Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:57:49.645241Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"9GI/+D7bT/0lrR2edm81/+aHuBV9bDn0VvILERxAP0Pat5s8g7Ms8LsU1Db/sGvV62mAF0f1uD9Xu8lAVjshAg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:57:49.645735Z","signed_message":"canonical_sha256_bytes"},"source_id":"1605.03915","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:111dedff0939db18ddab3f0a3a48981664e74e0fab5633407ceb56d6a904cddd","sha256:12f7d974219ad61c6431477ba6cf8cf4d10f62dc45177d096cafa2ec0e13ae2e"],"state_sha256":"6d5dd7d20c4ec961678ebea17a9a0be29d14a5f4954d5b151dc9d9f77829ca39"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RWmOX50buAudVn8GM6lpXzAm0IV4uw+Uj/c20DERGVdmNkPwjXbqgUTtmRwzJk/Oqf8Tr1/DLprzrUvXpIRVDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-29T20:46:19.541997Z","bundle_sha256":"0273b2e63b99c90628b644c08a4bbf7c5285247cc01b4a37fbdc5ddc087012ae"}}