{"about":{"site":"https://codewithpapers.app","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.","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"},"url":"/code/scheduler-2","entry":"scheduler","source":"Syntology graph, per-sample; not an archive number","read_at":"2026-09-24T18:15:14+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.","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; our fixture could not drive it","ran":"ran on a synthesized input","unverified":"unverified (harvested, no recorded run)"},"n_papers":12,"n_papers_ran":7,"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":14,"n_samples_ran":8,"n_samples_fingerprinted":4,"n_places":14,"n_places_pointer_only":4,"by_status":{"ran_honours":4,"ran_violates":0,"ran_draft_wrong":2,"ran_fixture":0,"ran":2,"unverified":6},"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":"2403.01482","paper":"/paper/eagle-eigen-aggregation-learning-for-object","title":"EAGLE: Eigen Aggregation Learning for Object-Centric Unsupervised Semantic Segmentation","date":"2024-03-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"MICV-yonsei/EAGLE","path":"src_EAGLE/train_segmentation_eigen.py","file_url":"https://github.com/MICV-yonsei/EAGLE/blob/HEAD/src_EAGLE/train_segmentation_eigen.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"475ff955e091e303","mcp_get_code":{"code_sha256":"475ff955e091e303"}},{"arxiv_id":"2402.05234","paper":"/paper/qgfn-controllable-greediness-with-action","title":"QGFN: Controllable Greediness with Action Values","date":"2024-02-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yunglau/qgfn","path":"src/gflownet/data/mix_iterator.py","file_url":"https://github.com/yunglau/qgfn/blob/HEAD/src/gflownet/data/mix_iterator.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"d8821f0b8834c2ef","mcp_get_code":{"code_sha256":"d8821f0b8834c2ef"}},{"arxiv_id":"2402.01887","paper":"/paper/on-f-divergence-principled-domain-adaptation","title":"On $f$-Divergence Principled Domain Adaptation: An Improved Framework","date":"2024-02-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"nv-tlabs/fdal","path":"demos/demo_mnist_usps.py","file_url":"https://github.com/nv-tlabs/fdal/blob/HEAD/demos/demo_mnist_usps.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NOASSERTION","inline_ok":false,"code_sha256_prefix":"b443a88d848fa725","mcp_get_code":{"code_sha256":"b443a88d848fa725"}},{"arxiv_id":"2310.13088","paper":"/paper/sequence-length-independent-norm-based","title":"Sequence Length Independent Norm-Based Generalization Bounds for Transformers","date":"2023-10-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"traugerjacob/transformer-gen-bounds","path":"run_experiment.py","file_url":"https://github.com/traugerjacob/transformer-gen-bounds/blob/HEAD/run_experiment.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"28de51f7b69fb409","mcp_get_code":{"code_sha256":"28de51f7b69fb409"}},{"arxiv_id":"2006.02334","paper":"/paper/detectors-detecting-objects-with-recursive-1","title":"DetectoRS: Detecting Objects with Recursive Feature Pyramid and Switchable Atrous Convolution","date":"2020-06-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Vishal-V/tf-models","path":"onlyBN/resnet_cifar.py","file_url":"https://github.com/Vishal-V/tf-models/blob/HEAD/onlyBN/resnet_cifar.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"02ec52619ce805da","mcp_get_code":{"code_sha256":"02ec52619ce805da"}},{"arxiv_id":"2005.07877","paper":"/paper/micronet-for-efficient-language-modeling","title":"MicroNet for Efficient Language Modeling","date":"2020-05-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mit-han-lab/neurips-micronet","path":"optim.py","file_url":"https://github.com/mit-han-lab/neurips-micronet/blob/HEAD/optim.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"04ade7e30fa78ea4","mcp_get_code":{"code_sha256":"04ade7e30fa78ea4"}},{"arxiv_id":"2005.07609","paper":"/paper/inverse-design-of-crystals-using-generalized","title":"An invertible crystallographic representation for general inverse design of inorganic crystals with targeted properties","date":"2020-05-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"PV-Lab/FTCP","path":"main_semi.py","file_url":"https://github.com/PV-Lab/FTCP/blob/HEAD/main_semi.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"3c10ee5e573f838a","mcp_get_code":{"code_sha256":"3c10ee5e573f838a"}},{"arxiv_id":"1904.13127","paper":"/paper/a-scalable-saliency-based-feature-selection","title":"A scalable saliency-based Feature selection method with instance level information","date":"2019-04-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"braisCB/SFS","path":"scripts/deep/cifar_10/sfs.py","file_url":"https://github.com/braisCB/SFS/blob/HEAD/scripts/deep/cifar_10/sfs.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"b4bbac2634b2b7f1","mcp_get_code":{"code_sha256":"b4bbac2634b2b7f1"}},{"arxiv_id":"1804.03619","paper":"/paper/looking-to-listen-at-the-cocktail-party-a","title":"Looking to Listen at the Cocktail Party: A Speaker-Independent Audio-Visual Model for Speech Separation","date":"2018-04-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"bill9800/speech_separation","path":"model/model_v1/AO_model_v1.py","file_url":"https://github.com/bill9800/speech_separation/blob/HEAD/model/model_v1/AO_model_v1.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"c80bbbbcfdaeefdb","mcp_get_code":{"code_sha256":"c80bbbbcfdaeefdb"}},{"arxiv_id":"1804.03619","paper":"/paper/looking-to-listen-at-the-cocktail-party-a","title":"Looking to Listen at the Cocktail Party: A Speaker-Independent Audio-Visual Model for Speech Separation","date":"2018-04-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"bill9800/speech_separation","path":"model/model_v2/AV_train.py","file_url":"https://github.com/bill9800/speech_separation/blob/HEAD/model/model_v2/AV_train.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"ae2dd7a5dd9f7baf","mcp_get_code":{"code_sha256":"ae2dd7a5dd9f7baf"}},{"arxiv_id":"1709.09890","paper":"/paper/b-cnn-branch-convolutional-neural-network-for","title":"B-CNN: Branch Convolutional Neural Network for Hierarchical Classification","date":"2017-09-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hitman567/hierarchical-classification","path":"train_val.py","file_url":"https://github.com/hitman567/hierarchical-classification/blob/HEAD/train_val.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"3f96679a64874a25","mcp_get_code":{"code_sha256":"3f96679a64874a25"}},{"arxiv_id":"1709.09890","paper":"/paper/b-cnn-branch-convolutional-neural-network-for","title":"B-CNN: Branch Convolutional Neural Network for Hierarchical Classification","date":"2017-09-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zhuxinqimac/B-CNN","path":"CIFAR_10_keras_medium.py","file_url":"https://github.com/zhuxinqimac/B-CNN/blob/HEAD/CIFAR_10_keras_medium.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"b0ef63c7b272fe36","mcp_get_code":{"code_sha256":"b0ef63c7b272fe36"}},{"arxiv_id":"1507.05717","paper":"/paper/an-end-to-end-trainable-neural-network-for","title":"An End-to-End Trainable Neural Network for Image-based Sequence Recognition and Its Application to Scene Text Recognition","date":"2015-07-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mrzaizai2k/Information-recognition-on-the-university-test-paper","path":"source/digit_train.py","file_url":"https://github.com/mrzaizai2k/Information-recognition-on-the-university-test-paper/blob/HEAD/source/digit_train.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"09177472a69b0aef","mcp_get_code":{"code_sha256":"09177472a69b0aef"}},{"arxiv_id":"1312.4400","paper":"/paper/network-in-network","title":"Network In Network","date":"2013-12-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Spoorthy-gunda/Image-Classification","path":"nin.py","file_url":"https://github.com/Spoorthy-gunda/Image-Classification/blob/HEAD/nin.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"89d72000b3a5b1af","mcp_get_code":{"code_sha256":"89d72000b3a5b1af"}}]}