Add submission: 0xUrsanomics - #70
Open
0xUrsanomics wants to merge 1 commit into
Open
0xUrsanomics wants to merge 1 commit into
0xUrsanomics wants to merge 1 commit into
Conversation
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Add this suggestion to a batch that can be applied as a single commit.This suggestion is invalid because no changes were made to the code.Suggestions cannot be applied while the pull request is closed.Suggestions cannot be applied while viewing a subset of changes.Only one suggestion per line can be applied in a batch.Add this suggestion to a batch that can be applied as a single commit.Applying suggestions on deleted lines is not supported.You must change the existing code in this line in order to create a valid suggestion.Outdated suggestions cannot be applied.This suggestion has been applied or marked resolved.Suggestions cannot be applied from pending reviews.Suggestions cannot be applied on multi-line comments.Suggestions cannot be applied while the pull request is queued to merge.Suggestion cannot be applied right now. Please check back later.
Adds
submissions/0xUrsanomics/withpredictions.jsonl(5,000 of 5,000 validation cases),MEMO.md, andSUBMISSION.md. No files outside that folder are touched.Solution repository: https://github.com/0xUrsanomics/mib-doc-challenge-solution (public, MIT,
Dockerfileat root).Score on the labelled train split via
scripts/evaluate.py: 101.42 / 150 (fields 40.37/50, classification 48.94/80, calibration 12.11/20, missing-case penalty 0/10). Predictions were produced by that image under--cpus 4 --memory 8g --network none --read-only, 0.091s per PDF against a 6s budget.No model at runtime: PyMuPDF for text, tesseract for scan pages, hand-written rules for adjudication.
The trust layer is the part of the write-up I would point at first. Across the 188 train packets carrying a planted answer key, the key's field values agree with ground truth 93.1% of the time while its adjudication agrees 0 times out of 188, so the verdict is refused unconditionally and the field values are read only as a last resort, after adjudication has already returned. Details and known failure modes in
MEMO.md.