{"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":"/paper/block-diffusion-interpolating-between","title":"Block Diffusion: Interpolating Between Autoregressive and Diffusion Language Models","arxiv_id":"2503.09573","date":"2025-03-12","proceeding":null,"authors":["Marianne Arriola","Aaron Gokaslan","Justin T. Chiu","Zhihan Yang","Zhixuan Qi","Jiaqi Han","Subham Sekhar Sahoo","Volodymyr Kuleshov"],"abstract":"Diffusion language models offer unique benefits over autoregressive models due to their potential for parallelized generation and controllability, yet they lag in likelihood modeling and are limited to fixed-length generation. In this work, we introduce a class of block diffusion language models that interpolate between discrete denoising diffusion and autoregressive models. Block diffusion overcomes key limitations of both approaches by supporting flexible-length generation and improving inference efficiency with KV caching and parallel token sampling. We propose a recipe for building effective block diffusion models that includes an efficient training algorithm, estimators of gradient variance, and data-driven noise schedules to minimize the variance. Block diffusion sets a new state-of-the-art performance among diffusion models on language modeling benchmarks and enables generation of arbitrary-length sequences. We provide the code, along with the model weights and blog post on the project page: https://m-arriola.com/bd3lms","url_abs":"https://arxiv.org/abs/2503.09573v3","url_pdf":"https://arxiv.org/pdf/2503.09573v3.pdf","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","row_kind":"abstracts"},"code_links":[{"paper_slug":"block-diffusion-interpolating-between","repo_url":"https://github.com/kuleshov-group/bd3lms","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"ok","spdx":"Apache-2.0"}},{"paper_slug":"block-diffusion-interpolating-between","repo_url":"https://github.com/MindSpore-scientific/code-12/tree/main/Block_Model","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"mindspore","reach":null}],"tasks":[{"task_slug":"denoising","task_name":"Denoising"},{"task_slug":"language-modeling","task_name":"Language Modeling"},{"task_slug":"language-modelling","task_name":"Language Modelling"}],"methods":[{"method_slug":"diffusion","method_name":"Diffusion"}],"datasets_introduced":[],"methods_introduced":[],"results":[{"leaderboard":"/sota/language-modelling-on-openwebtext","task":"Language Modelling","dataset":"OpenWebText","model":"BD3-LMs","rank_in_archive_order":8,"of":12,"metrics":{"eval_perplexity":"20.73","parameters":"131M"},"uses_additional_data":false}],"syntology":{"syntology_url":"https://syntology.ai/paper/2503.09573","atlas_url":"https://app.syntology.ai/?focus=2503.09573","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2503.09573"},"calls":[{"tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2503.09573"},"returns":"the samples harvested from this paper, each with its run record; it does not verify the paper"},{"tool":"get_code","arguments_in":"samples[].code_sha256","returns":"one stored sample by its code_sha256; not shown on this site"}]},"developers":"https://syntology.ai/developers","held":true,"reason":"in_graph_layer","checked_against":null,"agent_calls":[{"tool":"get_reference_implementation","arguments":{"name":"Block Diffusion"},"call":"get_reference_implementation(name='Block Diffusion')","min_level":{"quoted_from_server_card":["It REFUSES rather than serving below min_level, and the refusal names the highest level that exists","so lowering min_level is a deliberate, informed choice, not a guess."],"default_on_card":2,"server_card":"https://syntology.ai/.well-known/mcp/server-card.json","card_sha256":"479785a84658dd682a11b10237b3620d651d7f87799f5dc7add970aaa83f6d39","this_implementation_level":3}},{"tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2503.09573"},"call":"get_harvested_code_for_paper(arxiv_id=\"2503.09573\")"},{"tool":"get_code","arguments_in":{"code_sha256":"syntology.samples[].code_sha256"},"call":"get_code(code_sha256=\"…\")"},{"tool":"get_citation_path","arguments":{"paper_1":"2503.09573"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"2503.09573\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"2503.09573"},"call":"get_concepts_for_paper(arxiv_id=\"2503.09573\")"}],"reference_implementation":[{"method_name":"Block Diffusion","assembly_sha256":"06d03ac242edacb5","source":"generated from the paper text (not the authors' code)","level":3,"level_is_quoted_from_server_card":[{"level":"V2","quoted":["two implementations GENERATED from the paper's signature and spec agree numerically (1e-6) on fixture inputs","neither of the two ever read the authors' own code, so V2 measures how unambiguously the paper specifies the method, not fidelity to the authors' implementation (measured 2026-09-11, commit 75eaa77: cross_checked_by is a second LLM on 2,628 of 2,831 served samples)"]},{"level":"V3","quoted":["paper-derived property tests pass on both of those same two generations."]}],"server_card":"https://syntology.ai/.well-known/mcp/server-card.json","card_sha256":"479785a84658dd682a11b10237b3620d651d7f87799f5dc7add970aaa83f6d39","v3_tests_passed_both_sides":5,"no_rung":"No rung compares this code against the authors' implementation","no_rung_quoted_from_server_card":"No rung on this ladder compares the served code against the authors' implementation, so treat every level as evidence about runnability and internal agreement, not about matching the paper's results.","retrieve_with":"get_reference_implementation(name='Block Diffusion')","have_check":{"url":"https://syntology.ai/api/graph/have?x=2503.09573","call":"have('2503.09573')","in_build_sample":false}}],"reference_implementation_is":"Syntology's reference implementation of this paper's method: code Syntology generated from the paper text (not the authors' code), at the level its own end-to-end run recorded (the assembly's own level, never averaged); the level's meaning is quoted from Syntology's server card, and nothing here says the code is correct or reproduces the paper's results","by_repo":[{"repo":"kuleshov-group/bd3lms","kind":"official","samples":11,"ran":10,"instrument":7,"unverified":1},{"repo":"MindSpore-scientific/code-12","kind":"listed","samples":4,"ran":4,"instrument":0,"unverified":0}],"by_repo_is":"one row per repository in the archive's code links, Syntology's graph links or the samples; samples 0 means no sample is linked to this paper, a statement about Syntology's coverage, not about the repository: with harvested_for_other_papers present, Syntology harvested the repository for that many other papers, and without it, Syntology harvested nothing from it; placed_by_identical_code counts samples whose link records no repository, placed here because identical code was harvested from this repository for another paper; ran counts executions on a synthesized input and instrument counts failures of Syntology's instrument, not of the code","assemblies":[{"assembly_sha256":"06d03ac242edacb5","source_kind":"generated","method_name":"Block Diffusion","realizes_method":"Block Diffusion","graph_method":"Block Diffusion","realizes_severed":false,"claim":"Compute the Block Diffusion cross-entropy loss for concatenated block predictions.\n\nInputs:\n- x_logit: float array of shape (T, V) where T is total sequence length (sum of all block lengths) and V is vocab_size. Contains raw logits (unnormalized log-probabilities) for each token position.\n- x_target","centrality":"contribution","entry":"block_diffusion_loss","entry_sha256":"c5bd01a1cb09c4e474e07917d3d37dedca9b0499b6f86a66eff3f2a35dc3fb0d","n_bricks":1,"bricks":[{"entry":"block_diffusion_loss","code_sha256":"c5bd01a1cb09c4e474e07917d3d37dedca9b0499b6f86a66eff3f2a35dc3fb0d","role":"entry","order":0,"level":3,"status":"ran_fixture"}],"ran_individually":1,"ran_individually_constructed":null,"ran_individually_by_status":{"ran_fixture":1},"end_to_end":{"ran":true,"level":3,"against_independent_peer":true,"n_peers":1,"v3_tests_passed_both_sides":5,"means":"this assembly is a single routine, so the entry brick's verification IS the assembly's: it executed and two family-independent implementations agreed"},"level_lowered":null,"claim_match":"IMPLEMENTS","claim_match_rule":"single_judge","claim_match_basis":"construction","claim_match_judges":["construction:spec_drafted_for_this_method"],"label_verdict":"matches","label_verdict_judged":false,"suggested_method":null,"batch_at":"2026-09-07T20:44:12+00:00","sibling_group":"c0f3bbf2772f","n_siblings":0,"retention":"keep","provenance":"assembly:generated_reference_impl_v1","attached_at":"2026-09-07T20:44:12+00:00","attached_provenance":"assembly:generated_reference_impl_v1"},{"assembly_sha256":"50cd5fb6a859e3fe","source_kind":"harvested","method_name":"Block Diffusion","realizes_method":"Block Diffusion","graph_method":"Block Diffusion","realizes_severed":false,"claim":"Implements a block diffusion attention mechanism that combines self-attention within noised blocks and cross-attention for conditional context, enabling interpolation between autoregressive and diffusion language models.","centrality":"contribution","entry":"DDiTBlock","entry_sha256":"86fec9b064072440","n_bricks":11,"bricks":[{"entry":"DDiTBlock","code_sha256":"86fec9b064072440","role":"entry","order":0,"level":1,"status":"ran"},{"entry":"LayerNorm","code_sha256":"cdb5490054e8737a","role":"helper","order":1,"level":1,"status":"ran"},{"entry":"apply_rotary_pos_emb","code_sha256":"2700f6838f384546","role":"helper","order":2,"level":0,"status":"unverified"},{"entry":"apply_rotary_pos_emb_torchscript","code_sha256":"f080db2e3db70ca8","role":"helper","order":3,"level":1,"status":"ran_violates"},{"entry":"bias_dropout_add_scale_fused_inference","code_sha256":"1db46c6c34b8dce1","role":"helper","order":4,"level":1,"status":"ran_fixture"},{"entry":"bias_dropout_add_scale_fused_train","code_sha256":"ee894c881614c3ec","role":"helper","order":5,"level":1,"status":"ran_fixture"},{"entry":"fused_flex_attention","code_sha256":"b4f2749f771988c2","role":"model","order":6,"level":0,"status":"unverified"},{"entry":"modulate_fused","code_sha256":"45d7695ab56ca287","role":"helper","order":7,"level":1,"status":"ran_honours"},{"entry":"rotate_half","code_sha256":"8526ce179df04bd4","role":"helper","order":8,"level":1,"status":"ran_honours"},{"entry":"bias_dropout_add_scale","code_sha256":"fbbc6722b74bda27","role":"helper","order":9,"level":1,"status":"ran_fixture"},{"entry":"modulate","code_sha256":"78b555034273f3c7","role":"helper","order":10,"level":1,"status":"ran_honours"}],"ran_individually":9,"ran_individually_constructed":2,"ran_individually_by_status":{"ran":2,"ran_fixture":3,"ran_honours":3,"ran_violates":1},"end_to_end":{"ran":false,"level":0},"level_lowered":null,"claim_match":"IMPLEMENTS","claim_match_rule":"single_judge","claim_match_basis":"judge:global.anthropic.claude-sonnet-4-5-20250929-v1:0","claim_match_judges":["global.anthropic.claude-sonnet-4-5-20250929-v1:0"],"label_verdict":"matches","label_verdict_judged":true,"suggested_method":null,"batch_at":"2026-09-09T22:44:46+00:00","sibling_group":"4d2dba98b0cf","n_siblings":0,"retention":"keep","provenance":"assembly:harvest_method_v6","attached_at":"2026-09-09T22:44:46+00:00","attached_provenance":"assembly:harvest_method_v6"}],"assembly_sibling_groups":[{"group":"4d2dba98b0cf","realizes_method":"Block Diffusion","source_kind":"harvested","batch_at":"2026-09-09T22:44:46+00:00","members":["50cd5fb6a859e3fe"]},{"group":"c0f3bbf2772f","realizes_method":"Block Diffusion","source_kind":"generated","batch_at":"2026-09-07T20:44:12+00:00","members":["06d03ac242edacb5"]}],"assemblies_is":{"about":"What Syntology's graph records as this paper's claimed method, lifted into code: each assembly names its bricks (functions and classes), each with its own role and its own verification level. An assembly is not a check that the code implements the method correctly or reproduces the paper's results.","harvested":"assembled from code harvested from a repository linked to the paper","generated":"generated from the paper text, not the repository's code","end_to_end":"for a harvested assembly, the assembly has not been run end-to-end; for a generated one, end_to_end.level is the assembly's own level and against_independent_peer says whether it ran against a peer: an independent peer is a second implementation generated separately from the same paper text; neither implementation read the authors' code. At level 2 the two agreed numerically on the fixture's inputs; level 3 is recorded when property tests derived from the paper also passed on both, and each level 3 card prints how many its report lists","bricks_level":"each brick's own verification level in Syntology's graph (level 0: no recorded run), listed brick by brick and never combined into one level","ran_individually":"a COUNT of bricks that ran on their own on a fixture (split by status in ran_individually_by_status), not a level; instrument statuses are failures of Syntology's instrument, not of the code","siblings":"assemblies lifted from this paper in the same batch for the same method: alternative readings kept side by side; none replaces or supersedes another","judged":"Where a model read the code against the paper's claim, each assembly's label verdict is one model's judgement, kept in this page's JSON twin; it is not calibrated, so no card prints it. A generated assembly's label was set when its code was generated for the method, and no model judged it; its card prints it as \"by construction\" or \"not judged by a model\"","level_lowered":"a generated assembly whose level Syntology's graph lowered, with the level it had, the recorded reason and when","retention":"Syntology's spending triage for further verification, not a verdict","claim_match":"the claim_match vote: IMPLEMENTS, COMPONENT or UNCLEAR. Where claim_match_basis is \"judge:<model>\", it is one model's judgement of the assembly's label against the paper's claim (claim_match_rule single_judge, the model in claim_match_judges): not a verification and not a run. Where it is \"construction\", the value was set when the code was generated for this method and no model judged it, whatever claim_match_rule says. The page prints no claim match for any assembly","label_verdict":"whether the assembly's code is the method it is labelled with: matches, cannot_tell, mislabelled (suggested_method names what it looks like instead) or not_the_method; label_verdict_judged is true only when a model read the code (claim_match_basis \"judge:<model>\")","label_verdict_judged":"where true (claim_match_basis \"judge:<model>\"), label_verdict is a single model's judgement; not calibrated; not printed on the page; where false, it was set by construction, and the page prints it unless the node is shared with another paper (node_properties_written_for)","claim":"the claim text stored on the assembly node: for a harvested assembly, what the paper claims the code implements, as the lifting model wrote it; for a generated one, the specification the code was generated from. Not verified text","centrality":"how central the lifted method is to the paper, as the lifting step recorded it: contribution, component or incidental","v3_tests_passed_both_sides":"end_to_end.v3_tests_passed_both_sides: the number of property tests derived from the paper that passed on both implementations, as the attached report lists them; a level 3 card with 0 says its report lists none","ran_individually_constructed":"ran_individually_constructed: of the bricks counted in ran_individually, how many constructed an object rather than computing a result (Syntology's RAN record's rule, read from the graph-layer sample with the brick's code_sha256); a part of ran_individually, never subtracted from it and never a failure; null where a brick that ran has no sample in the graph layer this build read, so the figure was not counted"},"assemblies_call":{"tool":"assembly","arguments":{"arxiv_id":"2503.09573"},"call":"assembly(arxiv_id=\"2503.09573\")"},"read_at":"2026-10-05T00:36:11+00:00","read_at_is":"when the build read Syntology's graph, not when any sample ran","ran_record":{"url":"https://syntology.ai/api/ran/2503.09573.json","schema":"syntology.ran_record/1","counts_crosswalk":{"n_samples":"syntology.counts.lifted","n_ran":"syntology.counts.executed","n_ran_checked":"syntology.counts.checked","n_instrument":"syntology.counts.instrument_failures","n_unverified":"syntology.counts.no_recorded_run"},"note":"live record, measured at request time; may be newer than this page's graph read","badge":"https://syntology.ai/api/ran/2503.09573.svg"},"claim":"Per-sample execution status on synthesized fixtures; not a correctness claim about the paper. Samples come from repositories linked to the paper, official or community; repo_kind says which.","repos":[{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/MindSpore-scientific/code-12/tree/main/Block_Model","reach":null},{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/kuleshov-group/bd3lms","reach":{"status":"ok","spdx":"Apache-2.0"}}],"summary":{"ran_fixture":2,"ran_draft_wrong":5,"ran":7,"unverified":1},"n_samples":15,"n_ran":14,"n_constructed":0,"n_ran_checked":7,"n_instrument":7,"n_unverified":1,"n_instrument_is":"failures of Syntology's instrument, not of the code","every_run_is_an_instrument_failure":false,"key_notes":{"n_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_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)"},"by_repo_kind":{"official":{"samples":11,"ran":10,"n_ran_checked":3,"n_instrument":7,"repositories":1},"listed":{"samples":4,"ran":4,"n_ran_checked":4,"n_instrument":0,"repositories":1}},"repo_kind_vocabulary":{"official":"The archive marks this repository official for the paper","named_in_paper":"The archive records that the paper mentions this repository; it is not marked official","listed":"In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper","found_in_text":"Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted","community":"Not in the archive's code links for this paper; a community repository Syntology harvested"},"n_pointer_only_for_licence":8,"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_pointer_only_for_licence counts samples with inline_ok false (both gates), n_pointer_only_link_allows those of them whose inline_ok_link is true","n_pointer_only_link_allows":8,"fixture_fields_is":{"signature_and_fixture_out_type":"the arguments Syntology's fixture called the sample with, each as name:type/rank/element kind (? where none was recorded), and the type of what the fixture's run returned, exactly as the harness recorded them; the arguments and the returned type were recorded by two separate runs of the same fixture. No output value is shown, and a returned type says nothing about whether the output was right","level_recorded_at":"when Syntology's graph wrote the sample's verification level, not when the code executed; absent where the level was written before the date was kept, and never filled in with the build date","present_on":"samples that ran only; a key is absent, never empty, where the graph records nothing"},"n_ran_with_level_date":14,"n_ran_without_level_date":0,"n_ran_signature_not_shown":0,"levels_written_between":{"first":"2026-09-22","last":"2026-09-24","is":"the first and last UTC dates on which Syntology's graph wrote a verification level for a sample on this page that ran, not when the code executed"},"code_page_min_papers":5,"code_page_is":"a page for the entry name across every paper's harvested code; the name is a string, not an identity","samples":[{"code_sha256":"fbbc6722b74bda27","code_sha256_prefix":"fbbc6722b74bda27","entry":"bias_dropout_add_scale","repo":"kuleshov-group/bd3lms","repo_kind":"official","path":"models/autoregressive.py","file_url":"https://github.com/kuleshov-group/bd3lms/blob/HEAD/models/autoregressive.py","link_basis":"harvester_set","language":"python","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"invariant","behaviour_fingerprint":true,"signature":"x:Tensor/2/float, bias:Tensor/2/float, scale:Tensor/2/float, residual:Tensor/2/float, prob:float/0/float, training:bool/0/bool","fixture_out_type":"Tensor","level_recorded_at":"2026-09-22T14:31:46.068493+00:00","retrieve_with":{"tool":"get_code","code_sha256":"fbbc6722b74bda27"},"code_page":"/code/bias-dropout-add-scale","census":null,"licence":"Apache-2.0","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (Apache-2.0), but get_code serves the stored copy, first harvested from hxixixh/gumbel-distill, and GitHub detected no licence in that repository when it was checked","mcp_get_code":{"code_sha256":"fbbc6722b74bda27"}},{"code_sha256":"ee894c881614c3ec","code_sha256_prefix":"ee894c881614c3ec","entry":"bias_dropout_add_scale_fused_train","repo":"kuleshov-group/bd3lms","repo_kind":"official","path":"models/autoregressive.py","file_url":"https://github.com/kuleshov-group/bd3lms/blob/HEAD/models/autoregressive.py","link_basis":"harvester_set","language":"python","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"invariant","behaviour_fingerprint":false,"fixture_out_type":"Tensor","level_recorded_at":"2026-09-22T14:31:46.068493+00:00","code_page":"/code/bias-dropout-add-scale-fused-train","census":null,"licence":"Apache-2.0","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (Apache-2.0), but get_code serves the stored copy, first harvested from hxixixh/gumbel-distill, and GitHub detected no licence in that repository when it was checked","mcp_get_code":{"code_sha256":"ee894c881614c3ec"}},{"code_sha256":"14959ccf1e594504","code_sha256_prefix":"14959ccf1e594504","entry":"block_diff_mask","repo":"kuleshov-group/bd3lms","repo_kind":"official","path":"models/dit.py","file_url":"https://github.com/kuleshov-group/bd3lms/blob/HEAD/models/dit.py","link_basis":"harvester_set","language":"python","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"signature":"b:int/0/int, h:int/0/int, q_idx:Tensor/1/int, kv_idx:Tensor/1/int, block_size:int/0/int, n:int/0/int","fixture_out_type":"Tensor","level_recorded_at":"2026-09-22T14:31:46.068493+00:00","code_page":null,"census":null,"licence":"Apache-2.0","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (Apache-2.0), but get_code serves the stored copy, first harvested from hxixixh/gumbel-distill, and GitHub detected no licence in that repository when it was checked","mcp_get_code":{"code_sha256":"14959ccf1e594504"}},{"code_sha256":"72814d7de33e5aef","code_sha256_prefix":"72814d7de33e5aef","entry":"decode","repo":"MindSpore-scientific/code-12","repo_kind":"listed","path":"AECRNet/data.py","file_url":"https://github.com/MindSpore-scientific/code-12/blob/HEAD/AECRNet/data.py","link_basis":"harvester_set","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"signature":"img:ndarray/3/int","fixture_out_type":"Image","level_recorded_at":"2026-09-24T23:25:36.931776+00:00","code_page":"/code/decode","census":null,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"72814d7de33e5aef"}},{"code_sha256":"06d2d8e50f91481f","code_sha256_prefix":"06d2d8e50f91481f","entry":"get_bias_dropout_add_scale","repo":"kuleshov-group/bd3lms","repo_kind":"official","path":"models/autoregressive.py","file_url":"https://github.com/kuleshov-group/bd3lms/blob/HEAD/models/autoregressive.py","link_basis":"harvester_set","language":"python","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"signature":"training:bool/0/bool","fixture_out_type":"function","level_recorded_at":"2026-09-24T15:16:18.137819+00:00","code_page":"/code/get-bias-dropout-add-scale","census":null,"licence":"Apache-2.0","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (Apache-2.0), but get_code serves the stored copy, first harvested from jdeschena/blockgen, and GitHub detected no licence in that repository when it was checked","mcp_get_code":{"code_sha256":"06d2d8e50f91481f"}},{"code_sha256":"e1fdbc4d0bebba92","code_sha256_prefix":"e1fdbc4d0bebba92","entry":"get_noise","repo":"kuleshov-group/bd3lms","repo_kind":"official","path":"noise_schedule.py","file_url":"https://github.com/kuleshov-group/bd3lms/blob/HEAD/noise_schedule.py","link_basis":"harvester_set","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"signature":"config:Config/0/?, noise_type:str/0/str","fixture_out_type":"LogLinearNoise","level_recorded_at":"2026-09-24T23:57:41.519889+00:00","code_page":"/code/get-noise","census":null,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"e1fdbc4d0bebba92"}},{"code_sha256":"0e5797e82608fcdc","code_sha256_prefix":"0e5797e82608fcdc","entry":"get_time_variables","repo":"kuleshov-group/bd3lms","repo_kind":"official","path":"ssd-lm/ssd_model_decode.py","file_url":"https://github.com/kuleshov-group/bd3lms/blob/HEAD/ssd-lm/ssd_model_decode.py","link_basis":"harvester_set","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"signature":"t:Tensor/1/float, total_t:Tensor/0/float, device:str/0/str","fixture_out_type":"tuple","level_recorded_at":"2026-09-24T23:25:36.931776+00:00","code_page":null,"census":null,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"0e5797e82608fcdc"}},{"code_sha256":"576e1b9b9bcae8ff","code_sha256_prefix":"576e1b9b9bcae8ff","entry":"lm1b_detokenizer","repo":"kuleshov-group/bd3lms","repo_kind":"official","path":"dataloader.py","file_url":"https://github.com/kuleshov-group/bd3lms/blob/HEAD/dataloader.py","link_basis":"harvester_set","language":"python","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"signature":"x:str/0/str","fixture_out_type":"str","level_recorded_at":"2026-09-24T15:16:18.137819+00:00","retrieve_with":{"tool":"get_code","code_sha256":"576e1b9b9bcae8ff"},"code_page":"/code/lm1b-detokenizer","census":null,"licence":"Apache-2.0","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (Apache-2.0), but get_code serves the stored copy, first harvested from jdeschena/blockgen, and GitHub detected no licence in that repository when it was checked","mcp_get_code":{"code_sha256":"576e1b9b9bcae8ff"}},{"code_sha256":"ea40ca66b8b3349e","code_sha256_prefix":"ea40ca66b8b3349e","entry":"load_variavle","repo":"MindSpore-scientific/code-12","repo_kind":"listed","path":"Alexnet-ABeffect/feature_predict_abm.py","file_url":"https://github.com/MindSpore-scientific/code-12/blob/HEAD/Alexnet-ABeffect/feature_predict_abm.py","link_basis":"harvester_set","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"signature":"filename:str/0/str","fixture_out_type":"dict","level_recorded_at":"2026-09-24T23:57:41.519889+00:00","code_page":null,"census":null,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"ea40ca66b8b3349e"}},{"code_sha256":"5f25d11e3f7d8a07","code_sha256_prefix":"5f25d11e3f7d8a07","entry":"logits_projection","repo":"kuleshov-group/bd3lms","repo_kind":"official","path":"ssd-lm/ssd_model_decode.py","file_url":"https://github.com/kuleshov-group/bd3lms/blob/HEAD/ssd-lm/ssd_model_decode.py","link_basis":"harvester_set","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"signature":"logits:Tensor/3/float, top_p:float/0/float, one_hot_value:float/0/float","fixture_out_type":"Tensor","level_recorded_at":"2026-09-24T23:25:36.931776+00:00","retrieve_with":{"tool":"get_code","code_sha256":"5f25d11e3f7d8a07"},"code_page":null,"census":null,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"5f25d11e3f7d8a07"}},{"code_sha256":"9f7fbdbe7ca280e0","code_sha256_prefix":"9f7fbdbe7ca280e0","entry":"ptb_detokenizer","repo":"kuleshov-group/bd3lms","repo_kind":"official","path":"dataloader.py","file_url":"https://github.com/kuleshov-group/bd3lms/blob/HEAD/dataloader.py","link_basis":"harvester_set","language":"python","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"signature":"x:str/0/str","fixture_out_type":"str","level_recorded_at":"2026-09-24T15:16:18.137819+00:00","retrieve_with":{"tool":"get_code","code_sha256":"9f7fbdbe7ca280e0"},"code_page":"/code/ptb-detokenizer","census":null,"licence":"Apache-2.0","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (Apache-2.0), but get_code serves the stored copy, first harvested from jdeschena/blockgen, and GitHub detected no licence in that repository when it was checked","mcp_get_code":{"code_sha256":"9f7fbdbe7ca280e0"}},{"code_sha256":"f34618312c4fa9c9","code_sha256_prefix":"f34618312c4fa9c9","entry":"save_variable","repo":"MindSpore-scientific/code-12","repo_kind":"listed","path":"Alexnet-ABeffect/feature_predict_abm.py","file_url":"https://github.com/MindSpore-scientific/code-12/blob/HEAD/Alexnet-ABeffect/feature_predict_abm.py","link_basis":"harvester_set","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"signature":"v:dict/0/?, filename:str/0/str","fixture_out_type":"str","level_recorded_at":"2026-09-24T23:57:41.519889+00:00","code_page":null,"census":null,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"f34618312c4fa9c9"}},{"code_sha256":"14c181fabe865cbf","code_sha256_prefix":"14c181fabe865cbf","entry":"set_random_seed","repo":"MindSpore-scientific/code-12","repo_kind":"listed","path":"AECRNet/data.py","file_url":"https://github.com/MindSpore-scientific/code-12/blob/HEAD/AECRNet/data.py","link_basis":"harvester_set","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"signature":"img_name:str/0/str, seed:int/0/int","fixture_out_type":"str","level_recorded_at":"2026-09-24T23:25:36.931776+00:00","retrieve_with":{"tool":"get_code","code_sha256":"14c181fabe865cbf"},"code_page":"/code/set-random-seed","census":null,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"14c181fabe865cbf"}},{"code_sha256":"46c10627206a7795","code_sha256_prefix":"46c10627206a7795","entry":"wt_detokenizer","repo":"kuleshov-group/bd3lms","repo_kind":"official","path":"dataloader.py","file_url":"https://github.com/kuleshov-group/bd3lms/blob/HEAD/dataloader.py","link_basis":"harvester_set","language":"python","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"signature":"string:str/0/str","fixture_out_type":"str","level_recorded_at":"2026-09-24T15:16:18.137819+00:00","retrieve_with":{"tool":"get_code","code_sha256":"46c10627206a7795"},"code_page":"/code/wt-detokenizer","census":null,"licence":"Apache-2.0","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (Apache-2.0), but get_code serves the stored copy, first harvested from jdeschena/blockgen, and GitHub detected no licence in that repository when it was checked","mcp_get_code":{"code_sha256":"46c10627206a7795"}},{"code_sha256":"b4f2749f771988c2","code_sha256_prefix":"b4f2749f771988c2","entry":"fused_flex_attention","repo":"kuleshov-group/bd3lms","repo_kind":"official","path":"models/dit.py","file_url":"https://github.com/kuleshov-group/bd3lms/blob/HEAD/models/dit.py","link_basis":"harvester_set","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"code_page":null,"census":null,"licence":"Apache-2.0","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (Apache-2.0), but get_code serves the stored copy, first harvested from hxixixh/gumbel-distill, and GitHub detected no licence in that repository when it was checked","mcp_get_code":{"code_sha256":"b4f2749f771988c2"}}]},"code_links_note":null,"arxiv_metadata":null,"syntology_extracted_results":null,"record_sha256":"7d83b5d70be907623fad576bfc653a94fcdd02d013b958c8c8d8dae8f6863a74","record_changed_at":"2026-10-04","record_changed_at_basis":"changed"}