{"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/create-grid","entry":"create_grid","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":10,"n_samples_constructed":0,"n_samples_ran_checked":7,"n_samples_instrument":3,"n_samples_unverified":1,"n_samples_fingerprinted":2,"n_places":11,"n_places_pointer_only":4,"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":3,"ran_fixture":0,"ran":7,"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":"2603.04430","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2603-04430","title":"Flowers: A Warp Drive for Neural PDE Solvers","date":null,"month_inferred_from_arxiv_id":"2026-03","title_source":"syntology","repo":"t-muser/flowers","path":"flowers/models/flower.py","file_url":"https://github.com/t-muser/flowers/blob/HEAD/flowers/models/flower.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","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, t-muser/flowers (NOASSERTION)","code_sha256":"01950aa91ef31f43","code_sha256_prefix":"01950aa91ef31f43","mcp_get_code":{"code_sha256":"01950aa91ef31f43"}},{"arxiv_id":"2404.18630","arxiv_id_is_arxiv":true,"paper":"/paper/4d-dress-a-4d-dataset-of-real-world-human","title":"4D-DRESS: A 4D Dataset of Real-world Human Clothing with Semantic Annotations","date":"2024-04-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"eth-ait/4d-dress","path":"4dhumanparsing/lib/utility/general.py","file_url":"https://github.com/eth-ait/4d-dress/blob/HEAD/4dhumanparsing/lib/utility/general.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, eth-ait/4d-dress when it was checked","code_sha256":"e4b3aa713aa86db2","code_sha256_prefix":"e4b3aa713aa86db2","mcp_get_code":{"code_sha256":"e4b3aa713aa86db2"}},{"arxiv_id":"2305.15925","arxiv_id_is_arxiv":true,"paper":"/paper/on-the-identifiability-of-markov-switching","title":"On the Identifiability of Switching Dynamical Systems","date":"2023-05-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"charlio23/identifiable-sds","path":"models/PolyMSM.py","file_url":"https://github.com/charlio23/identifiable-sds/blob/HEAD/models/PolyMSM.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":"1e6f87b28942ab33","code_sha256_prefix":"1e6f87b28942ab33","mcp_get_code":{"code_sha256":"1e6f87b28942ab33"}},{"arxiv_id":"2305.14035","arxiv_id_is_arxiv":true,"paper":"/paper/can-self-supervised-neural-networks-pre","title":"Can Self-Supervised Neural Representations Pre-Trained on Human Speech distinguish Animal Callers?","date":"2023-05-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"idiap/ssl-caller-detection","path":"src/classifier_caller_groups.py","file_url":"https://github.com/idiap/ssl-caller-detection/blob/HEAD/src/classifier_caller_groups.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"GPL-3.0","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GPL-3.0, as GitHub detects it on this paper's repository, idiap/ssl-caller-detection, is not in the permissive set Syntology serves inline","code_sha256":"0e4afdfcb4078382","code_sha256_prefix":"0e4afdfcb4078382","mcp_get_code":{"code_sha256":"0e4afdfcb4078382"}},{"arxiv_id":"2303.04508","arxiv_id_is_arxiv":true,"paper":"/paper/fastsurf-fast-neural-rgb-d-surface","title":"InFusionSurf: Refining Neural RGB-D Surface Reconstruction Using Per-Frame Intrinsic Refinement and TSDF Fusion Prior Learning","date":"2023-03-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ROKIT-Healthcare/FastSurf","path":"grid.py","file_url":"https://github.com/ROKIT-Healthcare/FastSurf/blob/HEAD/grid.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":"44e4ce5907854b38","code_sha256_prefix":"44e4ce5907854b38","mcp_get_code":{"code_sha256":"44e4ce5907854b38"}},{"arxiv_id":"2210.02419","arxiv_id_is_arxiv":true,"paper":"/paper/explanation-uncertainty-with-decision","title":"Boundary-Aware Uncertainty for Feature Attribution Explainers","date":"2022-10-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"davinhill/gpec","path":"GPEC/decision_boundary.py","file_url":"https://github.com/davinhill/gpec/blob/HEAD/GPEC/decision_boundary.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":"7d2c11ac4acb0c02","code_sha256_prefix":"7d2c11ac4acb0c02","mcp_get_code":{"code_sha256":"7d2c11ac4acb0c02"}},{"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/sdf.py","file_url":"https://github.com/zhaofang0627/anchorudf/blob/HEAD/lib/sdf.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":"190c784e12e69338","code_sha256_prefix":"190c784e12e69338","mcp_get_code":{"code_sha256":"190c784e12e69338"}},{"arxiv_id":"1909.11895","arxiv_id_is_arxiv":true,"paper":"/paper/joint-task-self-supervised-learning-for","title":"Joint-task Self-supervised Learning for Temporal Correspondence","date":"2019-09-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Liusifei/UVC","path":"libs/concentration_loss.py","file_url":"https://github.com/Liusifei/UVC/blob/HEAD/libs/concentration_loss.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":"58402808d405db23","code_sha256_prefix":"58402808d405db23","mcp_get_code":{"code_sha256":"58402808d405db23"}},{"arxiv_id":"1909.11895","arxiv_id_is_arxiv":true,"paper":"/paper/joint-task-self-supervised-learning-for","title":"Joint-task Self-supervised Learning for Temporal Correspondence","date":"2019-09-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Liusifei/UVC","path":"libs/track_utils.py","file_url":"https://github.com/Liusifei/UVC/blob/HEAD/libs/track_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":"2bfe1a16c66739f6","code_sha256_prefix":"2bfe1a16c66739f6","mcp_get_code":{"code_sha256":"2bfe1a16c66739f6"}},{"arxiv_id":"1905.03561","arxiv_id_is_arxiv":true,"paper":"/paper/190503561","title":"D2-Net: A Trainable CNN for Joint Detection and Description of Local Features","date":"2019-05-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"visinf/cad","path":"segmentation/network/learned_mask.py","file_url":"https://github.com/visinf/cad/blob/HEAD/segmentation/network/learned_mask.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":"271cada3b4e82e8d","code_sha256_prefix":"271cada3b4e82e8d","mcp_get_code":{"code_sha256":"271cada3b4e82e8d"}},{"arxiv_id":"1506.02557","arxiv_id_is_arxiv":true,"paper":"/paper/variational-dropout-and-the-local","title":"Variational Dropout and the Local Reparameterization Trick","date":"2015-06-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"gpapamak/bayesian_neural_networks_demo","path":"bnn_demo.py","file_url":"https://github.com/gpapamak/bayesian_neural_networks_demo/blob/HEAD/bnn_demo.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","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, gpapamak/bayesian_neural_networks_demo (NOASSERTION)","code_sha256":"248eed0714c8eb72","code_sha256_prefix":"248eed0714c8eb72","mcp_get_code":{"code_sha256":"248eed0714c8eb72"}}],"record_sha256":"58b245cc9de7765ef29bde60f1e7901dae65afa1f4a4db6213746fbc1bf7ffb9","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}