{"about":{"site":"https://codewithpapers.app","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.","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"},"url":"/code/create-weights","entry":"create_weights","source":"Syntology graph, per-sample; not an archive number","read_at":"2026-09-24T18:15:14+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.","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; our fixture could not drive it","ran":"ran on a synthesized input","unverified":"unverified (harvested, no recorded run)"},"n_papers":6,"n_papers_ran":4,"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":4,"n_samples_fingerprinted":0,"n_places":8,"n_places_pointer_only":2,"by_status":{"ran_honours":4,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":0,"ran":0,"unverified":2},"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","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":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NOASSERTION","inline_ok":false,"code_sha256_prefix":"44198b466a33db48","mcp_get_code":{"code_sha256":"44198b466a33db48"}},{"arxiv_id":"2206.09194","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,"code_sha256_prefix":"35e8a1dce671edd0","mcp_get_code":{"code_sha256":"35e8a1dce671edd0"}},{"arxiv_id":"2206.09194","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,"code_sha256_prefix":"ade4e10146ee1a5c","mcp_get_code":{"code_sha256":"ade4e10146ee1a5c"}},{"arxiv_id":"2206.08843","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,"code_sha256_prefix":"8aafc51eaf6abeef","mcp_get_code":{"code_sha256":"8aafc51eaf6abeef"}},{"arxiv_id":"2202.00824","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,"code_sha256_prefix":"35e8a1dce671edd0","mcp_get_code":{"code_sha256":"35e8a1dce671edd0"}},{"arxiv_id":"2202.00824","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,"code_sha256_prefix":"297f50cd6da36f51","mcp_get_code":{"code_sha256":"297f50cd6da36f51"}},{"arxiv_id":"2110.15073","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,"code_sha256_prefix":"ade4e10146ee1a5c","mcp_get_code":{"code_sha256":"ade4e10146ee1a5c"}},{"arxiv_id":"1810.12042","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,"code_sha256_prefix":"691983021599f82f","mcp_get_code":{"code_sha256":"691983021599f82f"}}]}