{"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/xavier-init","entry":"xavier_init","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":18,"n_papers_ran":7,"n_papers_ran_no_instrument_failure":3,"n_papers_ran_instrument_only":4,"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":17,"n_samples_ran":6,"n_samples_constructed":0,"n_samples_ran_checked":3,"n_samples_instrument":3,"n_samples_unverified":11,"n_samples_fingerprinted":1,"n_places":19,"n_places_pointer_only":8,"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":3,"ran_fixture":0,"ran":2,"unverified":11},"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":"2405.06147","arxiv_id_is_arxiv":true,"paper":"/paper/state-free-inference-of-state-space-models","title":"State-Free Inference of State-Space Models: The Transfer Function Approach","date":"2024-05-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ruke1ire/RTF","path":"rtf.py","file_url":"https://github.com/ruke1ire/RTF/blob/HEAD/rtf.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"e8c14b7f4176d895","code_sha256_prefix":"e8c14b7f4176d895","mcp_get_code":{"code_sha256":"e8c14b7f4176d895"}},{"arxiv_id":"2403.05026","arxiv_id_is_arxiv":true,"paper":"/paper/spectral-invariant-learning-for-dynamic-1","title":"Spectral Invariant Learning for Dynamic Graphs under Distribution Shifts","date":"2024-03-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"wondergo2017/sild","path":"DIDA/DIDA/utils/inits.py","file_url":"https://github.com/wondergo2017/sild/blob/HEAD/DIDA/DIDA/utils/inits.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","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, wondergo2017/sild when it was checked","code_sha256":"072c717f02e44012","code_sha256_prefix":"072c717f02e44012","mcp_get_code":{"code_sha256":"072c717f02e44012"}},{"arxiv_id":"2311.11114","arxiv_id_is_arxiv":true,"paper":"/paper/environment-aware-dynamic-graph-learning-for-1","title":"Environment-Aware Dynamic Graph Learning for Out-of-Distribution Generalization","date":"2023-11-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"wondergo2017/DIDA","path":"DIDA/utils/inits.py","file_url":"https://github.com/wondergo2017/DIDA/blob/HEAD/DIDA/utils/inits.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","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, wondergo2017/DIDA when it was checked","code_sha256":"072c717f02e44012","code_sha256_prefix":"072c717f02e44012","mcp_get_code":{"code_sha256":"072c717f02e44012"}},{"arxiv_id":"2111.09189","arxiv_id_is_arxiv":true,"paper":"/paper/tom2c-target-oriented-multi-agent-1","title":"ToM2C: Target-oriented Multi-agent Communication and Cooperation with Theory of Mind","date":"2021-10-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"unrealtracking/tom2c","path":"model.py","file_url":"https://github.com/unrealtracking/tom2c/blob/HEAD/model.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","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, unrealtracking/tom2c when it was checked","code_sha256":"849ee9d273c72d55","code_sha256_prefix":"849ee9d273c72d55","mcp_get_code":{"code_sha256":"849ee9d273c72d55"}},{"arxiv_id":"2102.02051","arxiv_id_is_arxiv":true,"paper":"/paper/trusted-multi-view-classification-1","title":"Trusted Multi-View Classification","date":"2021-02-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hanmenghan/CPM_Nets","path":"util/model.py","file_url":"https://github.com/hanmenghan/CPM_Nets/blob/HEAD/util/model.py","status":"unverified","verification_level":0,"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, hanmenghan/CPM_Nets when it was checked","code_sha256":"a8389492cefa262a","code_sha256_prefix":"a8389492cefa262a","mcp_get_code":{"code_sha256":"a8389492cefa262a"}},{"arxiv_id":"2004.13579","arxiv_id_is_arxiv":true,"paper":"/paper/transedge-translating-relation-contextualized","title":"TransEdge: Translating Relation-contextualized Embeddings for Knowledge Graphs","date":"2020-04-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"nju-websoft/TransEdge","path":"code/model_funcs.py","file_url":"https://github.com/nju-websoft/TransEdge/blob/HEAD/code/model_funcs.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":"ae60d2c6a850f59a","code_sha256_prefix":"ae60d2c6a850f59a","mcp_get_code":{"code_sha256":"ae60d2c6a850f59a"}},{"arxiv_id":"2004.01902","arxiv_id_is_arxiv":true,"paper":"/paper/rational-neural-networks","title":"Rational neural networks","date":"2020-04-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"NBoulle/RationalNets","path":"src/Approximation/KdV_poly.py","file_url":"https://github.com/NBoulle/RationalNets/blob/HEAD/src/Approximation/KdV_poly.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":"df01ac91ccf49144","code_sha256_prefix":"df01ac91ccf49144","mcp_get_code":{"code_sha256":"df01ac91ccf49144"}},{"arxiv_id":"2003.10152","arxiv_id_is_arxiv":true,"paper":"/paper/solov2-dynamic-faster-and-stronger","title":"SOLOv2: Dynamic and Fast Instance Segmentation","date":"2020-03-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"OpenFirework/pytorch_solov2","path":"modules/solov2.py","file_url":"https://github.com/OpenFirework/pytorch_solov2/blob/HEAD/modules/solov2.py","status":"unverified","verification_level":0,"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, OpenFirework/pytorch_solov2 when it was checked","code_sha256":"0adc33be4bb1dac3","code_sha256_prefix":"0adc33be4bb1dac3","mcp_get_code":{"code_sha256":"0adc33be4bb1dac3"}},{"arxiv_id":"1912.08113","arxiv_id_is_arxiv":true,"paper":"/paper/improved-surrogates-in-inertial-confinement","title":"Improved Surrogates in Inertial Confinement Fusion with Manifold and Cycle Consistencies","date":"2019-12-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"rushilanirudh/macc","path":"utils.py","file_url":"https://github.com/rushilanirudh/macc/blob/HEAD/utils.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":"139e368dce2e10a1","code_sha256_prefix":"139e368dce2e10a1","mcp_get_code":{"code_sha256":"139e368dce2e10a1"}},{"arxiv_id":"1912.08113","arxiv_id_is_arxiv":true,"paper":"/paper/improved-surrogates-in-inertial-confinement","title":"Improved Surrogates in Inertial Confinement Fusion with Manifold and Cycle Consistencies","date":"2019-12-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"rushilanirudh/macc","path":"wae_metric/model_AVB.py","file_url":"https://github.com/rushilanirudh/macc/blob/HEAD/wae_metric/model_AVB.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":"5eb1ccd14f3b5a80","code_sha256_prefix":"5eb1ccd14f3b5a80","mcp_get_code":{"code_sha256":"5eb1ccd14f3b5a80"}},{"arxiv_id":"1909.06296","arxiv_id_is_arxiv":true,"paper":"/paper/bayesian-parameter-estimation-using","title":"Bayesian parameter estimation using conditional variational autoencoders for gravitational-wave astronomy","date":"2019-09-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hagabbar/VItamin","path":"Neural_Networks/vae_utils.py","file_url":"https://github.com/hagabbar/VItamin/blob/HEAD/Neural_Networks/vae_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":"0fad99d24f770537","code_sha256_prefix":"0fad99d24f770537","mcp_get_code":{"code_sha256":"0fad99d24f770537"}},{"arxiv_id":"1906.09602","arxiv_id_is_arxiv":true,"paper":"/paper/ego-cnn-distributed-egocentric","title":"Ego-CNN: Distributed, Egocentric Representations of Graphs for Detecting Critical Structures","date":"2019-06-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"rutzeng/EgoCNN","path":"run-visualization-model.py","file_url":"https://github.com/rutzeng/EgoCNN/blob/HEAD/run-visualization-model.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":"f9cf30923f4a2f36","code_sha256_prefix":"f9cf30923f4a2f36","mcp_get_code":{"code_sha256":"f9cf30923f4a2f36"}},{"arxiv_id":"1902.09913","arxiv_id_is_arxiv":true,"paper":"/paper/hexagan-generative-adversarial-nets-for-real","title":"HexaGAN: Generative Adversarial Nets for Real World Classification","date":"2019-02-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"shinyflight/HexaGAN","path":"train_mnist.py","file_url":"https://github.com/shinyflight/HexaGAN/blob/HEAD/train_mnist.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, shinyflight/HexaGAN (NOASSERTION)","code_sha256":"76ac6beb564477fd","code_sha256_prefix":"76ac6beb564477fd","mcp_get_code":{"code_sha256":"76ac6beb564477fd"}},{"arxiv_id":"1812.09916","arxiv_id_is_arxiv":true,"paper":"/paper/improving-mmd-gan-training-with-repulsive","title":"Improving MMD-GAN Training with Repulsive Loss Function","date":"2018-12-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"richardwth/MMD-GAN","path":"GeneralTools/graph_func.py","file_url":"https://github.com/richardwth/MMD-GAN/blob/HEAD/GeneralTools/graph_func.py","status":"unverified","verification_level":0,"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":"b38f1ddd69e392d9","code_sha256_prefix":"b38f1ddd69e392d9","mcp_get_code":{"code_sha256":"b38f1ddd69e392d9"}},{"arxiv_id":"1703.06585","arxiv_id_is_arxiv":true,"paper":"/paper/learning-cooperative-visual-dialog-agents","title":"Learning Cooperative Visual Dialog Agents with Deep Reinforcement Learning","date":"2017-03-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"kdexd/lang-emerge-parlai","path":"bots.py","file_url":"https://github.com/kdexd/lang-emerge-parlai/blob/HEAD/bots.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","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, kdexd/lang-emerge-parlai when it was checked","code_sha256":"daf2dbf91f9be1cd","code_sha256_prefix":"daf2dbf91f9be1cd","mcp_get_code":{"code_sha256":"daf2dbf91f9be1cd"}},{"arxiv_id":"1703.01488","arxiv_id_is_arxiv":true,"paper":"/paper/autoencoding-variational-inference-for-topic","title":"Autoencoding Variational Inference For Topic Models","date":"2017-03-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"akashgit/autoencoding_vi_for_topic_models","path":"models/nvlda.py","file_url":"https://github.com/akashgit/autoencoding_vi_for_topic_models/blob/HEAD/models/nvlda.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":"ce2f744c3f060169","code_sha256_prefix":"ce2f744c3f060169","mcp_get_code":{"code_sha256":"ce2f744c3f060169"}},{"arxiv_id":"1701.07875","arxiv_id_is_arxiv":true,"paper":"/paper/wasserstein-gan","title":"Wasserstein GAN","date":"2017-01-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"shekkizh/WassersteinGAN.tensorflow","path":"utils.py","file_url":"https://github.com/shekkizh/WassersteinGAN.tensorflow/blob/HEAD/utils.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":"5645c84de7678d1e","code_sha256_prefix":"5645c84de7678d1e","mcp_get_code":{"code_sha256":"5645c84de7678d1e"}},{"arxiv_id":"1612.00410","arxiv_id_is_arxiv":true,"paper":"/paper/deep-variational-information-bottleneck","title":"Deep Variational Information Bottleneck","date":"2016-12-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"shijing001/VIB_audio_classification","path":"model.py","file_url":"https://github.com/shijing001/VIB_audio_classification/blob/HEAD/model.py","status":"unverified","verification_level":0,"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, shijing001/VIB_audio_classification when it was checked","code_sha256":"1f17bea5c95190e2","code_sha256_prefix":"1f17bea5c95190e2","mcp_get_code":{"code_sha256":"1f17bea5c95190e2"}},{"arxiv_id":"1604.07379","arxiv_id_is_arxiv":true,"paper":"/paper/context-encoders-feature-learning-by","title":"Context Encoders: Feature Learning by Inpainting","date":"2016-04-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"shekkizh/TensorflowProjects","path":"TensorflowUtils.py","file_url":"https://github.com/shekkizh/TensorflowProjects/blob/HEAD/TensorflowUtils.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":"5645c84de7678d1e","code_sha256_prefix":"5645c84de7678d1e","mcp_get_code":{"code_sha256":"5645c84de7678d1e"}}],"record_sha256":"264fed919bf6fd1d1fcf0db286ae7ffd8139b7eb8aec8939eccebb67ce04ba55","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}