{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:JZXSMH5SMQSHSN3WQIHAGLKFO5","short_pith_number":"pith:JZXSMH5S","canonical_record":{"source":{"id":"2605.17266","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SP","submitted_at":"2026-05-17T05:21:15Z","cross_cats_sorted":[],"title_canon_sha256":"34a7fecd2247fd60c8301c37ca6d026de8eba447a1291503557b053ca08564ea","abstract_canon_sha256":"856da6cd4cd545b6eaf50daad39ed4b3403f620d562c8fa49ba8d50a3494fa6c"},"schema_version":"1.0"},"canonical_sha256":"4e6f261fb26424793776820e032d4577614c369306dafde89bf4e83ec51cdb0a","source":{"kind":"arxiv","id":"2605.17266","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.17266","created_at":"2026-05-20T00:03:48Z"},{"alias_kind":"arxiv_version","alias_value":"2605.17266v1","created_at":"2026-05-20T00:03:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.17266","created_at":"2026-05-20T00:03:48Z"},{"alias_kind":"pith_short_12","alias_value":"JZXSMH5SMQSH","created_at":"2026-05-20T00:03:48Z"},{"alias_kind":"pith_short_16","alias_value":"JZXSMH5SMQSHSN3W","created_at":"2026-05-20T00:03:48Z"},{"alias_kind":"pith_short_8","alias_value":"JZXSMH5S","created_at":"2026-05-20T00:03:48Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:JZXSMH5SMQSHSN3WQIHAGLKFO5","target":"record","payload":{"canonical_record":{"source":{"id":"2605.17266","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SP","submitted_at":"2026-05-17T05:21:15Z","cross_cats_sorted":[],"title_canon_sha256":"34a7fecd2247fd60c8301c37ca6d026de8eba447a1291503557b053ca08564ea","abstract_canon_sha256":"856da6cd4cd545b6eaf50daad39ed4b3403f620d562c8fa49ba8d50a3494fa6c"},"schema_version":"1.0"},"canonical_sha256":"4e6f261fb26424793776820e032d4577614c369306dafde89bf4e83ec51cdb0a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-20T00:03:48.752144Z","signature_b64":"h1H67K13uQNHcA+oq6HzIgGi3yBtm3Bxp6XlGZrtsl8dtbTpp6BPTTR1FSM63SAe58C3sYm+AwiobPiSxhGhBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4e6f261fb26424793776820e032d4577614c369306dafde89bf4e83ec51cdb0a","last_reissued_at":"2026-05-20T00:03:48.751290Z","signature_status":"signed_v1","first_computed_at":"2026-05-20T00:03:48.751290Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2605.17266","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:03:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"d9YWwdTVeDrx1j6I1OC2nK2QX7IHVeSpM6iCbBQh7pCS1hUiSp53L+8JLXeIvGzN4JkuLLFjCfKk6EdNwU0RBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T20:55:27.088005Z"},"content_sha256":"291206f454438b72d4ae72fc4ec9b8a18627aff35f1d9f3307a6c384423455e6","schema_version":"1.0","event_id":"sha256:291206f454438b72d4ae72fc4ec9b8a18627aff35f1d9f3307a6c384423455e6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:JZXSMH5SMQSHSN3WQIHAGLKFO5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Leveraging Deep Reinforcement Learning for Clustered Cell-Free Networking Over User Mobility","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"Deep reinforcement learning partitions cell-free networks into clusters using only one channel estimate per access point.","cross_cats":[],"primary_cat":"eess.SP","authors_text":"Antonio P\\'erez Yuste, Bo Qian, Junyuan Wang, Ouyang Zhou, Yusheng Ji","submitted_at":"2026-05-17T05:21:15Z","abstract_excerpt":"Clustered cell-free networking paves a new way for enabling scalable joint transmission among access points (APs) by partitioning the whole network into non-overlapping subnetworks. Previous works adopted clustering algorithms, graph partitioning methods or conventional continuous optimization theories to partition a network based on the channels between all users and all APs, resulting in huge channel measurement and computational costs. This makes these methods difficult to be implemented in practical systems since the optimal network partition could vary frequently due to user mobility. In "},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"The proposed DDPG-C²F framework can be adapted in various application scenarios with different objectives and constraints, outperforms existing baselines in all scenarios, reduces the handover cost over user mobility, and is robust to dynamic scenarios with random user joining or leaving.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"That a single channel estimate per access point provides sufficient state information for the neural network to produce effective clustering decisions that generalize across real-world mobility patterns and varying network sizes.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"A DRL-based framework for clustered cell-free networking reduces channel estimation overhead to a single measurement per AP and adapts to user mobility, outperforming prior clustering methods in simulations across multiple objectives.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"Deep reinforcement learning partitions cell-free networks into clusters using only one channel estimate per access point.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"26ea67fa62090520bd28c8275870c9f918073af053a1e351e1b578802fc01b32"},"source":{"id":"2605.17266","kind":"arxiv","version":1},"verdict":{"id":"b24438f1-698a-4af2-9437-518679ae8d5c","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-19T23:22:26.827109Z","strongest_claim":"The proposed DDPG-C²F framework can be adapted in various application scenarios with different objectives and constraints, outperforms existing baselines in all scenarios, reduces the handover cost over user mobility, and is robust to dynamic scenarios with random user joining or leaving.","one_line_summary":"A DRL-based framework for clustered cell-free networking reduces channel estimation overhead to a single measurement per AP and adapts to user mobility, outperforming prior clustering methods in simulations across multiple objectives.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"That a single channel estimate per access point provides sufficient state information for the neural network to produce effective clustering decisions that generalize across real-world mobility patterns and varying network sizes.","pith_extraction_headline":"Deep reinforcement learning partitions cell-free networks into clusters using only one channel estimate per access point."},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2605.17266/integrity.json","findings":[],"available":true,"detectors_run":[{"name":"doi_title_agreement","ran_at":"2026-05-19T23:31:20.246908Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"doi_compliance","ran_at":"2026-05-19T23:31:00.919236Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"claim_evidence","ran_at":"2026-05-19T22:01:57.842198Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"ai_meta_artifact","ran_at":"2026-05-19T21:33:23.781101Z","status":"skipped","version":"1.0.0","findings_count":0}],"snapshot_sha256":"6a743964447332ee6cc6f1418fcef0c6fffa69eb7060c23e7f67b02b4381051b"},"references":{"count":41,"sample":[{"doi":"","year":2025,"title":"A deep reinforcement learning framework for clustered cell-free networking over user mobility,","work_id":"2f37d3e7-5a2c-47ef-b43f-ef915028b22d","ref_index":1,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2023,"title":"5G-advanced toward 6G: Past, present, and future,","work_id":"f4391125-f2d2-439a-9689-cd1adf30eb60","ref_index":2,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2015,"title":"Asymptotic rate analysis of downlink multi-user systems with co-located and distributed antennas,","work_id":"5197b6f2-c173-4d5b-9d94-1c1e01007235","ref_index":3,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2012,"title":"Network MIMO with linear zero- forcing beamforming: Large system analysis, impact of channel esti- mation, and reduced-complexity scheduling,","work_id":"dd0ff3f5-8aa9-4204-aab3-ed9e2fed51f0","ref_index":4,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2018,"title":"User-centric C- RAN architecture for ultra-dense 6G networks: Challenges and method- ologies,","work_id":"5f6b515b-ab38-4d47-b485-7fca60617058","ref_index":5,"cited_arxiv_id":"","is_internal_anchor":false}],"resolved_work":41,"snapshot_sha256":"e075e778ab18faa6ce43f41471a54d7e1375a33b096d21ba669606a36fbccc4e","internal_anchors":0},"formal_canon":{"evidence_count":2,"snapshot_sha256":"03f7ab7213f5dcaaa3d80fcd3ff7f4987f9f2066522f5462f350f60da3b7dcc9"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"verdict_id":"b24438f1-698a-4af2-9437-518679ae8d5c"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-20T00:03:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kJoJV/pGuF2dWasxnA0qcR5iT+ADxnRlkOfndU/2f6/K0XfKJwJ7LK4jsG+AoynrGfFtLTzD1nkPM+YlxCJwBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T20:55:27.089174Z"},"content_sha256":"390862b31751cc3b5ff4aa6eb756969edda83020a169aed0d5eb32b931da2027","schema_version":"1.0","event_id":"sha256:390862b31751cc3b5ff4aa6eb756969edda83020a169aed0d5eb32b931da2027"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JZXSMH5SMQSHSN3WQIHAGLKFO5/bundle.json","state_url":"https://pith.science/pith/JZXSMH5SMQSHSN3WQIHAGLKFO5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JZXSMH5SMQSHSN3WQIHAGLKFO5/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-28T20:55:27Z","links":{"resolver":"https://pith.science/pith/JZXSMH5SMQSHSN3WQIHAGLKFO5","bundle":"https://pith.science/pith/JZXSMH5SMQSHSN3WQIHAGLKFO5/bundle.json","state":"https://pith.science/pith/JZXSMH5SMQSHSN3WQIHAGLKFO5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JZXSMH5SMQSHSN3WQIHAGLKFO5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:JZXSMH5SMQSHSN3WQIHAGLKFO5","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":"856da6cd4cd545b6eaf50daad39ed4b3403f620d562c8fa49ba8d50a3494fa6c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SP","submitted_at":"2026-05-17T05:21:15Z","title_canon_sha256":"34a7fecd2247fd60c8301c37ca6d026de8eba447a1291503557b053ca08564ea"},"schema_version":"1.0","source":{"id":"2605.17266","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.17266","created_at":"2026-05-20T00:03:48Z"},{"alias_kind":"arxiv_version","alias_value":"2605.17266v1","created_at":"2026-05-20T00:03:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.17266","created_at":"2026-05-20T00:03:48Z"},{"alias_kind":"pith_short_12","alias_value":"JZXSMH5SMQSH","created_at":"2026-05-20T00:03:48Z"},{"alias_kind":"pith_short_16","alias_value":"JZXSMH5SMQSHSN3W","created_at":"2026-05-20T00:03:48Z"},{"alias_kind":"pith_short_8","alias_value":"JZXSMH5S","created_at":"2026-05-20T00:03:48Z"}],"graph_snapshots":[{"event_id":"sha256:390862b31751cc3b5ff4aa6eb756969edda83020a169aed0d5eb32b931da2027","target":"graph","created_at":"2026-05-20T00:03:48Z","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":"The proposed DDPG-C²F framework can be adapted in various application scenarios with different objectives and constraints, outperforms existing baselines in all scenarios, reduces the handover cost over user mobility, and is robust to dynamic scenarios with random user joining or leaving."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"That a single channel estimate per access point provides sufficient state information for the neural network to produce effective clustering decisions that generalize across real-world mobility patterns and varying network sizes."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"A DRL-based framework for clustered cell-free networking reduces channel estimation overhead to a single measurement per AP and adapts to user mobility, outperforming prior clustering methods in simulations across multiple objectives."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"Deep reinforcement learning partitions cell-free networks into clusters using only one channel estimate per access point."}],"snapshot_sha256":"26ea67fa62090520bd28c8275870c9f918073af053a1e351e1b578802fc01b32"},"formal_canon":{"evidence_count":2,"snapshot_sha256":"03f7ab7213f5dcaaa3d80fcd3ff7f4987f9f2066522f5462f350f60da3b7dcc9"},"integrity":{"available":true,"clean":true,"detectors_run":[{"findings_count":0,"name":"doi_title_agreement","ran_at":"2026-05-19T23:31:20.246908Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"doi_compliance","ran_at":"2026-05-19T23:31:00.919236Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"claim_evidence","ran_at":"2026-05-19T22:01:57.842198Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"ai_meta_artifact","ran_at":"2026-05-19T21:33:23.781101Z","status":"skipped","version":"1.0.0"}],"endpoint":"/pith/2605.17266/integrity.json","findings":[],"snapshot_sha256":"6a743964447332ee6cc6f1418fcef0c6fffa69eb7060c23e7f67b02b4381051b","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Clustered cell-free networking paves a new way for enabling scalable joint transmission among access points (APs) by partitioning the whole network into non-overlapping subnetworks. Previous works adopted clustering algorithms, graph partitioning methods or conventional continuous optimization theories to partition a network based on the channels between all users and all APs, resulting in huge channel measurement and computational costs. This makes these methods difficult to be implemented in practical systems since the optimal network partition could vary frequently due to user mobility. In ","authors_text":"Antonio P\\'erez Yuste, Bo Qian, Junyuan Wang, Ouyang Zhou, Yusheng Ji","cross_cats":[],"headline":"Deep reinforcement learning partitions cell-free networks into clusters using only one channel estimate per access point.","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SP","submitted_at":"2026-05-17T05:21:15Z","title":"Leveraging Deep Reinforcement Learning for Clustered Cell-Free Networking Over User Mobility"},"references":{"count":41,"internal_anchors":0,"resolved_work":41,"sample":[{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":1,"title":"A deep reinforcement learning framework for clustered cell-free networking over user mobility,","work_id":"2f37d3e7-5a2c-47ef-b43f-ef915028b22d","year":2025},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":2,"title":"5G-advanced toward 6G: Past, present, and future,","work_id":"f4391125-f2d2-439a-9689-cd1adf30eb60","year":2023},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":3,"title":"Asymptotic rate analysis of downlink multi-user systems with co-located and distributed antennas,","work_id":"5197b6f2-c173-4d5b-9d94-1c1e01007235","year":2015},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":4,"title":"Network MIMO with linear zero- forcing beamforming: Large system analysis, impact of channel esti- mation, and reduced-complexity scheduling,","work_id":"dd0ff3f5-8aa9-4204-aab3-ed9e2fed51f0","year":2012},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":5,"title":"User-centric C- RAN architecture for ultra-dense 6G networks: Challenges and method- ologies,","work_id":"5f6b515b-ab38-4d47-b485-7fca60617058","year":2018}],"snapshot_sha256":"e075e778ab18faa6ce43f41471a54d7e1375a33b096d21ba669606a36fbccc4e"},"source":{"id":"2605.17266","kind":"arxiv","version":1},"verdict":{"created_at":"2026-05-19T23:22:26.827109Z","id":"b24438f1-698a-4af2-9437-518679ae8d5c","model_set":{"reader":"grok-4.3"},"one_line_summary":"A DRL-based framework for clustered cell-free networking reduces channel estimation overhead to a single measurement per AP and adapts to user mobility, outperforming prior clustering methods in simulations across multiple objectives.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"Deep reinforcement learning partitions cell-free networks into clusters using only one channel estimate per access point.","strongest_claim":"The proposed DDPG-C²F framework can be adapted in various application scenarios with different objectives and constraints, outperforms existing baselines in all scenarios, reduces the handover cost over user mobility, and is robust to dynamic scenarios with random user joining or leaving.","weakest_assumption":"That a single channel estimate per access point provides sufficient state information for the neural network to produce effective clustering decisions that generalize across real-world mobility patterns and varying network sizes."}},"verdict_id":"b24438f1-698a-4af2-9437-518679ae8d5c"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:291206f454438b72d4ae72fc4ec9b8a18627aff35f1d9f3307a6c384423455e6","target":"record","created_at":"2026-05-20T00:03:48Z","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":"856da6cd4cd545b6eaf50daad39ed4b3403f620d562c8fa49ba8d50a3494fa6c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SP","submitted_at":"2026-05-17T05:21:15Z","title_canon_sha256":"34a7fecd2247fd60c8301c37ca6d026de8eba447a1291503557b053ca08564ea"},"schema_version":"1.0","source":{"id":"2605.17266","kind":"arxiv","version":1}},"canonical_sha256":"4e6f261fb26424793776820e032d4577614c369306dafde89bf4e83ec51cdb0a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4e6f261fb26424793776820e032d4577614c369306dafde89bf4e83ec51cdb0a","first_computed_at":"2026-05-20T00:03:48.751290Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-20T00:03:48.751290Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"h1H67K13uQNHcA+oq6HzIgGi3yBtm3Bxp6XlGZrtsl8dtbTpp6BPTTR1FSM63SAe58C3sYm+AwiobPiSxhGhBw==","signature_status":"signed_v1","signed_at":"2026-05-20T00:03:48.752144Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.17266","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:291206f454438b72d4ae72fc4ec9b8a18627aff35f1d9f3307a6c384423455e6","sha256:390862b31751cc3b5ff4aa6eb756969edda83020a169aed0d5eb32b931da2027"],"state_sha256":"2e8ee5296ea37438d898cabfa259276579ef237db69da1410f6f171854f82edb"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0CCJ7JseahcVNjukyhh+uiJZAJwLEpUBjxGR79KOp2N5zARJxUKyv8K2J69/l1FzGNNPJfB1NzViavR1E0w1AQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T20:55:27.093603Z","bundle_sha256":"08e19935dc8709841ccea8b404f00a3aeb2b65ee9d65b71388ea219b330b31f9"}}