12 results about "Reason Code" patented technology

This invention discloses a citation verification method, apparatus, device, medium, and computer program product, comprising: acquiring original input; extracting the claim text to be verified and a candidate citation list associated with the claim text from the original input to form structured citation information and opinion citation pairs; performing existence verification on each candidate citation in the candidate citation list based on the structured citation information to determine whether the target document corresponding to the candidate citation actually exists and is accessible, generating an existence verification result, which at least includes a reason code and / or a hit method; and performing semantic alignment and support determination on the claim text and evidence fragments in the target document based on the opinion citation pairs to generate an opinion verification conclusion, which at least includes suggested actions and / or evidence location information. These technical features automate the entire citation verification process, improving the accuracy, traceability, and engineering reusability of citation verification.

The invention relates to the technical field of computer software, and discloses an enterprise portal integration method based on a user-defined client, and a desktop end system and a server end system are cooperatively executed. The desktop end system performs signature verification and static compilable verification on the integrated formula package, activates the candidate integrated formula package when both pass the signature verification and the static compilable verification, and returns and activates the previous effective integrated formula package when any one does not pass the signature verification and the static compilable verification; the desktop end system carries out constraint compiling on the precondition expression set and the sequence state machine definition and calculates a satisfiability reachable relation; the desktop end system performs consistency judgment based on the verifiable voucher packet and the target permission range, and outputs entry permission or rejection and reason codes; the server-side system signs and issues a one-time link bill carrying a user after checking a formula version, an interface contract abstract and a sequence state of the bill application parameters; and the desktop end system generates receipt abstracts and idempotent event keys, writes the receipt abstracts and idempotent event keys into an event account book, and compensates and uploads the receipt abstracts and idempotent event keys in batches during offline and network recovery.

Disclosed is a fail-closed conformance control layer for machine-assisted decision artifacts. The system generates replay-verifiable receipts that commit to a canonical artifact digest, evidence and snapshot identifiers, assumptions, toolchain identifiers, and a policy pack identifier and policy version digest. A deterministic validator evaluates a receipt under the versioned policy pack to output PASS, FAIL, or HOLD with reason codes from a reason-code registry, including time-stamped modeled-variability codes. Downstream side effects are gated in a control path and permitted only on PASS; otherwise they are withheld or routed to remediation or human review. The system may emit portable conformance packs and revalidate receipts over time to detect drift and manage a certification lifecycle. Conformance suites with deterministic test vectors and expected validator outputs may certify validator implementations by issuing signed conformance certificates and publishing a certificate or certificate digest to a verifiable certificate registry for independent verification and procurement acceptance testing.

The invention belongs to the crossing field of artificial intelligence and software engineering, and discloses an intelligent supervision audit inference code generation method and system based on a knowledge graph and templated mapping. The method comprises the following steps: firstly, constructing a supervision and audit domain knowledge graph comprising laws and regulations, rules, cases, entities, risk nodes and association relationships thereof; secondly, according to a predefined node mapping rule set, various nodes in the map are analyzed into a standardized logic element tuple, a corresponding preset Python code template is called according to the node type, and a point execution function is generated; meanwhile, a control code for describing inference logic between nodes is generated based on a predefined relation mapping rule; and finally, dynamically aggregating related node functions and control codes into an executable complete audit reasoning program according to a dependency relationship among nodes from target entity nodes by utilizing an automatic reasoning chain assembly algorithm based on graph traversal. According to the invention, the intelligent level and response speed of monitoring and auditing work are obviously improved.

A method for constructing a lookup table for determining outcomes of a prediction model. The method includes: (a) determining all possible outcomes for each hierarchy of the prediction model; (b) determining contributions of a set of features for each hierarchy of the prediction model; and (c) constructing the lookup table based on all possible outcomes and contributions of each of the set of features.

Systems and methods provide fail-closed permit-before-actuate control for high-stakes effectors. A permit engine receives an operation request, canonicalizes operation context to a context digest, and, in an attested execution environment, evaluates a versioned policy pack, optionally with overlays, against the digest and commitments to evidence bundles under freshness thresholds. Upon compliance, a proof-of-policy-compliance receipt is produced, a minimal receipt core is derived, and a receipt commitment is generated. The commitment is anchored in an append-only continuity-verified log publishing signed heads with inclusion and consistency proofs subject to a maximum-merge-delay policy. A mint-after-verify process issues a scoped permit token only after verifying log proofs; the token is bound to the receipt commitment and a token scope and includes anti-replay and validity constraints. An actuation gate denies by default and enables actuation only after time-of-use validation of scope, revocation status, and proof freshness, and outputs precondition failure records with deterministic reason codes.

