AI & ML
When Does a Cross-Device Run Justify PASS? Obligation-Level Evidence Qualification under Partial Observability
arXiv cs.SE0 views
arXiv:2611.06013v1 Announce Type: new Abstract: A cross-device test can complete every command yet judge a business claim from evidence belonging to another device or attempt. We introduce an executable evidence contract that makes support qualification an explicit stage before predicate evaluation. It binds each obligation to admissible subjects, episodes, objects and observation scopes, and records unresolved support rather than treating an apparently successful observation as proof. We evaluate two implemented parts of the contract. A prospectively specified, 12-seed controlled study isolates association under reused identifiers across 2,304 claims. Given identical records and business policy, Atomic-Facts Flat produces 160 false PASS and 76.30% PASS recall; supplying computed associations reduces false PASS to five and increases PASS recall to 99.09%. Deterministic Closure produces zero false PASS and 100.00% PASS recall, improving on Atomic Flat in 11 seeds with one tie (two-sided sign p=0.00098). Most of the benefit comes from explicit association rather than graph notation. A separate prospective field characterization spans four workflows, 40 physical episodes and 80 claims. Against frozen reference labels, the physical-evidence verifier attains 95.00% accuracy and 100.00% PASS recall (27/27), with three false PASS judgments. The field results are descriptive: a policy-input mismatch prevents the planned matched-policy comparison, and post-hoc sensitivity does not establish superiority over a policy-informed textual baseline. Together, the studies characterize qualification on physical evidence and isolate the value of explicit association under a controlled matching contract.
Source:https://arxiv.org/abs/2611.06013PreviousRetrieval Supersedes Scale: Efficient Log Level Prediction via Multiplex Socio-Technical ContextNextSynMOE: A Syntax-Aware MOE-Guided Approach for PEFT-Based Code Intelligence Learning
Related posts
Robocasa-Mem: Benchmarking Environment and Process Memory in Long-Horizon Mobile Manipulation
0arXiv cs.RO
Beyond Infraction Scores: Failure-Boundary Profiles for Closed-Loop Evaluation of Driving and Robot Navigation Agents
0arXiv cs.RO
$A^3$-VLA: Automatic Perception-Guided Attention Alignment for Robot Manipulation
0arXiv cs.RO
TwinBridge: Digital Twin-Driven Policy and Reward Transfer for Real-World Reinforcement Learning in Laboratory Robotics
0arXiv cs.RO
UniLoop: Unified Loop Closure Detection from Retrieval to Geometric Verification and Relative Pose Estimation
0arXiv cs.RO

Chain of Recall คืออะไร? Stable IDs ช่วยให้ AI Agent มีความจำได้อย่างไร
0dev.to AI