{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:KAOXH3F7A6UETUOPBAEEZSSXVE","short_pith_number":"pith:KAOXH3F7","schema_version":"1.0","canonical_sha256":"501d73ecbf07a849d1cf08084cca57a92b53e933bc8965762aab7f788584f17d","source":{"kind":"arxiv","id":"2403.19115","version":2},"attestation_state":"computed","paper":{"title":"HiRoPE: Length Extrapolation for Code Models Using Hierarchical Position","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SE","authors_text":"Ge Li, Huangzhao Zhang, Kechi Zhang, Zhi Jin","submitted_at":"2024-03-28T03:11:38Z","abstract_excerpt":"Addressing the limitation of context length in large language models for code-related tasks is the primary focus of this paper. Existing LLMs are constrained by their pre-trained context lengths, leading to performance issues in handling long complex code sequences. Inspired by how human programmers navigate code, we introduce Hierarchical Rotary Position Embedding (HiRoPE), a novel approach that enhances the traditional rotary position embedding into a hierarchical format based on the hierarchical structure of source code. HiRoPE offers easy integration into existing LLMs without extra traini"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2403.19115","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SE","submitted_at":"2024-03-28T03:11:38Z","cross_cats_sorted":[],"title_canon_sha256":"3955568fd9a757f7e791d31d95eca9dc3d118a7b68b4850e4bfee70192e2d17b","abstract_canon_sha256":"c3d8dfda7ba0b683175c20f2511870ac790104c6f823bcce83d5b32deb0dc0f1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:53:39.636791Z","signature_b64":"gRa2YLC6TygmliGaK2aOCT6us15QCW5xpy9PPSRKqYTdCuoLamKr16HVyCdnrdb1jcaRnH/MiVTGwP7HXE6UAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"501d73ecbf07a849d1cf08084cca57a92b53e933bc8965762aab7f788584f17d","last_reissued_at":"2026-07-05T08:53:39.636258Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:53:39.636258Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"HiRoPE: Length Extrapolation for Code Models Using Hierarchical Position","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SE","authors_text":"Ge Li, Huangzhao Zhang, Kechi Zhang, Zhi Jin","submitted_at":"2024-03-28T03:11:38Z","abstract_excerpt":"Addressing the limitation of context length in large language models for code-related tasks is the primary focus of this paper. Existing LLMs are constrained by their pre-trained context lengths, leading to performance issues in handling long complex code sequences. Inspired by how human programmers navigate code, we introduce Hierarchical Rotary Position Embedding (HiRoPE), a novel approach that enhances the traditional rotary position embedding into a hierarchical format based on the hierarchical structure of source code. HiRoPE offers easy integration into existing LLMs without extra traini"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2403.19115","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2403.19115/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"2403.19115","created_at":"2026-07-05T08:53:39.636322+00:00"},{"alias_kind":"arxiv_version","alias_value":"2403.19115v2","created_at":"2026-07-05T08:53:39.636322+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2403.19115","created_at":"2026-07-05T08:53:39.636322+00:00"},{"alias_kind":"pith_short_12","alias_value":"KAOXH3F7A6UE","created_at":"2026-07-05T08:53:39.636322+00:00"},{"alias_kind":"pith_short_16","alias_value":"KAOXH3F7A6UETUOP","created_at":"2026-07-05T08:53:39.636322+00:00"},{"alias_kind":"pith_short_8","alias_value":"KAOXH3F7","created_at":"2026-07-05T08:53:39.636322+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2506.05295","citing_title":"Sample Complexity and Representation Ability of Test-time Scaling Paradigms","ref_index":98,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/KAOXH3F7A6UETUOPBAEEZSSXVE","json":"https://pith.science/pith/KAOXH3F7A6UETUOPBAEEZSSXVE.json","graph_json":"https://pith.science/api/pith-number/KAOXH3F7A6UETUOPBAEEZSSXVE/graph.json","events_json":"https://pith.science/api/pith-number/KAOXH3F7A6UETUOPBAEEZSSXVE/events.json","paper":"https://pith.science/paper/KAOXH3F7"},"agent_actions":{"view_html":"https://pith.science/pith/KAOXH3F7A6UETUOPBAEEZSSXVE","download_json":"https://pith.science/pith/KAOXH3F7A6UETUOPBAEEZSSXVE.json","view_paper":"https://pith.science/paper/KAOXH3F7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2403.19115&json=true","fetch_graph":"https://pith.science/api/pith-number/KAOXH3F7A6UETUOPBAEEZSSXVE/graph.json","fetch_events":"https://pith.science/api/pith-number/KAOXH3F7A6UETUOPBAEEZSSXVE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KAOXH3F7A6UETUOPBAEEZSSXVE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KAOXH3F7A6UETUOPBAEEZSSXVE/action/storage_attestation","attest_author":"https://pith.science/pith/KAOXH3F7A6UETUOPBAEEZSSXVE/action/author_attestation","sign_citation":"https://pith.science/pith/KAOXH3F7A6UETUOPBAEEZSSXVE/action/citation_signature","submit_replication":"https://pith.science/pith/KAOXH3F7A6UETUOPBAEEZSSXVE/action/replication_record"}},"created_at":"2026-07-05T08:53:39.636322+00:00","updated_at":"2026-07-05T08:53:39.636322+00:00"}