{"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/get-angles","entry":"get_angles","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":21,"n_papers_ran":16,"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":9,"n_samples_ran":5,"n_samples_fingerprinted":2,"n_places":21,"n_places_pointer_only":8,"by_status":{"ran_honours":2,"ran_violates":1,"ran_draft_wrong":1,"ran_fixture":0,"ran":1,"unverified":4},"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":"2406.00670","paper":"/paper/cascade-clip-cascaded-vision-language","title":"Cascade-CLIP: Cascaded Vision-Language Embeddings Alignment for Zero-Shot Semantic Segmentation","date":"2024-06-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hvision-nku/cascade-clip","path":"models/decode_heads/utils.py","file_url":"https://github.com/hvision-nku/cascade-clip/blob/HEAD/models/decode_heads/utils.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"7816c6d65ab55d8f","mcp_get_code":{"code_sha256":"7816c6d65ab55d8f"}},{"arxiv_id":"2403.14183","paper":"/paper/otseg-multi-prompt-sinkhorn-attention-for","title":"OTSeg: Multi-prompt Sinkhorn Attention for Zero-Shot Semantic Segmentation","date":"2024-03-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"cubeyoung/OTSeg","path":"models/decode_heads/utils.py","file_url":"https://github.com/cubeyoung/OTSeg/blob/HEAD/models/decode_heads/utils.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"7816c6d65ab55d8f","mcp_get_code":{"code_sha256":"7816c6d65ab55d8f"}},{"arxiv_id":"2312.12754","paper":"/paper/spectral-prompt-tuning-unveiling-unseen","title":"Spectral Prompt Tuning:Unveiling Unseen Classes for Zero-Shot Semantic Segmentation","date":"2023-12-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"clearxu/spt","path":"models/decode_heads/utils.py","file_url":"https://github.com/clearxu/spt/blob/HEAD/models/decode_heads/utils.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"7816c6d65ab55d8f","mcp_get_code":{"code_sha256":"7816c6d65ab55d8f"}},{"arxiv_id":"2312.04147","paper":"/paper/an-improved-masking-strategy-for-self","title":"An Improved Masking Strategy for Self-supervised Masked Reconstruction in Human Activity Recognition","date":null,"month_inferred_from_arxiv_id":"2023-12","title_source":"archive","repo":"diheal/channle_masking","path":"utils.py","file_url":"https://github.com/diheal/channle_masking/blob/HEAD/utils.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"7816c6d65ab55d8f","mcp_get_code":{"code_sha256":"7816c6d65ab55d8f"}},{"arxiv_id":"2310.19727","paper":"/paper/generating-medical-instructions-with","title":"Generating Medical Prescriptions with Conditional Transformer","date":"2023-10-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hecta-uom/label-to-text-transformer","path":"Models/EncDecTransformer/Models.py","file_url":"https://github.com/hecta-uom/label-to-text-transformer/blob/HEAD/Models/EncDecTransformer/Models.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"73080156d02a4f89","mcp_get_code":{"code_sha256":"73080156d02a4f89"}},{"arxiv_id":"2310.13852","paper":"/paper/gradual-domain-adaptation-theory-and","title":"Gradual Domain Adaptation: Theory and Algorithms","date":"2023-10-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yifei-he/goat","path":"util.py","file_url":"https://github.com/yifei-he/goat/blob/HEAD/util.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"2683447b0d0da61c","mcp_get_code":{"code_sha256":"2683447b0d0da61c"}},{"arxiv_id":"2212.11972","paper":"/paper/scalable-adaptive-computation-for-iterative","title":"Scalable Adaptive Computation for Iterative Generation","date":"2022-12-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"google-research/pix2seq","path":"architectures/transformers.py","file_url":"https://github.com/google-research/pix2seq/blob/HEAD/architectures/transformers.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"c1a5330036a08dfa","mcp_get_code":{"code_sha256":"c1a5330036a08dfa"}},{"arxiv_id":"2212.03588","paper":"/paper/zegclip-towards-adapting-clip-for-zero-shot","title":"ZegCLIP: Towards Adapting CLIP for Zero-shot Semantic Segmentation","date":"2022-12-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ZiqinZhou66/ZegCLIP","path":"models/decode_heads/utils.py","file_url":"https://github.com/ZiqinZhou66/ZegCLIP/blob/HEAD/models/decode_heads/utils.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"7816c6d65ab55d8f","mcp_get_code":{"code_sha256":"7816c6d65ab55d8f"}},{"arxiv_id":"2210.07702","paper":"/paper/theory-and-approximate-solvers-for-branched","title":"Theory and Approximate Solvers for Branched Optimal Transport with Multiple Sources","date":"2022-10-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hci-unihd/BranchedOT","path":"src/tree_growing_heuristic.py","file_url":"https://github.com/hci-unihd/BranchedOT/blob/HEAD/src/tree_growing_heuristic.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"e507661252422201","mcp_get_code":{"code_sha256":"e507661252422201"}},{"arxiv_id":"2205.13571","paper":"/paper/low-rank-lottery-tickets-finding-efficient","title":"Low-rank lottery tickets: finding efficient low-rank neural networks via matrix differential equations","date":"2022-05-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"scsteffen/dlrt-net","path":"src/networks/transformer_dlrt.py","file_url":"https://github.com/scsteffen/dlrt-net/blob/HEAD/src/networks/transformer_dlrt.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"7816c6d65ab55d8f","mcp_get_code":{"code_sha256":"7816c6d65ab55d8f"}},{"arxiv_id":"2203.13573","paper":"/paper/unsupervised-learning-of-temporal","title":"Unsupervised Learning of Temporal Abstractions with Slot-based Transformers","date":"2022-03-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"agopal42/slottar","path":"slottar_modules.py","file_url":"https://github.com/agopal42/slottar/blob/HEAD/slottar_modules.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"7816c6d65ab55d8f","mcp_get_code":{"code_sha256":"7816c6d65ab55d8f"}},{"arxiv_id":"2110.10054","paper":"/paper/generating-symbolic-reasoning-problems-with-1","title":"Generating Symbolic Reasoning Problems with Transformer GANs","date":"2021-10-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"reactive-systems/TGAN-SR","path":"impl/tgan_sr/transformer/positional_encoding.py","file_url":"https://github.com/reactive-systems/TGAN-SR/blob/HEAD/impl/tgan_sr/transformer/positional_encoding.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"370c1f3fe2690649","mcp_get_code":{"code_sha256":"370c1f3fe2690649"}},{"arxiv_id":"2107.05916","paper":"/paper/towards-automatic-instrumentation-by-learning","title":"Towards Automatic Instrumentation by Learning to Separate Parts in Symbolic Multitrack Music","date":"2021-07-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"salu133445/arranger","path":"arranger/lstm/model.py","file_url":"https://github.com/salu133445/arranger/blob/HEAD/arranger/lstm/model.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"585440080f31568c","mcp_get_code":{"code_sha256":"585440080f31568c"}},{"arxiv_id":"2003.04218","paper":"/paper/teaching-temporal-logics-to-neural-networks","title":"Teaching Temporal Logics to Neural Networks","date":"2020-03-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"reactive-systems/deepltl","path":"deepltl/layers/positional_encoding.py","file_url":"https://github.com/reactive-systems/deepltl/blob/HEAD/deepltl/layers/positional_encoding.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"370c1f3fe2690649","mcp_get_code":{"code_sha256":"370c1f3fe2690649"}},{"arxiv_id":"2002.02562","paper":"/paper/transformer-transducer-a-streamable-speech","title":"Transformer Transducer: A Streamable Speech Recognition Model with Transformer Encoders and RNN-T Loss","date":"2020-02-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":null,"inline_ok":false,"code_sha256_prefix":"7816c6d65ab55d8f","mcp_get_code":{"code_sha256":"7816c6d65ab55d8f"}},{"arxiv_id":"1910.02562","paper":"/paper/master-multi-aspect-non-local-network-for","title":"MASTER: Multi-Aspect Non-local Network for Scene Text Recognition","date":"2019-10-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jiangxiluning/MASTER-TF","path":"src/model/transformer.py","file_url":"https://github.com/jiangxiluning/MASTER-TF/blob/HEAD/src/model/transformer.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"7816c6d65ab55d8f","mcp_get_code":{"code_sha256":"7816c6d65ab55d8f"}},{"arxiv_id":"1905.09904","paper":"/paper/cdsa-cross-dimensional-self-attention-for","title":"CDSA: Cross-Dimensional Self-Attention for Multivariate, Geo-tagged Time Series Imputation","date":"2019-05-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Gabriel-Macias/cdsa_imputation","path":"models.py","file_url":"https://github.com/Gabriel-Macias/cdsa_imputation/blob/HEAD/models.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"7816c6d65ab55d8f","mcp_get_code":{"code_sha256":"7816c6d65ab55d8f"}},{"arxiv_id":"1905.07697","paper":"/paper/explaining-machine-learning-classifiers","title":"Explaining Machine Learning Classifiers through Diverse Counterfactual Explanations","date":"2019-05-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"chihchenghsieh/eventlogdice","path":"model/PredNextBERT.py","file_url":"https://github.com/chihchenghsieh/eventlogdice/blob/HEAD/model/PredNextBERT.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"7816c6d65ab55d8f","mcp_get_code":{"code_sha256":"7816c6d65ab55d8f"}},{"arxiv_id":"1706.03762","paper":"/paper/attention-is-all-you-need","title":"Attention Is All You Need","date":"2017-06-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"seunghwan1228/Transfomer-MachineTranslation","path":"models/transformer.py","file_url":"https://github.com/seunghwan1228/Transfomer-MachineTranslation/blob/HEAD/models/transformer.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"2cf1092de7ac3279","mcp_get_code":{"code_sha256":"2cf1092de7ac3279"}},{"arxiv_id":"1704.04368","paper":"/paper/get-to-the-point-summarization-with-pointer","title":"Get To The Point: Summarization with Pointer-Generator Networks","date":"2017-04-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":null,"inline_ok":false,"code_sha256_prefix":"7816c6d65ab55d8f","mcp_get_code":{"code_sha256":"7816c6d65ab55d8f"}},{"arxiv_id":"quant-ph/9508027","paper":"/paper/polynomial-time-algorithms-for-prime","title":"Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer","date":null,"month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"bartek-bartlomiej/master-thesis","path":"gates/beauregard/constant_adder.py","file_url":"https://github.com/bartek-bartlomiej/master-thesis/blob/HEAD/gates/beauregard/constant_adder.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":"ef0e631c995d56f6","mcp_get_code":{"code_sha256":"ef0e631c995d56f6"}}]}