{"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/np-softmax","entry":"np_softmax","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":7,"n_papers_ran":7,"n_papers_ran_no_instrument_failure":7,"n_papers_ran_instrument_only":0,"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":6,"n_samples_ran":6,"n_samples_constructed":0,"n_samples_ran_checked":6,"n_samples_instrument":0,"n_samples_unverified":0,"n_samples_fingerprinted":5,"n_places":7,"n_places_pointer_only":1,"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":2,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":0,"ran":4,"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":"2502.06485","arxiv_id_is_arxiv":true,"paper":"/paper/wyckoffdiff-a-generative-diffusion-model-for","title":"WyckoffDiff -- A Generative Diffusion Model for Crystal Symmetry","date":"2025-02-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"CompRhys/aviary","path":"aviary/core.py","file_url":"https://github.com/CompRhys/aviary/blob/HEAD/aviary/core.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":"ebfab520175f7b91","code_sha256_prefix":"ebfab520175f7b91","mcp_get_code":{"code_sha256":"ebfab520175f7b91"}},{"arxiv_id":"2302.05118","arxiv_id_is_arxiv":true,"paper":"/paper/beyond-in-domain-scenarios-robust-density","title":"Beyond In-Domain Scenarios: Robust Density-Aware Calibration","date":"2023-02-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"futakw/densityawarecalibration","path":"density_aware_calib.py","file_url":"https://github.com/futakw/densityawarecalibration/blob/HEAD/density_aware_calib.py","status":"ran_honours","verification_level":2,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, futakw/densityawarecalibration when it was checked","code_sha256":"ef662d005fabc3b0","code_sha256_prefix":"ef662d005fabc3b0","mcp_get_code":{"code_sha256":"ef662d005fabc3b0"}},{"arxiv_id":"2109.09968","arxiv_id_is_arxiv":true,"paper":"/paper/generalization-in-text-based-games-via","title":"Generalization in Text-based Games via Hierarchical Reinforcement Learning","date":"2021-09-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yunqiuxu/h-kga","path":"train_rl.py","file_url":"https://github.com/yunqiuxu/h-kga/blob/HEAD/train_rl.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"e9cb93a3ca7340ba","code_sha256_prefix":"e9cb93a3ca7340ba","mcp_get_code":{"code_sha256":"e9cb93a3ca7340ba"}},{"arxiv_id":"2105.04051","arxiv_id_is_arxiv":true,"paper":"/paper/aggregating-from-multiple-target-shifted","title":"Aggregating From Multiple Target-Shifted Sources","date":"2021-05-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"cjshui/wadn","path":"utils.py","file_url":"https://github.com/cjshui/wadn/blob/HEAD/utils.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":"db82577adb193cb7","code_sha256_prefix":"db82577adb193cb7","mcp_get_code":{"code_sha256":"db82577adb193cb7"}},{"arxiv_id":"1910.06316","arxiv_id_is_arxiv":true,"paper":"/paper/neurvps-neural-vanishing-point-scanning-via","title":"NeurVPS: Neural Vanishing Point Scanning via Conic Convolution","date":"2019-10-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zhou13/neurvps","path":"neurvps/utils.py","file_url":"https://github.com/zhou13/neurvps/blob/HEAD/neurvps/utils.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":"51b1ab837451a9ae","code_sha256_prefix":"51b1ab837451a9ae","mcp_get_code":{"code_sha256":"51b1ab837451a9ae"}},{"arxiv_id":"1905.03246","arxiv_id_is_arxiv":true,"paper":"/paper/190503246","title":"End-to-End Wireframe Parsing","date":"2019-05-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zhou13/lcnn","path":"lcnn/utils.py","file_url":"https://github.com/zhou13/lcnn/blob/HEAD/lcnn/utils.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":"51b1ab837451a9ae","code_sha256_prefix":"51b1ab837451a9ae","mcp_get_code":{"code_sha256":"51b1ab837451a9ae"}},{"arxiv_id":"1810.05546","arxiv_id_is_arxiv":true,"paper":"/paper/uncertainty-in-neural-networks-bayesian","title":"Uncertainty in Neural Networks: Approximately Bayesian Ensembling","date":"2018-10-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"TeaPearce/Bayesian_NN_Ensembles","path":"classification/2d_class_need_03.py","file_url":"https://github.com/TeaPearce/Bayesian_NN_Ensembles/blob/HEAD/classification/2d_class_need_03.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":"e8ccab56c21c75ce","code_sha256_prefix":"e8ccab56c21c75ce","mcp_get_code":{"code_sha256":"e8ccab56c21c75ce"}}],"record_sha256":"fcd46c1e5d541cb6f136a53078455490e4fe2eb122860da2a3c66c24cb8aec91","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}