{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:5DVZVCUQFIXYUCZLARQFQU2Y34","short_pith_number":"pith:5DVZVCUQ","schema_version":"1.0","canonical_sha256":"e8eb9a8a902a2f8a0b2b0460585358df15d9e665f8d64b3883f7de1ef2999810","source":{"kind":"arxiv","id":"2603.05500","version":2},"attestation_state":"computed","paper":{"title":"POET-X: Memory-efficient LLM Training by Scaling Orthogonal Transformation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.CL"],"primary_cat":"cs.LG","authors_text":"Adrian Weller, Han Shi, Lixin Liu, Weiyang Liu, Zeju Qiu","submitted_at":"2026-03-05T18:59:23Z","abstract_excerpt":"Efficient and stable training of large language models (LLMs) remains a core challenge in modern machine learning systems. To address this challenge, Reparameterized Orthogonal Equivalence Training (POET), a spectrum-preserving framework that optimizes each weight matrix through orthogonal equivalence transformation, has been proposed. Although POET provides strong training stability, its original implementation incurs high memory consumption and computational overhead due to intensive matrix multiplications. To overcome these limitations, we introduce POET-X, a scalable and memory-efficient v"},"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":"2603.05500","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2026-03-05T18:59:23Z","cross_cats_sorted":["cs.AI","cs.CL"],"title_canon_sha256":"7cffbf3e44a0fce3141205c59a80c0e6cca74db4545d85ffa0928fe52590e799","abstract_canon_sha256":"b0e3b9e1e1aa8fb3d03b1d15c317f87084f51c43ffd2471105f0024c363bd87f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-09T01:05:15.538673Z","signature_b64":"LIEP7avz9Mrcc6FIIG9TTouYQY5cY8Ct+j8Dzz9O+cdLhpeR3uGCjxI34cv+lk+ig39RIDg9+ghMo0WzpWQcAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e8eb9a8a902a2f8a0b2b0460585358df15d9e665f8d64b3883f7de1ef2999810","last_reissued_at":"2026-06-09T01:05:15.538130Z","signature_status":"signed_v1","first_computed_at":"2026-06-09T01:05:15.538130Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"POET-X: Memory-efficient LLM Training by Scaling Orthogonal Transformation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.CL"],"primary_cat":"cs.LG","authors_text":"Adrian Weller, Han Shi, Lixin Liu, Weiyang Liu, Zeju Qiu","submitted_at":"2026-03-05T18:59:23Z","abstract_excerpt":"Efficient and stable training of large language models (LLMs) remains a core challenge in modern machine learning systems. To address this challenge, Reparameterized Orthogonal Equivalence Training (POET), a spectrum-preserving framework that optimizes each weight matrix through orthogonal equivalence transformation, has been proposed. Although POET provides strong training stability, its original implementation incurs high memory consumption and computational overhead due to intensive matrix multiplications. To overcome these limitations, we introduce POET-X, a scalable and memory-efficient v"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2603.05500","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/2603.05500/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":"2603.05500","created_at":"2026-06-09T01:05:15.538194+00:00"},{"alias_kind":"arxiv_version","alias_value":"2603.05500v2","created_at":"2026-06-09T01:05:15.538194+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2603.05500","created_at":"2026-06-09T01:05:15.538194+00:00"},{"alias_kind":"pith_short_12","alias_value":"5DVZVCUQFIXY","created_at":"2026-06-09T01:05:15.538194+00:00"},{"alias_kind":"pith_short_16","alias_value":"5DVZVCUQFIXYUCZL","created_at":"2026-06-09T01:05:15.538194+00:00"},{"alias_kind":"pith_short_8","alias_value":"5DVZVCUQ","created_at":"2026-06-09T01:05:15.538194+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/5DVZVCUQFIXYUCZLARQFQU2Y34","json":"https://pith.science/pith/5DVZVCUQFIXYUCZLARQFQU2Y34.json","graph_json":"https://pith.science/api/pith-number/5DVZVCUQFIXYUCZLARQFQU2Y34/graph.json","events_json":"https://pith.science/api/pith-number/5DVZVCUQFIXYUCZLARQFQU2Y34/events.json","paper":"https://pith.science/paper/5DVZVCUQ"},"agent_actions":{"view_html":"https://pith.science/pith/5DVZVCUQFIXYUCZLARQFQU2Y34","download_json":"https://pith.science/pith/5DVZVCUQFIXYUCZLARQFQU2Y34.json","view_paper":"https://pith.science/paper/5DVZVCUQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2603.05500&json=true","fetch_graph":"https://pith.science/api/pith-number/5DVZVCUQFIXYUCZLARQFQU2Y34/graph.json","fetch_events":"https://pith.science/api/pith-number/5DVZVCUQFIXYUCZLARQFQU2Y34/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5DVZVCUQFIXYUCZLARQFQU2Y34/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5DVZVCUQFIXYUCZLARQFQU2Y34/action/storage_attestation","attest_author":"https://pith.science/pith/5DVZVCUQFIXYUCZLARQFQU2Y34/action/author_attestation","sign_citation":"https://pith.science/pith/5DVZVCUQFIXYUCZLARQFQU2Y34/action/citation_signature","submit_replication":"https://pith.science/pith/5DVZVCUQFIXYUCZLARQFQU2Y34/action/replication_record"}},"created_at":"2026-06-09T01:05:15.538194+00:00","updated_at":"2026-06-09T01:05:15.538194+00:00"}