{"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":"/paper/hierarchical-memory-matching-network-for","title":"Hierarchical Memory Matching Network for Video Object Segmentation","arxiv_id":"2109.11404","date":"2021-09-23","proceeding":"ICCV 2021 10","authors":["Hongje Seong","Seoung Wug Oh","Joon-Young Lee","Seongwon Lee","Suhyeon Lee","Euntai Kim"],"abstract":"We present Hierarchical Memory Matching Network (HMMN) for semi-supervised video object segmentation. Based on a recent memory-based method [33], we propose two advanced memory read modules that enable us to perform memory reading in multiple scales while exploiting temporal smoothness. We first propose a kernel guided memory matching module that replaces the non-local dense memory read, commonly adopted in previous memory-based methods. The module imposes the temporal smoothness constraint in the memory read, leading to accurate memory retrieval. More importantly, we introduce a hierarchical memory matching scheme and propose a top-k guided memory matching module in which memory read on a fine-scale is guided by that on a coarse-scale. With the module, we perform memory read in multiple scales efficiently and leverage both high-level semantic and low-level fine-grained memory features to predict detailed object masks. Our network achieves state-of-the-art performance on the validation sets of DAVIS 2016/2017 (90.8% and 84.7%) and YouTube-VOS 2018/2019 (82.6% and 82.5%), and test-dev set of DAVIS 2017 (78.6%). The source code and model are available online: https://github.com/Hongje/HMMN.","url_abs":"https://arxiv.org/abs/2109.11404v1","url_pdf":"https://arxiv.org/pdf/2109.11404v1.pdf","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","row_kind":"abstracts"},"code_links":[{"paper_slug":"hierarchical-memory-matching-network-for","repo_url":"https://github.com/hongje/hmmn","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"ok"}}],"tasks":[{"task_slug":"object","task_name":"Object"},{"task_slug":"retrieval","task_name":"Retrieval"},{"task_slug":"semantic-segmentation","task_name":"Semantic Segmentation"},{"task_slug":"semi-supervised-video-object-segmentation","task_name":"Semi-Supervised Video Object Segmentation"},{"task_slug":"video-object-segmentation","task_name":"Video Object Segmentation"},{"task_slug":"video-semantic-segmentation","task_name":"Video Semantic Segmentation"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[{"leaderboard":"/sota/semi-supervised-video-object-segmentation-on-20","task":"Semi-Supervised Video Object Segmentation","dataset":"DAVIS (no YouTube-VOS training)","model":"HMMN","rank_in_archive_order":1,"of":26,"metrics":{"D16 val (F)":"90.6","D16 val (G)":"89.4","D16 val (J)":"88.2","D17 val (F)":"83.1","D17 val (G)":"80.4","D17 val (J)":"77.7","FPS":"10.0"},"uses_additional_data":false},{"leaderboard":"/sota/visual-object-tracking-on-davis-2016","task":"Semi-Supervised Video Object Segmentation","dataset":"DAVIS 2016","model":"HMMN","rank_in_archive_order":24,"of":78,"metrics":{"F-measure (Mean)":"92.0","J&F":"90.8","Jaccard (Mean)":"89.6"},"uses_additional_data":true},{"leaderboard":"/sota/semi-supervised-video-object-segmentation-on-1","task":"Semi-Supervised Video Object Segmentation","dataset":"DAVIS 2017 (test-dev)","model":"HMMN","rank_in_archive_order":24,"of":59,"metrics":{"F-measure (Mean)":"82.5","J&F":"78.6","Jaccard (Mean)":"74.7"},"uses_additional_data":true},{"leaderboard":"/sota/visual-object-tracking-on-davis-2017","task":"Semi-Supervised Video Object Segmentation","dataset":"DAVIS 2017 (val)","model":"HMMN","rank_in_archive_order":27,"of":81,"metrics":{"F-measure (Mean)":"87.5","J&F":"84.7","Jaccard (Mean)":"81.9"},"uses_additional_data":true},{"leaderboard":"/sota/video-object-segmentation-on-youtube-vos","task":"Semi-Supervised Video Object Segmentation","dataset":"YouTube-VOS 2018","model":"HMMN","rank_in_archive_order":31,"of":53,"metrics":{"F-Measure (Seen)":"87.0","F-Measure (Unseen)":"84.6","Jaccard (Seen)":"82.1","Jaccard (Unseen)":"76.8","Overall":"82.6"},"uses_additional_data":true}],"syntology":{"syntology_url":"https://syntology.ai/paper/2109.11404","atlas_url":"https://app.syntology.ai/?focus=2109.11404","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2109.11404"},"calls":[{"tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2109.11404"},"returns":"the samples harvested from this paper, each with its run record; it does not verify the paper"},{"tool":"get_code","arguments_in":"samples[].code_sha256","returns":"one stored sample by its code_sha256; not shown on this site"}]},"developers":"https://syntology.ai/developers","held":true,"reason":"in_graph_layer","checked_against":null,"agent_calls":[{"tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2109.11404"},"call":"get_harvested_code_for_paper(arxiv_id=\"2109.11404\")"},{"tool":"get_code","arguments_in":{"code_sha256":"syntology.samples[].code_sha256"},"call":"get_code(code_sha256=\"…\")"},{"tool":"get_citation_path","arguments":{"paper_1":"2109.11404"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"2109.11404\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"2109.11404"},"call":"get_concepts_for_paper(arxiv_id=\"2109.11404\")"}],"by_repo":[{"repo":"hongje/hmmn","kind":"official","samples":8,"ran":5,"instrument":0,"unverified":3}],"by_repo_is":"one row per repository in the archive's code links, Syntology's graph links or the samples; samples 0 means no sample is linked to this paper, a statement about Syntology's coverage, not about the repository: with harvested_for_other_papers present, Syntology harvested the repository for that many other papers, and without it, Syntology harvested nothing from it; placed_by_identical_code counts samples whose link records no repository, placed here because identical code was harvested from this repository for another paper; ran counts executions on a synthesized input and instrument counts failures of Syntology's instrument, not of the code","assemblies":[{"assembly_sha256":"5ead06736be4ad63","source_kind":"harvested","method_name":"Hierarchical Memory Matching Network","realizes_method":"Hierarchical Memory Matching Network","graph_method":"Hierarchical Memory Matching Network","realizes_severed":false,"claim":"The code implements a Hierarchical Memory Matching Network for semi-supervised video object segmentation, which uses multi-scale memory reading and temporal smoothness exploitation.","centrality":"contribution","entry":"HMMN","entry_sha256":"e25774e68ee0a333","n_bricks":9,"bricks":[{"entry":"HMMN","code_sha256":"e25774e68ee0a333","role":"entry","order":0,"level":0,"status":"unverified"},{"entry":"Decoder","code_sha256":"4d499c7a1c54839a","role":"model","order":1,"level":1,"status":"ran"},{"entry":"Encoder_M","code_sha256":"0b783799ea293620","role":"model","order":2,"level":0,"status":"unverified"},{"entry":"Encoder_Q","code_sha256":"6d12e62e34457264","role":"model","order":3,"level":0,"status":"unverified"},{"entry":"KeyValue","code_sha256":"3929cee794ef7996","role":"model","order":4,"level":1,"status":"ran"},{"entry":"Memory","code_sha256":"c73e4c9b0c5e54c7","role":"model","order":5,"level":1,"status":"ran"},{"entry":"Memory_topk","code_sha256":"3c110faa7db7d2ff","role":"model","order":6,"level":1,"status":"ran"},{"entry":"Refine","code_sha256":"0aa276a048959a5a","role":"model","order":7,"level":1,"status":"ran"},{"entry":"ResBlock","code_sha256":"b06c96717eec15da","role":"helper","order":8,"level":1,"status":"ran"}],"ran_individually":6,"ran_individually_constructed":5,"ran_individually_by_status":{"ran":6},"end_to_end":{"ran":false,"level":0},"level_lowered":null,"claim_match":"IMPLEMENTS","claim_match_rule":"single_judge","claim_match_basis":"judge:global.anthropic.claude-sonnet-4-5-20250929-v1:0","claim_match_judges":["global.anthropic.claude-sonnet-4-5-20250929-v1:0"],"label_verdict":"matches","label_verdict_judged":true,"suggested_method":null,"batch_at":"2026-09-09T22:44:46+00:00","sibling_group":"ccb785e3a24b","n_siblings":0,"retention":"defer","provenance":"assembly:harvest_method_v6","attached_at":"2026-09-09T22:44:46+00:00","attached_provenance":"assembly:harvest_method_v6"}],"assembly_sibling_groups":[{"group":"ccb785e3a24b","realizes_method":"Hierarchical Memory Matching Network","source_kind":"harvested","batch_at":"2026-09-09T22:44:46+00:00","members":["5ead06736be4ad63"]}],"assemblies_is":{"about":"What Syntology's graph records as this paper's claimed method, lifted into code: each assembly names its bricks (functions and classes), each with its own role and its own verification level. An assembly is not a check that the code implements the method correctly or reproduces the paper's results.","harvested":"assembled from code harvested from a repository linked to the paper","generated":"generated from the paper text, not the repository's code","end_to_end":"for a harvested assembly, the assembly has not been run end-to-end; for a generated one, end_to_end.level is the assembly's own level and against_independent_peer says whether it ran against a peer: an independent peer is a second implementation generated separately from the same paper text; neither implementation read the authors' code. At level 2 the two agreed numerically on the fixture's inputs; level 3 is recorded when property tests derived from the paper also passed on both, and each level 3 card prints how many its report lists","bricks_level":"each brick's own verification level in Syntology's graph (level 0: no recorded run), listed brick by brick and never combined into one level","ran_individually":"a COUNT of bricks that ran on their own on a fixture (split by status in ran_individually_by_status), not a level; instrument statuses are failures of Syntology's instrument, not of the code","siblings":"assemblies lifted from this paper in the same batch for the same method: alternative readings kept side by side; none replaces or supersedes another","judged":"Where a model read the code against the paper's claim, each assembly's label verdict is one model's judgement, kept in this page's JSON twin; it is not calibrated, so no card prints it. A generated assembly's label was set when its code was generated for the method, and no model judged it; its card prints it as \"by construction\" or \"not judged by a model\"","level_lowered":"a generated assembly whose level Syntology's graph lowered, with the level it had, the recorded reason and when","retention":"Syntology's spending triage for further verification, not a verdict","claim_match":"the claim_match vote: IMPLEMENTS, COMPONENT or UNCLEAR. Where claim_match_basis is \"judge:<model>\", it is one model's judgement of the assembly's label against the paper's claim (claim_match_rule single_judge, the model in claim_match_judges): not a verification and not a run. Where it is \"construction\", the value was set when the code was generated for this method and no model judged it, whatever claim_match_rule says. The page prints no claim match for any assembly","label_verdict":"whether the assembly's code is the method it is labelled with: matches, cannot_tell, mislabelled (suggested_method names what it looks like instead) or not_the_method; label_verdict_judged is true only when a model read the code (claim_match_basis \"judge:<model>\")","label_verdict_judged":"where true (claim_match_basis \"judge:<model>\"), label_verdict is a single model's judgement; not calibrated; not printed on the page; where false, it was set by construction, and the page prints it unless the node is shared with another paper (node_properties_written_for)","claim":"the claim text stored on the assembly node: for a harvested assembly, what the paper claims the code implements, as the lifting model wrote it; for a generated one, the specification the code was generated from. Not verified text","centrality":"how central the lifted method is to the paper, as the lifting step recorded it: contribution, component or incidental","v3_tests_passed_both_sides":"end_to_end.v3_tests_passed_both_sides: the number of property tests derived from the paper that passed on both implementations, as the attached report lists them; a level 3 card with 0 says its report lists none","ran_individually_constructed":"ran_individually_constructed: of the bricks counted in ran_individually, how many constructed an object rather than computing a result (Syntology's RAN record's rule, read from the graph-layer sample with the brick's code_sha256); a part of ran_individually, never subtracted from it and never a failure; null where a brick that ran has no sample in the graph layer this build read, so the figure was not counted"},"assemblies_call":{"tool":"assembly","arguments":{"arxiv_id":"2109.11404"},"call":"assembly(arxiv_id=\"2109.11404\")"},"read_at":"2026-10-05T00:36:11+00:00","read_at_is":"when the build read Syntology's graph, not when any sample ran","ran_record":{"url":"https://syntology.ai/api/ran/2109.11404.json","schema":"syntology.ran_record/1","counts_crosswalk":{"n_samples":"syntology.counts.lifted","n_ran":"syntology.counts.executed","n_ran_checked":"syntology.counts.checked","n_instrument":"syntology.counts.instrument_failures","n_unverified":"syntology.counts.no_recorded_run"},"note":"live record, measured at request time; may be newer than this page's graph read","badge":"https://syntology.ai/api/ran/2109.11404.svg"},"claim":"Per-sample execution status on synthesized fixtures; not a correctness claim about the paper. Samples come from repositories linked to the paper, official or community; repo_kind says which.","repos":[{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/hongje/hmmn","reach":{"status":"ok"}},{"provenance":"deterministic:regex_extraction","url":"https://github.com/Hongje/HMMN","reach":{"status":"ok"}}],"summary":{"ran":5,"unverified":3},"n_samples":8,"n_ran":5,"n_constructed":4,"n_ran_checked":5,"n_instrument":0,"n_unverified":3,"n_instrument_is":"failures of Syntology's instrument, not of the code","every_run_is_an_instrument_failure":false,"key_notes":{"n_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_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)"},"by_repo_kind":{"official":{"samples":8,"ran":5,"n_ran_checked":5,"n_instrument":0,"repositories":1}},"repo_kind_vocabulary":{"official":"The archive marks this repository official for the paper","named_in_paper":"The archive records that the paper mentions this repository; it is not marked official","listed":"In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper","found_in_text":"Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted","community":"Not in the archive's code links for this paper; a community repository Syntology harvested"},"n_pointer_only_for_licence":8,"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_pointer_only_for_licence counts samples with inline_ok false (both gates), n_pointer_only_link_allows those of them whose inline_ok_link is true","n_pointer_only_link_allows":0,"fixture_fields_is":{"signature_and_fixture_out_type":"the arguments Syntology's fixture called the sample with, each as name:type/rank/element kind (? where none was recorded), and the type of what the fixture's run returned, exactly as the harness recorded them; the arguments and the returned type were recorded by two separate runs of the same fixture. No output value is shown, and a returned type says nothing about whether the output was right","level_recorded_at":"when Syntology's graph wrote the sample's verification level, not when the code executed; absent where the level was written before the date was kept, and never filled in with the build date","present_on":"samples that ran only; a key is absent, never empty, where the graph records nothing","signature_not_shown":"the graph records a signature for this sample and it is not shown; signature_not_shown_because names why, as the export's field-exclusion reason","signature_not_shown_because":{"signature_is_harness_probe_not_fixture_args":"for a class the fixture built without calling, the harness called the object with inputs it made up itself, so the recorded signature is the harness's probe, not the fixture's arguments"}},"n_ran_with_level_date":5,"n_ran_without_level_date":0,"n_ran_signature_not_shown":1,"levels_written_between":{"first":"2026-09-22","last":"2026-09-24","is":"the first and last UTC dates on which Syntology's graph wrote a verification level for a sample on this page that ran, not when the code executed"},"code_page_min_papers":5,"code_page_is":"a page for the entry name across every paper's harvested code; the name is a string, not an identity","samples":[{"code_sha256":"4d499c7a1c54839a","code_sha256_prefix":"4d499c7a1c54839a","entry":"Decoder","repo":"Hongje/HMMN","repo_kind":"official","path":"model.py","file_url":"https://github.com/Hongje/HMMN/blob/HEAD/model.py","link_basis":"first_harvest_node","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"fixture_out_type":"Decoder","level_recorded_at":"2026-09-22T14:31:46.068493+00:00","code_page":"/code/decoder","census":null,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, Hongje/HMMN when it was checked","mcp_get_code":{"code_sha256":"4d499c7a1c54839a"}},{"code_sha256":"3929cee794ef7996","code_sha256_prefix":"3929cee794ef7996","entry":"KeyValue","repo":"Hongje/HMMN","repo_kind":"official","path":"model.py","file_url":"https://github.com/Hongje/HMMN/blob/HEAD/model.py","link_basis":"first_harvest_node","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"signature_not_shown":true,"signature_not_shown_because":"signature_is_harness_probe_not_fixture_args","fixture_out_type":"KeyValue","level_recorded_at":"2026-09-22T14:31:46.068493+00:00","retrieve_with":{"tool":"get_code","code_sha256":"3929cee794ef7996"},"code_page":null,"census":null,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, Hongje/HMMN when it was checked","mcp_get_code":{"code_sha256":"3929cee794ef7996"}},{"code_sha256":"c73e4c9b0c5e54c7","code_sha256_prefix":"c73e4c9b0c5e54c7","entry":"Memory","repo":"Hongje/HMMN","repo_kind":"official","path":"model.py","file_url":"https://github.com/Hongje/HMMN/blob/HEAD/model.py","link_basis":"first_harvest_node","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"fixture_out_type":"Memory","level_recorded_at":"2026-09-22T14:31:46.068493+00:00","code_page":"/code/memory","census":null,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, Hongje/HMMN when it was checked","mcp_get_code":{"code_sha256":"c73e4c9b0c5e54c7"}},{"code_sha256":"3c110faa7db7d2ff","code_sha256_prefix":"3c110faa7db7d2ff","entry":"Memory_topk","repo":"Hongje/HMMN","repo_kind":"official","path":"model.py","file_url":"https://github.com/Hongje/HMMN/blob/HEAD/model.py","link_basis":"first_harvest_node","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"signature":"m_in:Tensor/5/float, m_out:Tensor/5/float, q_in:Tensor/4/float, qk_ref:Tensor/3/float, qk_ref_topk_indices:NoneType/0/?, qk_ref_topk_val:NoneType/0/?, mem_dropout:NoneType/0/?","fixture_out_type":"tuple","level_recorded_at":"2026-09-24T15:16:18.137819+00:00","code_page":null,"census":null,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, Hongje/HMMN when it was checked","mcp_get_code":{"code_sha256":"3c110faa7db7d2ff"}},{"code_sha256":"0aa276a048959a5a","code_sha256_prefix":"0aa276a048959a5a","entry":"Refine","repo":"Hongje/HMMN","repo_kind":"official","path":"model.py","file_url":"https://github.com/Hongje/HMMN/blob/HEAD/model.py","link_basis":"first_harvest_node","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"fixture_out_type":"Refine","level_recorded_at":"2026-09-22T14:31:46.068493+00:00","code_page":"/code/refine","census":null,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, Hongje/HMMN when it was checked","mcp_get_code":{"code_sha256":"0aa276a048959a5a"}},{"code_sha256":"0b783799ea293620","code_sha256_prefix":"0b783799ea293620","entry":"Encoder_M","repo":"Hongje/HMMN","repo_kind":"official","path":"model.py","file_url":"https://github.com/Hongje/HMMN/blob/HEAD/model.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"code_page":null,"census":null,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, Hongje/HMMN when it was checked","mcp_get_code":{"code_sha256":"0b783799ea293620"}},{"code_sha256":"6d12e62e34457264","code_sha256_prefix":"6d12e62e34457264","entry":"Encoder_Q","repo":"Hongje/HMMN","repo_kind":"official","path":"model.py","file_url":"https://github.com/Hongje/HMMN/blob/HEAD/model.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"code_page":null,"census":null,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, Hongje/HMMN when it was checked","mcp_get_code":{"code_sha256":"6d12e62e34457264"}},{"code_sha256":"e25774e68ee0a333","code_sha256_prefix":"e25774e68ee0a333","entry":"HMMN","repo":"Hongje/HMMN","repo_kind":"official","path":"model.py","file_url":"https://github.com/Hongje/HMMN/blob/HEAD/model.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"code_page":null,"census":null,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, Hongje/HMMN when it was checked","mcp_get_code":{"code_sha256":"e25774e68ee0a333"}}]},"code_links_note":null,"arxiv_metadata":null,"syntology_extracted_results":null,"record_sha256":"fc989059d41c20e0ae0e9957514af2547d39bdeec8a908ca686c3a3064d3f4df","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}