{"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/g-2","entry":"G","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":6,"n_papers_ran_no_instrument_failure":6,"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":6,"n_samples_ran":6,"n_samples_constructed":1,"n_samples_ran_checked":6,"n_samples_instrument":0,"n_samples_unverified":0,"n_samples_fingerprinted":1,"n_places":7,"n_places_pointer_only":3,"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":1,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":0,"ran":5,"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":"2607.15823","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2607-15823","title":"Aggregation of Statistical Evidence under Exchangeability","date":null,"month_inferred_from_arxiv_id":"2026-07","title_source":"syntology","repo":"antoninschrab/sb-paper","path":"sampler.py","file_url":"https://github.com/antoninschrab/sb-paper/blob/HEAD/sampler.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"9ccbdd0ccdb2db7a","code_sha256_prefix":"9ccbdd0ccdb2db7a","mcp_get_code":{"code_sha256":"9ccbdd0ccdb2db7a"}},{"arxiv_id":"2306.08777","arxiv_id_is_arxiv":true,"paper":"/paper/mmd-fuse-learning-and-combining-kernels-for","title":"MMD-FUSE: Learning and Combining Kernels for Two-Sample Testing Without Data Splitting","date":"2023-06-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"antoninschrab/mmdfuse-paper","path":"sampler_perturbations.py","file_url":"https://github.com/antoninschrab/mmdfuse-paper/blob/HEAD/sampler_perturbations.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":"74f5342c2c79173c","code_sha256_prefix":"74f5342c2c79173c","mcp_get_code":{"code_sha256":"74f5342c2c79173c"}},{"arxiv_id":"2110.15073","arxiv_id_is_arxiv":true,"paper":"/paper/mmd-aggregated-two-sample-test","title":"MMD Aggregated Two-Sample Test","date":"2021-10-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"antoninschrab/mmdagg-paper","path":"sampling.py","file_url":"https://github.com/antoninschrab/mmdagg-paper/blob/HEAD/sampling.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":"74f5342c2c79173c","code_sha256_prefix":"74f5342c2c79173c","mcp_get_code":{"code_sha256":"74f5342c2c79173c"}},{"arxiv_id":"2106.03926","arxiv_id_is_arxiv":true,"paper":"/paper/reconciling-rewards-with-predictive-state","title":"Reconciling Rewards with Predictive State Representations","date":"2021-06-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"abaisero/rl-rpsr","path":"rl_rpsr/matrices.py","file_url":"https://github.com/abaisero/rl-rpsr/blob/HEAD/rl_rpsr/matrices.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":"134bb68b32e10eb8","code_sha256_prefix":"134bb68b32e10eb8","mcp_get_code":{"code_sha256":"134bb68b32e10eb8"}},{"arxiv_id":"2104.05170","arxiv_id_is_arxiv":true,"paper":"/paper/memory-guided-unsupervised-image-to-image","title":"Memory-guided Unsupervised Image-to-image Translation","date":"2021-04-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"HsinYingLee/DRIT","path":"src/model.py","file_url":"https://github.com/HsinYingLee/DRIT/blob/HEAD/src/model.py","status":"ran","verification_level":1,"contract_check":null,"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, HsinYingLee/DRIT when it was checked","code_sha256":"8555d745df56cef9","code_sha256_prefix":"8555d745df56cef9","mcp_get_code":{"code_sha256":"8555d745df56cef9"}},{"arxiv_id":"1511.06434","arxiv_id_is_arxiv":true,"paper":"/paper/unsupervised-representation-learning-with-1","title":"Unsupervised Representation Learning with Deep Convolutional Generative Adversarial Networks","date":"2015-11-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"oneil512/DCGAN","path":"DCGAN.py","file_url":"https://github.com/oneil512/DCGAN/blob/HEAD/DCGAN.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, oneil512/DCGAN when it was checked","code_sha256":"6d2e7b45ec6f246d","code_sha256_prefix":"6d2e7b45ec6f246d","mcp_get_code":{"code_sha256":"6d2e7b45ec6f246d"}},{"arxiv_id":"1511.06434","arxiv_id_is_arxiv":true,"paper":"/paper/unsupervised-representation-learning-with-1","title":"Unsupervised Representation Learning with Deep Convolutional Generative Adversarial Networks","date":"2015-11-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"suzana-ilic/pytorch_DCGANs","path":"DCGANs.py","file_url":"https://github.com/suzana-ilic/pytorch_DCGANs/blob/HEAD/DCGANs.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, suzana-ilic/pytorch_DCGANs when it was checked","code_sha256":"af3b18528cec45f7","code_sha256_prefix":"af3b18528cec45f7","mcp_get_code":{"code_sha256":"af3b18528cec45f7"}}],"record_sha256":"29681509e37ae10d6825a7bec35d2b536a5e8b0c22d87db4ac041bed51e37317","record_changed_at":"2026-10-04","record_changed_at_basis":"changed"}