The application discloses a black list comparison method, device and equipment and a computer readable storage medium, and the method comprises the following steps: when a comparison instruction is received, user information and product system information corresponding to the comparison instruction are acquired, and it is inquired whether the user information exists in a black list according to the user information and the product system information; if the user information exists in the black list, a target reason code corresponding to the user information is determined according to the product system information; and the target reason code is input into a rule engine to determine whether a user corresponding to the user information is rejected. If it is determined that the user information exists in the black list, the target reason code corresponding to the user information is determined according to the product system information, and the target reason code is input into the rule engine to determine whether the user corresponding to the user information is rejected, so that the practicability of the black list comparison method is improved.

Systems and methods for computing feature contribution and providing hum-interpretable reason codes for a Support Vector Machine (SVM) model are disclosed, A system computes, for each data point from amongst plurality of data points indicative of plurality of features, a feature contribution of each one of the plurality of features for a SVM model used for at least one of classification decision and a regression analysis. Further, the system provides human interpretable reason code for the interpretation corresponding to at least one of classification decision and the regression analysis from the SVM model. The system outputs to the user, a feature contribution output, and the human interpretable reason codes output. The feature contribution output and the human interpretable reason codes output are indicative of an acceptable decision to be taken by the user based on the classification decision and the regression analysis received from the SVM model.

A policy-controlled transaction system implements an A⋅C⋅T pipeline (Attest-Consent-Transact) with minimum-disclosure attestation and device-side BEITAPE capture. A policy engine retrieves a versioned policy (BEISEC) and reason codes. A dual-window rollback state machine provides Δt1 user rollback and Δt2 compliance rollback before finalization. A clearing ticket (BEICT) embeds an audit_hash computed over BEITAPE, a secure execution token (BEISET), and the policy_version, which are carried end-to-end in ISO 20022 messages. Upon expiry of Δt1 / Δt2 without valid rollback, the BEICT is finalized through BEICX and a BillProof is written to BEITREASURY; an external validator can recompute audit_hash and issue a signed verification report. The approach reduces data exposure while enabling verifiable compliance, reversible execution, and auditable settlement.

The invention discloses an on-chip forced audit execution netting method and device for a back-mounted vehicle-mounted terminal and a storage medium. The method comprises the following steps: setting controlled execution points forcibly passed by a terminal on key paths such as normalized coding-gating check-signature triggering / encryption-sealed submission, so that a service side can only enter key operation through a protected calling interface or a hardware state machine, and automatically writing an audit anchor point field associated with polyver / section (and optional rulevel / codever) at each controlled execution point; and when the gating fails or the key steps are abnormal, the terminal writes a failure cause code failureas and a key step state code in an abnormal path, and executes integrity protection operation on the audit record abstract to generate an audit voucher capable of verifying the signature. And the server side rechecks the field set and the coding aperture based on the version identifier, and performs signature verification, duplicate removal and receipt on the audit voucher, so that a recheckable evidence closed loop under the consistent aperture of the end cloud is realized. Preferably, the validity of the polyver / specter is verified by the security component based on an anti-rollback counter and trusted storage, and the key and version reference information can be written or derived by eFuse / OTP or an equivalent non-rewritable medium to improve cross-device consistency and anti-clone capability.

The application belongs to the cross field of artificial intelligence and software engineering, and discloses an intelligent supervision and audit reasoning code generation method and system based on a knowledge graph and a templated mapping. The method first constructs a supervision and audit field knowledge graph containing regulations, rules, cases, entities and risk nodes and their associated relationships. Secondly, through a pre-defined node mapping rule set, various nodes in the graph are parsed into standardized logical element tuples, and a point execution function is generated according to the node type and the corresponding pre-set Python code template. At the same time, control code describing the reasoning logic between nodes is generated based on the pre-defined relationship mapping rules. Finally, using a reasoning chain automatic assembly algorithm based on graph traversal, starting from the target entity node, the related node functions and control code are dynamically aggregated into an executable complete audit reasoning program according to the dependency relationship between nodes. The application significantly improves the intelligent level and response speed of supervision and audit work.

A system and method for generating ultimate reason codes for computer models is provided. The system for generating ultimate reason codes for computer models comprising a computer system for receiving a data set, and an ultimate reason code generation engine stored on the computer system which, when executed by the computer system, causes the computer system to train a base model with a plurality of reason codes, wherein each reason code includes one or more variables, each of which belongs to only one reason code, train a subsequent model using a subset of the plurality of reason codes, determine whether a high score exists in the base model, determine a scored difference if a high score exists in the base model, and designate a reason code having a largest drop of score as an ultimate reason code.