{"about":{"non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","site":"https://codewithpapers.app","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page","syntology":{"site":"https://syntology.ai","developers":"https://syntology.ai/developers","mcp":{"server":"https://syntology.ai/mcp","transport":"streamable-http","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","auth":{"type":"trial token, no account","trial_token":"https://syntology.ai/api/oauth/trial/token","method":"POST","docs":"https://syntology.ai/developers"}},"have":"https://syntology.ai/api/graph/have?x=<method, arXiv id or title> (free, answers coverage only)","paper_base":"https://syntology.ai/paper/","atlas_base":"https://app.syntology.ai/?focus="},"machine_readable":[{"url":"https://codewithpapers.app/llms.txt","what":"the machine catalog: every machine-readable file, counted"},{"url":"https://codewithpapers.app/index/manifest.json","what":"paper-to-code index by arXiv id, with Syntology's counts"},{"url":"https://codewithpapers.app/search/manifest.json","what":"site search index (titles, authors) and its files"},{"url":"https://codewithpapers.app/download","what":"bulk files: Syntology's layer, described there"},{"url":"https://codewithpapers.app/build_manifest.json","what":"the build record: inputs, counts, exclusions, probes"}]},"url":"/code/extract-data","entry":"extract_data","source":"Syntology graph, per-sample; not an archive number","read_at":"2026-10-05T00:36:11+00:00","claim":"Names are grouped by exact entry-name string. Same-named routines are NOT asserted to be equivalent; 'ran' means executed on a synthesized fixture, not correctness. n_samples_ran = sum of by_status over every status except 'unverified' (ran_draft_wrong and ran_fixture are failures of Syntology's instrument, not of the code); n_papers_ran = papers with at least one such sample = n_papers_ran_no_instrument_failure (papers with a run with no instrument failure) + n_papers_ran_instrument_only (papers where every run was a failure of Syntology's instrument); n_samples_ran = n_samples_ran_checked (honoured, violated, no contract) + n_samples_instrument (failures of Syntology's instrument, not of the code).","status_vocabulary":{"ran_honours":"ran, honoured the contract we drafted","ran_violates":"ran, violated the contract we drafted","ran_draft_wrong":"ran; our contract draft was wrong, not the code","ran_fixture":"ran; the contract check could not run (RAISES, DEP_MISSING or TIMEOUT)","ran":"ran on a synthesized input","unverified":"unverified (harvested, no recorded run)"},"n_papers":24,"n_papers_ran":20,"n_papers_ran_no_instrument_failure":16,"n_papers_ran_instrument_only":4,"units":"n_samples, n_samples_ran, n_samples_fingerprinted and by_status count distinct code bodies (code_sha256); n_places and n_places_pointer_only count places, one per (paper, code body) pair, which is also the unit of the samples list","n_samples":18,"n_samples_ran":14,"n_samples_constructed":0,"n_samples_ran_checked":10,"n_samples_instrument":4,"n_samples_unverified":4,"n_samples_fingerprinted":1,"n_places":26,"n_places_pointer_only":5,"n_places_pointer_only_link_open":0,"inline_ok_is":"inline_ok is true only when both licence gates allow Syntology to serve this code's text: this paper's link (inline_ok_link, from the licence of this paper's copy) and the stored copy of the same code that Syntology serves, which may have been first harvested from another repository. withheld_clause is Syntology's own wording of which gate keeps the text a pointer and why, and is null when inline_ok is true. This site shows no code text either way; n_places_pointer_only_link_open counts the places where this paper's link allows the text and the stored copy does not","by_status":{"ran_honours":1,"ran_violates":0,"ran_draft_wrong":4,"ran_fixture":0,"ran":9,"unverified":4},"key_notes":{"n_samples_ran_checked":"legacy name, kept unchanged so existing readers do not break: it counts the samples that ran with no instrument failure (honoured, violated, and ran with no contract checked); it does not mean a contract was checked, and the pages print it as 'K with no instrument failure', not 'K checked'","n_samples_constructed":"a sub-count of the samples that ran, never subtracted from them and never a failure: an executed sample whose run returned an instance of its own class (fixture_out_type equals the entry name): the run built an object and did not compute a result (Syntology's RAN record, counts.constructed)"},"syntology":{"atlas_url":null,"mcp":null,"mcp_per_sample":{"tool":"get_code","arguments_in":"samples[].mcp_get_code"},"developers":"https://syntology.ai/developers"},"samples":[{"arxiv_id":"2504.10160","arxiv_id_is_arxiv":true,"paper":"/paper/mt-r1-zero-advancing-llm-based-machine","title":"MT-R1-Zero: Advancing LLM-based Machine Translation via R1-Zero-like Reinforcement Learning","date":"2025-04-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"fzp0424/mt-r1-zero","path":"data/process_data.py","file_url":"https://github.com/fzp0424/mt-r1-zero/blob/HEAD/data/process_data.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"860391ac5525fe76","code_sha256_prefix":"860391ac5525fe76","mcp_get_code":{"code_sha256":"860391ac5525fe76"}},{"arxiv_id":"2410.04753","arxiv_id_is_arxiv":true,"paper":"/paper/improver-agent-based-automated-proof","title":"ImProver: Agent-Based Automated Proof Optimization","date":"2024-10-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"riyazahuja/ImProver","path":"benchmark/tools.py","file_url":"https://github.com/riyazahuja/ImProver/blob/HEAD/benchmark/tools.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, riyazahuja/ImProver when it was checked","code_sha256":"7adc3bfbf60b8306","code_sha256_prefix":"7adc3bfbf60b8306","mcp_get_code":{"code_sha256":"7adc3bfbf60b8306"}},{"arxiv_id":"2408.08578","arxiv_id_is_arxiv":true,"paper":"/paper/tamer-tree-aware-transformer-for-handwritten","title":"TAMER: Tree-Aware Transformer for Handwritten Mathematical Expression Recognition","date":"2024-08-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"qingzhenduyu/tamer","path":"tamer/datamodule/datamodule.py","file_url":"https://github.com/qingzhenduyu/tamer/blob/HEAD/tamer/datamodule/datamodule.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, qingzhenduyu/tamer when it was checked","code_sha256":"6ef73ec3051b3eb0","code_sha256_prefix":"6ef73ec3051b3eb0","mcp_get_code":{"code_sha256":"6ef73ec3051b3eb0"}},{"arxiv_id":"2407.07764","arxiv_id_is_arxiv":true,"paper":"/paper/posformer-recognizing-complex-handwritten","title":"PosFormer: Recognizing Complex Handwritten Mathematical Expression with Position Forest Transformer","date":"2024-07-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"sjtu-deepvisionlab/posformer","path":"m2e_pkg/datamodule.py","file_url":"https://github.com/sjtu-deepvisionlab/posformer/blob/HEAD/m2e_pkg/datamodule.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, sjtu-deepvisionlab/posformer when it was checked","code_sha256":"3d952d11c1bd842b","code_sha256_prefix":"3d952d11c1bd842b","mcp_get_code":{"code_sha256":"3d952d11c1bd842b"}},{"arxiv_id":"2407.07764","arxiv_id_is_arxiv":true,"paper":"/paper/posformer-recognizing-complex-handwritten","title":"PosFormer: Recognizing Complex Handwritten Mathematical Expression with Position Forest Transformer","date":"2024-07-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"sjtu-deepvisionlab/posformer","path":"Pos_Former/datamodule/datamodule.py","file_url":"https://github.com/sjtu-deepvisionlab/posformer/blob/HEAD/Pos_Former/datamodule/datamodule.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, sjtu-deepvisionlab/posformer when it was checked","code_sha256":"1fccc851efffb7be","code_sha256_prefix":"1fccc851efffb7be","mcp_get_code":{"code_sha256":"1fccc851efffb7be"}},{"arxiv_id":"2406.06589","arxiv_id_is_arxiv":true,"paper":"/paper/patenteval-understanding-errors-in-patent","title":"PatentEval: Understanding Errors in Patent Generation","date":"2024-06-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ZoeYou/coheoka","path":"coheoka/create_training_patents.py","file_url":"https://github.com/ZoeYou/coheoka/blob/HEAD/coheoka/create_training_patents.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"3bf528bb1e7f248a","code_sha256_prefix":"3bf528bb1e7f248a","mcp_get_code":{"code_sha256":"3bf528bb1e7f248a"}},{"arxiv_id":"2402.03563","arxiv_id_is_arxiv":true,"paper":"/paper/distinguishing-the-knowable-from-the","title":"Distinguishing the Knowable from the Unknowable with Language Models","date":"2024-02-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mims-harvard/spectra","path":"SPECTRA_paper/SPECTRA_SD/TAPE_Homology/calculate_similarity.py","file_url":"https://github.com/mims-harvard/spectra/blob/HEAD/SPECTRA_paper/SPECTRA_SD/TAPE_Homology/calculate_similarity.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"019a737a08eeaf7e","code_sha256_prefix":"019a737a08eeaf7e","mcp_get_code":{"code_sha256":"019a737a08eeaf7e"}},{"arxiv_id":"2312.06681","arxiv_id_is_arxiv":true,"paper":"/paper/steering-llama-2-via-contrastive-activation","title":"Steering Llama 2 via Contrastive Activation Addition","date":"2023-12-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"wusche1/caa_hallucination","path":"paper/lib/hallucination_lib.py","file_url":"https://github.com/wusche1/caa_hallucination/blob/HEAD/paper/lib/hallucination_lib.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, wusche1/caa_hallucination when it was checked","code_sha256":"c6ea479857c46dbd","code_sha256_prefix":"c6ea479857c46dbd","mcp_get_code":{"code_sha256":"c6ea479857c46dbd"}},{"arxiv_id":"2303.04743","arxiv_id_is_arxiv":true,"paper":"/paper/vector-quantized-time-series-generation-with","title":"Vector Quantized Time Series Generation with a Bidirectional Prior Model","date":"2023-03-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"danelee2601/supervised-fcn","path":"supervised_FCN/preprocessing/preprocess_uea.py","file_url":"https://github.com/danelee2601/supervised-fcn/blob/HEAD/supervised_FCN/preprocessing/preprocess_uea.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"7509c254e5b132f7","code_sha256_prefix":"7509c254e5b132f7","mcp_get_code":{"code_sha256":"7509c254e5b132f7"}},{"arxiv_id":"2211.17244","arxiv_id_is_arxiv":true,"paper":"/paper/overcoming-the-convex-relaxation-barrier-for","title":"Tight Certification of Adversarially Trained Neural Networks via Nonconvex Low-Rank Semidefinite Relaxations","date":"2022-11-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"IBM/CROWN-Robustness-Certification","path":"setup_mnist.py","file_url":"https://github.com/IBM/CROWN-Robustness-Certification/blob/HEAD/setup_mnist.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"86c9fa246614e9a9","code_sha256_prefix":"86c9fa246614e9a9","mcp_get_code":{"code_sha256":"86c9fa246614e9a9"}},{"arxiv_id":"2105.02412","arxiv_id_is_arxiv":true,"paper":"/paper/handwritten-mathematical-expression","title":"Handwritten Mathematical Expression Recognition with Bidirectionally Trained Transformer","date":"2021-05-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Green-Wood/BTTR","path":"bttr/datamodule/datamodule.py","file_url":"https://github.com/Green-Wood/BTTR/blob/HEAD/bttr/datamodule/datamodule.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"c5115025a3ddb95b","code_sha256_prefix":"c5115025a3ddb95b","mcp_get_code":{"code_sha256":"c5115025a3ddb95b"}},{"arxiv_id":"2007.04612","arxiv_id_is_arxiv":true,"paper":"/paper/concept-bottleneck-models","title":"Concept Bottleneck Models","date":"2020-07-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yewsiang/ConceptBottleneck","path":"CUB/data_processing.py","file_url":"https://github.com/yewsiang/ConceptBottleneck/blob/HEAD/CUB/data_processing.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"fb9f011b98a5be6f","code_sha256_prefix":"fb9f011b98a5be6f","mcp_get_code":{"code_sha256":"fb9f011b98a5be6f"}},{"arxiv_id":"2006.14748","arxiv_id_is_arxiv":true,"paper":"/paper/proper-network-interpretability-helps","title":"Proper Network Interpretability Helps Adversarial Robustness in Classification","date":"2020-06-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"AkhilanB/Proper-Interpretability","path":"funcs.py","file_url":"https://github.com/AkhilanB/Proper-Interpretability/blob/HEAD/funcs.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"86c9fa246614e9a9","code_sha256_prefix":"86c9fa246614e9a9","mcp_get_code":{"code_sha256":"86c9fa246614e9a9"}},{"arxiv_id":"1811.10828","arxiv_id_is_arxiv":true,"paper":"/paper/a-frank-wolfe-framework-for-efficient-and","title":"A Frank-Wolfe Framework for Efficient and Effective Adversarial Attacks","date":"2018-11-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"uclaml/Frank-Wolfe-AdvML","path":"setup_mnist.py","file_url":"https://github.com/uclaml/Frank-Wolfe-AdvML/blob/HEAD/setup_mnist.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"86c9fa246614e9a9","code_sha256_prefix":"86c9fa246614e9a9","mcp_get_code":{"code_sha256":"86c9fa246614e9a9"}},{"arxiv_id":"1811.00866","arxiv_id_is_arxiv":true,"paper":"/paper/efficient-neural-network-robustness","title":"Efficient Neural Network Robustness Certification with General Activation Functions","date":"2018-11-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"huanzhang12/CertifiedReLURobustness","path":"setup_mnist.py","file_url":"https://github.com/huanzhang12/CertifiedReLURobustness/blob/HEAD/setup_mnist.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"BSD-2-Clause","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"86c9fa246614e9a9","code_sha256_prefix":"86c9fa246614e9a9","mcp_get_code":{"code_sha256":"86c9fa246614e9a9"}},{"arxiv_id":"1810.03787","arxiv_id_is_arxiv":true,"paper":"/paper/quantum-convolutional-neural-networks","title":"Quantum Convolutional Neural Networks","date":null,"month_inferred_from_arxiv_id":"2018-10","title_source":"archive","repo":"Jaybsoni/Quantum-Convolutional-Neural-Networks","path":"qcnns_for_phase_recog/qcnn_classify_phases.py","file_url":"https://github.com/Jaybsoni/Quantum-Convolutional-Neural-Networks/blob/HEAD/qcnns_for_phase_recog/qcnn_classify_phases.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"c88ab08bc5a7ee90","code_sha256_prefix":"c88ab08bc5a7ee90","mcp_get_code":{"code_sha256":"c88ab08bc5a7ee90"}},{"arxiv_id":"1805.11770","arxiv_id_is_arxiv":true,"paper":"/paper/autozoom-autoencoder-based-zeroth-order","title":"AutoZOOM: Autoencoder-based Zeroth Order Optimization Method for Attacking Black-box Neural Networks","date":"2018-05-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"IBM/Autozoom-Attack","path":"setup_mnist.py","file_url":"https://github.com/IBM/Autozoom-Attack/blob/HEAD/setup_mnist.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"86c9fa246614e9a9","code_sha256_prefix":"86c9fa246614e9a9","mcp_get_code":{"code_sha256":"86c9fa246614e9a9"}},{"arxiv_id":"1805.11090","arxiv_id_is_arxiv":true,"paper":"/paper/genattack-practical-black-box-attacks-with","title":"GenAttack: Practical Black-box Attacks with Gradient-Free Optimization","date":"2018-05-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"nesl/adversarial_genattack","path":"setup_mnist.py","file_url":"https://github.com/nesl/adversarial_genattack/blob/HEAD/setup_mnist.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"86c9fa246614e9a9","code_sha256_prefix":"86c9fa246614e9a9","mcp_get_code":{"code_sha256":"86c9fa246614e9a9"}},{"arxiv_id":"1805.10367","arxiv_id_is_arxiv":true,"paper":"/paper/zeroth-order-stochastic-variance-reduction","title":"Zeroth-Order Stochastic Variance Reduction for Nonconvex Optimization","date":"2018-05-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"IBM/ZOSVRG-BlackBox-Adv","path":"setup_mnist.py","file_url":"https://github.com/IBM/ZOSVRG-BlackBox-Adv/blob/HEAD/setup_mnist.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"86c9fa246614e9a9","code_sha256_prefix":"86c9fa246614e9a9","mcp_get_code":{"code_sha256":"86c9fa246614e9a9"}},{"arxiv_id":"1805.09921","arxiv_id_is_arxiv":true,"paper":"/paper/meta-learning-probabilistic-inference-for","title":"Meta-Learning Probabilistic Inference For Prediction","date":"2018-05-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Gordonjo/versa","path":"src/omniglot.py","file_url":"https://github.com/Gordonjo/versa/blob/HEAD/src/omniglot.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"2408a27b9438a36d","code_sha256_prefix":"2408a27b9438a36d","mcp_get_code":{"code_sha256":"2408a27b9438a36d"}},{"arxiv_id":"1802.07623","arxiv_id_is_arxiv":true,"paper":"/paper/explanations-based-on-the-missing-towards","title":"Explanations based on the Missing: Towards Contrastive Explanations with Pertinent Negatives","date":"2018-02-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"IBM/Contrastive-Explanation-Method","path":"setup_mnist.py","file_url":"https://github.com/IBM/Contrastive-Explanation-Method/blob/HEAD/setup_mnist.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"86c9fa246614e9a9","code_sha256_prefix":"86c9fa246614e9a9","mcp_get_code":{"code_sha256":"86c9fa246614e9a9"}},{"arxiv_id":"1603.05027","arxiv_id_is_arxiv":true,"paper":"/paper/identity-mappings-in-deep-residual-networks","title":"Identity Mappings in Deep Residual Networks","date":"2016-03-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"JoegameZhou/ms-resnetv2","path":"infer/resnetv2_152/dataprocess/preprocess.py","file_url":"https://github.com/JoegameZhou/ms-resnetv2/blob/HEAD/infer/resnetv2_152/dataprocess/preprocess.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"569e04900031b215","code_sha256_prefix":"569e04900031b215","mcp_get_code":{"code_sha256":"569e04900031b215"}},{"arxiv_id":"1503.03832","arxiv_id_is_arxiv":true,"paper":"/paper/facenet-a-unified-embedding-for-face","title":"FaceNet: A Unified Embedding for Face Recognition and Clustering","date":"2015-03-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"davidsandberg/facenet","path":"tmp/mnist_center_loss.py","file_url":"https://github.com/davidsandberg/facenet/blob/HEAD/tmp/mnist_center_loss.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"f239ee916030025a","code_sha256_prefix":"f239ee916030025a","mcp_get_code":{"code_sha256":"f239ee916030025a"}},{"arxiv_id":"aaai_20650","arxiv_id_is_arxiv":false,"paper":null,"title":"AAAI id aaai_20650","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"IBM/UAE","path":"Supervised/setup_mnist.py","file_url":"https://github.com/IBM/UAE/blob/HEAD/Supervised/setup_mnist.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"86c9fa246614e9a9","code_sha256_prefix":"86c9fa246614e9a9","mcp_get_code":{"code_sha256":"86c9fa246614e9a9"}},{"arxiv_id":"aaai_20650","arxiv_id_is_arxiv":false,"paper":null,"title":"AAAI id aaai_20650","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"IBM/UAE","path":"Unsupversied/setup_fmmnist.py","file_url":"https://github.com/IBM/UAE/blob/HEAD/Unsupversied/setup_fmmnist.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"f7f6483f1420d26b","code_sha256_prefix":"f7f6483f1420d26b","mcp_get_code":{"code_sha256":"f7f6483f1420d26b"}},{"arxiv_id":"2023.findings-emnlp.142","arxiv_id_is_arxiv":false,"paper":null,"title":"ACL Anthology id 2023.findings-emnlp.142","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"Banner-Z/G-SPEED","path":"wiki_collector/wiki_util.py","file_url":"https://github.com/Banner-Z/G-SPEED/blob/HEAD/wiki_collector/wiki_util.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"2c0851a1c3793c8d","code_sha256_prefix":"2c0851a1c3793c8d","mcp_get_code":{"code_sha256":"2c0851a1c3793c8d"}}],"record_sha256":"bfdd8cbfd8a536c14fee423d01a3f0da82e406b74f5665993d096ba7e4c7e5b7","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}