{"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/reporthook","entry":"reporthook","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":5,"n_papers_ran":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":4,"n_samples_ran":1,"n_samples_fingerprinted":0,"n_places":5,"n_places_pointer_only":2,"by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":1,"ran_fixture":0,"ran":0,"unverified":3},"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":"2205.01316","paper":"/paper/hl-net-heterophily-learning-network-for-scene","title":"HL-Net: Heterophily Learning Network for Scene Graph Generation","date":"2022-05-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"siml3/HL-Net","path":"maskrcnn_benchmark/modeling/roi_heads/relation_head/model_mp.py","file_url":"https://github.com/siml3/HL-Net/blob/HEAD/maskrcnn_benchmark/modeling/roi_heads/relation_head/model_mp.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"cec8c324e96be444","mcp_get_code":{"code_sha256":"cec8c324e96be444"}},{"arxiv_id":"2107.12309","paper":"/paper/spatial-temporal-transformer-for-dynamic","title":"Spatial-Temporal Transformer for Dynamic Scene Graph Generation","date":"2021-07-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yrcong/STTran","path":"lib/word_vectors.py","file_url":"https://github.com/yrcong/STTran/blob/HEAD/lib/word_vectors.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"e31361e8a2fbb396","mcp_get_code":{"code_sha256":"e31361e8a2fbb396"}},{"arxiv_id":"1812.01880","paper":"/paper/learning-to-compose-dynamic-tree-structures","title":"Learning to Compose Dynamic Tree Structures for Visual Contexts","date":"2018-12-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"KaihuaTang/VCTree-Scene-Graph-Generation","path":"lib/word_vectors.py","file_url":"https://github.com/KaihuaTang/VCTree-Scene-Graph-Generation/blob/HEAD/lib/word_vectors.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"b0ccc0da43f7ec20","mcp_get_code":{"code_sha256":"b0ccc0da43f7ec20"}},{"arxiv_id":"1611.01603","paper":"/paper/bidirectional-attention-flow-for-machine","title":"Bidirectional Attention Flow for Machine Comprehension","date":"2016-11-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lmn-extracts/dcn_plus","path":"question_answering/preprocessing/squad_preprocess.py","file_url":"https://github.com/lmn-extracts/dcn_plus/blob/HEAD/question_answering/preprocessing/squad_preprocess.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"9724d0da37841e48","mcp_get_code":{"code_sha256":"9724d0da37841e48"}},{"arxiv_id":"1606.05250","paper":"/paper/squad-100000-questions-for-machine","title":"SQuAD: 100,000+ Questions for Machine Comprehension of Text","date":"2016-06-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":null,"inline_ok":false,"code_sha256_prefix":"9724d0da37841e48","mcp_get_code":{"code_sha256":"9724d0da37841e48"}}]}