{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:SNWO7HP3WNG5BF7OXKGNLGDY5C","short_pith_number":"pith:SNWO7HP3","canonical_record":{"source":{"id":"2605.16960","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2026-05-16T12:23:04Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"695923478310d2d6a7dc9af30e921d8d06da8f6439c17514c092715d46680248","abstract_canon_sha256":"64ad16c68143587f02ab852914247f89c2d6df2b390f9cfdc8e56a7f88d7c3b3"},"schema_version":"1.0"},"canonical_sha256":"936cef9dfbb34dd097eeba8cd59878e8a5ac89d56987f1f063f254e0a244aed9","source":{"kind":"arxiv","id":"2605.16960","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.16960","created_at":"2026-05-20T00:03:33Z"},{"alias_kind":"arxiv_version","alias_value":"2605.16960v1","created_at":"2026-05-20T00:03:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.16960","created_at":"2026-05-20T00:03:33Z"},{"alias_kind":"pith_short_12","alias_value":"SNWO7HP3WNG5","created_at":"2026-05-20T00:03:33Z"},{"alias_kind":"pith_short_16","alias_value":"SNWO7HP3WNG5BF7O","created_at":"2026-05-20T00:03:33Z"},{"alias_kind":"pith_short_8","alias_value":"SNWO7HP3","created_at":"2026-05-20T00:03:33Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:SNWO7HP3WNG5BF7OXKGNLGDY5C","target":"record","payload":{"canonical_record":{"source":{"id":"2605.16960","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2026-05-16T12:23:04Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"695923478310d2d6a7dc9af30e921d8d06da8f6439c17514c092715d46680248","abstract_canon_sha256":"64ad16c68143587f02ab852914247f89c2d6df2b390f9cfdc8e56a7f88d7c3b3"},"schema_version":"1.0"},"canonical_sha256":"936cef9dfbb34dd097eeba8cd59878e8a5ac89d56987f1f063f254e0a244aed9","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-20T00:03:33.001903Z","signature_b64":"Rjnuen1BLTByJxSCEcO2dmBTaBN4v5Y4M5e3N3wJR1cgs2NLivvDaEfshwUzEhE9wEewKpY1HQuyuQx+CZszDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"936cef9dfbb34dd097eeba8cd59878e8a5ac89d56987f1f063f254e0a244aed9","last_reissued_at":"2026-05-20T00:03:33.001067Z","signature_status":"signed_v1","first_computed_at":"2026-05-20T00:03:33.001067Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2605.16960","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:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6fKmC1oNWhVLYveQsSycdtmUL9zeJXII7QMVztF6SIP3PujG8qBcc2lD7to+UvHEbcYsNgyapSN2uPXukjkYCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T07:31:15.665070Z"},"content_sha256":"cfe688aff25e15fb4b5f75ad31d714a98c527753508b59f6734d82b6fc55c6bf","schema_version":"1.0","event_id":"sha256:cfe688aff25e15fb4b5f75ad31d714a98c527753508b59f6734d82b6fc55c6bf"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:SNWO7HP3WNG5BF7OXKGNLGDY5C","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Achieving $\\alpha$-Fairness in Clustered Cell-Free Networking: A Tight Relaxation Approach","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"Reformulating the clustering problem as a continuous optimization establishes exact equivalence to the integer program for alpha-fairness across four cases.","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Boxiang Ren, Chaowen Deng, Hao Wu, Jie Fan, Jingchen Peng, Junyuan Wang, Ziyuan Lyu","submitted_at":"2026-05-16T12:23:04Z","abstract_excerpt":"Clustered cell-free networking has emerged as a promising architecture to balance the high performance of cell-free massive MIMO and the scalability of traditional cellular systems. However, achieving fairness across subnetworks remains a critical yet largely unsolved challenge. This paper investigates the fairness problem in clustered cell-free networking and proposes a unified and tunable alpha-fairness scheme that effectively balances overall spectral efficiency and inter-subnetwork fairness. Using the closed-form deterministic equivalent of the ergodic sum capacity, we reformulate the comb"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"For each case, we establish the exact equivalence between the original integer program and its continuous relaxation, and develop efficient algorithms with guaranteed convergence.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"The closed-form deterministic equivalent of the ergodic sum capacity remains accurate enough after the clustering decisions are made that the reformulated continuous problem yields solutions whose true performance matches the claimed fairness and rate gains.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"A unified alpha-fairness scheme for clustered cell-free networking is achieved via closed-form deterministic equivalents and tight continuous relaxations that are exactly equivalent to the integer program in four cases of alpha.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"Reformulating the clustering problem as a continuous optimization establishes exact equivalence to the integer program for alpha-fairness across four cases.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"3d9c13a1dd381d5fc25e21441c722e8f4da7e33e30320f8e1a26b8c4f7e5cb5a"},"source":{"id":"2605.16960","kind":"arxiv","version":1},"verdict":{"id":"2e5a5e97-2f2c-40ad-ac3f-2fe9d4f3a145","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-19T19:00:45.282466Z","strongest_claim":"For each case, we establish the exact equivalence between the original integer program and its continuous relaxation, and develop efficient algorithms with guaranteed convergence.","one_line_summary":"A unified alpha-fairness scheme for clustered cell-free networking is achieved via closed-form deterministic equivalents and tight continuous relaxations that are exactly equivalent to the integer program in four cases of alpha.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"The closed-form deterministic equivalent of the ergodic sum capacity remains accurate enough after the clustering decisions are made that the reformulated continuous problem yields solutions whose true performance matches the claimed fairness and rate gains.","pith_extraction_headline":"Reformulating the clustering problem as a continuous optimization establishes exact equivalence to the integer program for alpha-fairness across four cases."},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2605.16960/integrity.json","findings":[],"available":true,"detectors_run":[{"name":"cited_work_retraction","ran_at":"2026-05-19T19:51:58.247888Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"citation_quote_validity","ran_at":"2026-05-19T19:50:16.112836Z","status":"completed","version":"0.1.0","findings_count":0},{"name":"doi_title_agreement","ran_at":"2026-05-19T19:31:18.917381Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"doi_compliance","ran_at":"2026-05-19T19:10:41.513085Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"claim_evidence","ran_at":"2026-05-19T18:41:56.231336Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"ai_meta_artifact","ran_at":"2026-05-19T18:33:26.316274Z","status":"skipped","version":"1.0.0","findings_count":0}],"snapshot_sha256":"a4ad2349283adcd5c22e9149c672c8190d69278682aaafee56378ba18e104860"},"references":{"count":51,"sample":[{"doi":"","year":2025,"title":"Towards load- balanced clustered cell-free networking: A tight relaxation approach,","work_id":"7b04ee40-11c2-4bc6-b873-1c93a920c6df","ref_index":1,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2020,"title":"A vision of 6G wireless systems: Applications, trends, technologies, and open research problems,","work_id":"a6622cc0-2df8-4473-bae5-b376b2377552","ref_index":2,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2011,"title":"Cell edge performance of cellular mobile systems,","work_id":"445b9921-a041-4c51-84b5-07a6600a7cc1","ref_index":3,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2005,"title":"D. Tse and P. Viswanath,Fundamentals of Wireless Communication. United States of America by Cambridge University Press, New York, 2005","work_id":"27d74928-42d4-4ba1-beeb-0bd7de080034","ref_index":4,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":1994,"title":"Shannon-theoretic approach to a Gaussian cellular multiple- access channel,","work_id":"98dfd160-cf0c-44db-896a-9a2968baa90d","ref_index":5,"cited_arxiv_id":"","is_internal_anchor":false}],"resolved_work":51,"snapshot_sha256":"226be9dd54341eafd4ae038a446c26ae42b8a228f1f4ad9a6a144af23918b066","internal_anchors":0},"formal_canon":{"evidence_count":2,"snapshot_sha256":"0c2b7886c67b1075c0086825587d51efced2e7a1c50922508629e0e92ae6041c"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"verdict_id":"2e5a5e97-2f2c-40ad-ac3f-2fe9d4f3a145"},"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:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pCL/Z3TmCJVcOU18/ACG+u2KOcXvkwJ+zMrnG/EhjNvfpdFVEUOU0mGKQ9fRaP3BxyKHrdoMKWpNwJtK8u+5CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T07:31:15.666306Z"},"content_sha256":"4c8c44fe28fb630de25814deae9c367ec383046a5a6727c891357f464baa2f16","schema_version":"1.0","event_id":"sha256:4c8c44fe28fb630de25814deae9c367ec383046a5a6727c891357f464baa2f16"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SNWO7HP3WNG5BF7OXKGNLGDY5C/bundle.json","state_url":"https://pith.science/pith/SNWO7HP3WNG5BF7OXKGNLGDY5C/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SNWO7HP3WNG5BF7OXKGNLGDY5C/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-27T07:31:15Z","links":{"resolver":"https://pith.science/pith/SNWO7HP3WNG5BF7OXKGNLGDY5C","bundle":"https://pith.science/pith/SNWO7HP3WNG5BF7OXKGNLGDY5C/bundle.json","state":"https://pith.science/pith/SNWO7HP3WNG5BF7OXKGNLGDY5C/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SNWO7HP3WNG5BF7OXKGNLGDY5C/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:SNWO7HP3WNG5BF7OXKGNLGDY5C","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":"64ad16c68143587f02ab852914247f89c2d6df2b390f9cfdc8e56a7f88d7c3b3","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2026-05-16T12:23:04Z","title_canon_sha256":"695923478310d2d6a7dc9af30e921d8d06da8f6439c17514c092715d46680248"},"schema_version":"1.0","source":{"id":"2605.16960","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.16960","created_at":"2026-05-20T00:03:33Z"},{"alias_kind":"arxiv_version","alias_value":"2605.16960v1","created_at":"2026-05-20T00:03:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.16960","created_at":"2026-05-20T00:03:33Z"},{"alias_kind":"pith_short_12","alias_value":"SNWO7HP3WNG5","created_at":"2026-05-20T00:03:33Z"},{"alias_kind":"pith_short_16","alias_value":"SNWO7HP3WNG5BF7O","created_at":"2026-05-20T00:03:33Z"},{"alias_kind":"pith_short_8","alias_value":"SNWO7HP3","created_at":"2026-05-20T00:03:33Z"}],"graph_snapshots":[{"event_id":"sha256:4c8c44fe28fb630de25814deae9c367ec383046a5a6727c891357f464baa2f16","target":"graph","created_at":"2026-05-20T00:03:33Z","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":"For each case, we establish the exact equivalence between the original integer program and its continuous relaxation, and develop efficient algorithms with guaranteed convergence."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"The closed-form deterministic equivalent of the ergodic sum capacity remains accurate enough after the clustering decisions are made that the reformulated continuous problem yields solutions whose true performance matches the claimed fairness and rate gains."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"A unified alpha-fairness scheme for clustered cell-free networking is achieved via closed-form deterministic equivalents and tight continuous relaxations that are exactly equivalent to the integer program in four cases of alpha."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"Reformulating the clustering problem as a continuous optimization establishes exact equivalence to the integer program for alpha-fairness across four cases."}],"snapshot_sha256":"3d9c13a1dd381d5fc25e21441c722e8f4da7e33e30320f8e1a26b8c4f7e5cb5a"},"formal_canon":{"evidence_count":2,"snapshot_sha256":"0c2b7886c67b1075c0086825587d51efced2e7a1c50922508629e0e92ae6041c"},"integrity":{"available":true,"clean":true,"detectors_run":[{"findings_count":0,"name":"cited_work_retraction","ran_at":"2026-05-19T19:51:58.247888Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"citation_quote_validity","ran_at":"2026-05-19T19:50:16.112836Z","status":"completed","version":"0.1.0"},{"findings_count":0,"name":"doi_title_agreement","ran_at":"2026-05-19T19:31:18.917381Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"doi_compliance","ran_at":"2026-05-19T19:10:41.513085Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"claim_evidence","ran_at":"2026-05-19T18:41:56.231336Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"ai_meta_artifact","ran_at":"2026-05-19T18:33:26.316274Z","status":"skipped","version":"1.0.0"}],"endpoint":"/pith/2605.16960/integrity.json","findings":[],"snapshot_sha256":"a4ad2349283adcd5c22e9149c672c8190d69278682aaafee56378ba18e104860","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Clustered cell-free networking has emerged as a promising architecture to balance the high performance of cell-free massive MIMO and the scalability of traditional cellular systems. However, achieving fairness across subnetworks remains a critical yet largely unsolved challenge. This paper investigates the fairness problem in clustered cell-free networking and proposes a unified and tunable alpha-fairness scheme that effectively balances overall spectral efficiency and inter-subnetwork fairness. Using the closed-form deterministic equivalent of the ergodic sum capacity, we reformulate the comb","authors_text":"Boxiang Ren, Chaowen Deng, Hao Wu, Jie Fan, Jingchen Peng, Junyuan Wang, Ziyuan Lyu","cross_cats":["math.IT"],"headline":"Reformulating the clustering problem as a continuous optimization establishes exact equivalence to the integer program for alpha-fairness across four cases.","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2026-05-16T12:23:04Z","title":"Achieving $\\alpha$-Fairness in Clustered Cell-Free Networking: A Tight Relaxation Approach"},"references":{"count":51,"internal_anchors":0,"resolved_work":51,"sample":[{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":1,"title":"Towards load- balanced clustered cell-free networking: A tight relaxation approach,","work_id":"7b04ee40-11c2-4bc6-b873-1c93a920c6df","year":2025},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":2,"title":"A vision of 6G wireless systems: Applications, trends, technologies, and open research problems,","work_id":"a6622cc0-2df8-4473-bae5-b376b2377552","year":2020},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":3,"title":"Cell edge performance of cellular mobile systems,","work_id":"445b9921-a041-4c51-84b5-07a6600a7cc1","year":2011},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":4,"title":"D. Tse and P. Viswanath,Fundamentals of Wireless Communication. United States of America by Cambridge University Press, New York, 2005","work_id":"27d74928-42d4-4ba1-beeb-0bd7de080034","year":2005},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":5,"title":"Shannon-theoretic approach to a Gaussian cellular multiple- access channel,","work_id":"98dfd160-cf0c-44db-896a-9a2968baa90d","year":1994}],"snapshot_sha256":"226be9dd54341eafd4ae038a446c26ae42b8a228f1f4ad9a6a144af23918b066"},"source":{"id":"2605.16960","kind":"arxiv","version":1},"verdict":{"created_at":"2026-05-19T19:00:45.282466Z","id":"2e5a5e97-2f2c-40ad-ac3f-2fe9d4f3a145","model_set":{"reader":"grok-4.3"},"one_line_summary":"A unified alpha-fairness scheme for clustered cell-free networking is achieved via closed-form deterministic equivalents and tight continuous relaxations that are exactly equivalent to the integer program in four cases of alpha.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"Reformulating the clustering problem as a continuous optimization establishes exact equivalence to the integer program for alpha-fairness across four cases.","strongest_claim":"For each case, we establish the exact equivalence between the original integer program and its continuous relaxation, and develop efficient algorithms with guaranteed convergence.","weakest_assumption":"The closed-form deterministic equivalent of the ergodic sum capacity remains accurate enough after the clustering decisions are made that the reformulated continuous problem yields solutions whose true performance matches the claimed fairness and rate gains."}},"verdict_id":"2e5a5e97-2f2c-40ad-ac3f-2fe9d4f3a145"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:cfe688aff25e15fb4b5f75ad31d714a98c527753508b59f6734d82b6fc55c6bf","target":"record","created_at":"2026-05-20T00:03:33Z","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":"64ad16c68143587f02ab852914247f89c2d6df2b390f9cfdc8e56a7f88d7c3b3","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2026-05-16T12:23:04Z","title_canon_sha256":"695923478310d2d6a7dc9af30e921d8d06da8f6439c17514c092715d46680248"},"schema_version":"1.0","source":{"id":"2605.16960","kind":"arxiv","version":1}},"canonical_sha256":"936cef9dfbb34dd097eeba8cd59878e8a5ac89d56987f1f063f254e0a244aed9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"936cef9dfbb34dd097eeba8cd59878e8a5ac89d56987f1f063f254e0a244aed9","first_computed_at":"2026-05-20T00:03:33.001067Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-20T00:03:33.001067Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Rjnuen1BLTByJxSCEcO2dmBTaBN4v5Y4M5e3N3wJR1cgs2NLivvDaEfshwUzEhE9wEewKpY1HQuyuQx+CZszDA==","signature_status":"signed_v1","signed_at":"2026-05-20T00:03:33.001903Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.16960","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cfe688aff25e15fb4b5f75ad31d714a98c527753508b59f6734d82b6fc55c6bf","sha256:4c8c44fe28fb630de25814deae9c367ec383046a5a6727c891357f464baa2f16"],"state_sha256":"084e9ef595b8f3ba6f3276252612f22585da33b62db22c2bc057a544751d4762"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1XDv0wES42G0MOuIxl2UA8osgA/SaCy3Zi8A9lqQlMvdK8KjbnWZnWm5je0CH/9w6ksyiC+y+Midlj1vaRtoCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T07:31:15.670936Z","bundle_sha256":"c14f96ccd5baa0f8ece8ee9285e5250ce78e85073ee6812a1e0cb1030b8c961b"}}