{"about":{"site":"https://codewithpapers.app","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.","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"},"url":"/code/drop-feature","entry":"drop_feature","source":"Syntology graph, per-sample; not an archive number","read_at":"2026-09-24T18:15:14+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.","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; our fixture could not drive it","ran":"ran on a synthesized input","unverified":"unverified (harvested, no recorded run)"},"n_papers":10,"n_papers_ran":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":3,"n_samples_ran":2,"n_samples_fingerprinted":2,"n_places":10,"n_places_pointer_only":4,"by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":1,"ran_fixture":0,"ran":1,"unverified":1},"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":"2506.23825","paper":"/paper/flash-vstream-efficient-real-time","title":"Flash-VStream: Efficient Real-Time Understanding for Long Video Streams","date":"2025-06-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"IVGSZ/Flash-VStream","path":"Flash-VStream-Qwen/models/vstream_qwen2vl_realtime.py","file_url":"https://github.com/IVGSZ/Flash-VStream/blob/HEAD/Flash-VStream-Qwen/models/vstream_qwen2vl_realtime.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"88e007251e2c289d","mcp_get_code":{"code_sha256":"88e007251e2c289d"}},{"arxiv_id":"2412.09261","paper":"/paper/single-view-graph-contrastive-learning-with","title":"Single-View Graph Contrastive Learning with Soft Neighborhood Awareness","date":"2024-12-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"sunisfighting/signa","path":"utils.py","file_url":"https://github.com/sunisfighting/signa/blob/HEAD/utils.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"22bfb6129463d322","mcp_get_code":{"code_sha256":"22bfb6129463d322"}},{"arxiv_id":"2410.14886","paper":"/paper/zero-shot-generalist-graph-anomaly-detection","title":"Zero-shot Generalist Graph Anomaly Detection with Unified Neighborhood Prompts","date":"2024-10-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mala-lab/UNPrompt","path":"pretrain.py","file_url":"https://github.com/mala-lab/UNPrompt/blob/HEAD/pretrain.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"22bfb6129463d322","mcp_get_code":{"code_sha256":"22bfb6129463d322"}},{"arxiv_id":"2409.16670","paper":"/paper/graphlora-structure-aware-contrastive-low","title":"GraphLoRA: Structure-Aware Contrastive Low-Rank Adaptation for Cross-Graph Transfer Learning","date":"2024-09-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"allminerlab/graphlora","path":"model/GRACE_model.py","file_url":"https://github.com/allminerlab/graphlora/blob/HEAD/model/GRACE_model.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"22bfb6129463d322","mcp_get_code":{"code_sha256":"22bfb6129463d322"}},{"arxiv_id":"2310.03977","paper":"/paper/perfect-alignment-may-be-poisonous-to-graph","title":"Perfect Alignment May be Poisonous to Graph Contrastive Learning","date":"2023-10-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"somebodyhh1/GRACEIS","path":"model.py","file_url":"https://github.com/somebodyhh1/GRACEIS/blob/HEAD/model.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"22bfb6129463d322","mcp_get_code":{"code_sha256":"22bfb6129463d322"}},{"arxiv_id":"2309.13944","paper":"/paper/provable-training-for-graph-contrastive-1","title":"Provable Training for Graph Contrastive Learning","date":"2023-09-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"VoidHaruhi/POT-GCL","path":"GRACE/model.py","file_url":"https://github.com/VoidHaruhi/POT-GCL/blob/HEAD/GRACE/model.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"22bfb6129463d322","mcp_get_code":{"code_sha256":"22bfb6129463d322"}},{"arxiv_id":"2306.10683","paper":"/paper/spatial-temporal-graph-learning-with","title":"Spatial-Temporal Graph Learning with Adversarial Contrastive Adaptation","date":"2023-06-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"HKUDS/GraphST","path":"code/model.py","file_url":"https://github.com/HKUDS/GraphST/blob/HEAD/code/model.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"22bfb6129463d322","mcp_get_code":{"code_sha256":"22bfb6129463d322"}},{"arxiv_id":"2110.14038","paper":"/paper/robustness-of-graph-neural-networks-at-scale","title":"Robustness of Graph Neural Networks at Scale","date":"2021-10-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ventr1c/res-gcl","path":"model.py","file_url":"https://github.com/ventr1c/res-gcl/blob/HEAD/model.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"22bfb6129463d322","mcp_get_code":{"code_sha256":"22bfb6129463d322"}},{"arxiv_id":"2106.12484","paper":"/paper/from-canonical-correlation-analysis-to-self","title":"From Canonical Correlation Analysis to Self-supervised Graph Neural Networks","date":"2021-06-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hengruizhang98/CCA-SSG","path":"aug.py","file_url":"https://github.com/hengruizhang98/CCA-SSG/blob/HEAD/aug.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"3d974267cf1bef51","mcp_get_code":{"code_sha256":"3d974267cf1bef51"}},{"arxiv_id":"2006.04131","paper":"/paper/deep-graph-contrastive-representation","title":"Deep Graph Contrastive Representation Learning","date":"2020-06-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":null,"inline_ok":false,"code_sha256_prefix":"22bfb6129463d322","mcp_get_code":{"code_sha256":"22bfb6129463d322"}}]}