{"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/pad-tensor","entry":"pad_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":27,"n_papers_ran":26,"n_papers_ran_no_instrument_failure":17,"n_papers_ran_instrument_only":9,"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":23,"n_samples_ran":22,"n_samples_constructed":0,"n_samples_ran_checked":15,"n_samples_instrument":7,"n_samples_unverified":1,"n_samples_fingerprinted":14,"n_places":27,"n_places_pointer_only":9,"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":0,"ran_violates":0,"ran_draft_wrong":2,"ran_fixture":5,"ran":15,"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":"2608.30682","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2608-30682","title":"Learning Materials Properties from Scarce Labels and Unlabeled Crystals","date":null,"month_inferred_from_arxiv_id":"2026-08","title_source":"syntology","repo":"littlepeachs/SemiMat","path":"ocpmodels/common/gp_utils.py","file_url":"https://github.com/littlepeachs/SemiMat/blob/HEAD/ocpmodels/common/gp_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":"30bc93160486bf59","code_sha256_prefix":"30bc93160486bf59","mcp_get_code":{"code_sha256":"30bc93160486bf59"}},{"arxiv_id":"2607.01731","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2607-01731","title":"Quantum-Inspired Vision: Leveraging Wave-Particle Duality for Low-Illumination Enhancement","date":null,"month_inferred_from_arxiv_id":"2026-07","title_source":"syntology","repo":"StudioYG/DRU","path":"models/networks.py","file_url":"https://github.com/StudioYG/DRU/blob/HEAD/models/networks.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","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, StudioYG/DRU when it was checked","code_sha256":"9457774086c9e2b5","code_sha256_prefix":"9457774086c9e2b5","mcp_get_code":{"code_sha256":"9457774086c9e2b5"}},{"arxiv_id":"2604.11214","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2604-11214","title":"HiEdit: Lifelong Model Editing with Hierarchical Reinforcement Learning","date":null,"month_inferred_from_arxiv_id":"2026-04","title_source":"syntology","repo":"yangfanww/hiedit","path":"editor/hieditmm.py","file_url":"https://github.com/yangfanww/hiedit/blob/HEAD/editor/hieditmm.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, yangfanww/hiedit when it was checked","code_sha256":"a8372336a87f5776","code_sha256_prefix":"a8372336a87f5776","mcp_get_code":{"code_sha256":"a8372336a87f5776"}},{"arxiv_id":"2507.20163","arxiv_id_is_arxiv":true,"paper":null,"title":"arXiv:2507.20163","date":null,"month_inferred_from_arxiv_id":"2025-07","title_source":null,"repo":"Zeyu1226-mt/LLM-IAVC","path":"stage_two/LLM_VC_dataset.py","file_url":"https://github.com/Zeyu1226-mt/LLM-IAVC/blob/HEAD/stage_two/LLM_VC_dataset.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, Zeyu1226-mt/LLM-IAVC when it was checked","code_sha256":"107f2048a0518c96","code_sha256_prefix":"107f2048a0518c96","mcp_get_code":{"code_sha256":"107f2048a0518c96"}},{"arxiv_id":"2505.14679","arxiv_id_is_arxiv":true,"paper":"/paper/ultraedit-training-subject-and-memory-free","title":"UltraEdit: Training-, Subject-, and Memory-Free Lifelong Editing in Large Language Models","date":"2025-05-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"xiaojiegu/ultraedit","path":"editor/ultraedit.py","file_url":"https://github.com/xiaojiegu/ultraedit/blob/HEAD/editor/ultraedit.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, xiaojiegu/ultraedit when it was checked","code_sha256":"a8372336a87f5776","code_sha256_prefix":"a8372336a87f5776","mcp_get_code":{"code_sha256":"a8372336a87f5776"}},{"arxiv_id":"2503.14043","arxiv_id_is_arxiv":true,"paper":"/paper/learning-on-llm-output-signatures-for-gray","title":"Learning on LLM Output Signatures for gray-box LLM Behavior Analysis","date":"2025-03-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"barsguy/llm-output-signatures-network","path":"utils/dataset_preprocess.py","file_url":"https://github.com/barsguy/llm-output-signatures-network/blob/HEAD/utils/dataset_preprocess.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":"3cc2afd1c95778eb","code_sha256_prefix":"3cc2afd1c95778eb","mcp_get_code":{"code_sha256":"3cc2afd1c95778eb"}},{"arxiv_id":"2411.05007","arxiv_id_is_arxiv":true,"paper":"/paper/svdqunat-absorbing-outliers-by-low-rank","title":"SVDQuant: Absorbing Outliers by Low-Rank Components for 4-Bit Diffusion Models","date":"2024-11-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mit-han-lab/nunchaku","path":"nunchaku/utils.py","file_url":"https://github.com/mit-han-lab/nunchaku/blob/HEAD/nunchaku/utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"15c37ce4033a4043","code_sha256_prefix":"15c37ce4033a4043","mcp_get_code":{"code_sha256":"15c37ce4033a4043"}},{"arxiv_id":"2402.14154","arxiv_id_is_arxiv":true,"paper":"/paper/mm-soc-benchmarking-multimodal-large-language","title":"MM-Soc: Benchmarking Multimodal Large Language Models in Social Media Platforms","date":"2024-02-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"claws-lab/mmsoc","path":"mmsoc/utils/data_utils.py","file_url":"https://github.com/claws-lab/mmsoc/blob/HEAD/mmsoc/utils/data_utils.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, claws-lab/mmsoc when it was checked","code_sha256":"1f67e155cfe5cae9","code_sha256_prefix":"1f67e155cfe5cae9","mcp_get_code":{"code_sha256":"1f67e155cfe5cae9"}},{"arxiv_id":"2310.13336","arxiv_id_is_arxiv":true,"paper":"/paper/flair-a-country-scale-land-cover-semantic","title":"FLAIR: a Country-Scale Land Cover Semantic Segmentation Dataset From Multi-Source Optical Imagery","date":"2023-10-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ignf/flair-2-ai-challenge","path":"src/utils_dataset.py","file_url":"https://github.com/ignf/flair-2-ai-challenge/blob/HEAD/src/utils_dataset.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":"314a47dca812f4f4","code_sha256_prefix":"314a47dca812f4f4","mcp_get_code":{"code_sha256":"314a47dca812f4f4"}},{"arxiv_id":"2305.13277","arxiv_id_is_arxiv":true,"paper":"/paper/u-tilise-a-sequence-to-sequence-model-for","title":"U-TILISE: A Sequence-to-sequence Model for Cloud Removal in Optical Satellite Time Series","date":"2023-05-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"prs-eth/u-tilise","path":"lib/data_utils.py","file_url":"https://github.com/prs-eth/u-tilise/blob/HEAD/lib/data_utils.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":"50951d269094499f","code_sha256_prefix":"50951d269094499f","mcp_get_code":{"code_sha256":"50951d269094499f"}},{"arxiv_id":"2305.12191","arxiv_id_is_arxiv":true,"paper":"/paper/pointwise-mutual-information-based-metric-and","title":"Pointwise Mutual Information Based Metric and Decoding Strategy for Faithful Generation in Document Grounded Dialogs","date":"2023-05-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ynandwan/pmi-faith","path":"faithful-decode/models/modeling_nce.py","file_url":"https://github.com/ynandwan/pmi-faith/blob/HEAD/faithful-decode/models/modeling_nce.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"2dec641c76d04d78","code_sha256_prefix":"2dec641c76d04d78","mcp_get_code":{"code_sha256":"2dec641c76d04d78"}},{"arxiv_id":"2305.10028","arxiv_id_is_arxiv":true,"paper":"/paper/pyramid-diffusion-models-for-low-light-image","title":"Pyramid Diffusion Models For Low-light Image Enhancement","date":"2023-05-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"limuloo/PyDIff","path":"PyDiff/pydiff/archs/ddpm_arch.py","file_url":"https://github.com/limuloo/PyDIff/blob/HEAD/PyDiff/pydiff/archs/ddpm_arch.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":"NOASSERTION","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub could not classify the licence of this paper's repository, limuloo/PyDIff (NOASSERTION)","code_sha256":"65a5c76a5c2ce5a0","code_sha256_prefix":"65a5c76a5c2ce5a0","mcp_get_code":{"code_sha256":"65a5c76a5c2ce5a0"}},{"arxiv_id":"2304.09116","arxiv_id_is_arxiv":true,"paper":"/paper/naturalspeech-2-latent-diffusion-models-are","title":"NaturalSpeech 2: Latent Diffusion Models are Natural and Zero-Shot Speech and Singing Synthesizers","date":"2023-04-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lucidrains/naturalspeech2-pytorch","path":"naturalspeech2_pytorch/aligner.py","file_url":"https://github.com/lucidrains/naturalspeech2-pytorch/blob/HEAD/naturalspeech2_pytorch/aligner.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":"c6289707dcc4058f","code_sha256_prefix":"c6289707dcc4058f","mcp_get_code":{"code_sha256":"c6289707dcc4058f"}},{"arxiv_id":"2301.04944","arxiv_id_is_arxiv":true,"paper":"/paper/vits-for-sits-vision-transformers-for","title":"ViTs for SITS: Vision Transformers for Satellite Image Time Series","date":"2023-01-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"VSainteuf/pastis-benchmark","path":"code/collate.py","file_url":"https://github.com/VSainteuf/pastis-benchmark/blob/HEAD/code/collate.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":"314a47dca812f4f4","code_sha256_prefix":"314a47dca812f4f4","mcp_get_code":{"code_sha256":"314a47dca812f4f4"}},{"arxiv_id":"2210.03501","arxiv_id_is_arxiv":true,"paper":"/paper/towards-multi-modal-sarcasm-detection-via","title":"Towards Multi-Modal Sarcasm Detection via Hierarchical Congruity Modeling with Knowledge Enhancement","date":"2022-10-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"less-and-less-bugs/hkemodel","path":"utils/data_utils.py","file_url":"https://github.com/less-and-less-bugs/hkemodel/blob/HEAD/utils/data_utils.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":"0e688f22521702da","code_sha256_prefix":"0e688f22521702da","mcp_get_code":{"code_sha256":"0e688f22521702da"}},{"arxiv_id":"2207.11517","arxiv_id_is_arxiv":true,"paper":"/paper/contrastive-monotonic-pixel-level-modulation","title":"Contrastive Monotonic Pixel-Level Modulation","date":"2022-07-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lukun199/MonoPix","path":"models/networks.py","file_url":"https://github.com/lukun199/MonoPix/blob/HEAD/models/networks.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","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, lukun199/MonoPix when it was checked","code_sha256":"9457774086c9e2b5","code_sha256_prefix":"9457774086c9e2b5","mcp_get_code":{"code_sha256":"9457774086c9e2b5"}},{"arxiv_id":"2204.10757","arxiv_id_is_arxiv":true,"paper":"/paper/faithdial-a-faithful-benchmark-for","title":"FaithDial: A Faithful Benchmark for Information-Seeking Dialogue","date":"2022-04-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mcgill-nlp/faithdial","path":"models/modeling_nce.py","file_url":"https://github.com/mcgill-nlp/faithdial/blob/HEAD/models/modeling_nce.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":"2dec641c76d04d78","code_sha256_prefix":"2dec641c76d04d78","mcp_get_code":{"code_sha256":"2dec641c76d04d78"}},{"arxiv_id":"2204.08397","arxiv_id_is_arxiv":true,"paper":"/paper/fast-and-memory-efficient-network-towards","title":"Fast and Memory-Efficient Network Towards Efficient Image Super-Resolution","date":"2022-04-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"nju-jet/fmen","path":"train_fmen.py","file_url":"https://github.com/nju-jet/fmen/blob/HEAD/train_fmen.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"36de767510d9fb56","code_sha256_prefix":"36de767510d9fb56","mcp_get_code":{"code_sha256":"36de767510d9fb56"}},{"arxiv_id":"2108.06805","arxiv_id_is_arxiv":true,"paper":"/paper/ssh-a-self-supervised-framework-for-image","title":"SSH: A Self-Supervised Framework for Image Harmonization","date":"2021-08-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"vita-group/ssharmonization","path":"unet_tile_se_norm.py","file_url":"https://github.com/vita-group/ssharmonization/blob/HEAD/unet_tile_se_norm.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","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, vita-group/ssharmonization (NOASSERTION)","code_sha256":"2261fafa69f3393c","code_sha256_prefix":"2261fafa69f3393c","mcp_get_code":{"code_sha256":"2261fafa69f3393c"}},{"arxiv_id":"2107.06099","arxiv_id_is_arxiv":true,"paper":"/paper/drug-target-interaction-prediction-with-graph","title":"Drug-Target Interaction Prediction with Graph Attention networks","date":"2021-07-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Haiyang-W/DTI-GRAPH","path":"dataloader.py","file_url":"https://github.com/Haiyang-W/DTI-GRAPH/blob/HEAD/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":"9f0c1caa239cb57d","code_sha256_prefix":"9f0c1caa239cb57d","mcp_get_code":{"code_sha256":"9f0c1caa239cb57d"}},{"arxiv_id":"2010.09990","arxiv_id_is_arxiv":true,"paper":"/paper/the-open-catalyst-2020-oc20-dataset-and","title":"The Open Catalyst 2020 (OC20) Dataset and Community Challenges","date":"2020-10-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"gasteigerjo/ocp","path":"ocpmodels/common/gp_utils.py","file_url":"https://github.com/gasteigerjo/ocp/blob/HEAD/ocpmodels/common/gp_utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":false,"inline_ok_link":false,"withheld_clause":"MIT, as GitHub detects it on this paper's repository, gasteigerjo/ocp, is in the permissive set, but a licence decision keeps the body a pointer: the reason for that decision is not recorded with it","code_sha256":"db111ae38a618c0c","code_sha256_prefix":"db111ae38a618c0c","mcp_get_code":{"code_sha256":"db111ae38a618c0c"}},{"arxiv_id":"2009.01439","arxiv_id_is_arxiv":true,"paper":"/paper/dexterous-robotic-grasping-with-object","title":"Learning Dexterous Grasping with Object-Centric Visual Affordances","date":"2020-09-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"priyankamandikal/graff","path":"a2c_ppo_acktr/tensor_utils.py","file_url":"https://github.com/priyankamandikal/graff/blob/HEAD/a2c_ppo_acktr/tensor_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":"a0fa6632ba91e5df","code_sha256_prefix":"a0fa6632ba91e5df","mcp_get_code":{"code_sha256":"a0fa6632ba91e5df"}},{"arxiv_id":"2007.04921","arxiv_id_is_arxiv":true,"paper":"/paper/graph-neural-network-based-coarse-grained","title":"Graph Neural Network Based Coarse-Grained Mapping Prediction","date":"2020-06-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"rochesterxugroup/DSGPM","path":"dataset/collate.py","file_url":"https://github.com/rochesterxugroup/DSGPM/blob/HEAD/dataset/collate.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":"4235cc0d67195ab3","code_sha256_prefix":"4235cc0d67195ab3","mcp_get_code":{"code_sha256":"4235cc0d67195ab3"}},{"arxiv_id":"1906.00391","arxiv_id_is_arxiv":true,"paper":"/paper/190600391","title":"Sequential Scenario-Specific Meta Learner for Online Recommendation","date":"2019-06-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"THUDM/ScenarioMeta","path":"src/utils.py","file_url":"https://github.com/THUDM/ScenarioMeta/blob/HEAD/src/utils.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":"ec1263e33cee1529","code_sha256_prefix":"ec1263e33cee1529","mcp_get_code":{"code_sha256":"ec1263e33cee1529"}},{"arxiv_id":"1812.04960","arxiv_id_is_arxiv":true,"paper":"/paper/object-centric-auto-encoders-and-dummy","title":"Object-centric Auto-encoders and Dummy Anomalies for Abnormal Event Detection in Video","date":"2018-12-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"fjchange/object_centric_VAD","path":"object_detection/utils/shape_utils.py","file_url":"https://github.com/fjchange/object_centric_VAD/blob/HEAD/object_detection/utils/shape_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":"7c67344dbf665e91","code_sha256_prefix":"7c67344dbf665e91","mcp_get_code":{"code_sha256":"7c67344dbf665e91"}},{"arxiv_id":"1604.07143","arxiv_id_is_arxiv":true,"paper":"/paper/neural-random-forests","title":"Neural Random Forests","date":"2016-04-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"dhuynh95/cryptotree","path":"cryptotree/tree.py","file_url":"https://github.com/dhuynh95/cryptotree/blob/HEAD/cryptotree/tree.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"254afcaedc5de2a9","code_sha256_prefix":"254afcaedc5de2a9","mcp_get_code":{"code_sha256":"254afcaedc5de2a9"}},{"arxiv_id":"1603.08983","arxiv_id_is_arxiv":true,"paper":"/paper/adaptive-computation-time-for-recurrent","title":"Adaptive Computation Time for Recurrent Neural Networks","date":"2016-03-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ceyzaguirre4/adaptive_computation","path":"act/utils.py","file_url":"https://github.com/ceyzaguirre4/adaptive_computation/blob/HEAD/act/utils.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":"4ba0c3a66ce30058","code_sha256_prefix":"4ba0c3a66ce30058","mcp_get_code":{"code_sha256":"4ba0c3a66ce30058"}}],"record_sha256":"906fccf59c73e22f145f987b0f1491b630ee466c560c6a147915fdb71e11aece","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}