{"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/triangle","entry":"triangle","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":8,"n_papers_ran_no_instrument_failure":8,"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":4,"n_samples_ran":4,"n_samples_constructed":0,"n_samples_ran_checked":4,"n_samples_instrument":0,"n_samples_unverified":0,"n_samples_fingerprinted":2,"n_places":8,"n_places_pointer_only":6,"n_places_pointer_only_link_open":3,"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":1,"ran_draft_wrong":0,"ran_fixture":0,"ran":3,"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":"2403.15139","arxiv_id_is_arxiv":true,"paper":"/paper/deep-generative-model-based-rate-distortion","title":"Deep Generative Model based Rate-Distortion for Image Downscaling Assessment","date":"2024-03-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"andreas128/SRFlow","path":"code/imresize.py","file_url":"https://github.com/andreas128/SRFlow/blob/HEAD/code/imresize.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NOASSERTION","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub could not classify the licence of this paper's repository, andreas128/SRFlow (NOASSERTION)","code_sha256":"2722f476a816c1b9","code_sha256_prefix":"2722f476a816c1b9","mcp_get_code":{"code_sha256":"2722f476a816c1b9"}},{"arxiv_id":"2310.03249","arxiv_id_is_arxiv":true,"paper":"/paper/can-large-language-models-be-good-path","title":"Can Large Language Models be Good Path Planners? A Benchmark and Investigation on Spatial-temporal Reasoning","date":"2023-10-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mohamedaghzal/llms-as-path-planners","path":"gpt-4-path-planning/src/geometries.py","file_url":"https://github.com/mohamedaghzal/llms-as-path-planners/blob/HEAD/gpt-4-path-planning/src/geometries.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, mohamedaghzal/llms-as-path-planners when it was checked","code_sha256":"02579eedf3922c00","code_sha256_prefix":"02579eedf3922c00","mcp_get_code":{"code_sha256":"02579eedf3922c00"}},{"arxiv_id":"2310.00105","arxiv_id_is_arxiv":true,"paper":"/paper/latent-space-symmetry-discovery","title":"Latent Space Symmetry Discovery","date":"2023-09-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jiankeyang/laligan","path":"src/data_utils/double_bump.py","file_url":"https://github.com/jiankeyang/laligan/blob/HEAD/src/data_utils/double_bump.py","status":"ran","verification_level":1,"contract_check":null,"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, jiankeyang/laligan when it was checked","code_sha256":"fc4b4d943fbca646","code_sha256_prefix":"fc4b4d943fbca646","mcp_get_code":{"code_sha256":"fc4b4d943fbca646"}},{"arxiv_id":"2210.12593","arxiv_id_is_arxiv":true,"paper":"/paper/single-image-super-resolution-via-a-dual","title":"Single Image Super-Resolution via a Dual Interactive Implicit Neural Network","date":"2022-10-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"robotic-vision-lab/dual-interactive-implicit-neural-network","path":"src/utils/matlab_imresize.py","file_url":"https://github.com/robotic-vision-lab/dual-interactive-implicit-neural-network/blob/HEAD/src/utils/matlab_imresize.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":null,"behaviour_fingerprint":true,"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 andreas128/SRFlow, and GitHub could not classify the licence of that repository (NOASSERTION)","code_sha256":"2722f476a816c1b9","code_sha256_prefix":"2722f476a816c1b9","mcp_get_code":{"code_sha256":"2722f476a816c1b9"}},{"arxiv_id":"2204.09679","arxiv_id_is_arxiv":true,"paper":"/paper/fs-ncsr-increasing-diversity-of-the-super","title":"FS-NCSR: Increasing Diversity of the Super-Resolution Space via Frequency Separation and Noise-Conditioned Normalizing Flow","date":"2022-04-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"dsshim0125/FS-NCSR","path":"imresize.py","file_url":"https://github.com/dsshim0125/FS-NCSR/blob/HEAD/imresize.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (MIT), but get_code serves the stored copy, first harvested from andreas128/SRFlow, and GitHub could not classify the licence of that repository (NOASSERTION)","code_sha256":"2722f476a816c1b9","code_sha256_prefix":"2722f476a816c1b9","mcp_get_code":{"code_sha256":"2722f476a816c1b9"}},{"arxiv_id":"2107.00848","arxiv_id_is_arxiv":true,"paper":"/paper/systematic-evaluation-of-causal-discovery-in-1","title":"Systematic Evaluation of Causal Discovery in Visual Model Based Reinforcement Learning","date":"2021-07-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"dido1998/CausalMBRL","path":"envs/block_pushing.py","file_url":"https://github.com/dido1998/CausalMBRL/blob/HEAD/envs/block_pushing.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":"d15591e079c2aced","code_sha256_prefix":"d15591e079c2aced","mcp_get_code":{"code_sha256":"d15591e079c2aced"}},{"arxiv_id":"1912.06960","arxiv_id_is_arxiv":true,"paper":"/paper/what-else-can-fool-deep-learning-addressing-1","title":"What Else Can Fool Deep Learning? Addressing Color Constancy Errors on Deep Neural Network Performance","date":"2019-12-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mahmoudnafifi/WB_color_augmenter","path":"WBAugmenter_Python/WBAugmenter/imresize.py","file_url":"https://github.com/mahmoudnafifi/WB_color_augmenter/blob/HEAD/WBAugmenter_Python/WBAugmenter/imresize.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (MIT), but get_code serves the stored copy, first harvested from andreas128/SRFlow, and GitHub could not classify the licence of that repository (NOASSERTION)","code_sha256":"2722f476a816c1b9","code_sha256_prefix":"2722f476a816c1b9","mcp_get_code":{"code_sha256":"2722f476a816c1b9"}},{"arxiv_id":"1911.12247","arxiv_id_is_arxiv":true,"paper":"/paper/contrastive-learning-of-structured-world-1","title":"Contrastive Learning of Structured World Models","date":"2019-11-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"tkipf/c-swm","path":"envs/block_pushing.py","file_url":"https://github.com/tkipf/c-swm/blob/HEAD/envs/block_pushing.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":"d15591e079c2aced","code_sha256_prefix":"d15591e079c2aced","mcp_get_code":{"code_sha256":"d15591e079c2aced"}}],"record_sha256":"524f7c39042dc4a84877c8fbe9fc4ff21bc96627642eb8d0326ba21f5f95416c","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}