{"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/make-inference","entry":"make_inference","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":5,"n_papers_ran":4,"n_papers_ran_no_instrument_failure":4,"n_papers_ran_instrument_only":0,"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":3,"n_samples_ran":2,"n_samples_constructed":0,"n_samples_ran_checked":2,"n_samples_instrument":0,"n_samples_unverified":1,"n_samples_fingerprinted":0,"n_places":5,"n_places_pointer_only":4,"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":0,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":0,"ran":2,"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":"2505.20292","arxiv_id_is_arxiv":true,"paper":"/paper/opens2v-nexus-a-detailed-benchmark-and","title":"OpenS2V-Nexus: A Detailed Benchmark and Million-Scale Dataset for Subject-to-Video Generation","date":"2025-05-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"PKU-YuanGroup/ConsisID","path":"util/rife_model.py","file_url":"https://github.com/PKU-YuanGroup/ConsisID/blob/HEAD/util/rife_model.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"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 pittisl/phyt2v, and GitHub detected no licence in that repository when it was checked","code_sha256":"44d67662b32e0a93","code_sha256_prefix":"44d67662b32e0a93","mcp_get_code":{"code_sha256":"44d67662b32e0a93"}},{"arxiv_id":"2503.20287","arxiv_id_is_arxiv":true,"paper":"/paper/insvie-1m-effective-instruction-based-video","title":"InsViE-1M: Effective Instruction-based Video Editing with Elaborate Dataset Construction","date":"2025-03-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"langmanbusi/insvie","path":"CogVideo/inference/gradio_composite_demo/rife_model.py","file_url":"https://github.com/langmanbusi/insvie/blob/HEAD/CogVideo/inference/gradio_composite_demo/rife_model.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 pittisl/phyt2v, and GitHub detected no licence in that repository when it was checked","code_sha256":"44d67662b32e0a93","code_sha256_prefix":"44d67662b32e0a93","mcp_get_code":{"code_sha256":"44d67662b32e0a93"}},{"arxiv_id":"2412.00596","arxiv_id_is_arxiv":true,"paper":"/paper/phyt2v-llm-guided-iterative-self-refinement","title":"PhyT2V: LLM-Guided Iterative Self-Refinement for Physics-Grounded Text-to-Video Generation","date":"2024-11-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"pittisl/phyt2v","path":"inference/gradio_composite_demo/rife_model.py","file_url":"https://github.com/pittisl/phyt2v/blob/HEAD/inference/gradio_composite_demo/rife_model.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, pittisl/phyt2v when it was checked","code_sha256":"44d67662b32e0a93","code_sha256_prefix":"44d67662b32e0a93","mcp_get_code":{"code_sha256":"44d67662b32e0a93"}},{"arxiv_id":"2411.12103","arxiv_id_is_arxiv":true,"paper":"/paper/does-unlearning-truly-unlearn-a-black-box","title":"Does Unlearning Truly Unlearn? A Black Box Evaluation of LLM Unlearning Methods","date":"2024-11-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jaidoshi/knowledge-erasure","path":"evaluation/common/utils.py","file_url":"https://github.com/jaidoshi/knowledge-erasure/blob/HEAD/evaluation/common/utils.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, jaidoshi/knowledge-erasure when it was checked","code_sha256":"7de47a6e9f939e94","code_sha256_prefix":"7de47a6e9f939e94","mcp_get_code":{"code_sha256":"7de47a6e9f939e94"}},{"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":"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":"6adacd6aa8068327","code_sha256_prefix":"6adacd6aa8068327","mcp_get_code":{"code_sha256":"6adacd6aa8068327"}}],"record_sha256":"05315bc5c14d7ce42d30b1bfebae8165fc002f7a4c57137d212e49bfc65ffbd8","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}