{"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/unnorm","entry":"unnorm","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":6,"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":7,"n_samples_ran":7,"n_samples_constructed":0,"n_samples_ran_checked":7,"n_samples_instrument":0,"n_samples_unverified":0,"n_samples_fingerprinted":3,"n_places":7,"n_places_pointer_only":1,"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":0,"ran_fixture":0,"ran":6,"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":"2410.15320","arxiv_id_is_arxiv":true,"paper":"/paper/amortized-probabilistic-conditioning-for","title":"Amortized Probabilistic Conditioning for Optimization, Simulation and Inference","date":"2024-10-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"acerbilab/amortized-conditioning-engine","path":"bo_demo_utils.py","file_url":"https://github.com/acerbilab/amortized-conditioning-engine/blob/HEAD/bo_demo_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":"651b0a92c7d8e3a3","code_sha256_prefix":"651b0a92c7d8e3a3","mcp_get_code":{"code_sha256":"651b0a92c7d8e3a3"}},{"arxiv_id":"2409.04847","arxiv_id_is_arxiv":true,"paper":"/paper/rethinking-the-training-and-evaluation-of","title":"Rethinking The Training And Evaluation of Rich-Context Layout-to-Image Generation","date":"2024-09-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"cplusx/rich_context_l2i","path":"callbacks/common.py","file_url":"https://github.com/cplusx/rich_context_l2i/blob/HEAD/callbacks/common.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, cplusx/rich_context_l2i when it was checked","code_sha256":"5639833613f1f408","code_sha256_prefix":"5639833613f1f408","mcp_get_code":{"code_sha256":"5639833613f1f408"}},{"arxiv_id":"2308.11804","arxiv_id_is_arxiv":true,"paper":"/paper/ceci-n-est-pas-une-pomme-adversarial","title":"Adversarial Illusions in Multi-Modal Embeddings","date":"2023-08-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ebagdasa/adversarial_illusions","path":"anomaly_detection.py","file_url":"https://github.com/ebagdasa/adversarial_illusions/blob/HEAD/anomaly_detection.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":"c368473e2e381cfc","code_sha256_prefix":"c368473e2e381cfc","mcp_get_code":{"code_sha256":"c368473e2e381cfc"}},{"arxiv_id":"2308.11804","arxiv_id_is_arxiv":true,"paper":"/paper/ceci-n-est-pas-une-pomme-adversarial","title":"Adversarial Illusions in Multi-Modal Embeddings","date":"2023-08-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ebagdasa/adversarial_illusions","path":"utils.py","file_url":"https://github.com/ebagdasa/adversarial_illusions/blob/HEAD/utils.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":"312f083d8548f733","code_sha256_prefix":"312f083d8548f733","mcp_get_code":{"code_sha256":"312f083d8548f733"}},{"arxiv_id":"2107.07871","arxiv_id_is_arxiv":true,"paper":"/paper/finite-basis-physics-informed-neural-networks","title":"Finite Basis Physics-Informed Neural Networks (FBPINNs): a scalable domain decomposition approach for solving differential equations","date":"2021-07-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"benmoseley/FBPINNs","path":"fbpinns/networks.py","file_url":"https://github.com/benmoseley/FBPINNs/blob/HEAD/fbpinns/networks.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":"bc1b592eccd4fdba","code_sha256_prefix":"bc1b592eccd4fdba","mcp_get_code":{"code_sha256":"bc1b592eccd4fdba"}},{"arxiv_id":"2003.02501","arxiv_id_is_arxiv":true,"paper":"/paper/detecting-attended-visual-targets-in-video","title":"Detecting Attended Visual Targets in Video","date":"2020-03-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ejcgt/attention-target-detection","path":"utils/imutils.py","file_url":"https://github.com/ejcgt/attention-target-detection/blob/HEAD/utils/imutils.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":"b65c0249984c6b66","code_sha256_prefix":"b65c0249984c6b66","mcp_get_code":{"code_sha256":"b65c0249984c6b66"}},{"arxiv_id":"1812.08985","arxiv_id_is_arxiv":true,"paper":"/paper/non-adversarial-image-synthesis-with","title":"Non-Adversarial Image Synthesis with Generative Latent Nearest Neighbors","date":"2018-12-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yedidh/glann","path":"utils.py","file_url":"https://github.com/yedidh/glann/blob/HEAD/utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"BSD-3-Clause","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"e61224a5533342ef","code_sha256_prefix":"e61224a5533342ef","mcp_get_code":{"code_sha256":"e61224a5533342ef"}}],"record_sha256":"6553564e1dedb5dec614040f75fb87e74d403d098f8a3ea19ba34cef4cbc5191","record_changed_at":"2026-10-04","record_changed_at_basis":"changed"}