{"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/init-dist","entry":"init_dist","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":2,"n_papers_ran_no_instrument_failure":2,"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":2,"n_samples_constructed":0,"n_samples_ran_checked":2,"n_samples_instrument":0,"n_samples_unverified":4,"n_samples_fingerprinted":0,"n_places":7,"n_places_pointer_only":3,"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":2,"unverified":4},"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":"2412.02168","arxiv_id_is_arxiv":true,"paper":"/paper/generative-photography-scene-consistent","title":"Generative Photography: Scene-Consistent Camera Control for Realistic Text-to-Image Synthesis","date":"2024-12-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"pandayuanyu/generative-photography","path":"train_bokehK.py","file_url":"https://github.com/pandayuanyu/generative-photography/blob/HEAD/train_bokehK.py","status":"unverified","verification_level":0,"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, pandayuanyu/generative-photography when it was checked","code_sha256":"e9bbe32f663cd8e4","code_sha256_prefix":"e9bbe32f663cd8e4","mcp_get_code":{"code_sha256":"e9bbe32f663cd8e4"}},{"arxiv_id":"2410.01595","arxiv_id_is_arxiv":true,"paper":"/paper/knobgen-controlling-the-sophistication-of","title":"KnobGen: Controlling the Sophistication of Artwork in Sketch-Based Diffusion Models","date":"2024-10-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"aminK8/KnobGen","path":"inference_adapter.py","file_url":"https://github.com/aminK8/KnobGen/blob/HEAD/inference_adapter.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"d7f6c8223c0d6001","code_sha256_prefix":"d7f6c8223c0d6001","mcp_get_code":{"code_sha256":"d7f6c8223c0d6001"}},{"arxiv_id":"2408.11049","arxiv_id_is_arxiv":true,"paper":"/paper/magicdec-breaking-the-latency-throughput","title":"MagicDec: Breaking the Latency-Throughput Tradeoff for Long Context Generation with Speculative Decoding","date":"2024-08-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"infini-ai-lab/magicdec","path":"Engine/tp.py","file_url":"https://github.com/infini-ai-lab/magicdec/blob/HEAD/Engine/tp.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":"e4f851f13f6f224e","code_sha256_prefix":"e4f851f13f6f224e","mcp_get_code":{"code_sha256":"e4f851f13f6f224e"}},{"arxiv_id":"2406.06526","arxiv_id_is_arxiv":true,"paper":"/paper/gaussiancity-generative-gaussian-splatting","title":"GaussianCity: Generative Gaussian Splatting for Unbounded 3D City Generation","date":"2024-06-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hzxie/GaussianCity","path":"utils/distributed.py","file_url":"https://github.com/hzxie/GaussianCity/blob/HEAD/utils/distributed.py","status":"unverified","verification_level":0,"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, hzxie/GaussianCity (NOASSERTION)","code_sha256":"b5d91bbfdb1eb2da","code_sha256_prefix":"b5d91bbfdb1eb2da","mcp_get_code":{"code_sha256":"b5d91bbfdb1eb2da"}},{"arxiv_id":"2309.00610","arxiv_id_is_arxiv":true,"paper":"/paper/citydreamer-compositional-generative-model-of","title":"CityDreamer: Compositional Generative Model of Unbounded 3D Cities","date":"2023-09-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hzxie/CityDreamer","path":"utils/distributed.py","file_url":"https://github.com/hzxie/CityDreamer/blob/HEAD/utils/distributed.py","status":"unverified","verification_level":0,"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, hzxie/CityDreamer when it was checked","code_sha256":"b5d91bbfdb1eb2da","code_sha256_prefix":"b5d91bbfdb1eb2da","mcp_get_code":{"code_sha256":"b5d91bbfdb1eb2da"}},{"arxiv_id":"2109.03508","arxiv_id_is_arxiv":true,"paper":"/paper/repnas-searching-for-efficient-re","title":"RepNAS: Searching for Efficient Re-parameterizing Blocks","date":"2021-09-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"bestfleer/RepNAS","path":"distributed.py","file_url":"https://github.com/bestfleer/RepNAS/blob/HEAD/distributed.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":"c94c1dbbf94b5928","code_sha256_prefix":"c94c1dbbf94b5928","mcp_get_code":{"code_sha256":"c94c1dbbf94b5928"}},{"arxiv_id":"2002.09128","arxiv_id_is_arxiv":true,"paper":"/paper/dsnas-direct-neural-architecture-search","title":"DSNAS: Direct Neural Architecture Search without Parameter Retraining","date":"2020-02-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"SNAS-Series/SNAS-Series","path":"SNAS/dist_util_torch.py","file_url":"https://github.com/SNAS-Series/SNAS-Series/blob/HEAD/SNAS/dist_util_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":"a1017b49bacb3e1a","code_sha256_prefix":"a1017b49bacb3e1a","mcp_get_code":{"code_sha256":"a1017b49bacb3e1a"}}],"record_sha256":"7cd39218e7ef0ca33bf015a58d35925f6b305c137ee19b9e2091580a3c71c886","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}