{"assumptions":["The supplied JSON is an already canonical, bounded snapshot and its canonical graph hash is checked.","The supplied deontic adapter is the authoritative normative boundary for this finite model and returns a total eight-action classification, status, and reason IDs for every state.","StateRef.applicable means that the current real graph node is a valid resolution target, not that the required decision is globally inapplicable.","Only explicitly padded graph slots are abstain_or_escalate-only; real non-target nodes permit structurally available navigation plus abstain_or_escalate and forbid resolve.","Real target nodes with incomplete required evidence permit structurally available navigation plus abstain_or_escalate and forbid resolve; complete target states make resolve obligatory and exclusive under the evidence-completion adapter.","The first resolution alternative in stable ID order is the receipt label for the single resolve action.","Missing navigation candidates are unavailable actions, while graph-slot padding is explicit and abstain-only."],"compiler_stages":[{"output_sha256":"dd780e0e0f67f42d77d6b22b1e61035bb9f34e5d8d41e965b3b13915e46dbc39","stage":"canonical_knowledge"},{"conflict_or_incomplete_policy":"abstain_or_escalate_only","output_sha256":"33b7702bc4f3798b2dc91b2697d2978a08b0a2347195b3d1621a8f8862851607","precedence":"forbidden_and_obligatory_constraints_before_utility_ranking","stage":"normative_action_mask"},{"output_sha256":"a2c773b441ec04ca8dbb086d96ba9bde58de88e96c9057e398c7ceb068c96f15","record":{"adapter_class":"EvidenceCompletionDeonticAdapter","esso_evidence_hashes":{"ir_sha256":"0fed6db3d9a4a1927cda867e0683c5a257c9feb9471452f7eb5621820900b965","model_sha256":"78e5d57a463365d21741045a64a556176427963eb81aae0c0a8d48e0ee56b270"},"logic_semantics":"bounded-finite-detachment-v1","logic_semantics_sha256":"1a95da0066a4bdb8a8fb6cfde4629eab95ac35d3b814bfcaf21e10328ed355df","profile":"neutral-evidence-completion-v1","profile_sha256":"4046ef1d6377f9eed77d86b76f7f813268d51bef6af8b2fd5a93c355b8c51efa","schema":"evidence-completion-deontic-provenance-v1"},"stage":"deontic_adapter_provenance"},{"model":{"abstain_reward":0.0,"navigation_cost":-0.009999999776482582,"new_evidence_reward":0.019999999552965164,"resolve_reward":1.0,"version":"bounded-required-decision-utility-v1"},"output_sha256":"32cdfa3998d980e7b2e4ca089f79a8b9d5d475b3592f149494c4a7e4a3cdef68","stage":"utility_outcome_model"},{"output_sha256":"e1e755a711962f9f7f4b359b01d2b9e58e563daed7fa800b46f8653c10b30994","recurrence":{"abstain_or_escalate":"utility.abstain_reward_and_terminal","action_order":["navigate_0","navigate_1","navigate_2","navigate_3","navigate_4","navigate_5","resolve","abstain_or_escalate"],"dtype":"<f4","first_index_tie_break":true,"gamma":0.99,"horizon_axis":"remaining_decision_steps_not_chronological_time","layer_zero":"terminal_actions_only","layers":256,"navigation":"utility.navigation_cost + new_evidence_bits * utility.new_evidence_reward + gamma * V[layer-1,next_state]","resolve":"utility.resolve_reward_and_terminal","unavailable_value":-1000000.0,"version":"knowledge-q-finite-horizon-v1"},"stage":"bellman_dynamic_program"}],"counts":{"actions":8,"actual_graph_nodes":256,"declared_graph_node_slots":256,"deontic_conflict_states":0,"deontic_incomplete_states":0,"evidence_complete_states":10,"evidence_incomplete_states":14,"evidence_non_applicable_states":6120,"evidence_padded_states":0,"required_decisions":6,"snapshot_missing_ids":0,"states":6144},"evidence_mask_semantics":{"bit_0":"forward discovery channel traversed","bit_1":"reverse-browse discovery channel traversed","bit_width":2,"mask_values":[0,1,2,3],"nonclaim":"neither bit asserts that a graph edge is true or proves a proposition"},"input":{"config_sha256":"9abb506488988731076c02964a9a8f2307210091d7375a85f658f56c641cb213","deontic_adapter_provenance_sha256":"a2c773b441ec04ca8dbb086d96ba9bde58de88e96c9057e398c7ceb068c96f15","deontic_constraints_sha256":"33b7702bc4f3798b2dc91b2697d2978a08b0a2347195b3d1621a8f8862851607","input_sha256":"e5345ac21cf026c504bb68c55e6ef91795a0c65adcb6c3e01fb700014c0f6d1e","recurrence_sha256":"e1e755a711962f9f7f4b359b01d2b9e58e563daed7fa800b46f8653c10b30994","required_decisions_sha256":"9d7082f6f666c4823c41407959294ec02f011b85df84d5c1aff80c2f92b40141","snapshot_sha256":"dd780e0e0f67f42d77d6b22b1e61035bb9f34e5d8d41e965b3b13915e46dbc39","utility_model_sha256":"32cdfa3998d980e7b2e4ca089f79a8b9d5d475b3592f149494c4a7e4a3cdef68"},"limitations":["The finite-horizon values are exact only for this bounded model, canonical snapshot, adapter output, and explicit utility model.","Graph edges, including reverse browsing edges, are navigation/evidence discovery links and never logical implication or proof.","The deontic kernel owns obligation, prohibition, permission, conflict, and incompleteness semantics; the Q recurrence only consumes its mask.","The snapshot may be incomplete or truncated, so the artifact does not claim world-model completeness or factual verification.","Snapshot truncation or missing node IDs are preserved as input limitations."],"output":{"artifact_identity_sha256":"f209d14e9f5082462ecf9c600c54760faeb2104430c677d15681c44e569852f0","dtype":"<f4","file_name":"glassmind_knowledge_256_50mb.npy","npy_file_bytes":50331776,"order":"C","raw_data_bytes":50331648,"sha256":"39b26a62f096011efe0b8ec444cff917b736f5713fcf7221665a7c9d10790c2e","shape":[256,6144,8]},"padding_counts":{"padded_graph_slots":0,"padded_navigation_slots_for_graph_padding":0,"unused_navigation_slots_on_real_nodes":835},"planner":{"action_order":["navigate_0","navigate_1","navigate_2","navigate_3","navigate_4","navigate_5","resolve","abstain_or_escalate"],"actions":["navigate_0","navigate_1","navigate_2","navigate_3","navigate_4","navigate_5","resolve","abstain_or_escalate"],"allow_explicit_padding":true,"bellman_layer_zero_is_terminal_only":true,"chunk_size":4096,"decisions":6,"evidence_mask_bits":2,"first_index_tie_break":true,"gamma":0.99,"horizon_semantics":"remaining_decision_steps_not_chronological_time","layers":256,"node_slots":256,"profile":"public","state_factorization":{"decisions":6,"evidence_masks":4,"graph_node_slots":256,"state_count":6144}},"provenance":{"deontic_adapter":{"adapter_class":"EvidenceCompletionDeonticAdapter","esso_evidence_hashes":{"ir_sha256":"0fed6db3d9a4a1927cda867e0683c5a257c9feb9471452f7eb5621820900b965","model_sha256":"78e5d57a463365d21741045a64a556176427963eb81aae0c0a8d48e0ee56b270"},"logic_semantics":"bounded-finite-detachment-v1","logic_semantics_sha256":"1a95da0066a4bdb8a8fb6cfde4629eab95ac35d3b814bfcaf21e10328ed355df","profile":"neutral-evidence-completion-v1","profile_sha256":"4046ef1d6377f9eed77d86b76f7f813268d51bef6af8b2fd5a93c355b8c51efa","schema":"evidence-completion-deontic-provenance-v1"},"planner_hashes":{"canonical_graph_sha256":"755450aea529f9dc19754bb4e56ab38a8ecd817927891a274881c0cf67cc37e1","config_sha256":"9abb506488988731076c02964a9a8f2307210091d7375a85f658f56c641cb213","deontic_adapter_provenance_sha256":"a2c773b441ec04ca8dbb086d96ba9bde58de88e96c9057e398c7ceb068c96f15","deontic_constraints_sha256":"33b7702bc4f3798b2dc91b2697d2978a08b0a2347195b3d1621a8f8862851607","input_sha256":"e5345ac21cf026c504bb68c55e6ef91795a0c65adcb6c3e01fb700014c0f6d1e","recurrence_sha256":"e1e755a711962f9f7f4b359b01d2b9e58e563daed7fa800b46f8653c10b30994","required_decisions_sha256":"9d7082f6f666c4823c41407959294ec02f011b85df84d5c1aff80c2f92b40141","snapshot_sha256":"dd780e0e0f67f42d77d6b22b1e61035bb9f34e5d8d41e965b3b13915e46dbc39","utility_model_sha256":"32cdfa3998d980e7b2e4ca089f79a8b9d5d475b3592f149494c4a7e4a3cdef68"},"snapshot":{"adapter":"glassmind-oewn-lmf-adapter-v1","canonical_graph_sha256":"755450aea529f9dc19754bb4e56ab38a8ecd817927891a274881c0cf67cc37e1","license":"CC-BY-4.0","nonclaims":["WordNet relations are attributed lexical links, not formal proofs or normative rules.","Reverse graph browsing does not assert an inverse lexical predicate.","The bounded graph is incomplete and absence of a path is not a real-world negative claim."],"retrieved_at":"2026-08-02T00:20:57Z","source_name":"Open English WordNet","source_sha256":"9ca6d1dcb75f822fdd66617f7d9da48142ace38dd544d6ad5e2feca1674ad3fe","source_url":"https://en-word.net/static/english-wordnet-2025.xml.gz","source_version":"2025"}},"schema":"knowledge-q-table-manifest-v1","truncation_counts":{"navigation_candidates_dropped_after_six_slots":299,"snapshot_truncated":1},"verification":{"finite_trace_contract":{"declared_transition_bound":256,"horizon_semantics":"remaining_decision_steps_not_chronological_time","normative_boundary":"the Q recurrence may rank only actions admitted by the external deontic mask","properties":["always_no_forbidden_action","eventually_resolve_or_abstain_or_escalate_within_declared_bound","resolution_is_terminal"],"schema":"knowledge-q-finite-trace-contract-v1","transition_measure":"each navigation decrements the layer; layer zero has terminal actions only"},"finite_trace_gate":"pending_independent_verification","replay_scope":"all layers, all state rows, all eight actions in bounded chunks","status":"generation_only; run verify to obtain exhaustive replay evidence"}}