{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:Q7RP75NJCFUMSVMKU25HEF2AWR","short_pith_number":"pith:Q7RP75NJ","canonical_record":{"source":{"id":"2605.15530","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2026-05-15T01:59:10Z","cross_cats_sorted":[],"title_canon_sha256":"3030629c6c60df30f956abb675863bd5b4868cf177fb8c0f69193342135f5fc3","abstract_canon_sha256":"a6a1f834261719ca90efaa28d358065ad5649c7b5fc8d826fbc25614199b3e5d"},"schema_version":"1.0"},"canonical_sha256":"87e2fff5a91168c9558aa6ba721740b448e77fceb44c662c8f4e5e1d16959941","source":{"kind":"arxiv","id":"2605.15530","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.15530","created_at":"2026-05-20T00:01:03Z"},{"alias_kind":"arxiv_version","alias_value":"2605.15530v1","created_at":"2026-05-20T00:01:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.15530","created_at":"2026-05-20T00:01:03Z"},{"alias_kind":"pith_short_12","alias_value":"Q7RP75NJCFUM","created_at":"2026-05-20T00:01:03Z"},{"alias_kind":"pith_short_16","alias_value":"Q7RP75NJCFUMSVMK","created_at":"2026-05-20T00:01:03Z"},{"alias_kind":"pith_short_8","alias_value":"Q7RP75NJ","created_at":"2026-05-20T00:01:03Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:Q7RP75NJCFUMSVMKU25HEF2AWR","target":"record","payload":{"canonical_record":{"source":{"id":"2605.15530","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2026-05-15T01:59:10Z","cross_cats_sorted":[],"title_canon_sha256":"3030629c6c60df30f956abb675863bd5b4868cf177fb8c0f69193342135f5fc3","abstract_canon_sha256":"a6a1f834261719ca90efaa28d358065ad5649c7b5fc8d826fbc25614199b3e5d"},"schema_version":"1.0"},"canonical_sha256":"87e2fff5a91168c9558aa6ba721740b448e77fceb44c662c8f4e5e1d16959941","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-20T00:01:03.659307Z","signature_b64":"AbGQFaaVETd47TGzQ0JoHJk7NAWgmXKuLXIeEwoa3AMTyPXRd6rM7uLpNN2sQd0Qpx0p3D1jc64Lh3bJL3kDDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"87e2fff5a91168c9558aa6ba721740b448e77fceb44c662c8f4e5e1d16959941","last_reissued_at":"2026-05-20T00:01:03.658498Z","signature_status":"signed_v1","first_computed_at":"2026-05-20T00:01:03.658498Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2605.15530","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-20T00:01:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8BBYzY46RkKFG9lvQQZF7iErjbcFekbPEOwHaSezHxGd39varT5OP/gv7IPmsPcnji1J6QwfQfERk+9nSqY2Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-20T18:42:26.266659Z"},"content_sha256":"90cee300d55dde1b182f1f794fccc58316f97b376abc31c6a2aa427d2659f979","schema_version":"1.0","event_id":"sha256:90cee300d55dde1b182f1f794fccc58316f97b376abc31c6a2aa427d2659f979"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:Q7RP75NJCFUMSVMKU25HEF2AWR","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Rethinking Neural Network Learning Rates: A Stackelberg Perspective","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"Assigning a smaller learning rate to body layers and a larger learning rate to the final layer is equivalent to two-time-scale alternating gradient descent on a Stackelberg reformulation of neural network training.","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Sihan Zeng, Sujay Bhatt, Sumitra Ganesh","submitted_at":"2026-05-15T01:59:10Z","abstract_excerpt":"Neural networks are typically trained with a single learning rate across all layers. While recent empirical evidence suggests that assigning layer-specific learning rates can accelerate training, a principled understanding of the conditions and mechanisms under which non-uniform learning rates are beneficial remains limited. In this work, we investigate non-uniform learning rates through the lens of Stackelberg optimization. Specifically, we demonstrate that training neural networks with a smaller learning rate for the body layers and a larger learning rate for the final layer can be interpret"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"training neural networks with a smaller learning rate for the body layers and a larger learning rate for the final layer can be interpreted as a two-time-scale alternating gradient descent algorithm applied to a Stackelberg reformulation of the original objective. We establish finite-time convergence guarantees for the algorithm under broad conditions that accommodate constraint sets and non-smooth activation functions.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"The training dynamics of a neural network can be accurately captured by a Stackelberg game in which the final layer is the leader whose objective is defined on the followers' best response; this reformulation must preserve the original optimization landscape sufficiently for the convergence and curvature claims to transfer back to standard training.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"Non-uniform learning rates correspond to a Stackelberg reformulation of the training objective whose two-time-scale alternating gradient descent yields finite-time convergence and can accelerate training through stronger optimization structure and sharper early curvature.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"Assigning a smaller learning rate to body layers and a larger learning rate to the final layer is equivalent to two-time-scale alternating gradient descent on a Stackelberg reformulation of neural network training.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"552582ffead687d51ef7ff6a22d007369719c1c86fa2ab838e14e9e6b1bd09b3"},"source":{"id":"2605.15530","kind":"arxiv","version":1},"verdict":{"id":"147a7b78-4206-491d-ba15-662e0ef9a049","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-19T14:37:19.333466Z","strongest_claim":"training neural networks with a smaller learning rate for the body layers and a larger learning rate for the final layer can be interpreted as a two-time-scale alternating gradient descent algorithm applied to a Stackelberg reformulation of the original objective. We establish finite-time convergence guarantees for the algorithm under broad conditions that accommodate constraint sets and non-smooth activation functions.","one_line_summary":"Non-uniform learning rates correspond to a Stackelberg reformulation of the training objective whose two-time-scale alternating gradient descent yields finite-time convergence and can accelerate training through stronger optimization structure and sharper early curvature.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"The training dynamics of a neural network can be accurately captured by a Stackelberg game in which the final layer is the leader whose objective is defined on the followers' best response; this reformulation must preserve the original optimization landscape sufficiently for the convergence and curvature claims to transfer back to standard training.","pith_extraction_headline":"Assigning a smaller learning rate to body layers and a larger learning rate to the final layer is equivalent to two-time-scale alternating gradient descent on a Stackelberg reformulation of neural network training."},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2605.15530/integrity.json","findings":[],"available":true,"detectors_run":[{"name":"doi_title_agreement","ran_at":"2026-05-19T15:01:17.518879Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"doi_compliance","ran_at":"2026-05-19T14:49:57.554234Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"cited_work_retraction","ran_at":"2026-05-19T14:22:02.212584Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"claim_evidence","ran_at":"2026-05-19T14:21:54.037972Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"shingle_duplication","ran_at":"2026-05-19T13:49:41.835827Z","status":"skipped","version":"0.1.0","findings_count":0},{"name":"citation_quote_validity","ran_at":"2026-05-19T13:49:41.373268Z","status":"skipped","version":"0.1.0","findings_count":0},{"name":"ai_meta_artifact","ran_at":"2026-05-19T13:33:22.621376Z","status":"skipped","version":"1.0.0","findings_count":0}],"snapshot_sha256":"f64f3827a010f6bcf03542a0597378fe7c2aa3307f2f5d6f42b2d86b067bb0ba"},"references":{"count":16,"sample":[{"doi":"","year":null,"title":"Ultra-fast fea- ture learning for the training of two-layer neural net- works in the two-timescale regime.arXiv preprint arXiv:2504.18208,","work_id":"74802858-d44a-4c3c-9f04-b14627b4cfb3","ref_index":1,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":null,"title":"Closed-Form Last Layer Optimization","work_id":"71a57628-f71c-479b-b8eb-9e3d74dc91d9","ref_index":2,"cited_arxiv_id":"2510.04606","is_internal_anchor":true},{"doi":"","year":1905,"title":"Stochastic gradient methods with layer- wise adaptive moments for training of deep networks","work_id":"65c65157-0510-4070-94a6-5c7dadaa998f","ref_index":3,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":null,"title":"Noise- adaptive layerwise learning rates: Accelerating geometry- aware optimization for deep neural network training","work_id":"43915281-2b91-46ce-9436-f6f81a79cf7a","ref_index":4,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2002,"title":"Large batch training does not need warmup.arXiv preprint arXiv:2002.01576,","work_id":"ca8ff354-b95e-4dc9-a3ba-892034201629","ref_index":5,"cited_arxiv_id":"","is_internal_anchor":false}],"resolved_work":16,"snapshot_sha256":"d1da5c8fe04af6fd364e2c67fba1c27bf064927f332a83421fc80acee9a401c5","internal_anchors":2},"formal_canon":{"evidence_count":2,"snapshot_sha256":"3f919971fd094e41245d7b6c18966afa32fd50efe90bb44d7888f460ed6ab9d6"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"verdict_id":"147a7b78-4206-491d-ba15-662e0ef9a049"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-20T00:01:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mi3mgYtiH7TXBn+BxTmAzR6fJ4goQRp6xGGU6F4BjRZt4HTEjIR3RAqblZIdHsz1zRiH5c8id1kGWDZMXiv8DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-20T18:42:26.267378Z"},"content_sha256":"e589f87d321dbe62d8f785bb26f400bb9330c78aead2ad335457bf9fbf6ade0a","schema_version":"1.0","event_id":"sha256:e589f87d321dbe62d8f785bb26f400bb9330c78aead2ad335457bf9fbf6ade0a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/Q7RP75NJCFUMSVMKU25HEF2AWR/bundle.json","state_url":"https://pith.science/pith/Q7RP75NJCFUMSVMKU25HEF2AWR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/Q7RP75NJCFUMSVMKU25HEF2AWR/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-05-20T18:42:26Z","links":{"resolver":"https://pith.science/pith/Q7RP75NJCFUMSVMKU25HEF2AWR","bundle":"https://pith.science/pith/Q7RP75NJCFUMSVMKU25HEF2AWR/bundle.json","state":"https://pith.science/pith/Q7RP75NJCFUMSVMKU25HEF2AWR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/Q7RP75NJCFUMSVMKU25HEF2AWR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:Q7RP75NJCFUMSVMKU25HEF2AWR","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":"a6a1f834261719ca90efaa28d358065ad5649c7b5fc8d826fbc25614199b3e5d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2026-05-15T01:59:10Z","title_canon_sha256":"3030629c6c60df30f956abb675863bd5b4868cf177fb8c0f69193342135f5fc3"},"schema_version":"1.0","source":{"id":"2605.15530","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.15530","created_at":"2026-05-20T00:01:03Z"},{"alias_kind":"arxiv_version","alias_value":"2605.15530v1","created_at":"2026-05-20T00:01:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.15530","created_at":"2026-05-20T00:01:03Z"},{"alias_kind":"pith_short_12","alias_value":"Q7RP75NJCFUM","created_at":"2026-05-20T00:01:03Z"},{"alias_kind":"pith_short_16","alias_value":"Q7RP75NJCFUMSVMK","created_at":"2026-05-20T00:01:03Z"},{"alias_kind":"pith_short_8","alias_value":"Q7RP75NJ","created_at":"2026-05-20T00:01:03Z"}],"graph_snapshots":[{"event_id":"sha256:e589f87d321dbe62d8f785bb26f400bb9330c78aead2ad335457bf9fbf6ade0a","target":"graph","created_at":"2026-05-20T00:01:03Z","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":"training neural networks with a smaller learning rate for the body layers and a larger learning rate for the final layer can be interpreted as a two-time-scale alternating gradient descent algorithm applied to a Stackelberg reformulation of the original objective. We establish finite-time convergence guarantees for the algorithm under broad conditions that accommodate constraint sets and non-smooth activation functions."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"The training dynamics of a neural network can be accurately captured by a Stackelberg game in which the final layer is the leader whose objective is defined on the followers' best response; this reformulation must preserve the original optimization landscape sufficiently for the convergence and curvature claims to transfer back to standard training."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"Non-uniform learning rates correspond to a Stackelberg reformulation of the training objective whose two-time-scale alternating gradient descent yields finite-time convergence and can accelerate training through stronger optimization structure and sharper early curvature."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"Assigning a smaller learning rate to body layers and a larger learning rate to the final layer is equivalent to two-time-scale alternating gradient descent on a Stackelberg reformulation of neural network training."}],"snapshot_sha256":"552582ffead687d51ef7ff6a22d007369719c1c86fa2ab838e14e9e6b1bd09b3"},"formal_canon":{"evidence_count":2,"snapshot_sha256":"3f919971fd094e41245d7b6c18966afa32fd50efe90bb44d7888f460ed6ab9d6"},"integrity":{"available":true,"clean":true,"detectors_run":[{"findings_count":0,"name":"doi_title_agreement","ran_at":"2026-05-19T15:01:17.518879Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"doi_compliance","ran_at":"2026-05-19T14:49:57.554234Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"cited_work_retraction","ran_at":"2026-05-19T14:22:02.212584Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"claim_evidence","ran_at":"2026-05-19T14:21:54.037972Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"shingle_duplication","ran_at":"2026-05-19T13:49:41.835827Z","status":"skipped","version":"0.1.0"},{"findings_count":0,"name":"citation_quote_validity","ran_at":"2026-05-19T13:49:41.373268Z","status":"skipped","version":"0.1.0"},{"findings_count":0,"name":"ai_meta_artifact","ran_at":"2026-05-19T13:33:22.621376Z","status":"skipped","version":"1.0.0"}],"endpoint":"/pith/2605.15530/integrity.json","findings":[],"snapshot_sha256":"f64f3827a010f6bcf03542a0597378fe7c2aa3307f2f5d6f42b2d86b067bb0ba","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Neural networks are typically trained with a single learning rate across all layers. While recent empirical evidence suggests that assigning layer-specific learning rates can accelerate training, a principled understanding of the conditions and mechanisms under which non-uniform learning rates are beneficial remains limited. In this work, we investigate non-uniform learning rates through the lens of Stackelberg optimization. Specifically, we demonstrate that training neural networks with a smaller learning rate for the body layers and a larger learning rate for the final layer can be interpret","authors_text":"Sihan Zeng, Sujay Bhatt, Sumitra Ganesh","cross_cats":[],"headline":"Assigning a smaller learning rate to body layers and a larger learning rate to the final layer is equivalent to two-time-scale alternating gradient descent on a Stackelberg reformulation of neural network training.","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2026-05-15T01:59:10Z","title":"Rethinking Neural Network Learning Rates: A Stackelberg Perspective"},"references":{"count":16,"internal_anchors":2,"resolved_work":16,"sample":[{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":1,"title":"Ultra-fast fea- ture learning for the training of two-layer neural net- works in the two-timescale regime.arXiv preprint arXiv:2504.18208,","work_id":"74802858-d44a-4c3c-9f04-b14627b4cfb3","year":null},{"cited_arxiv_id":"2510.04606","doi":"","is_internal_anchor":true,"ref_index":2,"title":"Closed-Form Last Layer Optimization","work_id":"71a57628-f71c-479b-b8eb-9e3d74dc91d9","year":null},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":3,"title":"Stochastic gradient methods with layer- wise adaptive moments for training of deep networks","work_id":"65c65157-0510-4070-94a6-5c7dadaa998f","year":1905},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":4,"title":"Noise- adaptive layerwise learning rates: Accelerating geometry- aware optimization for deep neural network training","work_id":"43915281-2b91-46ce-9436-f6f81a79cf7a","year":null},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":5,"title":"Large batch training does not need warmup.arXiv preprint arXiv:2002.01576,","work_id":"ca8ff354-b95e-4dc9-a3ba-892034201629","year":2002}],"snapshot_sha256":"d1da5c8fe04af6fd364e2c67fba1c27bf064927f332a83421fc80acee9a401c5"},"source":{"id":"2605.15530","kind":"arxiv","version":1},"verdict":{"created_at":"2026-05-19T14:37:19.333466Z","id":"147a7b78-4206-491d-ba15-662e0ef9a049","model_set":{"reader":"grok-4.3"},"one_line_summary":"Non-uniform learning rates correspond to a Stackelberg reformulation of the training objective whose two-time-scale alternating gradient descent yields finite-time convergence and can accelerate training through stronger optimization structure and sharper early curvature.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"Assigning a smaller learning rate to body layers and a larger learning rate to the final layer is equivalent to two-time-scale alternating gradient descent on a Stackelberg reformulation of neural network training.","strongest_claim":"training neural networks with a smaller learning rate for the body layers and a larger learning rate for the final layer can be interpreted as a two-time-scale alternating gradient descent algorithm applied to a Stackelberg reformulation of the original objective. We establish finite-time convergence guarantees for the algorithm under broad conditions that accommodate constraint sets and non-smooth activation functions.","weakest_assumption":"The training dynamics of a neural network can be accurately captured by a Stackelberg game in which the final layer is the leader whose objective is defined on the followers' best response; this reformulation must preserve the original optimization landscape sufficiently for the convergence and curvature claims to transfer back to standard training."}},"verdict_id":"147a7b78-4206-491d-ba15-662e0ef9a049"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:90cee300d55dde1b182f1f794fccc58316f97b376abc31c6a2aa427d2659f979","target":"record","created_at":"2026-05-20T00:01:03Z","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":"a6a1f834261719ca90efaa28d358065ad5649c7b5fc8d826fbc25614199b3e5d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2026-05-15T01:59:10Z","title_canon_sha256":"3030629c6c60df30f956abb675863bd5b4868cf177fb8c0f69193342135f5fc3"},"schema_version":"1.0","source":{"id":"2605.15530","kind":"arxiv","version":1}},"canonical_sha256":"87e2fff5a91168c9558aa6ba721740b448e77fceb44c662c8f4e5e1d16959941","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"87e2fff5a91168c9558aa6ba721740b448e77fceb44c662c8f4e5e1d16959941","first_computed_at":"2026-05-20T00:01:03.658498Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-20T00:01:03.658498Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"AbGQFaaVETd47TGzQ0JoHJk7NAWgmXKuLXIeEwoa3AMTyPXRd6rM7uLpNN2sQd0Qpx0p3D1jc64Lh3bJL3kDDw==","signature_status":"signed_v1","signed_at":"2026-05-20T00:01:03.659307Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.15530","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:90cee300d55dde1b182f1f794fccc58316f97b376abc31c6a2aa427d2659f979","sha256:e589f87d321dbe62d8f785bb26f400bb9330c78aead2ad335457bf9fbf6ade0a"],"state_sha256":"abe3233087dafafeb60e87de26954de2649286f338b58d1c8041470165205920"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/gdIBM/eT3XYpQDVjdBR3KFTXDmVfkdpaONo7b3+fNDZmDCCAnOid/GYsJeNokm9yb6ih2k5nuPg2/vbwZNBBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-20T18:42:26.270041Z","bundle_sha256":"662417bcb4cee78c0a5b65f4994a6c544a2e973993904b4731513e26b5e264a4"}}