{"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/foundation-policies-with-hilbert","title":"Foundation Policies with Hilbert Representations","arxiv_id":"2402.15567","date":"2024-02-23","proceeding":null,"authors":["Seohong Park","Tobias Kreiman","Sergey Levine"],"abstract":"Unsupervised and self-supervised objectives, such as next token prediction, have enabled pre-training generalist models from large amounts of unlabeled data. In reinforcement learning (RL), however, finding a truly general and scalable unsupervised pre-training objective for generalist policies from offline data remains a major open question. While a number of methods have been proposed to enable generic self-supervised RL, based on principles such as goal-conditioned RL, behavioral cloning, and unsupervised skill learning, such methods remain limited in terms of either the diversity of the discovered behaviors, the need for high-quality demonstration data, or the lack of a clear adaptation mechanism for downstream tasks. In this work, we propose a novel unsupervised framework to pre-train generalist policies that capture diverse, optimal, long-horizon behaviors from unlabeled offline data such that they can be quickly adapted to any arbitrary new tasks in a zero-shot manner. Our key insight is to learn a structured representation that preserves the temporal structure of the underlying environment, and then to span this learned latent space with directional movements, which enables various zero-shot policy \"prompting\" schemes for downstream tasks. Through our experiments on simulated robotic locomotion and manipulation benchmarks, we show that our unsupervised policies can solve goal-conditioned and general RL tasks in a zero-shot fashion, even often outperforming prior methods designed specifically for each setting. Our code and videos are available at https://seohong.me/projects/hilp/.","url_abs":"https://arxiv.org/abs/2402.15567v2","url_pdf":"https://arxiv.org/pdf/2402.15567v2.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":"foundation-policies-with-hilbert","repo_url":"https://github.com/seohongpark/hilp","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":0,"framework":"jax","reach":{"status":"ok"}},{"paper_slug":"foundation-policies-with-hilbert","repo_url":"https://github.com/rail-berkeley/supe","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"jax","reach":{"status":"ok","spdx":"MIT"}}],"tasks":[{"task_slug":"reinforcement-learning-1","task_name":"Reinforcement Learning (RL)"},{"task_slug":"unsupervised-pre-training","task_name":"Unsupervised Pre-training"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/2402.15567","atlas_url":"https://app.syntology.ai/?focus=2402.15567","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2402.15567"},"calls":[{"tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2402.15567"},"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_reference_implementation","arguments":{"name":"Foundation Policies with Hilbert Representations"},"call":"get_reference_implementation(name='Foundation Policies with Hilbert Representations')","min_level":{"quoted_from_server_card":["It REFUSES rather than serving below min_level, and the refusal names the highest level that exists","so lowering min_level is a deliberate, informed choice, not a guess."],"default_on_card":2,"server_card":"https://syntology.ai/.well-known/mcp/server-card.json","card_sha256":"479785a84658dd682a11b10237b3620d651d7f87799f5dc7add970aaa83f6d39","this_implementation_level":3}},{"tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2402.15567"},"call":"get_harvested_code_for_paper(arxiv_id=\"2402.15567\")"},{"tool":"get_code","arguments_in":{"code_sha256":"syntology.samples[].code_sha256"},"call":"get_code(code_sha256=\"…\")"},{"tool":"get_citation_path","arguments":{"paper_1":"2402.15567"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"2402.15567\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"2402.15567"},"call":"get_concepts_for_paper(arxiv_id=\"2402.15567\")"}],"reference_implementation":[{"method_name":"Foundation Policies with Hilbert Representations","assembly_sha256":"25e68317093f40ea","source":"generated from the paper text (not the authors' code)","level":3,"level_is_quoted_from_server_card":[{"level":"V2","quoted":["two implementations GENERATED from the paper's signature and spec agree numerically (1e-6) on fixture inputs","neither of the two ever read the authors' own code, so V2 measures how unambiguously the paper specifies the method, not fidelity to the authors' implementation (measured 2026-09-11, commit 75eaa77: cross_checked_by is a second LLM on 2,628 of 2,831 served samples)"]},{"level":"V3","quoted":["paper-derived property tests pass on both of those same two generations."]}],"server_card":"https://syntology.ai/.well-known/mcp/server-card.json","card_sha256":"479785a84658dd682a11b10237b3620d651d7f87799f5dc7add970aaa83f6d39","v3_tests_passed_both_sides":5,"no_rung":"No rung compares this code against the authors' implementation","no_rung_quoted_from_server_card":"No rung on this ladder compares the served code against the authors' implementation, so treat every level as evidence about runnability and internal agreement, not about matching the paper's results.","retrieve_with":"get_reference_implementation(name='Foundation Policies with Hilbert Representations')","have_check":{"url":"https://syntology.ai/api/graph/have?x=2402.15567","call":"have('2402.15567')","in_build_sample":false}}],"reference_implementation_is":"Syntology's reference implementation of this paper's method: code Syntology generated from the paper text (not the authors' code), at the level its own end-to-end run recorded (the assembly's own level, never averaged); the level's meaning is quoted from Syntology's server card, and nothing here says the code is correct or reproduces the paper's results","by_repo":[{"repo":"seohongpark/hilp","kind":"official","samples":16,"ran":7,"instrument":1,"unverified":9},{"repo":"rail-berkeley/supe","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["2410.18076"],"harvested_for_calls":[{"arxiv_id":"2410.18076","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2410.18076"},"call":"get_harvested_code_for_paper(arxiv_id=\"2410.18076\")"}]}],"by_repo_harvested_for_is":"harvested_for: the arXiv ids (as Syntology's graph holds them) of every paper whose samples Syntology's graph links to this repository, in arXiv-id order, complete; the page names the first 3 and says how many more. A link only: it does not say the papers are the same work, that one copied the other, or that the code implements this paper's method; harvested_for_calls gives the get_harvested_code_for_paper call for each arXiv-shaped id among them","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":"25e68317093f40ea","source_kind":"generated","method_name":"Foundation Policies with Hilbert Representations","realizes_method":"Foundation Policies with Hilbert Representations","graph_method":"Foundation Policies with Hilbert Representations","realizes_severed":false,"claim":"Compute the intrinsic reward r(s, z, s') for Hilbert Foundation Policies. Given:\n- phi_s: Hilbert representation of current state s, shape (D,) where D is the representation dimension, float array\n- phi_s_prime: Hilbert representation of next state s', shape (D,), float array\n- z: goal direction vec","centrality":"contribution","entry":"compute_intrinsic_reward","entry_sha256":"67a7b1901781aebbb7371843c51807797bea1b5fa77aad9278e7c629a45807b6","n_bricks":1,"bricks":[{"entry":"compute_intrinsic_reward","code_sha256":"67a7b1901781aebbb7371843c51807797bea1b5fa77aad9278e7c629a45807b6","role":"entry","order":0,"level":3,"status":"ran_draft_wrong"}],"ran_individually":1,"ran_individually_constructed":null,"ran_individually_by_status":{"ran_draft_wrong":1},"end_to_end":{"ran":true,"level":3,"against_independent_peer":true,"n_peers":1,"v3_tests_passed_both_sides":5,"means":"this assembly is a single routine, so the entry brick's verification IS the assembly's: it executed and two family-independent implementations agreed"},"level_lowered":null,"claim_match":"IMPLEMENTS","claim_match_rule":"single_judge","claim_match_basis":"construction","claim_match_judges":["construction:spec_drafted_for_this_method"],"label_verdict":"matches","label_verdict_judged":false,"suggested_method":null,"batch_at":"2026-09-07T20:44:12+00:00","sibling_group":"626e4dd0f182","n_siblings":0,"retention":"keep","provenance":"assembly:generated_reference_impl_v1","attached_at":"2026-09-07T20:44:12+00:00","attached_provenance":"assembly:generated_reference_impl_v1"}],"assembly_sibling_groups":[{"group":"626e4dd0f182","realizes_method":"Foundation Policies with Hilbert Representations","source_kind":"generated","batch_at":"2026-09-07T20:44:12+00:00","members":["25e68317093f40ea"]}],"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":"2402.15567"},"call":"assembly(arxiv_id=\"2402.15567\")"},"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/2402.15567.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/2402.15567.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/rail-berkeley/supe","reach":{"status":"ok","spdx":"MIT"}},{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/seohongpark/hilp","reach":{"status":"ok"}}],"summary":{"ran_honours":4,"ran_draft_wrong":1,"ran":2,"unverified":9},"n_samples":16,"n_ran":7,"n_constructed":0,"n_ran_checked":6,"n_instrument":1,"n_unverified":9,"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":16,"ran":7,"n_ran_checked":6,"n_instrument":1,"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":16,"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_object_repr":"an argument's recorded type or element kind is a printout of an object in Syntology's harness (such as a mock object, a class or a pandas printout), not the type of an input, so it does not describe the call's shape"}},"n_ran_with_level_date":7,"n_ran_without_level_date":0,"n_ran_signature_not_shown":1,"levels_written_between":{"first":"2026-09-25","last":"2026-09-25","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":"2d17f9689108389d","code_sha256_prefix":"2d17f9689108389d","entry":"get_canvas_image","repo":"seohongpark/hilp","repo_kind":"official","path":"hilp_gcrl/src/d4rl_ant.py","file_url":"https://github.com/seohongpark/hilp/blob/HEAD/hilp_gcrl/src/d4rl_ant.py","link_basis":"harvester_set","language":"python","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":false,"signature_not_shown":true,"signature_not_shown_because":"signature_is_harness_object_repr","fixture_out_type":"ndarray","level_recorded_at":"2026-09-25T23:22:42.264232+00:00","code_page":"/code/get-canvas-image","census":null,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, seohongpark/hilp when it was checked","mcp_get_code":{"code_sha256":"2d17f9689108389d"}},{"code_sha256":"395635db622171fa","code_sha256_prefix":"395635db622171fa","entry":"get_keys","repo":"seohongpark/hilp","repo_kind":"official","path":"hilp_gcrl/d4rl_ext/offline_env.py","file_url":"https://github.com/seohongpark/hilp/blob/HEAD/hilp_gcrl/d4rl_ext/offline_env.py","link_basis":"harvester_set","language":"python","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"signature":"h5file:File/0/?","fixture_out_type":"list","level_recorded_at":"2026-09-25T22:21:49.183891+00:00","code_page":"/code/get-keys","census":null,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, seohongpark/hilp when it was checked","mcp_get_code":{"code_sha256":"395635db622171fa"}},{"code_sha256":"e60bfdd0574ddc5f","code_sha256_prefix":"e60bfdd0574ddc5f","entry":"get_normalization","repo":"seohongpark/hilp","repo_kind":"official","path":"hilp_gcrl/src/d4rl_utils.py","file_url":"https://github.com/seohongpark/hilp/blob/HEAD/hilp_gcrl/src/d4rl_utils.py","link_basis":"harvester_set","language":"python","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":false,"signature":"dataset:dict/0/?","fixture_out_type":"float","level_recorded_at":"2026-09-25T23:22:42.264232+00:00","code_page":"/code/get-normalization","census":null,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, seohongpark/hilp when it was checked","mcp_get_code":{"code_sha256":"e60bfdd0574ddc5f"}},{"code_sha256":"56f8ab2680a5bf38","code_sha256_prefix":"56f8ab2680a5bf38","entry":"kitchen_render","repo":"seohongpark/hilp","repo_kind":"official","path":"hilp_gcrl/dataset_render.py","file_url":"https://github.com/seohongpark/hilp/blob/HEAD/hilp_gcrl/dataset_render.py","link_basis":"harvester_set","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"fixture_out_type":"ndarray","level_recorded_at":"2026-09-25T23:22:42.264232+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, seohongpark/hilp when it was checked","mcp_get_code":{"code_sha256":"56f8ab2680a5bf38"}},{"code_sha256":"fd2c92d2074f0195","code_sha256_prefix":"fd2c92d2074f0195","entry":"most_squarelike","repo":"seohongpark/hilp","repo_kind":"official","path":"hilp_gcrl/src/viz_utils.py","file_url":"https://github.com/seohongpark/hilp/blob/HEAD/hilp_gcrl/src/viz_utils.py","link_basis":"harvester_set","language":"python","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":true,"signature":"n:int/0/int","fixture_out_type":"tuple","level_recorded_at":"2026-09-25T22:21:49.183891+00:00","retrieve_with":{"tool":"get_code","code_sha256":"fd2c92d2074f0195"},"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, seohongpark/hilp when it was checked","mcp_get_code":{"code_sha256":"fd2c92d2074f0195"}},{"code_sha256":"6ee7e4a795696bca","code_sha256_prefix":"6ee7e4a795696bca","entry":"random_crop","repo":"seohongpark/hilp","repo_kind":"official","path":"hilp_gcrl/src/dataset_utils.py","file_url":"https://github.com/seohongpark/hilp/blob/HEAD/hilp_gcrl/src/dataset_utils.py","link_basis":"harvester_set","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"signature":"img:ArrayImpl/3/float, crop_from:tuple/1/int, padding:int/0/int","fixture_out_type":"ArrayImpl","level_recorded_at":"2026-09-25T23:22:42.264232+00:00","code_page":"/code/random-crop","census":null,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, seohongpark/hilp when it was checked","mcp_get_code":{"code_sha256":"6ee7e4a795696bca"}},{"code_sha256":"a5514c312d961e08","code_sha256_prefix":"a5514c312d961e08","entry":"valid_goal_sampler","repo":"seohongpark/hilp","repo_kind":"official","path":"hilp_gcrl/src/d4rl_ant.py","file_url":"https://github.com/seohongpark/hilp/blob/HEAD/hilp_gcrl/src/d4rl_ant.py","link_basis":"harvester_set","language":"python","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":false,"signature":"self:MockMazeEnv/0/?, np_random:RandomState/0/?","fixture_out_type":"tuple","level_recorded_at":"2026-09-25T22:21:49.183891+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, seohongpark/hilp when it was checked","mcp_get_code":{"code_sha256":"a5514c312d961e08"}},{"code_sha256":"88d6d21f699682b1","code_sha256_prefix":"88d6d21f699682b1","entry":"download_dataset_from_url","repo":"seohongpark/hilp","repo_kind":"official","path":"hilp_gcrl/d4rl_ext/offline_env.py","file_url":"https://github.com/seohongpark/hilp/blob/HEAD/hilp_gcrl/d4rl_ext/offline_env.py","link_basis":"harvester_set","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"code_page":"/code/download-dataset-from-url","census":null,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, seohongpark/hilp when it was checked","mcp_get_code":{"code_sha256":"88d6d21f699682b1"}},{"code_sha256":"7f174e0d2fe49c08","code_sha256_prefix":"7f174e0d2fe49c08","entry":"ensemblize","repo":"seohongpark/hilp","repo_kind":"official","path":"hilp_gcrl/jaxrl_m/networks.py","file_url":"https://github.com/seohongpark/hilp/blob/HEAD/hilp_gcrl/jaxrl_m/networks.py","link_basis":"harvester_set","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"code_page":"/code/ensemblize","census":null,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, seohongpark/hilp when it was checked","mcp_get_code":{"code_sha256":"7f174e0d2fe49c08"}},{"code_sha256":"e14321aa0b5c0b78","code_sha256_prefix":"e14321aa0b5c0b78","entry":"filepath_from_url","repo":"seohongpark/hilp","repo_kind":"official","path":"hilp_gcrl/d4rl_ext/offline_env.py","file_url":"https://github.com/seohongpark/hilp/blob/HEAD/hilp_gcrl/d4rl_ext/offline_env.py","link_basis":"harvester_set","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"code_page":"/code/filepath-from-url","census":null,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, seohongpark/hilp when it was checked","mcp_get_code":{"code_sha256":"e14321aa0b5c0b78"}},{"code_sha256":"b3d75720ab55c2c2","code_sha256_prefix":"b3d75720ab55c2c2","entry":"make_env","repo":"seohongpark/hilp","repo_kind":"official","path":"hilp_gcrl/src/d4rl_utils.py","file_url":"https://github.com/seohongpark/hilp/blob/HEAD/hilp_gcrl/src/d4rl_utils.py","link_basis":"harvester_set","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"code_page":"/code/make-env","census":null,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, seohongpark/hilp when it was checked","mcp_get_code":{"code_sha256":"b3d75720ab55c2c2"}},{"code_sha256":"9e273495210cbc4c","code_sha256_prefix":"9e273495210cbc4c","entry":"make_visual","repo":"seohongpark/hilp","repo_kind":"official","path":"hilp_gcrl/src/viz_utils.py","file_url":"https://github.com/seohongpark/hilp/blob/HEAD/hilp_gcrl/src/viz_utils.py","link_basis":"harvester_set","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, seohongpark/hilp when it was checked","mcp_get_code":{"code_sha256":"9e273495210cbc4c"}},{"code_sha256":"8bc4244b8915e237","code_sha256_prefix":"8bc4244b8915e237","entry":"make_visual_no_image","repo":"seohongpark/hilp","repo_kind":"official","path":"hilp_gcrl/src/viz_utils.py","file_url":"https://github.com/seohongpark/hilp/blob/HEAD/hilp_gcrl/src/viz_utils.py","link_basis":"harvester_set","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, seohongpark/hilp when it was checked","mcp_get_code":{"code_sha256":"8bc4244b8915e237"}},{"code_sha256":"7effca8e608209f2","code_sha256_prefix":"7effca8e608209f2","entry":"prepare_video","repo":"seohongpark/hilp","repo_kind":"official","path":"hilp_gcrl/src/utils.py","file_url":"https://github.com/seohongpark/hilp/blob/HEAD/hilp_gcrl/src/utils.py","link_basis":"harvester_set","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, seohongpark/hilp when it was checked","mcp_get_code":{"code_sha256":"7effca8e608209f2"}},{"code_sha256":"8620eae358ce25cb","code_sha256_prefix":"8620eae358ce25cb","entry":"record_video","repo":"seohongpark/hilp","repo_kind":"official","path":"hilp_gcrl/src/utils.py","file_url":"https://github.com/seohongpark/hilp/blob/HEAD/hilp_gcrl/src/utils.py","link_basis":"harvester_set","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, seohongpark/hilp when it was checked","mcp_get_code":{"code_sha256":"8620eae358ce25cb"}},{"code_sha256":"61a1ee7ea522bbd8","code_sha256_prefix":"61a1ee7ea522bbd8","entry":"save_video","repo":"seohongpark/hilp","repo_kind":"official","path":"hilp_gcrl/src/utils.py","file_url":"https://github.com/seohongpark/hilp/blob/HEAD/hilp_gcrl/src/utils.py","link_basis":"harvester_set","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"code_page":"/code/save-video","census":null,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, seohongpark/hilp when it was checked","mcp_get_code":{"code_sha256":"61a1ee7ea522bbd8"}}]},"code_links_note":null,"arxiv_metadata":null,"syntology_extracted_results":null,"record_sha256":"222ced9df4fe2b5725b9dd731ed5ad61cd0e772754f140d3ea3649b2e4dee06f","record_changed_at":"2026-10-04","record_changed_at_basis":"changed"}