{"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-weights","entry":"create_weights","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":5,"n_papers_ran_no_instrument_failure":4,"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":6,"n_samples_ran":5,"n_samples_constructed":0,"n_samples_ran_checked":4,"n_samples_instrument":1,"n_samples_unverified":1,"n_samples_fingerprinted":0,"n_places":8,"n_places_pointer_only":2,"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":4,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":1,"ran":0,"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":"2602.22249","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2602-22249","title":"Improving Spatial Allocation for Energy System Coupling with Graph Neural Networks","date":null,"month_inferred_from_arxiv_id":"2026-02","title_source":"syntology","repo":"KIT-IAI/AllocateGNN","path":"ClusterBasedVoronoi/utils/create_weights.py","file_url":"https://github.com/KIT-IAI/AllocateGNN/blob/HEAD/ClusterBasedVoronoi/utils/create_weights.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","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, KIT-IAI/AllocateGNN (NOASSERTION)","code_sha256":"44198b466a33db48","code_sha256_prefix":"44198b466a33db48","mcp_get_code":{"code_sha256":"44198b466a33db48"}},{"arxiv_id":"2206.09194","arxiv_id_is_arxiv":true,"paper":"/paper/efficient-aggregated-kernel-tests-using","title":"Efficient Aggregated Kernel Tests using Incomplete $U$-statistics","date":"2022-06-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"antoninschrab/ksdagg","path":"ksdagg/jax.py","file_url":"https://github.com/antoninschrab/ksdagg/blob/HEAD/ksdagg/jax.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"35e8a1dce671edd0","code_sha256_prefix":"35e8a1dce671edd0","mcp_get_code":{"code_sha256":"35e8a1dce671edd0"}},{"arxiv_id":"2206.09194","arxiv_id_is_arxiv":true,"paper":"/paper/efficient-aggregated-kernel-tests-using","title":"Efficient Aggregated Kernel Tests using Incomplete $U$-statistics","date":"2022-06-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"antoninschrab/mmdagg","path":"mmdagg/jax.py","file_url":"https://github.com/antoninschrab/mmdagg/blob/HEAD/mmdagg/jax.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"ade4e10146ee1a5c","code_sha256_prefix":"ade4e10146ee1a5c","mcp_get_code":{"code_sha256":"ade4e10146ee1a5c"}},{"arxiv_id":"2206.08843","arxiv_id_is_arxiv":true,"paper":"/paper/automl-two-sample-test","title":"AutoML Two-Sample Test","date":"2022-06-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"antoninschrab/fl-mmdagg","path":"mmdagg.py","file_url":"https://github.com/antoninschrab/fl-mmdagg/blob/HEAD/mmdagg.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"8aafc51eaf6abeef","code_sha256_prefix":"8aafc51eaf6abeef","mcp_get_code":{"code_sha256":"8aafc51eaf6abeef"}},{"arxiv_id":"2202.00824","arxiv_id_is_arxiv":true,"paper":"/paper/ksd-aggregated-goodness-of-fit-test","title":"KSD Aggregated Goodness-of-fit Test","date":"2022-02-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":null,"inline_ok":false,"inline_ok_link":false,"withheld_clause":"this paper's copy of the code was not recorded (its link names no repository or source path), so no licence was read for it","code_sha256":"35e8a1dce671edd0","code_sha256_prefix":"35e8a1dce671edd0","mcp_get_code":{"code_sha256":"35e8a1dce671edd0"}},{"arxiv_id":"2202.00824","arxiv_id_is_arxiv":true,"paper":"/paper/ksd-aggregated-goodness-of-fit-test","title":"KSD Aggregated Goodness-of-fit Test","date":"2022-02-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"antoninschrab/ksdagg","path":"ksdagg/np.py","file_url":"https://github.com/antoninschrab/ksdagg/blob/HEAD/ksdagg/np.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"297f50cd6da36f51","code_sha256_prefix":"297f50cd6da36f51","mcp_get_code":{"code_sha256":"297f50cd6da36f51"}},{"arxiv_id":"2110.15073","arxiv_id_is_arxiv":true,"paper":"/paper/mmd-aggregated-two-sample-test","title":"MMD Aggregated Two-Sample Test","date":"2021-10-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"antoninschrab/mmdagg-paper","path":"mmdagg/jax.py","file_url":"https://github.com/antoninschrab/mmdagg-paper/blob/HEAD/mmdagg/jax.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"ade4e10146ee1a5c","code_sha256_prefix":"ade4e10146ee1a5c","mcp_get_code":{"code_sha256":"ade4e10146ee1a5c"}},{"arxiv_id":"1810.12042","arxiv_id_is_arxiv":true,"paper":"/paper/logit-pairing-methods-can-fool-gradient-based","title":"Logit Pairing Methods Can Fool Gradient-Based Attacks","date":"2018-10-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"uds-lsv/evaluating-logit-pairing-methods","path":"mnist_cifar10/models.py","file_url":"https://github.com/uds-lsv/evaluating-logit-pairing-methods/blob/HEAD/mnist_cifar10/models.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":"691983021599f82f","code_sha256_prefix":"691983021599f82f","mcp_get_code":{"code_sha256":"691983021599f82f"}}],"record_sha256":"0b0f02d52ee9232c003890355d4338ca167f1ddeefc7c775890bd51f49bd4260","record_changed_at":"2026-10-04","record_changed_at_basis":"changed"}