{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:DOONHNVWYAHAYHTAIGLW4ZFH6N","short_pith_number":"pith:DOONHNVW","canonical_record":{"source":{"id":"2605.13370","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-05-13T11:28:06Z","cross_cats_sorted":["cs.CL"],"title_canon_sha256":"6ff8c4f4a8e34823fb1f56d450862de71f57cf37e5e33576ffdd64a48b427a19","abstract_canon_sha256":"9fae0ee4f03281c54c1104a233a60b8bbe868caead070ebaaad1b04f0f399d49"},"schema_version":"1.0"},"canonical_sha256":"1b9cd3b6b6c00e0c1e6041976e64a7f353b55c3a853f5747102a22fb5f80f694","source":{"kind":"arxiv","id":"2605.13370","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.13370","created_at":"2026-05-18T02:44:47Z"},{"alias_kind":"arxiv_version","alias_value":"2605.13370v1","created_at":"2026-05-18T02:44:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.13370","created_at":"2026-05-18T02:44:47Z"},{"alias_kind":"pith_short_12","alias_value":"DOONHNVWYAHA","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"DOONHNVWYAHAYHTA","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"DOONHNVW","created_at":"2026-05-18T12:33:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:DOONHNVWYAHAYHTAIGLW4ZFH6N","target":"record","payload":{"canonical_record":{"source":{"id":"2605.13370","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-05-13T11:28:06Z","cross_cats_sorted":["cs.CL"],"title_canon_sha256":"6ff8c4f4a8e34823fb1f56d450862de71f57cf37e5e33576ffdd64a48b427a19","abstract_canon_sha256":"9fae0ee4f03281c54c1104a233a60b8bbe868caead070ebaaad1b04f0f399d49"},"schema_version":"1.0"},"canonical_sha256":"1b9cd3b6b6c00e0c1e6041976e64a7f353b55c3a853f5747102a22fb5f80f694","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:44:47.983146Z","signature_b64":"/fUUy2S0l4MvdZw+LsJAheNJOjtEeAnks8mB2yKa1fVAlksvIKdmUa2nT35EdPQFJH7ntaczDk+6IWd2C6xxAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1b9cd3b6b6c00e0c1e6041976e64a7f353b55c3a853f5747102a22fb5f80f694","last_reissued_at":"2026-05-18T02:44:47.982749Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:44:47.982749Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2605.13370","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:44:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"edt4WfQJg8HNUKrLuSB/RXasdw6VcWa5Bufh7pwoLWPCjT6g/trPGf3Qaf8mgkixOaCpATYIKfzHoA54avBAAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T14:25:01.004081Z"},"content_sha256":"69f634f25605dee37704ab0119759bfca7530f661207cad3082bfbcb0aad72bc","schema_version":"1.0","event_id":"sha256:69f634f25605dee37704ab0119759bfca7530f661207cad3082bfbcb0aad72bc"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:DOONHNVWYAHAYHTAIGLW4ZFH6N","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Phasor Memory Networks: Stable Backpropagation Through Time for Scalable Explicit Memory","license":"http://creativecommons.org/licenses/by/4.0/","headline":"Constraining recurrent states to phase rotations on the complex unit circle preserves gradient norms in explicit memory networks.","cross_cats":["cs.CL"],"primary_cat":"cs.LG","authors_text":"Hwi-yeol Yun, Sangkeun Jung, Sungwoo Goo","submitted_at":"2026-05-13T11:28:06Z","abstract_excerpt":"For over a decade, explicit memory architectures like the Neural Turing Machine have remained theoretically appealing yet practically intractable for language modeling due to catastrophic gradient instability during Backpropagation Through Time. In this work, we break this stalemate with \\textit{Phasor Memory Network} (PMNet), a novel architecture that structurally resolves memory volatility through \\textit{Unitary Phasor Dynamics} and \\textit{Hierarchical Learnable Anchors}. Rather than relying on brute-force scaling, we present a mechanistic proof-of-concept in a controlled byte-level settin"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"By constraining recurrent state updates to phase rotations on a complex unit circle, PMNet preserves gradient norms and inherently prevents divergence without the need for specialized initialization.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"That the unitary phasor constraint and hierarchical anchors will preserve sufficient expressivity and generalize from the synthetic Copy-Paste task to natural language without introducing new failure modes or requiring extensive hyperparameter tuning.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"PMNet uses unitary phasor dynamics and hierarchical anchors to make explicit memory stable for long sequences, matching a 3x larger Mamba model on long-context robustness with a 119M parameter network.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"Constraining recurrent states to phase rotations on the complex unit circle preserves gradient norms in explicit memory networks.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"18ec23b68fe3ccb638671669d29cfb8b5860cbff558518d0a34f9108313baa4d"},"source":{"id":"2605.13370","kind":"arxiv","version":1},"verdict":{"id":"b5c6556b-8347-419b-90a4-445f6453eeae","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-14T20:32:48.647889Z","strongest_claim":"By constraining recurrent state updates to phase rotations on a complex unit circle, PMNet preserves gradient norms and inherently prevents divergence without the need for specialized initialization.","one_line_summary":"PMNet uses unitary phasor dynamics and hierarchical anchors to make explicit memory stable for long sequences, matching a 3x larger Mamba model on long-context robustness with a 119M parameter network.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"That the unitary phasor constraint and hierarchical anchors will preserve sufficient expressivity and generalize from the synthetic Copy-Paste task to natural language without introducing new failure modes or requiring extensive hyperparameter tuning.","pith_extraction_headline":"Constraining recurrent states to phase rotations on the complex unit circle preserves gradient norms in explicit memory networks."},"references":{"count":21,"sample":[{"doi":"","year":2024,"title":"B., Lozhkov, A., Bakouch, E., von Werra, L., and Wolf, T","work_id":"4d0fcba2-acc3-4f06-802d-3d371696d2e9","ref_index":1,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2016,"title":"Arjovsky, M., Shah, A., and Bengio, Y . (2016). Unitary evolution recurrent neural networks. InInternational conference on machine learning, pages 1120–1128. PMLR","work_id":"1483754f-b03e-417b-ac21-578108a9cbb0","ref_index":2,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2026,"title":"Conditional Memory via Scalable Lookup: A New Axis of Sparsity for Large Language Models","work_id":"942d7453-d7f7-4ad9-8180-e04bd226f6e5","ref_index":3,"cited_arxiv_id":"2601.07372","is_internal_anchor":true},{"doi":"","year":2019,"title":"Generating Long Sequences with Sparse Transformers","work_id":"c5b81688-45ee-4a9a-b095-e6290f45cb6c","ref_index":4,"cited_arxiv_id":"1904.10509","is_internal_anchor":true},{"doi":"","year":2019,"title":"G., Le, Q., and Salakhutdinov, R","work_id":"06942c16-5058-426c-81d1-c62299fe8aee","ref_index":5,"cited_arxiv_id":"","is_internal_anchor":false}],"resolved_work":21,"snapshot_sha256":"4f6018aa7197331e6e93876c60571825d7a5503ab4222b7a76e6e446487c1937","internal_anchors":12},"formal_canon":{"evidence_count":2,"snapshot_sha256":"7a2a5c121827d77f7d2ce78af39efe31cf182c5cc95b97b775833d1d1bb25197"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"verdict_id":"b5c6556b-8347-419b-90a4-445f6453eeae"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:44:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ei/cx5EyAxhnmmtdBv5W4/mLrvo0yb1G6STBP1JDjpzR1gxh1mjX6B/aIlzKxC6fztsbwhb++/ycaAD9Ijd5Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T14:25:01.004727Z"},"content_sha256":"19d4c35325e8de48117ec8b1aad73035d095d515875bff20ea51c039dfe7c457","schema_version":"1.0","event_id":"sha256:19d4c35325e8de48117ec8b1aad73035d095d515875bff20ea51c039dfe7c457"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DOONHNVWYAHAYHTAIGLW4ZFH6N/bundle.json","state_url":"https://pith.science/pith/DOONHNVWYAHAYHTAIGLW4ZFH6N/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DOONHNVWYAHAYHTAIGLW4ZFH6N/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-06T14:25:01Z","links":{"resolver":"https://pith.science/pith/DOONHNVWYAHAYHTAIGLW4ZFH6N","bundle":"https://pith.science/pith/DOONHNVWYAHAYHTAIGLW4ZFH6N/bundle.json","state":"https://pith.science/pith/DOONHNVWYAHAYHTAIGLW4ZFH6N/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DOONHNVWYAHAYHTAIGLW4ZFH6N/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:DOONHNVWYAHAYHTAIGLW4ZFH6N","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"9fae0ee4f03281c54c1104a233a60b8bbe868caead070ebaaad1b04f0f399d49","cross_cats_sorted":["cs.CL"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-05-13T11:28:06Z","title_canon_sha256":"6ff8c4f4a8e34823fb1f56d450862de71f57cf37e5e33576ffdd64a48b427a19"},"schema_version":"1.0","source":{"id":"2605.13370","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.13370","created_at":"2026-05-18T02:44:47Z"},{"alias_kind":"arxiv_version","alias_value":"2605.13370v1","created_at":"2026-05-18T02:44:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.13370","created_at":"2026-05-18T02:44:47Z"},{"alias_kind":"pith_short_12","alias_value":"DOONHNVWYAHA","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"DOONHNVWYAHAYHTA","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"DOONHNVW","created_at":"2026-05-18T12:33:37Z"}],"graph_snapshots":[{"event_id":"sha256:19d4c35325e8de48117ec8b1aad73035d095d515875bff20ea51c039dfe7c457","target":"graph","created_at":"2026-05-18T02:44:47Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":4,"items":[{"attestation":"unclaimed","claim_id":"C1","kind":"strongest_claim","source":"verdict.strongest_claim","status":"machine_extracted","text":"By constraining recurrent state updates to phase rotations on a complex unit circle, PMNet preserves gradient norms and inherently prevents divergence without the need for specialized initialization."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"That the unitary phasor constraint and hierarchical anchors will preserve sufficient expressivity and generalize from the synthetic Copy-Paste task to natural language without introducing new failure modes or requiring extensive hyperparameter tuning."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"PMNet uses unitary phasor dynamics and hierarchical anchors to make explicit memory stable for long sequences, matching a 3x larger Mamba model on long-context robustness with a 119M parameter network."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"Constraining recurrent states to phase rotations on the complex unit circle preserves gradient norms in explicit memory networks."}],"snapshot_sha256":"18ec23b68fe3ccb638671669d29cfb8b5860cbff558518d0a34f9108313baa4d"},"formal_canon":{"evidence_count":2,"snapshot_sha256":"7a2a5c121827d77f7d2ce78af39efe31cf182c5cc95b97b775833d1d1bb25197"},"paper":{"abstract_excerpt":"For over a decade, explicit memory architectures like the Neural Turing Machine have remained theoretically appealing yet practically intractable for language modeling due to catastrophic gradient instability during Backpropagation Through Time. In this work, we break this stalemate with \\textit{Phasor Memory Network} (PMNet), a novel architecture that structurally resolves memory volatility through \\textit{Unitary Phasor Dynamics} and \\textit{Hierarchical Learnable Anchors}. Rather than relying on brute-force scaling, we present a mechanistic proof-of-concept in a controlled byte-level settin","authors_text":"Hwi-yeol Yun, Sangkeun Jung, Sungwoo Goo","cross_cats":["cs.CL"],"headline":"Constraining recurrent states to phase rotations on the complex unit circle preserves gradient norms in explicit memory networks.","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-05-13T11:28:06Z","title":"Phasor Memory Networks: Stable Backpropagation Through Time for Scalable Explicit Memory"},"references":{"count":21,"internal_anchors":12,"resolved_work":21,"sample":[{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":1,"title":"B., Lozhkov, A., Bakouch, E., von Werra, L., and Wolf, T","work_id":"4d0fcba2-acc3-4f06-802d-3d371696d2e9","year":2024},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":2,"title":"Arjovsky, M., Shah, A., and Bengio, Y . (2016). Unitary evolution recurrent neural networks. InInternational conference on machine learning, pages 1120–1128. PMLR","work_id":"1483754f-b03e-417b-ac21-578108a9cbb0","year":2016},{"cited_arxiv_id":"2601.07372","doi":"","is_internal_anchor":true,"ref_index":3,"title":"Conditional Memory via Scalable Lookup: A New Axis of Sparsity for Large Language Models","work_id":"942d7453-d7f7-4ad9-8180-e04bd226f6e5","year":2026},{"cited_arxiv_id":"1904.10509","doi":"","is_internal_anchor":true,"ref_index":4,"title":"Generating Long Sequences with Sparse Transformers","work_id":"c5b81688-45ee-4a9a-b095-e6290f45cb6c","year":2019},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":5,"title":"G., Le, Q., and Salakhutdinov, R","work_id":"06942c16-5058-426c-81d1-c62299fe8aee","year":2019}],"snapshot_sha256":"4f6018aa7197331e6e93876c60571825d7a5503ab4222b7a76e6e446487c1937"},"source":{"id":"2605.13370","kind":"arxiv","version":1},"verdict":{"created_at":"2026-05-14T20:32:48.647889Z","id":"b5c6556b-8347-419b-90a4-445f6453eeae","model_set":{"reader":"grok-4.3"},"one_line_summary":"PMNet uses unitary phasor dynamics and hierarchical anchors to make explicit memory stable for long sequences, matching a 3x larger Mamba model on long-context robustness with a 119M parameter network.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"Constraining recurrent states to phase rotations on the complex unit circle preserves gradient norms in explicit memory networks.","strongest_claim":"By constraining recurrent state updates to phase rotations on a complex unit circle, PMNet preserves gradient norms and inherently prevents divergence without the need for specialized initialization.","weakest_assumption":"That the unitary phasor constraint and hierarchical anchors will preserve sufficient expressivity and generalize from the synthetic Copy-Paste task to natural language without introducing new failure modes or requiring extensive hyperparameter tuning."}},"verdict_id":"b5c6556b-8347-419b-90a4-445f6453eeae"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:69f634f25605dee37704ab0119759bfca7530f661207cad3082bfbcb0aad72bc","target":"record","created_at":"2026-05-18T02:44:47Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"9fae0ee4f03281c54c1104a233a60b8bbe868caead070ebaaad1b04f0f399d49","cross_cats_sorted":["cs.CL"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-05-13T11:28:06Z","title_canon_sha256":"6ff8c4f4a8e34823fb1f56d450862de71f57cf37e5e33576ffdd64a48b427a19"},"schema_version":"1.0","source":{"id":"2605.13370","kind":"arxiv","version":1}},"canonical_sha256":"1b9cd3b6b6c00e0c1e6041976e64a7f353b55c3a853f5747102a22fb5f80f694","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1b9cd3b6b6c00e0c1e6041976e64a7f353b55c3a853f5747102a22fb5f80f694","first_computed_at":"2026-05-18T02:44:47.982749Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:44:47.982749Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"/fUUy2S0l4MvdZw+LsJAheNJOjtEeAnks8mB2yKa1fVAlksvIKdmUa2nT35EdPQFJH7ntaczDk+6IWd2C6xxAg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:44:47.983146Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.13370","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:69f634f25605dee37704ab0119759bfca7530f661207cad3082bfbcb0aad72bc","sha256:19d4c35325e8de48117ec8b1aad73035d095d515875bff20ea51c039dfe7c457"],"state_sha256":"03f21005c2e640ecd9701e6091c779b00d9e2b0fec10af60348008b7da3591be"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wYPyV9thyGddmAcu78lLOkuC/77/6q3pZs/PYasgEeCscu9ZeN5+sp4qQTTP+0DnJMza1ZYVCRmQqr6Qes8NCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-06T14:25:01.008892Z","bundle_sha256":"d89032ba248df8ac0772ea50e14d9145645511420bab292f8ef75908fc5a64a1"}}