{"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/gamma","entry":"gamma","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":8,"n_papers_ran":7,"n_papers_ran_no_instrument_failure":6,"n_papers_ran_instrument_only":1,"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":7,"n_samples_ran":6,"n_samples_constructed":0,"n_samples_ran_checked":5,"n_samples_instrument":1,"n_samples_unverified":1,"n_samples_fingerprinted":3,"n_places":8,"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":1,"ran_violates":0,"ran_draft_wrong":1,"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":"2409.02980","arxiv_id_is_arxiv":true,"paper":"/paper/how-dreams-are-made-emulating-satellite","title":"How DREAMS are made: Emulating Satellite Galaxy and Subhalo Populations with Diffusion Models and Point Clouds","date":"2024-09-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"trivnguyen/nehod_torch","path":"nehod/diffusion_utils.py","file_url":"https://github.com/trivnguyen/nehod_torch/blob/HEAD/nehod/diffusion_utils.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":"d929340d298c94c8","code_sha256_prefix":"d929340d298c94c8","mcp_get_code":{"code_sha256":"d929340d298c94c8"}},{"arxiv_id":"2406.02645","arxiv_id_is_arxiv":true,"paper":"/paper/astral-training-physics-informed-neural","title":"Astral: training physics-informed neural networks with error majorants","date":"2024-06-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"4gnskq5g2s-collab/Astral","path":"datasets/elastoplasticity.py","file_url":"https://github.com/4gnskq5g2s-collab/Astral/blob/HEAD/datasets/elastoplasticity.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Unlicense","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"bc6fc65a144102d4","code_sha256_prefix":"bc6fc65a144102d4","mcp_get_code":{"code_sha256":"bc6fc65a144102d4"}},{"arxiv_id":"2405.14847","arxiv_id_is_arxiv":true,"paper":"/paper/neural-directional-encoding-for-efficient-and","title":"Neural Directional Encoding for Efficient and Accurate View-Dependent Appearance Modeling","date":"2024-05-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lwwu2/nde","path":"utils/ops.py","file_url":"https://github.com/lwwu2/nde/blob/HEAD/utils/ops.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, lwwu2/nde when it was checked","code_sha256":"7f8a4d9dd2129e63","code_sha256_prefix":"7f8a4d9dd2129e63","mcp_get_code":{"code_sha256":"7f8a4d9dd2129e63"}},{"arxiv_id":"2311.17141","arxiv_id_is_arxiv":true,"paper":"/paper/a-point-cloud-approach-to-generative-modeling","title":"A point cloud approach to generative modeling for galaxy surveys at the field level","date":"2023-11-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"smsharma/point-cloud-galaxy-diffusion","path":"models/diffusion_utils.py","file_url":"https://github.com/smsharma/point-cloud-galaxy-diffusion/blob/HEAD/models/diffusion_utils.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":"d929340d298c94c8","code_sha256_prefix":"d929340d298c94c8","mcp_get_code":{"code_sha256":"d929340d298c94c8"}},{"arxiv_id":"2104.03954","arxiv_id_is_arxiv":true,"paper":"/paper/de-rendering-the-world-s-revolutionary","title":"De-rendering the World's Revolutionary Artefacts","date":"2021-04-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"elliottwu/sorderender","path":"eval/eval_syn_vase.py","file_url":"https://github.com/elliottwu/sorderender/blob/HEAD/eval/eval_syn_vase.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":"22c0675924a1c807","code_sha256_prefix":"22c0675924a1c807","mcp_get_code":{"code_sha256":"22c0675924a1c807"}},{"arxiv_id":"2010.11300","arxiv_id_is_arxiv":true,"paper":"/paper/how-do-fair-decisions-fare-in-long-term","title":"How Do Fair Decisions Fare in Long-term Qualification?","date":"2020-10-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"TURuibo/long-term-impact-of-fairness-constraints","path":"fico_util.py","file_url":"https://github.com/TURuibo/long-term-impact-of-fairness-constraints/blob/HEAD/fico_util.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, TURuibo/long-term-impact-of-fairness-constraints when it was checked","code_sha256":"1ba0b0c2c268c254","code_sha256_prefix":"1ba0b0c2c268c254","mcp_get_code":{"code_sha256":"1ba0b0c2c268c254"}},{"arxiv_id":"1907.01879","arxiv_id_is_arxiv":true,"paper":"/paper/learning-to-predict-robot-keypoints-using","title":"Learning to Predict Robot Keypoints Using Artificially Generated Images","date":"2019-07-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"cheind/pytorch-blender","path":"pkg_pytorch/blendtorch/btt/colors.py","file_url":"https://github.com/cheind/pytorch-blender/blob/HEAD/pkg_pytorch/blendtorch/btt/colors.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":"5e61404f9bfe2ff5","code_sha256_prefix":"5e61404f9bfe2ff5","mcp_get_code":{"code_sha256":"5e61404f9bfe2ff5"}},{"arxiv_id":"1906.00425","arxiv_id_is_arxiv":true,"paper":"/paper/190600425","title":"The Convergence Rate of Neural Networks for Learned Functions of Different Frequencies","date":"2019-06-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ykasten/Convergence-Rate-NN-Different-Frequencies","path":"Asymptotics/mainAndPlot.py","file_url":"https://github.com/ykasten/Convergence-Rate-NN-Different-Frequencies/blob/HEAD/Asymptotics/mainAndPlot.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, ykasten/Convergence-Rate-NN-Different-Frequencies when it was checked","code_sha256":"bb2fb7a180303193","code_sha256_prefix":"bb2fb7a180303193","mcp_get_code":{"code_sha256":"bb2fb7a180303193"}}],"record_sha256":"b86f636b2d1719f99ed5af83ef4d7a8fcc157cdbde49abb96d330798afa98b4e","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}