{"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/kl-divergence-2","entry":"KL_divergence","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":10,"n_papers_ran_no_instrument_failure":7,"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":9,"n_samples_ran":9,"n_samples_constructed":0,"n_samples_ran_checked":6,"n_samples_instrument":3,"n_samples_unverified":0,"n_samples_fingerprinted":6,"n_places":10,"n_places_pointer_only":5,"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":2,"ran_fixture":1,"ran":4,"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.01376","arxiv_id_is_arxiv":true,"paper":"/paper/learning-physics-from-video-unsupervised","title":"Learning Physics From Video: Unsupervised Physical Parameter Estimation for Continuous Dynamical Systems","date":"2024-10-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"alejandro-neuro/learning_physics_from_video","path":"src/loss_func.py","file_url":"https://github.com/alejandro-neuro/learning_physics_from_video/blob/HEAD/src/loss_func.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","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, alejandro-neuro/learning_physics_from_video when it was checked","code_sha256":"cc329f6ed02990a3","code_sha256_prefix":"cc329f6ed02990a3","mcp_get_code":{"code_sha256":"cc329f6ed02990a3"}},{"arxiv_id":"2402.07762","arxiv_id_is_arxiv":true,"paper":"/paper/scalable-structure-learning-for-sparse","title":"Scalable Structure Learning for Sparse Context-Specific Systems","date":"2024-02-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"felixleopoldo/cslearn","path":"src/cslearn/evaluate.py","file_url":"https://github.com/felixleopoldo/cslearn/blob/HEAD/src/cslearn/evaluate.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"56a7eeefc6a58db3","code_sha256_prefix":"56a7eeefc6a58db3","mcp_get_code":{"code_sha256":"56a7eeefc6a58db3"}},{"arxiv_id":"2308.09472","arxiv_id_is_arxiv":true,"paper":"/paper/vision-relation-transformer-for-unbiased","title":"Vision Relation Transformer for Unbiased Scene Graph Generation","date":"2023-08-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"visinf/veto","path":"SHA_GCL_extra/kl_divergence.py","file_url":"https://github.com/visinf/veto/blob/HEAD/SHA_GCL_extra/kl_divergence.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"a7dd305afad6384a","code_sha256_prefix":"a7dd305afad6384a","mcp_get_code":{"code_sha256":"a7dd305afad6384a"}},{"arxiv_id":"2302.10413","arxiv_id_is_arxiv":true,"paper":"/paper/cadis-handling-cluster-skewed-non-iid-data-in","title":"CADIS: Handling Cluster-skewed Non-IID Data in Federated Learning with Clustered Aggregation and Knowledge DIStilled Regularization","date":"2023-02-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"aiot-lab-bkai/oro-ccgrid2023-cadis","path":"algorithm/cadis.py","file_url":"https://github.com/aiot-lab-bkai/oro-ccgrid2023-cadis/blob/HEAD/algorithm/cadis.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":"edb3ad39d03ce939","code_sha256_prefix":"edb3ad39d03ce939","mcp_get_code":{"code_sha256":"edb3ad39d03ce939"}},{"arxiv_id":"2204.12676","arxiv_id_is_arxiv":true,"paper":"/paper/the-multimarginal-optimal-transport","title":"The Multimarginal Optimal Transport Formulation of Adversarial Multiclass Classification","date":"2022-04-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mattwerenski/adversarial-ot","path":"entropic.py","file_url":"https://github.com/mattwerenski/adversarial-ot/blob/HEAD/entropic.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, mattwerenski/adversarial-ot when it was checked","code_sha256":"c6f88cbb20105019","code_sha256_prefix":"c6f88cbb20105019","mcp_get_code":{"code_sha256":"c6f88cbb20105019"}},{"arxiv_id":"2203.09811","arxiv_id_is_arxiv":true,"paper":"/paper/stacked-hybrid-attention-and-group","title":"Stacked Hybrid-Attention and Group Collaborative Learning for Unbiased Scene Graph Generation","date":"2022-03-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"dongxingning/SHA-GCL-for-SGG","path":"SHA_GCL_extra/kl_divergence.py","file_url":"https://github.com/dongxingning/SHA-GCL-for-SGG/blob/HEAD/SHA_GCL_extra/kl_divergence.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":false,"inline_ok_link":false,"withheld_clause":"MIT, as GitHub detects it on this paper's repository, dongxingning/SHA-GCL-for-SGG, is in the permissive set, but a licence decision keeps the body a pointer: the reason for that decision is not recorded with it","code_sha256":"a7dd305afad6384a","code_sha256_prefix":"a7dd305afad6384a","mcp_get_code":{"code_sha256":"a7dd305afad6384a"}},{"arxiv_id":"2106.04145","arxiv_id_is_arxiv":true,"paper":"/paper/unbalanced-optimal-transport-through-non","title":"Unbalanced Optimal Transport through Non-negative Penalized Linear Regression","date":"2021-06-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lchapel/UOT-though-penalized-linear-regression","path":"solvers/solver_kl_UOT.py","file_url":"https://github.com/lchapel/UOT-though-penalized-linear-regression/blob/HEAD/solvers/solver_kl_UOT.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, lchapel/UOT-though-penalized-linear-regression when it was checked","code_sha256":"a2ce9978525740bf","code_sha256_prefix":"a2ce9978525740bf","mcp_get_code":{"code_sha256":"a2ce9978525740bf"}},{"arxiv_id":"2104.00864","arxiv_id_is_arxiv":true,"paper":"/paper/constrained-non-negative-matrix-factorization","title":"Constrained non-negative matrix factorization enabling real-time insights of $\\textit{in situ}$ and high-throughput experiments","date":"2021-04-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"NSLS-II/constrained-matrix-factorization","path":"constrainedmf/nmf/metrics.py","file_url":"https://github.com/NSLS-II/constrained-matrix-factorization/blob/HEAD/constrainedmf/nmf/metrics.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"BSD-3-Clause","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"103628a541cf7a84","code_sha256_prefix":"103628a541cf7a84","mcp_get_code":{"code_sha256":"103628a541cf7a84"}},{"arxiv_id":"1810.00597","arxiv_id_is_arxiv":true,"paper":"/paper/taming-vaes","title":"Taming VAEs","date":"2018-10-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"denproc/Taming-VAEs","path":"IWAE_GECO.py","file_url":"https://github.com/denproc/Taming-VAEs/blob/HEAD/IWAE_GECO.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, denproc/Taming-VAEs when it was checked","code_sha256":"c53f20354600989c","code_sha256_prefix":"c53f20354600989c","mcp_get_code":{"code_sha256":"c53f20354600989c"}},{"arxiv_id":"1610.03577","arxiv_id_is_arxiv":true,"paper":"/paper/minimax-filter-learning-to-preserve-privacy","title":"Minimax Filter: Learning to Preserve Privacy from Inference Attacks","date":"2016-10-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jihunhamm/MinimaxFilter","path":"src/sparse_autoencoder.py","file_url":"https://github.com/jihunhamm/MinimaxFilter/blob/HEAD/src/sparse_autoencoder.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"12705aea29776386","code_sha256_prefix":"12705aea29776386","mcp_get_code":{"code_sha256":"12705aea29776386"}}],"record_sha256":"7c74b008b389948785dc21c58cf8763a898c7b0251c5186c7919ce7f974f6657","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}