{"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/load-network","entry":"load_network","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":5,"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":4},"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":"2107.03573","paper":"/paper/deep-structural-point-process-for-learning","title":"Deep Structural Point Process for Learning Temporal Interaction Networks","date":"2021-07-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"cjx96/DSPP","path":"DSPP_src/utils/LoadGraph.py","file_url":"https://github.com/cjx96/DSPP/blob/HEAD/DSPP_src/utils/LoadGraph.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"852c537cdce81cb7","mcp_get_code":{"code_sha256":"852c537cdce81cb7"}},{"arxiv_id":"2105.07239","paper":"/paper/ageflow-conditional-age-progression-and","title":"AgeFlow: Conditional Age Progression and Regression with Normalizing Flows","date":"2021-05-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Hzzone/AgeFlow","path":"flow/models.py","file_url":"https://github.com/Hzzone/AgeFlow/blob/HEAD/flow/models.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"2f38c15938410aa5","mcp_get_code":{"code_sha256":"2f38c15938410aa5"}},{"arxiv_id":"2104.10510","paper":"/paper/balanced-knowledge-distillation-for-long-1","title":"Balanced Knowledge Distillation for Long-tailed Learning","date":"2021-04-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"EricZsy/BalancedKnowledgeDistillation","path":"train_student.py","file_url":"https://github.com/EricZsy/BalancedKnowledgeDistillation/blob/HEAD/train_student.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"736304c34e6b4815","mcp_get_code":{"code_sha256":"736304c34e6b4815"}},{"arxiv_id":"1908.01207","paper":"/paper/predicting-dynamic-embedding-trajectory-in","title":"Predicting Dynamic Embedding Trajectory in Temporal Interaction Networks","date":"2019-08-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"srijankr/jodie","path":"library_data.py","file_url":"https://github.com/srijankr/jodie/blob/HEAD/library_data.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"be91c7358bc3cdfa","mcp_get_code":{"code_sha256":"be91c7358bc3cdfa"}},{"arxiv_id":"1905.03422","paper":"/paper/190503422","title":"Frustratingly Easy Person Re-Identification: Generalizing Person Re-ID in Practice","date":"2019-05-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"BJTUJia/person_reID_DualNorm","path":"person_reID_DualNorm/test_grid.py","file_url":"https://github.com/BJTUJia/person_reID_DualNorm/blob/HEAD/person_reID_DualNorm/test_grid.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"819089c23d7a6be3","mcp_get_code":{"code_sha256":"819089c23d7a6be3"}}]}