{"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":"/census/sequence-mask","entry":"sequence_mask","source":"Syntology differential census (groundwork/55, run v2_2026-09-22), per sample; not an archive number","census_date":"2026-09-22","battery_sha256":["b986f7e04d794a0d88ad4c5f32cf63ec3590b5deff0192150737bc5f1c0b4677"],"runner_sha256":["5a452d0e7c0da5b80771d1be2afe3572e253568cf5c5d59a0d08ebd663d00808"],"bucket_key":"positional (rank, kind, dtype) of each array argument; the argument name is not part of the key because the harness draws the shared array from (rank, kind) and casts it to the dtype, whatever the name","bucket_fields":["rank","kind","dtype"],"claim":"Implementations sharing this entry name were each run on one shared input fixed by the positional (rank, kind, dtype) of their array arguments (the bucket). A cluster is the set whose recorded output digest (sha256 of the output rounded to 6 decimals) is identical. Identical values to six decimals on the shared input are agreement on those inputs, not a statement about the whole domain and not a substitution claim.","n_implementations_compared":12,"n_papers":15,"n_buckets":2,"n_distinct_outputs":5,"n_class_bearing":0,"not_compared":{"not_run_on_shared_input":{"n":0,"by_error":{}},"no_array_argument_ran_on_own_fixture_arguments_only":{"n":0,"n_papers":0,"recorded_shared_digest_equals_own_fixture_digest":0},"output_not_digested_non_numeric":{"n":0,"by_type":{}}},"withdrawn_excluded":0,"code_page":"/code/sequence-mask","buckets":[{"bucket":[[1,"int","int64"]],"n_implementations_compared":11,"n_papers":14,"n_not_digested":0,"not_digested_by_type":{},"clusters":[{"output_sha":"1803f396afa72f33","size":7,"n_papers":9,"shape":[8,3],"dtype":"bool","type":"Tensor","finite":true,"max_difference_among_recorded_values":0.0,"members_with_recorded_values":7,"torch_reference_conventions_with_this_digest":[],"values":[1.0,1.0,0.0,1.0,0.0,0.0,1.0,1.0,1.0,0.0,0.0,0.0,1.0,0.0,0.0,1.0,1.0,0.0,1.0,1.0,0.0,1.0,1.0,0.0],"values_recorded":24,"members":[{"code_sha256_prefix":"88bf809d1bc9db4c","path":"model/layers.py","papers":["2106.06103","2310.00014","2212.00973"],"paper_pages":[{"arxiv_id":"2106.06103","page":"/paper/conditional-variational-autoencoder-with"},{"arxiv_id":"2310.00014","page":"/paper/fewer-token-neural-speech-codec-with-time"},{"arxiv_id":"2212.00973","page":"/paper/a-domain-knowledge-inspired-music-embedding"}],"arg_sig_recorded":[["length",1,"int","int64"]],"scalar_args":{"max_length":"None"},"class_bearing":false},{"code_sha256_prefix":"07acd8eda50af5b4","path":"SPFN/losses_implementation.py","papers":["2109.00113"],"paper_pages":[{"arxiv_id":"2109.00113","page":"/paper/cpfn-cascaded-primitive-fitting-networks-for"}],"arg_sig_recorded":[["lengths",1,"int","int64"]],"scalar_args":{"maxlen":"None"},"class_bearing":false},{"code_sha256_prefix":"149c4508c7494e2a","path":"AttentionRNN/Multilayers_Decoder.py","papers":["1409.0473"],"paper_pages":[{"arxiv_id":"1409.0473","page":"/paper/neural-machine-translation-by-jointly"}],"arg_sig_recorded":[["lengths",1,"int","int64"]],"scalar_args":{},"class_bearing":false},{"code_sha256_prefix":"1c106a6e83b6ce65","path":"recoversat.py","papers":["2006.05165"],"paper_pages":[{"arxiv_id":"2006.05165","page":"/paper/learning-to-recover-from-multi-modality"}],"arg_sig_recorded":[["lengths",1,"int","int64"]],"scalar_args":{"max_len":"None"},"class_bearing":false},{"code_sha256_prefix":"7286741cac3a2cab","path":"model/lina.py","papers":["2306.05284"],"paper_pages":[{"arxiv_id":"2306.05284","page":"/paper/simple-and-controllable-music-generation"}],"arg_sig_recorded":[["lengths",1,"int","int64"]],"scalar_args":{"max_len":"None","device":"device(type='cpu')"},"class_bearing":false},{"code_sha256_prefix":"cfe964d3e7be6c9d","path":"src/models/music_continuous_token.py","papers":["2602.07063"],"paper_pages":[{"arxiv_id":"2602.07063","page":"/paper/arxiv-2602-07063"}],"arg_sig_recorded":[["length",1,"int","int64"]],"scalar_args":{"max_length":"None"},"class_bearing":false},{"code_sha256_prefix":"f9379a80bc4cfd5a","path":"src/model.py","papers":["2205.12585"],"paper_pages":[{"arxiv_id":"2205.12585","page":"/paper/a-simple-and-unified-tagging-model-with"}],"arg_sig_recorded":[["lens",1,"int","int64"]],"scalar_args":{"max_len":"None"},"class_bearing":false}]},{"output_sha":"3bddb7789f43cb3b","size":2,"n_papers":2,"shape":[8,4],"dtype":"bool","type":"Tensor","finite":true,"max_difference_among_recorded_values":0.0,"members_with_recorded_values":2,"torch_reference_conventions_with_this_digest":[],"values":[1.0,1.0,0.0,0.0,1.0,0.0,0.0,0.0,1.0,1.0,1.0,0.0,0.0,0.0,0.0,0.0,1.0,0.0,0.0,0.0,1.0,1.0,0.0,0.0,1.0,1.0,0.0,0.0,1.0,1.0,0.0,0.0],"values_recorded":32,"members":[{"code_sha256_prefix":"94671955165a864c","path":"Classifier/models/neural.py","papers":["2106.05589"],"paper_pages":[{"arxiv_id":"2106.05589","page":"/paper/augnlg-few-shot-natural-language-generation"}],"arg_sig_recorded":[["lengths",1,"int","int64"]],"scalar_args":{"max_len":"4"},"class_bearing":false},{"code_sha256_prefix":"edd8dd6147b4ded8","path":"src/model/ebcl_model.py","papers":["2312.10308"],"paper_pages":[{"arxiv_id":"2312.10308","page":"/paper/event-based-contrastive-learning-for-medical"}],"arg_sig_recorded":[["lengths",1,"int","int64"]],"scalar_args":{"maxlen":"4","dtype":"torch.bool"},"class_bearing":false}]},{"output_sha":"d8aa3c9eef69562f","size":1,"n_papers":2,"shape":[8,7],"dtype":"bool","type":"Tensor","finite":true,"max_difference_among_recorded_values":null,"members_with_recorded_values":1,"torch_reference_conventions_with_this_digest":[],"values":[1.0,1.0,0.0,0.0,0.0,0.0,0.0,1.0,0.0,0.0,0.0,0.0,0.0,0.0,1.0,1.0,1.0,0.0,0.0,0.0,0.0,0.0,0.0,0.0,0.0,0.0,0.0,0.0,1.0,0.0,0.0,0.0,0.0,0.0,0.0,1.0,1.0,0.0,0.0,0.0,0.0,0.0,1.0,1.0,0.0,0.0,0.0,0.0,0.0,1.0,1.0,0.0,0.0,0.0,0.0,0.0],"values_recorded":56,"members":[{"code_sha256_prefix":"0c43e7290e581e42","path":"pointer_network.py","papers":["1506.03134","1611.09940"],"paper_pages":[{"arxiv_id":"1506.03134","page":"/paper/pointer-networks"},{"arxiv_id":"1611.09940","page":"/paper/neural-combinatorial-optimization-with"}],"arg_sig_recorded":[["lengths",1,"int","int64"]],"scalar_args":{"max_len":"7"},"class_bearing":false}]},{"output_sha":"003f5cd20cfe9675","size":1,"n_papers":1,"shape":[8,6],"dtype":"bool","type":"Tensor","finite":true,"max_difference_among_recorded_values":null,"members_with_recorded_values":1,"torch_reference_conventions_with_this_digest":[],"values":[1.0,1.0,0.0,0.0,0.0,0.0,1.0,0.0,0.0,0.0,0.0,0.0,1.0,1.0,1.0,0.0,0.0,0.0,0.0,0.0,0.0,0.0,0.0,0.0,1.0,0.0,0.0,0.0,0.0,0.0,1.0,1.0,0.0,0.0,0.0,0.0,1.0,1.0,0.0,0.0,0.0,0.0,1.0,1.0,0.0,0.0,0.0,0.0],"values_recorded":48,"members":[{"code_sha256_prefix":"588c48c10ab1ad04","path":"models/seq3_losses.py","papers":["2010.04379"],"paper_pages":[{"arxiv_id":"2010.04379","page":"/paper/q-learning-with-language-model-for-edit-based"}],"arg_sig_recorded":[["lengths",1,"int","int64"]],"scalar_args":{"max_len":"6"},"class_bearing":false}]}]},{"bucket":[[2,"int","int64"]],"n_implementations_compared":1,"n_papers":1,"n_not_digested":0,"not_digested_by_type":{},"clusters":[{"output_sha":"8559b5ae26577792","size":1,"n_papers":1,"shape":[4,8,8],"dtype":"uint8","type":"Tensor","finite":true,"max_difference_among_recorded_values":null,"members_with_recorded_values":1,"torch_reference_conventions_with_this_digest":[],"values":[0.0,1.0,1.0,1.0,1.0,1.0,1.0,1.0,0.0,0.0,1.0,1.0,1.0,1.0,1.0,1.0,0.0,0.0,0.0,1.0,1.0,1.0,1.0,1.0,0.0,0.0,0.0,0.0,1.0,1.0,1.0,1.0,0.0,0.0,0.0,0.0,0.0,1.0,1.0,1.0,0.0,0.0,0.0,0.0,0.0,0.0,1.0,1.0,0.0,0.0,0.0,0.0,0.0,0.0,0.0,1.0,0.0,0.0,0.0,0.0,0.0,0.0,0.0,0.0,0.0,1.0,1.0,1.0,1.0,1.0,1.0,1.0,0.0,0.0,1.0,1.0,1.0,1.0,1.0,1.0,0.0,0.0,0.0,1.0,1.0,1.0,1.0,1.0,0.0,0.0,0.0,0.0,1.0,1.0,1.0,1.0,0.0,0.0,0.0,0.0,0.0,1.0,1.0,1.0,0.0,0.0,0.0,0.0,0.0,0.0,1.0,1.0,0.0,0.0,0.0,0.0,0.0,0.0,0.0,1.0,0.0,0.0,0.0,0.0,0.0,0.0,0.0,0.0,0.0,1.0,1.0,1.0,1.0,1.0,1.0,1.0,0.0,0.0,1.0,1.0,1.0,1.0,1.0,1.0,0.0,0.0,0.0,1.0,1.0,1.0,1.0,1.0,0.0,0.0,0.0,0.0,1.0,1.0,1.0,1.0,0.0,0.0,0.0,0.0,0.0,1.0,1.0,1.0,0.0,0.0,0.0,0.0,0.0,0.0,1.0,1.0,0.0,0.0,0.0,0.0,0.0,0.0,0.0,1.0,0.0,0.0,0.0,0.0,0.0,0.0,0.0,0.0,0.0,1.0,1.0,1.0,1.0,1.0,1.0,1.0,0.0,0.0,1.0,1.0,1.0,1.0,1.0,1.0,0.0,0.0,0.0,1.0,1.0,1.0,1.0,1.0,0.0,0.0,0.0,0.0,1.0,1.0,1.0,1.0,0.0,0.0,0.0,0.0,0.0,1.0,1.0,1.0,0.0,0.0,0.0,0.0,0.0,0.0,1.0,1.0,0.0,0.0,0.0,0.0,0.0,0.0,0.0,1.0,0.0,0.0,0.0,0.0,0.0,0.0,0.0,0.0],"values_recorded":256,"members":[{"code_sha256_prefix":"c85046b5d3a3729d","path":"tree_transformer.py","papers":["1811.07234"],"paper_pages":[{"arxiv_id":"1811.07234","page":"/paper/improving-automatic-source-code-summarization"}],"arg_sig_recorded":[["seq",2,"int","int64"]],"scalar_args":{},"class_bearing":false}]}]}]}