{"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/gen-random","entry":"gen_random","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":6,"n_papers_ran_no_instrument_failure":0,"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":3,"n_samples_ran":3,"n_samples_constructed":0,"n_samples_ran_checked":0,"n_samples_instrument":3,"n_samples_unverified":0,"n_samples_fingerprinted":2,"n_places":6,"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":2,"ran_fixture":1,"ran":0,"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":"2602.10392","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2602-10392","title":"Tensor Methods: A Unified and Interpretable Approach for Material Design","date":null,"month_inferred_from_arxiv_id":"2026-02","title_source":"syntology","repo":"shaanpakala/Tensor-Methods-for-Material-Design","path":"tensor_completion_models/CPD_smooth.py","file_url":"https://github.com/shaanpakala/Tensor-Methods-for-Material-Design/blob/HEAD/tensor_completion_models/CPD_smooth.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","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, shaanpakala/Tensor-Methods-for-Material-Design when it was checked","code_sha256":"7c75a24316b77904","code_sha256_prefix":"7c75a24316b77904","mcp_get_code":{"code_sha256":"7c75a24316b77904"}},{"arxiv_id":"2510.07474","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2510-07474","title":"Surrogate Modeling for the Design of Optimal Lattice Structures using Tensor Completion","date":null,"month_inferred_from_arxiv_id":"2025-10","title_source":"syntology","repo":"shaanpakala/Surrogate-Modeling-for-the-Design-of-Optimal-Lattice-Structures-using-Tensor-Completion","path":"tensor_completion_models/CPD_smooth.py","file_url":"https://github.com/shaanpakala/Surrogate-Modeling-for-the-Design-of-Optimal-Lattice-Structures-using-Tensor-Completion/blob/HEAD/tensor_completion_models/CPD_smooth.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","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, shaanpakala/Surrogate-Modeling-for-the-Design-of-Optimal-Lattice-Structures-using-Tensor-Completion when it was checked","code_sha256":"7c75a24316b77904","code_sha256_prefix":"7c75a24316b77904","mcp_get_code":{"code_sha256":"7c75a24316b77904"}},{"arxiv_id":"2410.06408","arxiv_id_is_arxiv":true,"paper":"/paper/automating-data-science-pipelines-with-tensor","title":"Automating Data Science Pipelines with Tensor Completion","date":"2024-10-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"shaanpakala/stc_automl","path":"src/tensor_completion_models/CPD_smooth.py","file_url":"https://github.com/shaanpakala/stc_automl/blob/HEAD/src/tensor_completion_models/CPD_smooth.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","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, shaanpakala/stc_automl when it was checked","code_sha256":"7c75a24316b77904","code_sha256_prefix":"7c75a24316b77904","mcp_get_code":{"code_sha256":"7c75a24316b77904"}},{"arxiv_id":"2409.15452","arxiv_id_is_arxiv":true,"paper":"/paper/cute-measuring-llms-understanding-of-their","title":"CUTE: Measuring LLMs' Understanding of Their Tokens","date":"2024-09-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"leukas/cute","path":"data_gen/gen_char_tasks.py","file_url":"https://github.com/leukas/cute/blob/HEAD/data_gen/gen_char_tasks.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"1ef70d8be309684d","code_sha256_prefix":"1ef70d8be309684d","mcp_get_code":{"code_sha256":"1ef70d8be309684d"}},{"arxiv_id":"1909.03935","arxiv_id_is_arxiv":true,"paper":"/paper/gan-leaks-a-taxonomy-of-membership-inference","title":"GAN-Leaks: A Taxonomy of Membership Inference Attacks against Generative Models","date":"2019-09-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"DingfanChen/GAN-Leaks","path":"gan_models/dcgan/model.py","file_url":"https://github.com/DingfanChen/GAN-Leaks/blob/HEAD/gan_models/dcgan/model.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"040714a23128cf94","code_sha256_prefix":"040714a23128cf94","mcp_get_code":{"code_sha256":"040714a23128cf94"}},{"arxiv_id":"1511.06434","arxiv_id_is_arxiv":true,"paper":"/paper/unsupervised-representation-learning-with-1","title":"Unsupervised Representation Learning with Deep Convolutional Generative Adversarial Networks","date":"2015-11-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"carpedm20/DCGAN-tensorflow","path":"model.py","file_url":"https://github.com/carpedm20/DCGAN-tensorflow/blob/HEAD/model.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"040714a23128cf94","code_sha256_prefix":"040714a23128cf94","mcp_get_code":{"code_sha256":"040714a23128cf94"}}],"record_sha256":"9da626d06ea47bca3ad1586d5b6ceb1863405fcd8d454da8520c1de25de55c7b","record_changed_at":"2026-10-04","record_changed_at_basis":"changed"}