{"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/get-tensor","entry":"get_tensor","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":6,"n_papers_ran_no_instrument_failure":5,"n_papers_ran_instrument_only":1,"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":4,"n_samples_constructed":0,"n_samples_ran_checked":3,"n_samples_instrument":1,"n_samples_unverified":2,"n_samples_fingerprinted":0,"n_places":8,"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":1,"ran_violates":0,"ran_draft_wrong":1,"ran_fixture":0,"ran":2,"unverified":2},"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":"2403.03181","arxiv_id_is_arxiv":true,"paper":"/paper/behavior-generation-with-latent-actions","title":"Behavior Generation with Latent Actions","date":"2024-03-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jayLEE0301/vq_bet_official","path":"vqvae/vqvae_utils.py","file_url":"https://github.com/jayLEE0301/vq_bet_official/blob/HEAD/vqvae/vqvae_utils.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":"5f5f6bab7bdf48cb","code_sha256_prefix":"5f5f6bab7bdf48cb","mcp_get_code":{"code_sha256":"5f5f6bab7bdf48cb"}},{"arxiv_id":"2401.09870","arxiv_id_is_arxiv":true,"paper":"/paper/reconciling-spatial-and-temporal-abstractions","title":"Reconciling Spatial and Temporal Abstractions for Goal Representation","date":"2024-01-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"cosynus-lix/STAR","path":"star/agents.py","file_url":"https://github.com/cosynus-lix/STAR/blob/HEAD/star/agents.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, cosynus-lix/STAR when it was checked","code_sha256":"4938b585d0d7b67c","code_sha256_prefix":"4938b585d0d7b67c","mcp_get_code":{"code_sha256":"4938b585d0d7b67c"}},{"arxiv_id":"2110.13625","arxiv_id_is_arxiv":true,"paper":"/paper/landmark-guided-subgoal-generation-in","title":"Landmark-Guided Subgoal Generation in Hierarchical Reinforcement Learning","date":"2021-10-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"junsu-kim97/HIGL","path":"higl/higl.py","file_url":"https://github.com/junsu-kim97/HIGL/blob/HEAD/higl/higl.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"4938b585d0d7b67c","code_sha256_prefix":"4938b585d0d7b67c","mcp_get_code":{"code_sha256":"4938b585d0d7b67c"}},{"arxiv_id":"2006.11485","arxiv_id_is_arxiv":true,"paper":"/paper/generating-adjacency-constrained-subgoals-in","title":"Generating Adjacency-Constrained Subgoals in Hierarchical Reinforcement Learning","date":"2020-06-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":null,"inline_ok":false,"inline_ok_link":false,"withheld_clause":"this paper's copy of the code was not recorded (its link names no repository or source path), so no licence was read for it","code_sha256":"4938b585d0d7b67c","code_sha256_prefix":"4938b585d0d7b67c","mcp_get_code":{"code_sha256":"4938b585d0d7b67c"}},{"arxiv_id":"1907.04809","arxiv_id_is_arxiv":true,"paper":"/paper/variational-autoencoders-and-nonlinear-ica-a","title":"Variational Autoencoders and Nonlinear ICA: A Unifying Framework","date":"2019-07-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ilkhem/ivae","path":"models/tcl/tcl_eval.py","file_url":"https://github.com/ilkhem/ivae/blob/HEAD/models/tcl/tcl_eval.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":"8ea5a22de767a1cd","code_sha256_prefix":"8ea5a22de767a1cd","mcp_get_code":{"code_sha256":"8ea5a22de767a1cd"}},{"arxiv_id":"1905.11946","arxiv_id_is_arxiv":true,"paper":"/paper/efficientnet-rethinking-model-scaling-for","title":"EfficientNet: Rethinking Model Scaling for Convolutional Neural Networks","date":"2019-05-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"linhduongtuan/Fruits_Vegetables_Classifier_WebApp","path":"commons.py","file_url":"https://github.com/linhduongtuan/Fruits_Vegetables_Classifier_WebApp/blob/HEAD/commons.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":"0aa29283f6dfba93","code_sha256_prefix":"0aa29283f6dfba93","mcp_get_code":{"code_sha256":"0aa29283f6dfba93"}},{"arxiv_id":"1805.08318","arxiv_id_is_arxiv":true,"paper":"/paper/self-attention-generative-adversarial","title":"Self-Attention Generative Adversarial Networks","date":"2018-05-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"alfagao/DeOldify","path":"fastai/dataloader.py","file_url":"https://github.com/alfagao/DeOldify/blob/HEAD/fastai/dataloader.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":"90dbf24c9ddd7f1d","code_sha256_prefix":"90dbf24c9ddd7f1d","mcp_get_code":{"code_sha256":"90dbf24c9ddd7f1d"}},{"arxiv_id":"1711.05225","arxiv_id_is_arxiv":true,"paper":"/paper/chexnet-radiologist-level-pneumonia-detection","title":"CheXNet: Radiologist-Level Pneumonia Detection on Chest X-Rays with Deep Learning","date":"2017-11-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"SGNovice/Disease-detection-using-chest-xrays","path":"commons.py","file_url":"https://github.com/SGNovice/Disease-detection-using-chest-xrays/blob/HEAD/commons.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":"d4a498230f440c39","code_sha256_prefix":"d4a498230f440c39","mcp_get_code":{"code_sha256":"d4a498230f440c39"}}],"record_sha256":"2d1531c63ed14bca2bed575bce594a97870ed6494c48630021ffdd8b8ca02a8f","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}