{"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/kernel","entry":"kernel","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":22,"n_papers_ran":18,"n_papers_ran_no_instrument_failure":10,"n_papers_ran_instrument_only":8,"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":19,"n_samples_ran":16,"n_samples_constructed":0,"n_samples_ran_checked":9,"n_samples_instrument":7,"n_samples_unverified":3,"n_samples_fingerprinted":7,"n_places":22,"n_places_pointer_only":10,"n_places_pointer_only_link_open":2,"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":5,"ran_fixture":2,"ran":8,"unverified":3},"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":"2605.10651","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2605-10651","title":"A Recursive Decomposition Framework for Causal Structure Learning in the Presence of Latent Variables","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"zhengli0060/DiCoLa-ICML2026","path":"compare_algs/causallearn_package/utils/ScoreUtils.py","file_url":"https://github.com/zhengli0060/DiCoLa-ICML2026/blob/HEAD/compare_algs/causallearn_package/utils/ScoreUtils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"a084bc313faa18ab","code_sha256_prefix":"a084bc313faa18ab","mcp_get_code":{"code_sha256":"a084bc313faa18ab"}},{"arxiv_id":"2604.23256","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2604-23256","title":"Architecture-Induced Recoverability Bias in Differentiable Symbolic Regression","date":null,"month_inferred_from_arxiv_id":"2026-04","title_source":"syntology","repo":"ChakshuGupta13/lab","path":"alife/gupta2026lenia/code/lenia.py","file_url":"https://github.com/ChakshuGupta13/lab/blob/HEAD/alife/gupta2026lenia/code/lenia.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"CC-BY-4.0","inline_ok":false,"inline_ok_link":false,"withheld_clause":"CC-BY-4.0, as GitHub detects it on this paper's repository, ChakshuGupta13/lab, is not in the permissive set Syntology serves inline","code_sha256":"72e542abd1787b52","code_sha256_prefix":"72e542abd1787b52","mcp_get_code":{"code_sha256":"72e542abd1787b52"}},{"arxiv_id":"2603.21928","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2603-21928","title":"The Golden Subspace: Where Efficiency Meets Generalization in Continual Test-Time Adaptation","date":null,"month_inferred_from_arxiv_id":"2026-03","title_source":"syntology","repo":"AIGNLAI/GOLD","path":"classification/methods/cmf.py","file_url":"https://github.com/AIGNLAI/GOLD/blob/HEAD/classification/methods/cmf.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, AIGNLAI/GOLD when it was checked","code_sha256":"b086cfc2dfe368f4","code_sha256_prefix":"b086cfc2dfe368f4","mcp_get_code":{"code_sha256":"b086cfc2dfe368f4"}},{"arxiv_id":"2601.20589","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2601-20589","title":"Exact Graph Learning via Integer Programming","date":null,"month_inferred_from_arxiv_id":"2026-01","title_source":"syntology","repo":"py-why/causal-learn","path":"causallearn/utils/ScoreUtils.py","file_url":"https://github.com/py-why/causal-learn/blob/HEAD/causallearn/utils/ScoreUtils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"a084bc313faa18ab","code_sha256_prefix":"a084bc313faa18ab","mcp_get_code":{"code_sha256":"a084bc313faa18ab"}},{"arxiv_id":"2509.24100","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2509-24100","title":"SpeedCP: Fast Kernel-Based Conditional Conformal Prediction","date":null,"month_inferred_from_arxiv_id":"2025-09","title_source":"syntology","repo":"yeojin-jung/speedcp","path":"speedcp/utils.py","file_url":"https://github.com/yeojin-jung/speedcp/blob/HEAD/speedcp/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":"62ef2c7c0e6f7e9d","code_sha256_prefix":"62ef2c7c0e6f7e9d","mcp_get_code":{"code_sha256":"62ef2c7c0e6f7e9d"}},{"arxiv_id":"2406.18868","arxiv_id_is_arxiv":true,"paper":"/paper/advancing-cross-domain-discriminability-in","title":"Advancing Cross-domain Discriminability in Continual Learning of Vision-Language Models","date":"2024-06-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"linghan1997/regression-based-analytic-incremental-learning","path":"utils.py","file_url":"https://github.com/linghan1997/regression-based-analytic-incremental-learning/blob/HEAD/utils.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, linghan1997/regression-based-analytic-incremental-learning when it was checked","code_sha256":"ccbfd937580443e4","code_sha256_prefix":"ccbfd937580443e4","mcp_get_code":{"code_sha256":"ccbfd937580443e4"}},{"arxiv_id":"2405.16391","arxiv_id_is_arxiv":true,"paper":"/paper/when-does-compositional-structure-yield","title":"When does compositional structure yield compositional generalization? A kernel theory","date":"2024-05-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"sflippl/compositional-generalization","path":"simple_compositional_tasks/models/kernel_machines.py","file_url":"https://github.com/sflippl/compositional-generalization/blob/HEAD/simple_compositional_tasks/models/kernel_machines.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, sflippl/compositional-generalization when it was checked","code_sha256":"4dd4ca690ab53814","code_sha256_prefix":"4dd4ca690ab53814","mcp_get_code":{"code_sha256":"4dd4ca690ab53814"}},{"arxiv_id":"2403.18442","arxiv_id_is_arxiv":true,"paper":"/paper/backpropagation-free-network-for-3d-test-time","title":"Backpropagation-free Network for 3D Test-time Adaptation","date":"2024-03-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"abie-e/bftt3d","path":"run_BFTT3D_mn40.py","file_url":"https://github.com/abie-e/bftt3d/blob/HEAD/run_BFTT3D_mn40.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, abie-e/bftt3d when it was checked","code_sha256":"8189624c101067de","code_sha256_prefix":"8189624c101067de","mcp_get_code":{"code_sha256":"8189624c101067de"}},{"arxiv_id":"2403.14606","arxiv_id_is_arxiv":true,"paper":"/paper/the-elements-of-differentiable-programming","title":"The Elements of Differentiable Programming","date":"2024-03-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"diffprog/code","path":"data_struct/plot_dict_kernel_estim.py","file_url":"https://github.com/diffprog/code/blob/HEAD/data_struct/plot_dict_kernel_estim.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":"81dda7d4de68eb97","code_sha256_prefix":"81dda7d4de68eb97","mcp_get_code":{"code_sha256":"81dda7d4de68eb97"}},{"arxiv_id":"2402.13241","arxiv_id_is_arxiv":true,"paper":"/paper/federated-causal-discovery-from-heterogeneous","title":"Federated Causal Discovery from Heterogeneous Data","date":"2024-02-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lokali/FedCDH","path":"causallearn/utils/ScoreUtils.py","file_url":"https://github.com/lokali/FedCDH/blob/HEAD/causallearn/utils/ScoreUtils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, lokali/FedCDH when it was checked","code_sha256":"98df2a458d28d6c9","code_sha256_prefix":"98df2a458d28d6c9","mcp_get_code":{"code_sha256":"98df2a458d28d6c9"}},{"arxiv_id":"2311.14653","arxiv_id_is_arxiv":true,"paper":"/paper/data-driven-prior-learning-for-bayesian","title":"Data-driven Prior Learning for Bayesian Optimisation","date":"2023-11-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"sighellan/plebo","path":"mcmc/prior_learning.py","file_url":"https://github.com/sighellan/plebo/blob/HEAD/mcmc/prior_learning.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, sighellan/plebo when it was checked","code_sha256":"542c58186c3365ba","code_sha256_prefix":"542c58186c3365ba","mcp_get_code":{"code_sha256":"542c58186c3365ba"}},{"arxiv_id":"2308.05141","arxiv_id_is_arxiv":true,"paper":"/paper/sound-propagation-in-realistic-interactive-3d","title":"Sound propagation in realistic interactive 3D scenes with parameterized sources using deep neural operators","date":"2023-08-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"dtu-act/deeponet-acoustic-wave-prop","path":"deeponet_acoustics/models/CEOD.py","file_url":"https://github.com/dtu-act/deeponet-acoustic-wave-prop/blob/HEAD/deeponet_acoustics/models/CEOD.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"7b330dbcaa7182eb","code_sha256_prefix":"7b330dbcaa7182eb","mcp_get_code":{"code_sha256":"7b330dbcaa7182eb"}},{"arxiv_id":"2305.17209","arxiv_id_is_arxiv":true,"paper":"/paper/functional-flow-matching","title":"Functional Flow Matching","date":"2023-05-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"gavinkerrigan/functional_flow_matching","path":"models/gano_models.py","file_url":"https://github.com/gavinkerrigan/functional_flow_matching/blob/HEAD/models/gano_models.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (MIT), but get_code serves the stored copy, first harvested from HrishikeshVish/AdaFNIO, and GitHub detected no licence in that repository when it was checked","code_sha256":"d0c296ad2f898205","code_sha256_prefix":"d0c296ad2f898205","mcp_get_code":{"code_sha256":"d0c296ad2f898205"}},{"arxiv_id":"2301.12321","arxiv_id_is_arxiv":true,"paper":"/paper/neural-relation-graph-a-unified-framework-for-1","title":"Neural Relation Graph: A Unified Framework for Identifying Label Noise and Outlier Data","date":"2023-01-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"snu-mllab/neural-relation-graph","path":"relation.py","file_url":"https://github.com/snu-mllab/neural-relation-graph/blob/HEAD/relation.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"882280247d87526d","code_sha256_prefix":"882280247d87526d","mcp_get_code":{"code_sha256":"882280247d87526d"}},{"arxiv_id":"2211.10791","arxiv_id_is_arxiv":true,"paper":"/paper/nio-lightweight-neural-operator-based","title":"AdaFNIO: Adaptive Fourier Neural Interpolation Operator for video frame interpolation","date":"2022-11-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"HrishikeshVish/AdaFNIO","path":"NIO.py","file_url":"https://github.com/HrishikeshVish/AdaFNIO/blob/HEAD/NIO.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, HrishikeshVish/AdaFNIO when it was checked","code_sha256":"d0c296ad2f898205","code_sha256_prefix":"d0c296ad2f898205","mcp_get_code":{"code_sha256":"d0c296ad2f898205"}},{"arxiv_id":"2210.07702","arxiv_id_is_arxiv":true,"paper":"/paper/theory-and-approximate-solvers-for-branched","title":"Theory and Approximate Solvers for Branched Optimal Transport with Multiple Sources","date":"2022-10-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hci-unihd/BranchedOT","path":"src/greedy_topology_optimization.py","file_url":"https://github.com/hci-unihd/BranchedOT/blob/HEAD/src/greedy_topology_optimization.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":"383e7bb99ccb4c4a","code_sha256_prefix":"383e7bb99ccb4c4a","mcp_get_code":{"code_sha256":"383e7bb99ccb4c4a"}},{"arxiv_id":"2207.11685","arxiv_id_is_arxiv":true,"paper":"/paper/kernel-relative-prototype-spectral-filtering","title":"Kernel Relative-prototype Spectral Filtering for Few-shot Learning","date":"2022-07-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zhangtao2022/DSFN","path":"models/classification_heads.py","file_url":"https://github.com/zhangtao2022/DSFN/blob/HEAD/models/classification_heads.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"617a350f818c273a","code_sha256_prefix":"617a350f818c273a","mcp_get_code":{"code_sha256":"617a350f818c273a"}},{"arxiv_id":"2007.04154","arxiv_id_is_arxiv":true,"paper":"/paper/robust-pricing-and-hedging-via-neural-sdes","title":"Robust pricing and hedging via neural SDEs","date":"2020-07-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ericavanee/bicausal_wasserstein_mtglproj","path":"src/adapted_mtgl/mtgl_test/mtgl.py","file_url":"https://github.com/ericavanee/bicausal_wasserstein_mtglproj/blob/HEAD/src/adapted_mtgl/mtgl_test/mtgl.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":"9ae524158f4feefb","code_sha256_prefix":"9ae524158f4feefb","mcp_get_code":{"code_sha256":"9ae524158f4feefb"}},{"arxiv_id":"1608.04471","arxiv_id_is_arxiv":true,"paper":"/paper/stein-variational-gradient-descent-a-general","title":"Stein Variational Gradient Descent: A General Purpose Bayesian Inference Algorithm","date":"2016-08-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"feynmanliang/dist-svgd","path":"experiments/gmm.py","file_url":"https://github.com/feynmanliang/dist-svgd/blob/HEAD/experiments/gmm.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":"552376bd52d01b1e","code_sha256_prefix":"552376bd52d01b1e","mcp_get_code":{"code_sha256":"552376bd52d01b1e"}},{"arxiv_id":"1606.04443","arxiv_id_is_arxiv":true,"paper":"/paper/a-scalable-end-to-end-gaussian-process","title":"A scalable end-to-end Gaussian process adapter for irregularly sampled time series classification","date":"2016-06-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"steveli/gp-adapter","path":"gp_kernel.py","file_url":"https://github.com/steveli/gp-adapter/blob/HEAD/gp_kernel.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":"95e644b77d25a0a5","code_sha256_prefix":"95e644b77d25a0a5","mcp_get_code":{"code_sha256":"95e644b77d25a0a5"}},{"arxiv_id":"1511.05547","arxiv_id_is_arxiv":true,"paper":"/paper/return-of-frustratingly-easy-domain","title":"Return of Frustratingly Easy Domain Adaptation","date":"2015-11-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"vincent-vercruyssen/transfertools","path":"transfertools/utils/utils.py","file_url":"https://github.com/vincent-vercruyssen/transfertools/blob/HEAD/transfertools/utils/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":"a89c1e6286834a6b","code_sha256_prefix":"a89c1e6286834a6b","mcp_get_code":{"code_sha256":"a89c1e6286834a6b"}},{"arxiv_id":"Ni_Maintaining_Consistent_Inter-Class_Topology_in_Continual_Test-Time_Adaptation_CVPR_2025_paper","arxiv_id_is_arxiv":false,"paper":null,"title":"CVF open access id Ni_Maintaining_Consistent_Inter-Class_Topology_in_Continual_Test-Time_Adaptation_CVPR_2025_paper","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"Successybbdwm/TCA","path":"classification/methods/cmf.py","file_url":"https://github.com/Successybbdwm/TCA/blob/HEAD/classification/methods/cmf.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (MIT), but get_code serves the stored copy, first harvested from AIGNLAI/GOLD, and GitHub detected no licence in that repository when it was checked","code_sha256":"b086cfc2dfe368f4","code_sha256_prefix":"b086cfc2dfe368f4","mcp_get_code":{"code_sha256":"b086cfc2dfe368f4"}}],"record_sha256":"976a75d17f7523bab5de682e4b4dff21008e861312ab312440280283a0f2ea15","record_changed_at":"2026-10-04","record_changed_at_basis":"changed"}