{"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/kl-div-loss","entry":"kl_div_loss","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":10,"n_papers_ran":10,"n_papers_ran_no_instrument_failure":10,"n_papers_ran_instrument_only":0,"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":1,"n_samples_ran":1,"n_samples_constructed":0,"n_samples_ran_checked":1,"n_samples_instrument":0,"n_samples_unverified":0,"n_samples_fingerprinted":1,"n_places":10,"n_places_pointer_only":10,"n_places_pointer_only_link_open":6,"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":0,"ran_fixture":0,"ran":1,"unverified":0},"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":"2412.12788","arxiv_id_is_arxiv":true,"paper":"/paper/ra-sgg-retrieval-augmented-scene-graph","title":"RA-SGG: Retrieval-Augmented Scene Graph Generation Framework via Multi-Prototype Learning","date":"2024-12-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"KanghoonYoon/torch-rasgg","path":"maskrcnn_benchmark/layers/kl_div_loss.py","file_url":"https://github.com/KanghoonYoon/torch-rasgg/blob/HEAD/maskrcnn_benchmark/layers/kl_div_loss.py","status":"ran","verification_level":1,"contract_check":null,"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, KanghoonYoon/torch-rasgg when it was checked","code_sha256":"382942f3ada73679","code_sha256_prefix":"382942f3ada73679","mcp_get_code":{"code_sha256":"382942f3ada73679"}},{"arxiv_id":"2406.02038","arxiv_id_is_arxiv":true,"paper":"/paper/leveraging-predicate-and-triplet-learning-for","title":"Leveraging Predicate and Triplet Learning for Scene Graph Generation","date":"2024-06-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jkli1998/drm","path":"maskrcnn_benchmark/layers/kl_div_loss.py","file_url":"https://github.com/jkli1998/drm/blob/HEAD/maskrcnn_benchmark/layers/kl_div_loss.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (MIT), but get_code serves the stored copy, first harvested from KanghoonYoon/torch-rasgg, and GitHub detected no licence in that repository when it was checked","code_sha256":"382942f3ada73679","code_sha256_prefix":"382942f3ada73679","mcp_get_code":{"code_sha256":"382942f3ada73679"}},{"arxiv_id":"2401.09786","arxiv_id_is_arxiv":true,"paper":"/paper/adaptive-self-training-framework-for-fine","title":"Adaptive Self-training Framework for Fine-grained Scene Graph Generation","date":"2024-01-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"rlqja1107/torch-ST-SGG","path":"maskrcnn_benchmark/layers/kl_div_loss.py","file_url":"https://github.com/rlqja1107/torch-ST-SGG/blob/HEAD/maskrcnn_benchmark/layers/kl_div_loss.py","status":"ran","verification_level":1,"contract_check":null,"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, rlqja1107/torch-ST-SGG when it was checked","code_sha256":"382942f3ada73679","code_sha256_prefix":"382942f3ada73679","mcp_get_code":{"code_sha256":"382942f3ada73679"}},{"arxiv_id":"2308.09472","arxiv_id_is_arxiv":true,"paper":"/paper/vision-relation-transformer-for-unbiased","title":"Vision Relation Transformer for Unbiased Scene Graph Generation","date":"2023-08-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"visinf/veto","path":"pysgg/layers/kl_div_loss.py","file_url":"https://github.com/visinf/veto/blob/HEAD/pysgg/layers/kl_div_loss.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (Apache-2.0), but get_code serves the stored copy, first harvested from KanghoonYoon/torch-rasgg, and GitHub detected no licence in that repository when it was checked","code_sha256":"382942f3ada73679","code_sha256_prefix":"382942f3ada73679","mcp_get_code":{"code_sha256":"382942f3ada73679"}},{"arxiv_id":"2308.06712","arxiv_id_is_arxiv":true,"paper":"/paper/compositional-feature-augmentation-for","title":"Compositional Feature Augmentation for Unbiased Scene Graph Generation","date":"2023-08-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hkust-longgroup/cfa","path":"maskrcnn_benchmark/layers/kl_div_loss.py","file_url":"https://github.com/hkust-longgroup/cfa/blob/HEAD/maskrcnn_benchmark/layers/kl_div_loss.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (MIT), but get_code serves the stored copy, first harvested from KanghoonYoon/torch-rasgg, and GitHub detected no licence in that repository when it was checked","code_sha256":"382942f3ada73679","code_sha256_prefix":"382942f3ada73679","mcp_get_code":{"code_sha256":"382942f3ada73679"}},{"arxiv_id":"2303.07096","arxiv_id_is_arxiv":true,"paper":"/paper/prototype-based-embedding-network-for-scene","title":"Prototype-based Embedding Network for Scene Graph Generation","date":"2023-03-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"VL-Group/PENET","path":"maskrcnn_benchmark/layers/kl_div_loss.py","file_url":"https://github.com/VL-Group/PENET/blob/HEAD/maskrcnn_benchmark/layers/kl_div_loss.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, VL-Group/PENET, 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":"382942f3ada73679","code_sha256_prefix":"382942f3ada73679","mcp_get_code":{"code_sha256":"382942f3ada73679"}},{"arxiv_id":"2201.06794","arxiv_id_is_arxiv":true,"paper":"/paper/resistance-training-using-prior-bias-toward","title":"Resistance Training using Prior Bias: toward Unbiased Scene Graph Generation","date":"2022-01-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ChCh1999/RTPB","path":"maskrcnn_benchmark/layers/kl_div_loss.py","file_url":"https://github.com/ChCh1999/RTPB/blob/HEAD/maskrcnn_benchmark/layers/kl_div_loss.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (MIT), but get_code serves the stored copy, first harvested from KanghoonYoon/torch-rasgg, and GitHub detected no licence in that repository when it was checked","code_sha256":"382942f3ada73679","code_sha256_prefix":"382942f3ada73679","mcp_get_code":{"code_sha256":"382942f3ada73679"}},{"arxiv_id":"2103.15365","arxiv_id_is_arxiv":true,"paper":"/paper/visual-distant-supervision-for-scene-graph","title":"Visual Distant Supervision for Scene Graph Generation","date":"2021-03-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"thunlp/VisualDS","path":"maskrcnn_benchmark/layers/kl_div_loss.py","file_url":"https://github.com/thunlp/VisualDS/blob/HEAD/maskrcnn_benchmark/layers/kl_div_loss.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (MIT), but get_code serves the stored copy, first harvested from KanghoonYoon/torch-rasgg, and GitHub detected no licence in that repository when it was checked","code_sha256":"382942f3ada73679","code_sha256_prefix":"382942f3ada73679","mcp_get_code":{"code_sha256":"382942f3ada73679"}},{"arxiv_id":"2002.11949","arxiv_id_is_arxiv":true,"paper":"/paper/unbiased-scene-graph-generation-from-biased","title":"Unbiased Scene Graph Generation from Biased Training","date":"2020-02-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"KaihuaTang/Scene-Graph-Benchmark.pytorch","path":"maskrcnn_benchmark/layers/kl_div_loss.py","file_url":"https://github.com/KaihuaTang/Scene-Graph-Benchmark.pytorch/blob/HEAD/maskrcnn_benchmark/layers/kl_div_loss.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, KaihuaTang/Scene-Graph-Benchmark.pytorch, 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":"382942f3ada73679","code_sha256_prefix":"382942f3ada73679","mcp_get_code":{"code_sha256":"382942f3ada73679"}},{"arxiv_id":"aaai_25356","arxiv_id_is_arxiv":false,"paper":null,"title":"AAAI id aaai_25356","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"wanglei0618/A-PFG","path":"maskrcnn_benchmark/layers/kl_div_loss.py","file_url":"https://github.com/wanglei0618/A-PFG/blob/HEAD/maskrcnn_benchmark/layers/kl_div_loss.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (MIT), but get_code serves the stored copy, first harvested from KanghoonYoon/torch-rasgg, and GitHub detected no licence in that repository when it was checked","code_sha256":"382942f3ada73679","code_sha256_prefix":"382942f3ada73679","mcp_get_code":{"code_sha256":"382942f3ada73679"}}],"record_sha256":"23caa586bb2ac3ea30913ad8fc721cfbb174052fad1eef2c24669c1ae85363df","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}