{"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/gaussian-entropy","entry":"gaussian_entropy","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":8,"n_papers_ran":8,"n_papers_ran_no_instrument_failure":3,"n_papers_ran_instrument_only":5,"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":4,"n_samples_ran":4,"n_samples_constructed":0,"n_samples_ran_checked":3,"n_samples_instrument":1,"n_samples_unverified":0,"n_samples_fingerprinted":3,"n_places":8,"n_places_pointer_only":5,"n_places_pointer_only_link_open":1,"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":1,"ran_fixture":0,"ran":1,"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":"2609.13991","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2609-13991","title":"Mind2Cloud: EEG-to-Point Cloud Generation with Two-Granularity Diffusion Decoding","date":null,"month_inferred_from_arxiv_id":"2026-09","title_source":"syntology","repo":"duasoi/Mind2Cloud","path":"PointCNN/model_PCNN/common.py","file_url":"https://github.com/duasoi/Mind2Cloud/blob/HEAD/PointCNN/model_PCNN/common.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, duasoi/Mind2Cloud when it was checked","code_sha256":"82816eb1edfdbd19","code_sha256_prefix":"82816eb1edfdbd19","mcp_get_code":{"code_sha256":"82816eb1edfdbd19"}},{"arxiv_id":"2407.06250","arxiv_id_is_arxiv":true,"paper":"/paper/fairdiff-fair-segmentation-with-point-image","title":"FairDiff: Fair Segmentation with Point-Image Diffusion","date":"2024-07-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"wenyi-li/fairdiff","path":"PointMaskGen/models/common.py","file_url":"https://github.com/wenyi-li/fairdiff/blob/HEAD/PointMaskGen/models/common.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, wenyi-li/fairdiff when it was checked","code_sha256":"82816eb1edfdbd19","code_sha256_prefix":"82816eb1edfdbd19","mcp_get_code":{"code_sha256":"82816eb1edfdbd19"}},{"arxiv_id":"2402.06680","arxiv_id_is_arxiv":true,"paper":"/paper/social-physics-informed-diffusion-model-for","title":"Social Physics Informed Diffusion Model for Crowd Simulation","date":"2024-02-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"tsinghua-fib-lab/SPDiff","path":"models/common.py","file_url":"https://github.com/tsinghua-fib-lab/SPDiff/blob/HEAD/models/common.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, tsinghua-fib-lab/SPDiff when it was checked","code_sha256":"82816eb1edfdbd19","code_sha256_prefix":"82816eb1edfdbd19","mcp_get_code":{"code_sha256":"82816eb1edfdbd19"}},{"arxiv_id":"2308.08824","arxiv_id_is_arxiv":true,"paper":"/paper/fast-inference-and-update-of-probabilistic","title":"Fast Inference and Update of Probabilistic Density Estimation on Trajectory Prediction","date":"2023-08-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"meaten/flowchain-iccv2023","path":"src/models/TP/MID.py","file_url":"https://github.com/meaten/flowchain-iccv2023/blob/HEAD/src/models/TP/MID.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, meaten/flowchain-iccv2023 when it was checked","code_sha256":"82816eb1edfdbd19","code_sha256_prefix":"82816eb1edfdbd19","mcp_get_code":{"code_sha256":"82816eb1edfdbd19"}},{"arxiv_id":"2305.04847","arxiv_id_is_arxiv":true,"paper":"/paper/caloclouds-fast-geometry-independent-highly","title":"CaloClouds: Fast Geometry-Independent Highly-Granular Calorimeter Simulation","date":"2023-05-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"flc-qu-hep/caloclouds-2","path":"models/common.py","file_url":"https://github.com/flc-qu-hep/caloclouds-2/blob/HEAD/models/common.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (Apache-2.0), but get_code serves the stored copy, first harvested from duasoi/Mind2Cloud, and GitHub detected no licence in that repository when it was checked","code_sha256":"82816eb1edfdbd19","code_sha256_prefix":"82816eb1edfdbd19","mcp_get_code":{"code_sha256":"82816eb1edfdbd19"}},{"arxiv_id":"2211.02222","arxiv_id_is_arxiv":true,"paper":"/paper/the-benefits-of-model-based-generalization-in","title":"The Benefits of Model-Based Generalization in Reinforcement Learning","date":"2022-11-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"kenjyoung/model_generalization_code_supplement","path":"train_latent_model_DQN.py","file_url":"https://github.com/kenjyoung/model_generalization_code_supplement/blob/HEAD/train_latent_model_DQN.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":"671ceafbe524c6d7","code_sha256_prefix":"671ceafbe524c6d7","mcp_get_code":{"code_sha256":"671ceafbe524c6d7"}},{"arxiv_id":"2106.09620","arxiv_id_is_arxiv":true,"paper":"/paper/disentangling-identifiable-features-from","title":"Disentangling Identifiable Features from Noisy Data with Structured Nonlinear ICA","date":"2021-06-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"HHalva/snica","path":"elbo.py","file_url":"https://github.com/HHalva/snica/blob/HEAD/elbo.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"38c1891fa5bd8cbf","code_sha256_prefix":"38c1891fa5bd8cbf","mcp_get_code":{"code_sha256":"38c1891fa5bd8cbf"}},{"arxiv_id":"2004.07530","arxiv_id_is_arxiv":true,"paper":"/paper/continual-reinforcement-learning-with-multi","title":"Continual Reinforcement Learning with Multi-Timescale Replay","date":"2020-04-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ChristosKap/multi_timescale_replay","path":"policies.py","file_url":"https://github.com/ChristosKap/multi_timescale_replay/blob/HEAD/policies.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":"30442e0c664c94cb","code_sha256_prefix":"30442e0c664c94cb","mcp_get_code":{"code_sha256":"30442e0c664c94cb"}}],"record_sha256":"2acaaecf5def7c89fc49bb33e170ff0d779b74855ac6c39f051dbd501508ee05","record_changed_at":"2026-10-04","record_changed_at_basis":"changed"}