{"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":"/dataset/vrd","name":"VRD","full_name":"Visual Relationship Detection dataset","description_markdown":"The Visual Relationship Dataset (**VRD**) contains 4000 images for training and 1000 for testing annotated with visual relationships. Bounding boxes are annotated with a label containing 100 unary predicates. These labels refer to animals, vehicles, clothes and generic objects. Pairs of bounding boxes are annotated with a label containing 70 binary predicates. These labels refer to actions, prepositions, spatial relations, comparatives or preposition phrases. The dataset has 37993 instances of visual relationships and 6672 types of relationships. 1877 instances of relationships occur only in the test set and they are used to evaluate the zero-shot learning scenario.\r\n\r\nSource: [Compensating Supervision Incompleteness with Prior Knowledge in Semantic Image Interpretation](https://arxiv.org/abs/1910.00462)\r\nImage Source: [https://cs.stanford.edu/people/ranjaykrishna/vrd/](https://cs.stanford.edu/people/ranjaykrishna/vrd/)","description_withheld":null,"homepage":"https://cs.stanford.edu/people/ranjaykrishna/vrd/","introduced_date":"2016-01-01","introduced_date_note":null,"introduced_by":{"paper":"/paper/visual-relationship-detection-with-language","title":"Visual Relationship Detection with Language Priors","first_author":"Cewu Lu","url":null},"license":{"name":"Unknown","url":null},"modalities":[{"name":"Images","url":"/datasets/modality/images"},{"name":"Texts","url":"/datasets/modality/texts"}],"tasks":[{"name":"Scene Graph Generation","url":"/task/scene-graph-generation","datasets_with_task":"/datasets/task/scene-graph-generation"},{"name":"Visual Relationship Detection","url":"/task/visual-relationship-detection","datasets_with_task":"/datasets/task/visual-relationship-detection"},{"name":"Scene Graph Detection","url":"/task/scene-graph-detection","datasets_with_task":"/datasets/task/scene-graph-detection"},{"name":"Relationship Detection","url":"/task/relationship-detection","datasets_with_task":"/datasets/task/relationship-detection"}],"languages":[],"variants":["VRD","VRD Predicate Detection","VRD Phrase Detection","VRD Relationship Detection"],"data_loaders":[],"num_papers_in_archive":151,"source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28"},"benchmarks":[{"leaderboard":"/sota/visual-relationship-detection-on-vrd-1","task":"Visual Relationship Detection","dataset_variant":"VRD Relationship Detection","rows":8,"metrics":["R@100","R@50"],"first_row_in_archive_order":{"model":"Yu et. al [[Yu et al.2017a]]","paper":"/paper/visual-relationship-detection-with-internal","metrics":{"R@100":"31.89","R@50":"22.68"},"code_links":[]},"note":"rows are the archive's own order at snapshot; nothing here re-ranks them"},{"leaderboard":"/sota/visual-relationship-detection-on-vrd","task":"Visual Relationship Detection","dataset_variant":"VRD Predicate Detection","rows":7,"metrics":["R@100","R@50"],"first_row_in_archive_order":{"model":"Yu et. al [[Yu et al.2017a]]","paper":"/paper/visual-relationship-detection-with-internal","metrics":{"R@100":"94.65","R@50":"85.64"},"code_links":[]},"note":"rows are the archive's own order at snapshot; nothing here re-ranks them"},{"leaderboard":"/sota/visual-relationship-detection-on-vrd-phrase","task":"Visual Relationship Detection","dataset_variant":"VRD Phrase Detection","rows":7,"metrics":["R@100","R@50"],"first_row_in_archive_order":{"model":"Yu et. al [[Yu et al.2017a]]","paper":"/paper/visual-relationship-detection-with-internal","metrics":{"R@100":"29.43","R@50":"26.32"},"code_links":[]},"note":"rows are the archive's own order at snapshot; nothing here re-ranks them"},{"leaderboard":"/sota/scene-graph-generation-on-vrd","task":"Scene Graph Generation","dataset_variant":"VRD","rows":2,"metrics":["Recall@50"],"first_row_in_archive_order":{"model":"FactorizableNet","paper":"/paper/factorizable-net-an-efficient-subgraph-based","metrics":{"Recall@50":"18.32"},"code_links":[{"title":"yikang-li/FactorizableNet","url":"https://github.com/yikang-li/FactorizableNet"}]},"note":"rows are the archive's own order at snapshot; nothing here re-ranks them"},{"leaderboard":"/sota/visual-relationship-detection-on-vrd-2","task":"Visual Relationship Detection","dataset_variant":"VRD","rows":1,"metrics":["R@50 k=1"],"first_row_in_archive_order":{"model":"Ours - v","paper":"/paper/improving-visual-relation-detection-using","metrics":{"R@50 k=1":"15"},"code_links":[{"title":"Sina-Baharlou/Depth-VRD","url":"https://github.com/Sina-Baharlou/Depth-VRD"}]},"note":"rows are the archive's own order at snapshot; nothing here re-ranks them"}],"papers":{"order":"date (newest first), then slug","population":"every paper with a leaderboard row on this dataset's benchmarks (the benchmark-backed subset): the archive's own papers-using-this-dataset list was never published, so this is not that list; num_papers_in_archive is the archive's own count","page":1,"pages_in_order":1,"rows_per_page":100,"shown":10,"of":10,"counts":{"papers_with_a_benchmark_row":10,"with_a_code_link":7,"where_syntology_ran_a_sample":1,"not_listed_spam_title":0,"listed":10,"listed_where_code_ran":1,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":1,"every_run_a_failure_of_syntologys_instrument":0,"listed_with_a_run_with_no_instrument_failure":1,"listed_every_run_a_failure_of_syntologys_instrument":0,"filter":{"states":["a run with no instrument failure","any run, instrument failures included"],"default":"a run with no instrument failure","note":"on the 'only where code ran' pages the default hides, in the browser, the rows where every run was a failure of Syntology's instrument; the second state shows them again. Rows are hidden, never re-ordered; these twins list every row"}},"definition":"distinct papers with at least one leaderboard row on this dataset's benchmarks; 'where Syntology ran a sample' counts papers with at least one harvested sample that ran, which is not a correctness claim"},"items":[{"paper":"/paper/improving-visual-relation-detection-using","slug":"improving-visual-relation-detection-using","title":"Improving Visual Relation Detection using Depth Maps","date":"2019-05-02","arxiv_id":"1905.00966","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/block-bilinear-superdiagonal-fusion-for","slug":"block-bilinear-superdiagonal-fusion-for","title":"BLOCK: Bilinear Superdiagonal Fusion for Visual Question Answering and Visual Relationship Detection","date":"2019-01-31","arxiv_id":"1902.00038","rows_on_this_dataset":3,"code_links":1,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":2,"samples_ran":2,"samples_constructed":0,"samples_ran_checked":2,"samples_ran_instrument_failed":0,"samples_unverified":0,"pointer_only_for_licence":0,"official":{"repos":["Cadene/block.bootstrap.pytorch"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/block-bilinear-superdiagonal-fusion-for#ran","syntology_url":"https://syntology.ai/paper/1902.00038","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1902.00038"}}}},{"paper":"/paper/factorizable-net-an-efficient-subgraph-based","slug":"factorizable-net-an-efficient-subgraph-based","title":"Factorizable Net: An Efficient Subgraph-based Framework for Scene Graph Generation","date":"2018-06-29","arxiv_id":"1806.11538","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/visual-relationship-detection-with-deep","slug":"visual-relationship-detection-with-deep","title":"Visual relationship detection with deep structural ranking","date":"2018-04-27","arxiv_id":null,"rows_on_this_dataset":2,"code_links":1,"syntology":null},{"paper":"/paper/weakly-supervised-learning-of-visual","slug":"weakly-supervised-learning-of-visual","title":"Weakly-supervised learning of visual relations","date":"2017-07-29","arxiv_id":"1707.09472","rows_on_this_dataset":3,"code_links":0,"syntology":null},{"paper":"/paper/visual-relationship-detection-with-internal","slug":"visual-relationship-detection-with-internal","title":"Visual Relationship Detection with Internal and External Linguistic Knowledge Distillation","date":"2017-07-28","arxiv_id":"1707.09423","rows_on_this_dataset":3,"code_links":0,"syntology":null},{"paper":"/paper/detecting-visual-relationships-with-deep","slug":"detecting-visual-relationships-with-deep","title":"Detecting Visual Relationships with Deep Relational Networks","date":"2017-04-11","arxiv_id":"1704.03114","rows_on_this_dataset":3,"code_links":1,"syntology":null},{"paper":"/paper/deep-variation-structured-reinforcement","slug":"deep-variation-structured-reinforcement","title":"Deep Variation-structured Reinforcement Learning for Visual Relationship and Attribute Detection","date":"2017-03-08","arxiv_id":"1703.03054","rows_on_this_dataset":2,"code_links":1,"syntology":null},{"paper":"/paper/visual-translation-embedding-network-for","slug":"visual-translation-embedding-network-for","title":"Visual Translation Embedding Network for Visual Relation Detection","date":"2017-02-27","arxiv_id":"1702.08319","rows_on_this_dataset":3,"code_links":2,"syntology":null},{"paper":"/paper/visual-relationship-detection-with-language","slug":"visual-relationship-detection-with-language","title":"Visual Relationship Detection with Language Priors","date":"2016-07-31","arxiv_id":"1608.00187","rows_on_this_dataset":4,"code_links":0,"syntology":null}],"full_list":"papers_with_a_benchmark_row: every listed paper, in this order"},"papers_with_a_benchmark_row":[{"paper":"/paper/improving-visual-relation-detection-using","slug":"improving-visual-relation-detection-using","title":"Improving Visual Relation Detection using Depth Maps","date":"2019-05-02","arxiv_id":"1905.00966","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/block-bilinear-superdiagonal-fusion-for","slug":"block-bilinear-superdiagonal-fusion-for","title":"BLOCK: Bilinear Superdiagonal Fusion for Visual Question Answering and Visual Relationship Detection","date":"2019-01-31","arxiv_id":"1902.00038","rows_on_this_dataset":3,"code_links":1,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":2,"samples_ran":2,"samples_constructed":0,"samples_ran_checked":2,"samples_ran_instrument_failed":0,"samples_unverified":0,"pointer_only_for_licence":0,"official":{"repos":["Cadene/block.bootstrap.pytorch"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/block-bilinear-superdiagonal-fusion-for#ran","syntology_url":"https://syntology.ai/paper/1902.00038","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1902.00038"}}}},{"paper":"/paper/factorizable-net-an-efficient-subgraph-based","slug":"factorizable-net-an-efficient-subgraph-based","title":"Factorizable Net: An Efficient Subgraph-based Framework for Scene Graph Generation","date":"2018-06-29","arxiv_id":"1806.11538","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/visual-relationship-detection-with-deep","slug":"visual-relationship-detection-with-deep","title":"Visual relationship detection with deep structural ranking","date":"2018-04-27","arxiv_id":null,"rows_on_this_dataset":2,"code_links":1,"syntology":null},{"paper":"/paper/weakly-supervised-learning-of-visual","slug":"weakly-supervised-learning-of-visual","title":"Weakly-supervised learning of visual relations","date":"2017-07-29","arxiv_id":"1707.09472","rows_on_this_dataset":3,"code_links":0,"syntology":null},{"paper":"/paper/visual-relationship-detection-with-internal","slug":"visual-relationship-detection-with-internal","title":"Visual Relationship Detection with Internal and External Linguistic Knowledge Distillation","date":"2017-07-28","arxiv_id":"1707.09423","rows_on_this_dataset":3,"code_links":0,"syntology":null},{"paper":"/paper/detecting-visual-relationships-with-deep","slug":"detecting-visual-relationships-with-deep","title":"Detecting Visual Relationships with Deep Relational Networks","date":"2017-04-11","arxiv_id":"1704.03114","rows_on_this_dataset":3,"code_links":1,"syntology":null},{"paper":"/paper/deep-variation-structured-reinforcement","slug":"deep-variation-structured-reinforcement","title":"Deep Variation-structured Reinforcement Learning for Visual Relationship and Attribute Detection","date":"2017-03-08","arxiv_id":"1703.03054","rows_on_this_dataset":2,"code_links":1,"syntology":null},{"paper":"/paper/visual-translation-embedding-network-for","slug":"visual-translation-embedding-network-for","title":"Visual Translation Embedding Network for Visual Relation Detection","date":"2017-02-27","arxiv_id":"1702.08319","rows_on_this_dataset":3,"code_links":2,"syntology":null},{"paper":"/paper/visual-relationship-detection-with-language","slug":"visual-relationship-detection-with-language","title":"Visual Relationship Detection with Language Priors","date":"2016-07-31","arxiv_id":"1608.00187","rows_on_this_dataset":4,"code_links":0,"syntology":null}],"papers_where_code_ran":1,"papers_where_code_ran_first_page":"/dataset/vrd/papers/ran/1","papers_where_code_ran_caption":"We ran code from the paper's repository; we did not run it on this dataset or check it against this dataset's benchmarks.","pages":[{"order":"ran","page":1,"of":1,"url":"/dataset/vrd/papers/ran/1","json":"/dataset/vrd/papers/ran/1.json","rows":1}],"row_route":"each paper's syntology object carries sample_list (this site's paper page, #ran), syntology_url (syntology.ai's page for the paper, only when that route probed live) and mcp (the agent call that lists the paper's harvested samples; not a verdict on the paper)","developers":"https://syntology.ai/developers","syntology_totals":{"read_at":"2026-10-05T00:36:11+00:00","papers_with_samples":1,"samples_harvested":2,"samples_ran":2,"samples_constructed":0,"samples_ran_checked":2,"samples_ran_instrument_failed":0,"samples_unverified":0,"pointer_only_for_licence":0,"papers_with_no_sample_that_ran":0,"papers_with_a_sample_that_ran":1,"papers_with_a_run_with_no_instrument_failure":1,"papers_where_every_run_was_an_instrument_failure":0,"note":"the per-paper counts of every listed paper (all pages), summed; not a rate"},"key_notes":{"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'","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)"},"since_archive_judged":{"papers":0,"papers_placed":0,"judged_by":{"model":"a model","models_as_recorded":[],"from":"lb_rows_run_verified.jsonl: each record's `model` field (the extractor's call that wrote decisions[])"},"note":"a model's judgement from the paper's own tables that they report on this leaderboard, not a result: no value from a paper that was not placed is printed or carried here; papers counts each paper once over these leaderboards","backfill":"8,886 of 18,637 newer papers checked so far (733 more had nothing to place; 41 could not be read)","backfill_complete":false,"leaderboards":[]},"papers_note":"The archive never published its papers-using-dataset list; these are papers with a leaderboard row on this dataset's benchmarks.","record_sha256":"ecae24398652c7bb3a2ed132e9b2320a9f2fb5326fb7c2a06bc104e4c02112dc","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}