{"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/kld","entry":"KLD","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":3,"n_papers_ran_instrument_only":2,"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":3,"n_samples_instrument":2,"n_samples_unverified":1,"n_samples_fingerprinted":5,"n_places":6,"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":0,"ran_violates":0,"ran_draft_wrong":2,"ran_fixture":0,"ran":3,"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":"2411.00823","arxiv_id_is_arxiv":true,"paper":"/paper/mobility-llm-learning-visiting-intentions-and","title":"Mobility-LLM: Learning Visiting Intentions and Travel Preferences from Human Mobility Data with Large Language Models","date":"2024-10-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"LetianGong/Mobility-LLM","path":"model/utils.py","file_url":"https://github.com/LetianGong/Mobility-LLM/blob/HEAD/model/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, LetianGong/Mobility-LLM when it was checked","code_sha256":"7e92f4bf8ff58c85","code_sha256_prefix":"7e92f4bf8ff58c85","mcp_get_code":{"code_sha256":"7e92f4bf8ff58c85"}},{"arxiv_id":"2207.06543","arxiv_id_is_arxiv":true,"paper":"/paper/coscl-cooperation-of-small-continual-learners","title":"CoSCL: Cooperation of Small Continual Learners is Stronger than a Big One","date":"2022-07-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lywang3081/caf","path":"approaches/ppo_ewc_caf.py","file_url":"https://github.com/lywang3081/caf/blob/HEAD/approaches/ppo_ewc_caf.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":"cf3dfb506115c589","code_sha256_prefix":"cf3dfb506115c589","mcp_get_code":{"code_sha256":"cf3dfb506115c589"}},{"arxiv_id":"2006.13913","arxiv_id_is_arxiv":true,"paper":"/paper/generative-causal-explanations-of-black-box","title":"Generative causal explanations of black-box classifiers","date":"2020-06-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"shin-ee-chen/UvA_FACT_2021","path":"models/cvae.py","file_url":"https://github.com/shin-ee-chen/UvA_FACT_2021/blob/HEAD/models/cvae.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NOASSERTION","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub could not classify the licence of this paper's repository, shin-ee-chen/UvA_FACT_2021 (NOASSERTION)","code_sha256":"5f3e98a861c6bffe","code_sha256_prefix":"5f3e98a861c6bffe","mcp_get_code":{"code_sha256":"5f3e98a861c6bffe"}},{"arxiv_id":"1905.12019","arxiv_id_is_arxiv":true,"paper":"/paper/unified-probabilistic-deep-continual-learning","title":"Unified Probabilistic Deep Continual Learning through Generative Replay and Open Set Recognition","date":"2019-05-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"MrtnMndt/OCDVAEContinualLearning","path":"lib/Training/loss_functions.py","file_url":"https://github.com/MrtnMndt/OCDVAEContinualLearning/blob/HEAD/lib/Training/loss_functions.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":"35a868da9fed37c9","code_sha256_prefix":"35a868da9fed37c9","mcp_get_code":{"code_sha256":"35a868da9fed37c9"}},{"arxiv_id":"1903.11412","arxiv_id_is_arxiv":true,"paper":"/paper/self-supervised-learning-via-conditional","title":"Self-Supervised Learning via Conditional Motion Propagation","date":"2019-03-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"XiaohangZhan/conditional-motion-propagation","path":"losses.py","file_url":"https://github.com/XiaohangZhan/conditional-motion-propagation/blob/HEAD/losses.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":"9366245e5fdff0eb","code_sha256_prefix":"9366245e5fdff0eb","mcp_get_code":{"code_sha256":"9366245e5fdff0eb"}},{"arxiv_id":"1703.09452","arxiv_id_is_arxiv":true,"paper":"/paper/segan-speech-enhancement-generative","title":"SEGAN: Speech Enhancement Generative Adversarial Network","date":"2017-03-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"santi-pdp/segan_pytorch","path":"segan/models/ops.py","file_url":"https://github.com/santi-pdp/segan_pytorch/blob/HEAD/segan/models/ops.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":"c8cdd110f18d46c9","code_sha256_prefix":"c8cdd110f18d46c9","mcp_get_code":{"code_sha256":"c8cdd110f18d46c9"}}],"record_sha256":"10c2d9f9c9e5e5b26f57bf6db85eeba8ddf5cd6b061953283cea7bdac5ec2e2f","record_changed_at":"2026-10-04","record_changed_at_basis":"changed"}