{"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/gumbel-sigmoid","entry":"gumbel_sigmoid","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":15,"n_papers_ran":15,"n_papers_ran_no_instrument_failure":9,"n_papers_ran_instrument_only":6,"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":13,"n_samples_ran":13,"n_samples_constructed":0,"n_samples_ran_checked":8,"n_samples_instrument":5,"n_samples_unverified":0,"n_samples_fingerprinted":8,"n_places":15,"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":0,"ran_violates":0,"ran_draft_wrong":3,"ran_fixture":2,"ran":8,"unverified":0},"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":"2605.28441","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2605-28441","title":"Bayesian Gated Non-Negative Contrastive Learning","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"Cui-Peng-624/BayesNCL","path":"solo/methods/bayesncl_helper_functions.py","file_url":"https://github.com/Cui-Peng-624/BayesNCL/blob/HEAD/solo/methods/bayesncl_helper_functions.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, Cui-Peng-624/BayesNCL when it was checked","code_sha256":"249632c588c17fb0","code_sha256_prefix":"249632c588c17fb0","mcp_get_code":{"code_sha256":"249632c588c17fb0"}},{"arxiv_id":"2605.08314","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2605-08314","title":"FlashSVD v1.5: Making Low-Rank Transformers Inference Actually Fast","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"Zishan-Shao/FlashSVD","path":"src/legacy/FlashSVD-V1/BERTAda/adaptive_rank_selection.py","file_url":"https://github.com/Zishan-Shao/FlashSVD/blob/HEAD/src/legacy/FlashSVD-V1/BERTAda/adaptive_rank_selection.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"3a558a165ad030f5","code_sha256_prefix":"3a558a165ad030f5","mcp_get_code":{"code_sha256":"3a558a165ad030f5"}},{"arxiv_id":"2603.20585","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2603-20585","title":"RECLAIM: Cyclic Causal Discovery Amid Measurement Noise","date":null,"month_inferred_from_arxiv_id":"2026-03","title_source":"syntology","repo":null,"path":"","file_url":null,"status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":null,"inline_ok":false,"inline_ok_link":false,"withheld_clause":"this paper's copy of the code was not recorded (its link names no repository or source path), so no licence was read for it","code_sha256":"d6775d96f6872aa7","code_sha256_prefix":"d6775d96f6872aa7","mcp_get_code":{"code_sha256":"d6775d96f6872aa7"}},{"arxiv_id":"2602.02763","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2602-02763","title":"Exposing Vulnerabilities in Explanation for Time Series Classifiers via Dual-Target Attacks","date":null,"month_inferred_from_arxiv_id":"2026-02","title_source":"syntology","repo":"Bohan7/TSEF","path":"experiments/evaluation/tsef_attack.py","file_url":"https://github.com/Bohan7/TSEF/blob/HEAD/experiments/evaluation/tsef_attack.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"3c8da9125fcb3655","code_sha256_prefix":"3c8da9125fcb3655","mcp_get_code":{"code_sha256":"3c8da9125fcb3655"}},{"arxiv_id":"2410.07013","arxiv_id_is_arxiv":true,"paper":"/paper/causal-representation-learning-in-temporal","title":"Causal Representation Learning in Temporal Data via Single-Parent Decoding","date":"2024-10-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"kurowasan/cdsd","path":"model/tsdcd_latent.py","file_url":"https://github.com/kurowasan/cdsd/blob/HEAD/model/tsdcd_latent.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, kurowasan/cdsd when it was checked","code_sha256":"d6775d96f6872aa7","code_sha256_prefix":"d6775d96f6872aa7","mcp_get_code":{"code_sha256":"d6775d96f6872aa7"}},{"arxiv_id":"2409.19660","arxiv_id_is_arxiv":true,"paper":"/paper/all-in-one-image-coding-for-joint-human","title":"All-in-One Image Coding for Joint Human-Machine Vision with Multi-Path Aggregation","date":"2024-09-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"NJUVISION/MPA","path":"compressai/layers/layers.py","file_url":"https://github.com/NJUVISION/MPA/blob/HEAD/compressai/layers/layers.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NOASSERTION","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub could not classify the licence of this paper's repository, NJUVISION/MPA (NOASSERTION)","code_sha256":"cba60dba29f40ee7","code_sha256_prefix":"cba60dba29f40ee7","mcp_get_code":{"code_sha256":"cba60dba29f40ee7"}},{"arxiv_id":"2311.04066","arxiv_id_is_arxiv":true,"paper":"/paper/can-clip-help-sound-source-localization","title":"Can CLIP Help Sound Source Localization?","date":"2023-11-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"swimmiing/ACL-SSL","path":"modules/mask_utils.py","file_url":"https://github.com/swimmiing/ACL-SSL/blob/HEAD/modules/mask_utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, swimmiing/ACL-SSL when it was checked","code_sha256":"832166e6327d35fe","code_sha256_prefix":"832166e6327d35fe","mcp_get_code":{"code_sha256":"832166e6327d35fe"}},{"arxiv_id":"2302.12200","arxiv_id_is_arxiv":true,"paper":"/paper/a-neural-span-based-continual-named-entity","title":"A Neural Span-Based Continual Named Entity Recognition Model","date":"2023-02-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Qznan/SpanKL","path":"modules.py","file_url":"https://github.com/Qznan/SpanKL/blob/HEAD/modules.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":"7f90aea42236850b","code_sha256_prefix":"7f90aea42236850b","mcp_get_code":{"code_sha256":"7f90aea42236850b"}},{"arxiv_id":"2212.00785","arxiv_id_is_arxiv":true,"paper":"/paper/learning-to-generate-text-grounded-mask-for","title":"Learning to Generate Text-grounded Mask for Open-world Semantic Segmentation from Only Image-Text Pairs","date":"2022-12-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"kakaobrain/tcl","path":"models/tcl/gumbel.py","file_url":"https://github.com/kakaobrain/tcl/blob/HEAD/models/tcl/gumbel.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"9b85141da9c13ff7","code_sha256_prefix":"9b85141da9c13ff7","mcp_get_code":{"code_sha256":"9b85141da9c13ff7"}},{"arxiv_id":"2006.08437","arxiv_id_is_arxiv":true,"paper":"/paper/depth-uncertainty-in-neural-networks","title":"Depth Uncertainty in Neural Networks","date":"2020-06-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"cambridge-mlg/DUN","path":"src/probability.py","file_url":"https://github.com/cambridge-mlg/DUN/blob/HEAD/src/probability.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"3f8936e2414a0c9b","code_sha256_prefix":"3f8936e2414a0c9b","mcp_get_code":{"code_sha256":"3f8936e2414a0c9b"}},{"arxiv_id":"2004.00345","arxiv_id_is_arxiv":true,"paper":"/paper/editable-neural-networks-1","title":"Editable Neural Networks","date":"2020-04-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"xtinkt/editable","path":"lib/utils/gumbel.py","file_url":"https://github.com/xtinkt/editable/blob/HEAD/lib/utils/gumbel.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":"9d12c26ca7e41a01","code_sha256_prefix":"9d12c26ca7e41a01","mcp_get_code":{"code_sha256":"9d12c26ca7e41a01"}},{"arxiv_id":"2004.00070","arxiv_id_is_arxiv":true,"paper":"/paper/conditional-channel-gated-networks-for-task","title":"Conditional Channel Gated Networks for Task-Aware Continual Learning","date":"2020-03-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lit-leo/cgate","path":"src/blocks.py","file_url":"https://github.com/lit-leo/cgate/blob/HEAD/src/blocks.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"e0f0ddbe7f79c547","code_sha256_prefix":"e0f0ddbe7f79c547","mcp_get_code":{"code_sha256":"e0f0ddbe7f79c547"}},{"arxiv_id":"1903.02278","arxiv_id_is_arxiv":true,"paper":"/paper/causal-discovery-toolbox-uncover-causal","title":"Causal Discovery Toolbox: Uncover causal relationships in Python","date":"2019-03-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"elementai/causal_discovery_toolbox","path":"cdt/utils/torch.py","file_url":"https://github.com/elementai/causal_discovery_toolbox/blob/HEAD/cdt/utils/torch.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":"1189b0c4307ca015","code_sha256_prefix":"1189b0c4307ca015","mcp_get_code":{"code_sha256":"1189b0c4307ca015"}},{"arxiv_id":"1803.04929","arxiv_id_is_arxiv":true,"paper":"/paper/sam-structural-agnostic-model-causal","title":"Structural Agnostic Modeling: Adversarial Learning of Causal Graphs","date":"2018-03-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Diviyan-Kalainathan/SAM","path":"sam/utils/gumble_utils.py","file_url":"https://github.com/Diviyan-Kalainathan/SAM/blob/HEAD/sam/utils/gumble_utils.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":"1189b0c4307ca015","code_sha256_prefix":"1189b0c4307ca015","mcp_get_code":{"code_sha256":"1189b0c4307ca015"}},{"arxiv_id":"1602.02830","arxiv_id_is_arxiv":true,"paper":"/paper/binarized-neural-networks-training-deep","title":"Binarized Neural Networks: Training Deep Neural Networks with Weights and Activations Constrained to +1 or -1","date":"2016-02-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hellolzc/SBN_gumbel","path":"gumbel_sigmoid_softmax.py","file_url":"https://github.com/hellolzc/SBN_gumbel/blob/HEAD/gumbel_sigmoid_softmax.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"cdaecaefec7f56e7","code_sha256_prefix":"cdaecaefec7f56e7","mcp_get_code":{"code_sha256":"cdaecaefec7f56e7"}}],"record_sha256":"478f936580ecf02ab9805fee4b208eed1cda8962abdb7396b52c2ef99454f2da","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}