{"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/recon-loss","entry":"recon_loss","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":10,"n_papers_ran":7,"n_papers_ran_no_instrument_failure":7,"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":9,"n_samples_ran":7,"n_samples_constructed":0,"n_samples_ran_checked":7,"n_samples_instrument":0,"n_samples_unverified":2,"n_samples_fingerprinted":2,"n_places":11,"n_places_pointer_only":3,"n_places_pointer_only_link_open":1,"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":6,"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":"2409.09369","arxiv_id_is_arxiv":true,"paper":"/paper/interpretable-vision-language-survival","title":"Interpretable Vision-Language Survival Analysis with Ordinal Inductive Bias for Computational Pathology","date":"2024-09-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"liupei101/VLSA","path":"loss/loss_surv.py","file_url":"https://github.com/liupei101/VLSA/blob/HEAD/loss/loss_surv.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NOASSERTION","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub could not classify the licence of this paper's repository, liupei101/VLSA (NOASSERTION)","code_sha256":"a39104cf333b9b24","code_sha256_prefix":"a39104cf333b9b24","mcp_get_code":{"code_sha256":"a39104cf333b9b24"}},{"arxiv_id":"2212.06515","arxiv_id_is_arxiv":true,"paper":"/paper/advmil-adversarial-multiple-instance-learning","title":"AdvMIL: Adversarial Multiple Instance Learning for the Survival Analysis on Whole-Slide Images","date":"2022-12-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"liupei101/advmil","path":"loss/utils.py","file_url":"https://github.com/liupei101/advmil/blob/HEAD/loss/utils.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":"a7bdd3621350a41c","code_sha256_prefix":"a7bdd3621350a41c","mcp_get_code":{"code_sha256":"a7bdd3621350a41c"}},{"arxiv_id":"2108.08422","arxiv_id_is_arxiv":true,"paper":"/paper/generating-smooth-pose-sequences-for-diverse","title":"Generating Smooth Pose Sequences for Diverse Human Motion Prediction","date":"2021-08-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"wei-mao-2019/gsps","path":"motion_pred/exp_dlow.py","file_url":"https://github.com/wei-mao-2019/gsps/blob/HEAD/motion_pred/exp_dlow.py","status":"unverified","verification_level":0,"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 Khrylx/DLow, and GitHub could not classify the licence of that repository (NOASSERTION)","code_sha256":"cbce7cc3e782a3b7","code_sha256_prefix":"cbce7cc3e782a3b7","mcp_get_code":{"code_sha256":"cbce7cc3e782a3b7"}},{"arxiv_id":"2103.14023","arxiv_id_is_arxiv":true,"paper":"/paper/agentformer-agent-aware-transformers-for","title":"AgentFormer: Agent-Aware Transformers for Socio-Temporal Multi-Agent Forecasting","date":"2021-03-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Khrylx/AgentFormer","path":"model/dlow.py","file_url":"https://github.com/Khrylx/AgentFormer/blob/HEAD/model/dlow.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":"7a165e35db87d53d","code_sha256_prefix":"7a165e35db87d53d","mcp_get_code":{"code_sha256":"7a165e35db87d53d"}},{"arxiv_id":"2003.08386","arxiv_id_is_arxiv":true,"paper":"/paper/dlow-diversifying-latent-flows-for-diverse","title":"DLow: Diversifying Latent Flows for Diverse Human Motion Prediction","date":"2020-03-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Khrylx/DLow","path":"motion_pred/exp_dlow.py","file_url":"https://github.com/Khrylx/DLow/blob/HEAD/motion_pred/exp_dlow.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NOASSERTION","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub could not classify the licence of this paper's repository, Khrylx/DLow (NOASSERTION)","code_sha256":"cbce7cc3e782a3b7","code_sha256_prefix":"cbce7cc3e782a3b7","mcp_get_code":{"code_sha256":"cbce7cc3e782a3b7"}},{"arxiv_id":"2001.04296","arxiv_id_is_arxiv":true,"paper":"/paper/high-fidelity-synthesis-with-disentangled","title":"High-Fidelity Synthesis with Disentangled Representation","date":"2020-01-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"rosinality/id-gan-pytorch","path":"train_vae.py","file_url":"https://github.com/rosinality/id-gan-pytorch/blob/HEAD/train_vae.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"37c03b5191a499f8","code_sha256_prefix":"37c03b5191a499f8","mcp_get_code":{"code_sha256":"37c03b5191a499f8"}},{"arxiv_id":"1912.13361","arxiv_id_is_arxiv":true,"paper":"/paper/learning-representations-by-maximizing-mutual-1","title":"Learning Representations by Maximizing Mutual Information in Variational Autoencoders","date":"2019-12-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"AliLotfi92/InfoMaxVAE","path":"CelebA/InfoMaxVAE_CelebA.py","file_url":"https://github.com/AliLotfi92/InfoMaxVAE/blob/HEAD/CelebA/InfoMaxVAE_CelebA.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":"012b56d45e310b3b","code_sha256_prefix":"012b56d45e310b3b","mcp_get_code":{"code_sha256":"012b56d45e310b3b"}},{"arxiv_id":"1912.13361","arxiv_id_is_arxiv":true,"paper":"/paper/learning-representations-by-maximizing-mutual-1","title":"Learning Representations by Maximizing Mutual Information in Variational Autoencoders","date":"2019-12-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"AliLotfi92/InfoMaxVAE","path":"utils/loss.py","file_url":"https://github.com/AliLotfi92/InfoMaxVAE/blob/HEAD/utils/loss.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":"3b85f05b6edb9652","code_sha256_prefix":"3b85f05b6edb9652","mcp_get_code":{"code_sha256":"3b85f05b6edb9652"}},{"arxiv_id":"1904.02399","arxiv_id_is_arxiv":true,"paper":"/paper/riemannian-normalizing-flow-on-variational","title":"Riemannian Normalizing Flow on Variational Wasserstein Autoencoder for Text Modeling","date":"2019-04-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"kingofspace0wzz/wae-rnf-lm","path":"loss.py","file_url":"https://github.com/kingofspace0wzz/wae-rnf-lm/blob/HEAD/loss.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":"f78950c60af411a7","code_sha256_prefix":"f78950c60af411a7","mcp_get_code":{"code_sha256":"f78950c60af411a7"}},{"arxiv_id":"1902.01568","arxiv_id_is_arxiv":true,"paper":"/paper/relevance-factor-vae-learning-and-identifying","title":"Relevance Factor VAE: Learning and Identifying Disentangled Factors","date":"2019-02-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ThomasMrY/RF-VAE","path":"ops.py","file_url":"https://github.com/ThomasMrY/RF-VAE/blob/HEAD/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":"2cbe0cbb9e1cf86e","code_sha256_prefix":"2cbe0cbb9e1cf86e","mcp_get_code":{"code_sha256":"2cbe0cbb9e1cf86e"}},{"arxiv_id":"1802.05983","arxiv_id_is_arxiv":true,"paper":"/paper/disentangling-by-factorising","title":"Disentangling by Factorising","date":"2018-02-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"1Konny/FactorVAE","path":"ops.py","file_url":"https://github.com/1Konny/FactorVAE/blob/HEAD/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":"2cbe0cbb9e1cf86e","code_sha256_prefix":"2cbe0cbb9e1cf86e","mcp_get_code":{"code_sha256":"2cbe0cbb9e1cf86e"}}],"record_sha256":"071b0f60ca5f5cf518b51bc9656bcc201f0ec1b74cc07bd6960c98b4bce4774c","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}