{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:OZBITBH37GEKAYYOWFMCSKZ2LE","short_pith_number":"pith:OZBITBH3","canonical_record":{"source":{"id":"2303.10512","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2023-03-18T22:36:25Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"65487a5ce3ebbb82788f0b281cf811b249831a49cdde8c5a10501f61fb3e55d1","abstract_canon_sha256":"3b5dc8bf7f1deb065599367115db56ba5b23504379c8d78d18af86a3fce6ffd2"},"schema_version":"1.0"},"canonical_sha256":"76428984fbf988a0630eb158292b3a591495e7b40d4632af634ce86099f2d26c","source":{"kind":"arxiv","id":"2303.10512","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2303.10512","created_at":"2026-07-05T07:26:36Z"},{"alias_kind":"arxiv_version","alias_value":"2303.10512v2","created_at":"2026-07-05T07:26:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2303.10512","created_at":"2026-07-05T07:26:36Z"},{"alias_kind":"pith_short_12","alias_value":"OZBITBH37GEK","created_at":"2026-07-05T07:26:36Z"},{"alias_kind":"pith_short_16","alias_value":"OZBITBH37GEKAYYO","created_at":"2026-07-05T07:26:36Z"},{"alias_kind":"pith_short_8","alias_value":"OZBITBH3","created_at":"2026-07-05T07:26:36Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:OZBITBH37GEKAYYOWFMCSKZ2LE","target":"record","payload":{"canonical_record":{"source":{"id":"2303.10512","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2023-03-18T22:36:25Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"65487a5ce3ebbb82788f0b281cf811b249831a49cdde8c5a10501f61fb3e55d1","abstract_canon_sha256":"3b5dc8bf7f1deb065599367115db56ba5b23504379c8d78d18af86a3fce6ffd2"},"schema_version":"1.0"},"canonical_sha256":"76428984fbf988a0630eb158292b3a591495e7b40d4632af634ce86099f2d26c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:26:36.608511Z","signature_b64":"Zny98Vr7rUiKxBf/pWoeRt3RJAfLocATH9nFPes+7womN3XClB6lLkaNEXmdXRiroWaHhjIB1vKZ9zDvII0UAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"76428984fbf988a0630eb158292b3a591495e7b40d4632af634ce86099f2d26c","last_reissued_at":"2026-07-05T07:26:36.608012Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:26:36.608012Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2303.10512","source_version":2,"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-07-05T07:26:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"STc35O3+D3CRU9kDyhys518R0Wu3cxmKidaeBC3xiKSuNZrLPD2aoVUx9oG6TpGL/5sT3VDwGiZSXTIsNzcgCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-07T22:35:00.327734Z"},"content_sha256":"0474c469101867e773ddd61c948dd15876b1667843f9159c920fadbacda3f939","schema_version":"1.0","event_id":"sha256:0474c469101867e773ddd61c948dd15876b1667843f9159c920fadbacda3f939"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:OZBITBH37GEKAYYOWFMCSKZ2LE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"AdaLoRA: Adaptive Budget Allocation for Parameter-Efficient Fine-Tuning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"AdaLoRA allocates the fine-tuning budget across weight matrices by ranking the importance of their low-rank updates via singular value decomposition.","cross_cats":["cs.LG"],"primary_cat":"cs.CL","authors_text":"Alexander Bukharin, Minshuo Chen, Nikos Karampatziakis, Pengcheng He, Qingru Zhang, Tuo Zhao, Weizhu Chen, Yu Cheng","submitted_at":"2023-03-18T22:36:25Z","abstract_excerpt":"Fine-tuning large pre-trained language models on downstream tasks has become an important paradigm in NLP. However, common practice fine-tunes all of the parameters in a pre-trained model, which becomes prohibitive when a large number of downstream tasks are present. Therefore, many fine-tuning methods are proposed to learn incremental updates of pre-trained weights in a parameter efficient way, e.g., low-rank increments. These methods often evenly distribute the budget of incremental updates across all pre-trained weight matrices, and overlook the varying importance of different weight parame"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"AdaLoRA adaptively allocates the parameter budget among weight matrices according to their importance score. In particular, AdaLoRA parameterizes the incremental updates in the form of singular value decomposition. Such a novel approach allows us to effectively prune the singular values of unimportant updates... Results demonstrate that AdaLoRA manifests notable improvement over baselines, especially in the low budget settings.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"That an importance score derived from the singular values of the low-rank updates can reliably identify which weight matrices deserve more budget, and that pruning those singular values preserves task performance without introducing new failure modes.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"AdaLoRA uses SVD-based pruning to allocate the parameter budget for low-rank fine-tuning updates according to per-matrix importance scores, yielding better performance than uniform allocation especially under tight budgets.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"AdaLoRA allocates the fine-tuning budget across weight matrices by ranking the importance of their low-rank updates via singular value decomposition.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"a86fce3dfdceaf992ad237074599ed389be386522af5ac34b7dcda87c9410583"},"source":{"id":"2303.10512","kind":"arxiv","version":2},"verdict":{"id":"1fe8e0ae-5667-4f02-a8c1-b6269d565b2c","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-12T21:05:26.726030Z","strongest_claim":"AdaLoRA adaptively allocates the parameter budget among weight matrices according to their importance score. In particular, AdaLoRA parameterizes the incremental updates in the form of singular value decomposition. Such a novel approach allows us to effectively prune the singular values of unimportant updates... Results demonstrate that AdaLoRA manifests notable improvement over baselines, especially in the low budget settings.","one_line_summary":"AdaLoRA uses SVD-based pruning to allocate the parameter budget for low-rank fine-tuning updates according to per-matrix importance scores, yielding better performance than uniform allocation especially under tight budgets.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"That an importance score derived from the singular values of the low-rank updates can reliably identify which weight matrices deserve more budget, and that pruning those singular values preserves task performance without introducing new failure modes.","pith_extraction_headline":"AdaLoRA allocates the fine-tuning budget across weight matrices by ranking the importance of their low-rank updates via singular value decomposition."},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2303.10512/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":29,"sample":[{"doi":"","year":null,"title":"Layer Normalization","work_id":"20a2d720-0046-4c7c-bcd6-327ec8143f69","ref_index":1,"cited_arxiv_id":"1607.06450","is_internal_anchor":true},{"doi":"","year":2020,"title":"Tom B. Brown, Benjamin Mann, Nick Ryder, Melanie Subbiah, Jared Kaplan, Prafulla Dhariwal, Arvind Neelakantan, Pranav Shyam, Girish Sastry, Amanda Askell, Sandhini Agarwal, Ariel Herbert-V oss, Gretch","work_id":"f9577620-882a-46b2-a20a-aa941252e001","ref_index":2,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":1956,"title":"A singular value thresholding algorithm for matrix completion","work_id":"2750dd56-cb17-409e-b68a-2c0844c647e2","ref_index":3,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2019,"title":"BERT: Pre-training of deep bidirectional transformers for language understanding","work_id":"3b4c5fa8-87a9-4e13-9374-3e8e3e4152db","ref_index":4,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"10.18653/v1/n19-1423","year":2012,"title":"BERT : Pre-training of Deep Bidirectional Transformers for Language Understanding","work_id":"3e3c8ac8-b858-4b22-af32-393d98c883e0","ref_index":5,"cited_arxiv_id":"","is_internal_anchor":false}],"resolved_work":29,"snapshot_sha256":"e8a8420dee8f325476254c62a13548291898c7686adccc89b91a827d20f244f9","internal_anchors":4},"formal_canon":{"evidence_count":2,"snapshot_sha256":"702081faf90759dd001f2c08dc9ffea7e96d701fcada54edfa5d795b2fad9d6e"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"verdict_id":"1fe8e0ae-5667-4f02-a8c1-b6269d565b2c"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T07:26:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ULoavNsZtnfFauQ2IWCzTgWP+3dbQC7b8GaBkOYLnOlzpMkQqNAgFMvS2WZfwvNWAY4BZnxWSRVcnMiyjTPUCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-07T22:35:00.328607Z"},"content_sha256":"52bd602b1a6fcb9bd279ea562e415461889d8d051dc4e3c4c5d672bcda813dcb","schema_version":"1.0","event_id":"sha256:52bd602b1a6fcb9bd279ea562e415461889d8d051dc4e3c4c5d672bcda813dcb"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OZBITBH37GEKAYYOWFMCSKZ2LE/bundle.json","state_url":"https://pith.science/pith/OZBITBH37GEKAYYOWFMCSKZ2LE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OZBITBH37GEKAYYOWFMCSKZ2LE/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-08-07T22:35:00Z","links":{"resolver":"https://pith.science/pith/OZBITBH37GEKAYYOWFMCSKZ2LE","bundle":"https://pith.science/pith/OZBITBH37GEKAYYOWFMCSKZ2LE/bundle.json","state":"https://pith.science/pith/OZBITBH37GEKAYYOWFMCSKZ2LE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OZBITBH37GEKAYYOWFMCSKZ2LE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:OZBITBH37GEKAYYOWFMCSKZ2LE","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":"3b5dc8bf7f1deb065599367115db56ba5b23504379c8d78d18af86a3fce6ffd2","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2023-03-18T22:36:25Z","title_canon_sha256":"65487a5ce3ebbb82788f0b281cf811b249831a49cdde8c5a10501f61fb3e55d1"},"schema_version":"1.0","source":{"id":"2303.10512","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2303.10512","created_at":"2026-07-05T07:26:36Z"},{"alias_kind":"arxiv_version","alias_value":"2303.10512v2","created_at":"2026-07-05T07:26:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2303.10512","created_at":"2026-07-05T07:26:36Z"},{"alias_kind":"pith_short_12","alias_value":"OZBITBH37GEK","created_at":"2026-07-05T07:26:36Z"},{"alias_kind":"pith_short_16","alias_value":"OZBITBH37GEKAYYO","created_at":"2026-07-05T07:26:36Z"},{"alias_kind":"pith_short_8","alias_value":"OZBITBH3","created_at":"2026-07-05T07:26:36Z"}],"graph_snapshots":[{"event_id":"sha256:52bd602b1a6fcb9bd279ea562e415461889d8d051dc4e3c4c5d672bcda813dcb","target":"graph","created_at":"2026-07-05T07:26:36Z","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":"AdaLoRA adaptively allocates the parameter budget among weight matrices according to their importance score. In particular, AdaLoRA parameterizes the incremental updates in the form of singular value decomposition. Such a novel approach allows us to effectively prune the singular values of unimportant updates... Results demonstrate that AdaLoRA manifests notable improvement over baselines, especially in the low budget settings."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"That an importance score derived from the singular values of the low-rank updates can reliably identify which weight matrices deserve more budget, and that pruning those singular values preserves task performance without introducing new failure modes."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"AdaLoRA uses SVD-based pruning to allocate the parameter budget for low-rank fine-tuning updates according to per-matrix importance scores, yielding better performance than uniform allocation especially under tight budgets."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"AdaLoRA allocates the fine-tuning budget across weight matrices by ranking the importance of their low-rank updates via singular value decomposition."}],"snapshot_sha256":"a86fce3dfdceaf992ad237074599ed389be386522af5ac34b7dcda87c9410583"},"formal_canon":{"evidence_count":2,"snapshot_sha256":"702081faf90759dd001f2c08dc9ffea7e96d701fcada54edfa5d795b2fad9d6e"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2303.10512/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Fine-tuning large pre-trained language models on downstream tasks has become an important paradigm in NLP. However, common practice fine-tunes all of the parameters in a pre-trained model, which becomes prohibitive when a large number of downstream tasks are present. Therefore, many fine-tuning methods are proposed to learn incremental updates of pre-trained weights in a parameter efficient way, e.g., low-rank increments. These methods often evenly distribute the budget of incremental updates across all pre-trained weight matrices, and overlook the varying importance of different weight parame","authors_text":"Alexander Bukharin, Minshuo Chen, Nikos Karampatziakis, Pengcheng He, Qingru Zhang, Tuo Zhao, Weizhu Chen, Yu Cheng","cross_cats":["cs.LG"],"headline":"AdaLoRA allocates the fine-tuning budget across weight matrices by ranking the importance of their low-rank updates via singular value decomposition.","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2023-03-18T22:36:25Z","title":"AdaLoRA: Adaptive Budget Allocation for Parameter-Efficient Fine-Tuning"},"references":{"count":29,"internal_anchors":4,"resolved_work":29,"sample":[{"cited_arxiv_id":"1607.06450","doi":"","is_internal_anchor":true,"ref_index":1,"title":"Layer Normalization","work_id":"20a2d720-0046-4c7c-bcd6-327ec8143f69","year":null},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":2,"title":"Tom B. Brown, Benjamin Mann, Nick Ryder, Melanie Subbiah, Jared Kaplan, Prafulla Dhariwal, Arvind Neelakantan, Pranav Shyam, Girish Sastry, Amanda Askell, Sandhini Agarwal, Ariel Herbert-V oss, Gretch","work_id":"f9577620-882a-46b2-a20a-aa941252e001","year":2020},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":3,"title":"A singular value thresholding algorithm for matrix completion","work_id":"2750dd56-cb17-409e-b68a-2c0844c647e2","year":1956},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":4,"title":"BERT: Pre-training of deep bidirectional transformers for language understanding","work_id":"3b4c5fa8-87a9-4e13-9374-3e8e3e4152db","year":2019},{"cited_arxiv_id":"","doi":"10.18653/v1/n19-1423","is_internal_anchor":false,"ref_index":5,"title":"BERT : Pre-training of Deep Bidirectional Transformers for Language Understanding","work_id":"3e3c8ac8-b858-4b22-af32-393d98c883e0","year":2012}],"snapshot_sha256":"e8a8420dee8f325476254c62a13548291898c7686adccc89b91a827d20f244f9"},"source":{"id":"2303.10512","kind":"arxiv","version":2},"verdict":{"created_at":"2026-05-12T21:05:26.726030Z","id":"1fe8e0ae-5667-4f02-a8c1-b6269d565b2c","model_set":{"reader":"grok-4.3"},"one_line_summary":"AdaLoRA uses SVD-based pruning to allocate the parameter budget for low-rank fine-tuning updates according to per-matrix importance scores, yielding better performance than uniform allocation especially under tight budgets.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"AdaLoRA allocates the fine-tuning budget across weight matrices by ranking the importance of their low-rank updates via singular value decomposition.","strongest_claim":"AdaLoRA adaptively allocates the parameter budget among weight matrices according to their importance score. In particular, AdaLoRA parameterizes the incremental updates in the form of singular value decomposition. Such a novel approach allows us to effectively prune the singular values of unimportant updates... Results demonstrate that AdaLoRA manifests notable improvement over baselines, especially in the low budget settings.","weakest_assumption":"That an importance score derived from the singular values of the low-rank updates can reliably identify which weight matrices deserve more budget, and that pruning those singular values preserves task performance without introducing new failure modes."}},"verdict_id":"1fe8e0ae-5667-4f02-a8c1-b6269d565b2c"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:0474c469101867e773ddd61c948dd15876b1667843f9159c920fadbacda3f939","target":"record","created_at":"2026-07-05T07:26:36Z","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":"3b5dc8bf7f1deb065599367115db56ba5b23504379c8d78d18af86a3fce6ffd2","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2023-03-18T22:36:25Z","title_canon_sha256":"65487a5ce3ebbb82788f0b281cf811b249831a49cdde8c5a10501f61fb3e55d1"},"schema_version":"1.0","source":{"id":"2303.10512","kind":"arxiv","version":2}},"canonical_sha256":"76428984fbf988a0630eb158292b3a591495e7b40d4632af634ce86099f2d26c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"76428984fbf988a0630eb158292b3a591495e7b40d4632af634ce86099f2d26c","first_computed_at":"2026-07-05T07:26:36.608012Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T07:26:36.608012Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Zny98Vr7rUiKxBf/pWoeRt3RJAfLocATH9nFPes+7womN3XClB6lLkaNEXmdXRiroWaHhjIB1vKZ9zDvII0UAQ==","signature_status":"signed_v1","signed_at":"2026-07-05T07:26:36.608511Z","signed_message":"canonical_sha256_bytes"},"source_id":"2303.10512","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0474c469101867e773ddd61c948dd15876b1667843f9159c920fadbacda3f939","sha256:52bd602b1a6fcb9bd279ea562e415461889d8d051dc4e3c4c5d672bcda813dcb"],"state_sha256":"43ed24d2320bc94ed4b04f76068f7231427c7e4dda1fbdd889278196fdd8c5d1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GWkal5s48NGqbe/4/SllYhPIAzHmv9H4FfnfQaO/2e6XSZkTsFOZKwiDBm53BZBsR2S1WHufCALrVOLr+/DaCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-07T22:35:00.334273Z","bundle_sha256":"e781d6e86a99e8f45a25987db929e64b76038de25c1ca172670c7d9139a0948f"}}