{"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/index","entry":"index","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":10,"n_papers_ran":9,"n_papers_ran_no_instrument_failure":6,"n_papers_ran_instrument_only":3,"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":11,"n_samples_ran":9,"n_samples_constructed":0,"n_samples_ran_checked":6,"n_samples_instrument":3,"n_samples_unverified":2,"n_samples_fingerprinted":4,"n_places":11,"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":2,"ran_violates":0,"ran_draft_wrong":1,"ran_fixture":2,"ran":4,"unverified":2},"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":"2607.19376","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2607-19376","title":"Refnd: Preventing Data Leakage in Relational Datasets","date":null,"month_inferred_from_arxiv_id":"2026-07","title_source":"syntology","repo":"JacobCote/refnd_experimental_code","path":"code.py","file_url":"https://github.com/JacobCote/refnd_experimental_code/blob/HEAD/code.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","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, JacobCote/refnd_experimental_code when it was checked","code_sha256":"d6d7394ba4353320","code_sha256_prefix":"d6d7394ba4353320","mcp_get_code":{"code_sha256":"d6d7394ba4353320"}},{"arxiv_id":"2506.17230","arxiv_id_is_arxiv":true,"paper":null,"title":"arXiv:2506.17230","date":null,"month_inferred_from_arxiv_id":"2025-06","title_source":null,"repo":"YichenLuo-0/MMET","path":"model/mmet.py","file_url":"https://github.com/YichenLuo-0/MMET/blob/HEAD/model/mmet.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"d1131f0b49544860","code_sha256_prefix":"d1131f0b49544860","mcp_get_code":{"code_sha256":"d1131f0b49544860"}},{"arxiv_id":"2402.19197","arxiv_id_is_arxiv":true,"paper":"/paper/fine-structure-aware-sampling-a-new-sampling","title":"Fine Structure-Aware Sampling: A New Sampling Training Scheme for Pixel-Aligned Implicit Models in Single-View Human Reconstruction","date":"2024-02-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"kcyt/FSS","path":"lib/model/HGPIFuNetwNML.py","file_url":"https://github.com/kcyt/FSS/blob/HEAD/lib/model/HGPIFuNetwNML.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","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, kcyt/FSS when it was checked","code_sha256":"f88b72488e5ccf4d","code_sha256_prefix":"f88b72488e5ccf4d","mcp_get_code":{"code_sha256":"f88b72488e5ccf4d"}},{"arxiv_id":"2310.19932","arxiv_id_is_arxiv":true,"paper":"/paper/sim2real-for-environmental-neural-processes","title":"Sim2Real for Environmental Neural Processes","date":"2023-10-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jonas-scholz123/sim2real-downscaling","path":"sim2real/era5_investigation.py","file_url":"https://github.com/jonas-scholz123/sim2real-downscaling/blob/HEAD/sim2real/era5_investigation.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":"fd00054ddef9e7b5","code_sha256_prefix":"fd00054ddef9e7b5","mcp_get_code":{"code_sha256":"fd00054ddef9e7b5"}},{"arxiv_id":"2204.02445","arxiv_id_is_arxiv":true,"paper":"/paper/chore-contact-human-and-object-reconstruction","title":"CHORE: Contact, Human and Object REconstruction from a single RGB image","date":"2022-04-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"xiexh20/CHORE","path":"model/chore.py","file_url":"https://github.com/xiexh20/CHORE/blob/HEAD/model/chore.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, xiexh20/CHORE when it was checked","code_sha256":"e871a11e2e29828c","code_sha256_prefix":"e871a11e2e29828c","mcp_get_code":{"code_sha256":"e871a11e2e29828c"}},{"arxiv_id":"2108.08478","arxiv_id_is_arxiv":true,"paper":"/paper/learning-anchored-unsigned-distance-functions","title":"Learning Anchored Unsigned Distance Functions with Gradient Direction Alignment for Single-view Garment Reconstruction","date":"2021-08-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zhaofang0627/anchorudf","path":"lib/geometry.py","file_url":"https://github.com/zhaofang0627/anchorudf/blob/HEAD/lib/geometry.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":"9e75a53ec16ff31a","code_sha256_prefix":"9e75a53ec16ff31a","mcp_get_code":{"code_sha256":"9e75a53ec16ff31a"}},{"arxiv_id":"2104.14757","arxiv_id_is_arxiv":true,"paper":"/paper/an-adversarial-transfer-network-for-knowledge","title":"An Adversarial Transfer Network for Knowledge Representation Learning","date":"2021-04-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"LemonNoel/ATransN","path":"src/link_predictor.py","file_url":"https://github.com/LemonNoel/ATransN/blob/HEAD/src/link_predictor.py","status":"ran","verification_level":1,"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":"1be2ea3a070800ae","code_sha256_prefix":"1be2ea3a070800ae","mcp_get_code":{"code_sha256":"1be2ea3a070800ae"}},{"arxiv_id":"1710.05941","arxiv_id_is_arxiv":true,"paper":"/paper/searching-for-activation-functions","title":"Searching for Activation Functions","date":"2017-10-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"WessZumino/expectation_propagation","path":"TF/analysis_utils.py","file_url":"https://github.com/WessZumino/expectation_propagation/blob/HEAD/TF/analysis_utils.py","status":"ran","verification_level":1,"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":"2bb7b02beb4bcb12","code_sha256_prefix":"2bb7b02beb4bcb12","mcp_get_code":{"code_sha256":"2bb7b02beb4bcb12"}},{"arxiv_id":"1706.06511","arxiv_id_is_arxiv":true,"paper":"/paper/optimal-modularity-and-memory-capacity-of","title":"Optimal modularity and memory capacity of neural reservoirs","date":"2017-06-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Nathaniel-Rodriguez/reservoirlib","path":"reservoirlib/experiment.py","file_url":"https://github.com/Nathaniel-Rodriguez/reservoirlib/blob/HEAD/reservoirlib/experiment.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"b4cc6d1542d0ec35","code_sha256_prefix":"b4cc6d1542d0ec35","mcp_get_code":{"code_sha256":"b4cc6d1542d0ec35"}},{"arxiv_id":"1604.08140","arxiv_id_is_arxiv":true,"paper":"/paper/how-should-spin-weighted-spherical-functions","title":"How should spin-weighted spherical functions be defined?","date":null,"month_inferred_from_arxiv_id":"2016-04","title_source":"archive","repo":"moble/spherical","path":"spherical/modes/utilities.py","file_url":"https://github.com/moble/spherical/blob/HEAD/spherical/modes/utilities.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":"21b00aed4b55bdb2","code_sha256_prefix":"21b00aed4b55bdb2","mcp_get_code":{"code_sha256":"21b00aed4b55bdb2"}},{"arxiv_id":"1604.08140","arxiv_id_is_arxiv":true,"paper":"/paper/how-should-spin-weighted-spherical-functions","title":"How should spin-weighted spherical functions be defined?","date":null,"month_inferred_from_arxiv_id":"2016-04","title_source":"archive","repo":"moble/spherical_functions","path":"spherical_functions/SWSH_modes/utilities.py","file_url":"https://github.com/moble/spherical_functions/blob/HEAD/spherical_functions/SWSH_modes/utilities.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":"69ad5617df33bfef","code_sha256_prefix":"69ad5617df33bfef","mcp_get_code":{"code_sha256":"69ad5617df33bfef"}}],"record_sha256":"6a383afcea2a08156495931e69a38519b3c8f3badf236f8ffe610b65d957c186","record_changed_at":"2026-10-04","record_changed_at_basis":"changed"}