{"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/get-std-opt","entry":"get_std_opt","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":6,"n_papers_ran":5,"n_papers_ran_no_instrument_failure":5,"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":5,"n_samples_ran":4,"n_samples_constructed":0,"n_samples_ran_checked":4,"n_samples_instrument":0,"n_samples_unverified":1,"n_samples_fingerprinted":0,"n_places":6,"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":0,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":0,"ran":4,"unverified":1},"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":"2402.12269","arxiv_id_is_arxiv":true,"paper":"/paper/end-to-end-supervised-prediction-of-arbitrary","title":"Any2Graph: Deep End-To-End Supervised Graph Prediction With An Optimal Transport Loss","date":"2024-02-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"KrzakalaPaul/Any2Graph","path":"Any2Graph/utils.py","file_url":"https://github.com/KrzakalaPaul/Any2Graph/blob/HEAD/Any2Graph/utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, KrzakalaPaul/Any2Graph when it was checked","code_sha256":"186a7a26fda1c0c0","code_sha256_prefix":"186a7a26fda1c0c0","mcp_get_code":{"code_sha256":"186a7a26fda1c0c0"}},{"arxiv_id":"2104.09715","arxiv_id_is_arxiv":true,"paper":"/paper/adaspeech-2-adaptive-text-to-speech-with","title":"AdaSpeech 2: Adaptive Text to Speech with Untranscribed Data","date":"2021-04-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"rishikksh20/AdaSpeech2","path":"core/optimizer.py","file_url":"https://github.com/rishikksh20/AdaSpeech2/blob/HEAD/core/optimizer.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":"09d756d182147053","code_sha256_prefix":"09d756d182147053","mcp_get_code":{"code_sha256":"09d756d182147053"}},{"arxiv_id":"2006.09286","arxiv_id_is_arxiv":true,"paper":"/paper/on-the-computational-power-of-transformers","title":"On the Computational Power of Transformers and its Implications in Sequence Modeling","date":"2020-06-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"satwik77/Transformer-Computation-Analysis","path":"Transformer/src/utils/helper.py","file_url":"https://github.com/satwik77/Transformer-Computation-Analysis/blob/HEAD/Transformer/src/utils/helper.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":"c930b9e88eed3346","code_sha256_prefix":"c930b9e88eed3346","mcp_get_code":{"code_sha256":"c930b9e88eed3346"}},{"arxiv_id":"2006.04558","arxiv_id_is_arxiv":true,"paper":"/paper/fastspeech-2-fast-and-high-quality-end-to-end","title":"FastSpeech 2: Fast and High-Quality End-to-End Text to Speech","date":"2020-06-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"rishikksh20/FastSpeech2","path":"core/optimizer.py","file_url":"https://github.com/rishikksh20/FastSpeech2/blob/HEAD/core/optimizer.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":"09d756d182147053","code_sha256_prefix":"09d756d182147053","mcp_get_code":{"code_sha256":"09d756d182147053"}},{"arxiv_id":"1910.06188","arxiv_id_is_arxiv":true,"paper":"/paper/q8bert-quantized-8bit-bert","title":"Q8BERT: Quantized 8Bit BERT","date":"2019-10-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"iabd/QuantizedNMT","path":"src/noamOpt.py","file_url":"https://github.com/iabd/QuantizedNMT/blob/HEAD/src/noamOpt.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":"b08eb2ca2806310a","code_sha256_prefix":"b08eb2ca2806310a","mcp_get_code":{"code_sha256":"b08eb2ca2806310a"}},{"arxiv_id":"1909.06639","arxiv_id_is_arxiv":true,"paper":"/paper/tree-transformer-integrating-tree-structures","title":"Tree Transformer: Integrating Tree Structures into Self-Attention","date":"2019-09-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"itzpankajpanwar/Tree-transform","path":"modules.py","file_url":"https://github.com/itzpankajpanwar/Tree-transform/blob/HEAD/modules.py","status":"unverified","verification_level":0,"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":"009d3f80a8ce3436","code_sha256_prefix":"009d3f80a8ce3436","mcp_get_code":{"code_sha256":"009d3f80a8ce3436"}}],"record_sha256":"b16c3135964dbc61622f11e39946cde6137d20cc3336980c43ee8db81b65cbf8","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}