{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:YC7UBC43HJQ27BDAOS3F7MPFIV","short_pith_number":"pith:YC7UBC43","canonical_record":{"source":{"id":"2605.17492","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2026-05-17T15:01:11Z","cross_cats_sorted":[],"title_canon_sha256":"e8406c219b8da20c9190a2283e6cb91a9dc4afc9d533b91c77fa35ef9ae4360d","abstract_canon_sha256":"1580b882ed249cd76abaf93e187bad3ae08a8abddb6c4fc8db1a2c6b35f5d9a8"},"schema_version":"1.0"},"canonical_sha256":"c0bf408b9b3a61af846074b65fb1e5455fd88fcbf196f5331a3c2a794f0ede41","source":{"kind":"arxiv","id":"2605.17492","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.17492","created_at":"2026-05-20T00:04:42Z"},{"alias_kind":"arxiv_version","alias_value":"2605.17492v1","created_at":"2026-05-20T00:04:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.17492","created_at":"2026-05-20T00:04:42Z"},{"alias_kind":"pith_short_12","alias_value":"YC7UBC43HJQ2","created_at":"2026-05-20T00:04:42Z"},{"alias_kind":"pith_short_16","alias_value":"YC7UBC43HJQ27BDA","created_at":"2026-05-20T00:04:42Z"},{"alias_kind":"pith_short_8","alias_value":"YC7UBC43","created_at":"2026-05-20T00:04:42Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:YC7UBC43HJQ27BDAOS3F7MPFIV","target":"record","payload":{"canonical_record":{"source":{"id":"2605.17492","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2026-05-17T15:01:11Z","cross_cats_sorted":[],"title_canon_sha256":"e8406c219b8da20c9190a2283e6cb91a9dc4afc9d533b91c77fa35ef9ae4360d","abstract_canon_sha256":"1580b882ed249cd76abaf93e187bad3ae08a8abddb6c4fc8db1a2c6b35f5d9a8"},"schema_version":"1.0"},"canonical_sha256":"c0bf408b9b3a61af846074b65fb1e5455fd88fcbf196f5331a3c2a794f0ede41","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-20T00:04:42.012629Z","signature_b64":"7skyUi8vgkqJZ/S3rzkJrQhGGwH70qoPxXhn3RfDwOWJrenSQ+FeU08nQvv/JyfnvyPKYN4Fn6++pFxSyRJeCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c0bf408b9b3a61af846074b65fb1e5455fd88fcbf196f5331a3c2a794f0ede41","last_reissued_at":"2026-05-20T00:04:42.011921Z","signature_status":"signed_v1","first_computed_at":"2026-05-20T00:04:42.011921Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2605.17492","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:04:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"c0E8usL+bVw4p4G6D0C4g7Er8OR0MfVkJ7FWl3ONgdfmzhBIZggjHGTeKRAKqSamjfJq7oZAH2cEqjwX+aV+Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T21:54:44.396470Z"},"content_sha256":"1cbf487e574016940b6652e799c48a16b64421108d0c4df4aa2e6570367b978e","schema_version":"1.0","event_id":"sha256:1cbf487e574016940b6652e799c48a16b64421108d0c4df4aa2e6570367b978e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:YC7UBC43HJQ27BDAOS3F7MPFIV","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Finding the Balance Rate of Uncertain Signed Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"Balance rate quantifies stability in uncertain signed graphs and can be estimated efficiently even though exact computation is NP-hard.","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Can Wang, Jiawei Chen, Jingbang Chen, Kudria Sergei, Xiaodong Luo, Xinyu Wang, Zeyu Wang","submitted_at":"2026-05-17T15:01:11Z","abstract_excerpt":"Signed graphs are widely used to analyze complex systems such as social, political, and biological networks. The notion of balance, a key concept of signed graphs, reflects the stability of relationships. While it has been extensively studied in deterministic graphs, real-world networks often exhibit uncertainty in their connections, which traditional approaches struggle to address. To bridge this gap, we introduce the concept of balance rate, a metric for quantifying the degree of balance in uncertain signed graphs, and prove that computing it exactly is NP-hard, motivating the need for effic"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"We introduce the concept of balance rate, a metric for quantifying the degree of balance in uncertain signed graphs, and prove that computing it exactly is NP-hard... We propose a novel Rao-Blackwellized spanning-tree estimator that achieves near-linear time complexity per sample by leveraging graph decomposition and structural properties. We also construct asymptotically justified confidence intervals using the Delta method.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"The uncertainty model for signed edges permits a graph decomposition into spanning trees whose balance contributions can be Rao-Blackwellized to yield an unbiased estimator whose variance is controlled by the structural properties invoked in the proof.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"Balance rate quantifies stability in uncertain signed graphs; exact computation is NP-hard but a Rao-Blackwellized spanning-tree estimator achieves near-linear time per sample with Delta-method intervals.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"Balance rate quantifies stability in uncertain signed graphs and can be estimated efficiently even though exact computation is NP-hard.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"06df8d51b3577d3c7b5b375dbd27ab1ac37250eea5007a0939ef494ab00a50d5"},"source":{"id":"2605.17492","kind":"arxiv","version":1},"verdict":{"id":"4432f82c-cb59-4daa-81fb-b9df16e52f17","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-19T22:27:00.078223Z","strongest_claim":"We introduce the concept of balance rate, a metric for quantifying the degree of balance in uncertain signed graphs, and prove that computing it exactly is NP-hard... We propose a novel Rao-Blackwellized spanning-tree estimator that achieves near-linear time complexity per sample by leveraging graph decomposition and structural properties. We also construct asymptotically justified confidence intervals using the Delta method.","one_line_summary":"Balance rate quantifies stability in uncertain signed graphs; exact computation is NP-hard but a Rao-Blackwellized spanning-tree estimator achieves near-linear time per sample with Delta-method intervals.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"The uncertainty model for signed edges permits a graph decomposition into spanning trees whose balance contributions can be Rao-Blackwellized to yield an unbiased estimator whose variance is controlled by the structural properties invoked in the proof.","pith_extraction_headline":"Balance rate quantifies stability in uncertain signed graphs and can be estimated efficiently even though exact computation is NP-hard."},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2605.17492/integrity.json","findings":[],"available":true,"detectors_run":[{"name":"doi_title_agreement","ran_at":"2026-05-19T23:01:19.530692Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"doi_compliance","ran_at":"2026-05-19T22:41:18.739181Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"claim_evidence","ran_at":"2026-05-19T21:41:57.678374Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"ai_meta_artifact","ran_at":"2026-05-19T21:33:23.641832Z","status":"skipped","version":"1.0.0","findings_count":0}],"snapshot_sha256":"d671cd2af1496db25e77b10e915a0b1acc72c5fc634f0f23156aa68f9603ea1d"},"references":{"count":67,"sample":[{"doi":"","year":2017,"title":"Robert P Abelson and Milton J Rosenberg. 2017. Symbolic psycho-logic: A model of attitudinal cognition. InAttitude change. Routledge, 86–115","work_id":"a737436d-8400-4f95-8210-c882603a9ee4","ref_index":1,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2005,"title":"Lada A Adamic and Natalie Glance. 2005. The political blogosphere and the 2004 US election: divided they blog. InProceedings of the 3rd international workshop on Link discovery. 36–43","work_id":"734c0377-41c1-40cb-9fe4-d7f61a5ba925","ref_index":2,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":1975,"title":"KK Aggarwal, KB Misra, and JS Gupta. 1975. Reliability evaluation a comparative study of different techniques.Microelectronics Reliability14, 1 (1975), 49–56","work_id":"a5f91678-737f-49cb-9580-8d1466d0434b","ref_index":3,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2020,"title":"Samin Aref, Andrew J Mason, and Mark C Wilson. 2020. A modeling and compu- tational study of the frustration index in signed networks.Networks75, 1 (2020), 95–110","work_id":"c547ed01-ae41-40ba-8498-bebed198d095","ref_index":4,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2020,"title":"Samin Aref and Zachary Neal. 2020. Detecting coalitions by optimally partitioning signed networks of political collaboration.Scientific reports10, 1 (2020), 1506","work_id":"a59a68e1-9dee-4012-a54a-ee38fffd60d2","ref_index":5,"cited_arxiv_id":"","is_internal_anchor":false}],"resolved_work":67,"snapshot_sha256":"b19786d80e92d8972a896799c13842d332e9175a4367df5e848c0b1b06f879e5","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"verdict_id":"4432f82c-cb59-4daa-81fb-b9df16e52f17"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-20T00:04:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"i/r4u06lI7lYBp1sGykdOCirraam0BSITe60uBpek/ZkD5UKlTi3Kt0jk+3+rlS82Kw6C6kKCKMYkIotODlICw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T21:54:44.397964Z"},"content_sha256":"087fe9332a35ff93e3283cff72f0addcf45eae5173e9bdbb4c13e12445d16bba","schema_version":"1.0","event_id":"sha256:087fe9332a35ff93e3283cff72f0addcf45eae5173e9bdbb4c13e12445d16bba"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YC7UBC43HJQ27BDAOS3F7MPFIV/bundle.json","state_url":"https://pith.science/pith/YC7UBC43HJQ27BDAOS3F7MPFIV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YC7UBC43HJQ27BDAOS3F7MPFIV/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-28T21:54:44Z","links":{"resolver":"https://pith.science/pith/YC7UBC43HJQ27BDAOS3F7MPFIV","bundle":"https://pith.science/pith/YC7UBC43HJQ27BDAOS3F7MPFIV/bundle.json","state":"https://pith.science/pith/YC7UBC43HJQ27BDAOS3F7MPFIV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YC7UBC43HJQ27BDAOS3F7MPFIV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:YC7UBC43HJQ27BDAOS3F7MPFIV","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":"1580b882ed249cd76abaf93e187bad3ae08a8abddb6c4fc8db1a2c6b35f5d9a8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2026-05-17T15:01:11Z","title_canon_sha256":"e8406c219b8da20c9190a2283e6cb91a9dc4afc9d533b91c77fa35ef9ae4360d"},"schema_version":"1.0","source":{"id":"2605.17492","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.17492","created_at":"2026-05-20T00:04:42Z"},{"alias_kind":"arxiv_version","alias_value":"2605.17492v1","created_at":"2026-05-20T00:04:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.17492","created_at":"2026-05-20T00:04:42Z"},{"alias_kind":"pith_short_12","alias_value":"YC7UBC43HJQ2","created_at":"2026-05-20T00:04:42Z"},{"alias_kind":"pith_short_16","alias_value":"YC7UBC43HJQ27BDA","created_at":"2026-05-20T00:04:42Z"},{"alias_kind":"pith_short_8","alias_value":"YC7UBC43","created_at":"2026-05-20T00:04:42Z"}],"graph_snapshots":[{"event_id":"sha256:087fe9332a35ff93e3283cff72f0addcf45eae5173e9bdbb4c13e12445d16bba","target":"graph","created_at":"2026-05-20T00:04:42Z","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":"We introduce the concept of balance rate, a metric for quantifying the degree of balance in uncertain signed graphs, and prove that computing it exactly is NP-hard... We propose a novel Rao-Blackwellized spanning-tree estimator that achieves near-linear time complexity per sample by leveraging graph decomposition and structural properties. We also construct asymptotically justified confidence intervals using the Delta method."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"The uncertainty model for signed edges permits a graph decomposition into spanning trees whose balance contributions can be Rao-Blackwellized to yield an unbiased estimator whose variance is controlled by the structural properties invoked in the proof."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"Balance rate quantifies stability in uncertain signed graphs; exact computation is NP-hard but a Rao-Blackwellized spanning-tree estimator achieves near-linear time per sample with Delta-method intervals."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"Balance rate quantifies stability in uncertain signed graphs and can be estimated efficiently even though exact computation is NP-hard."}],"snapshot_sha256":"06df8d51b3577d3c7b5b375dbd27ab1ac37250eea5007a0939ef494ab00a50d5"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[{"findings_count":0,"name":"doi_title_agreement","ran_at":"2026-05-19T23:01:19.530692Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"doi_compliance","ran_at":"2026-05-19T22:41:18.739181Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"claim_evidence","ran_at":"2026-05-19T21:41:57.678374Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"ai_meta_artifact","ran_at":"2026-05-19T21:33:23.641832Z","status":"skipped","version":"1.0.0"}],"endpoint":"/pith/2605.17492/integrity.json","findings":[],"snapshot_sha256":"d671cd2af1496db25e77b10e915a0b1acc72c5fc634f0f23156aa68f9603ea1d","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Signed graphs are widely used to analyze complex systems such as social, political, and biological networks. The notion of balance, a key concept of signed graphs, reflects the stability of relationships. While it has been extensively studied in deterministic graphs, real-world networks often exhibit uncertainty in their connections, which traditional approaches struggle to address. To bridge this gap, we introduce the concept of balance rate, a metric for quantifying the degree of balance in uncertain signed graphs, and prove that computing it exactly is NP-hard, motivating the need for effic","authors_text":"Can Wang, Jiawei Chen, Jingbang Chen, Kudria Sergei, Xiaodong Luo, Xinyu Wang, Zeyu Wang","cross_cats":[],"headline":"Balance rate quantifies stability in uncertain signed graphs and can be estimated efficiently even though exact computation is NP-hard.","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2026-05-17T15:01:11Z","title":"Finding the Balance Rate of Uncertain Signed Graphs"},"references":{"count":67,"internal_anchors":0,"resolved_work":67,"sample":[{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":1,"title":"Robert P Abelson and Milton J Rosenberg. 2017. Symbolic psycho-logic: A model of attitudinal cognition. InAttitude change. Routledge, 86–115","work_id":"a737436d-8400-4f95-8210-c882603a9ee4","year":2017},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":2,"title":"Lada A Adamic and Natalie Glance. 2005. The political blogosphere and the 2004 US election: divided they blog. InProceedings of the 3rd international workshop on Link discovery. 36–43","work_id":"734c0377-41c1-40cb-9fe4-d7f61a5ba925","year":2005},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":3,"title":"KK Aggarwal, KB Misra, and JS Gupta. 1975. Reliability evaluation a comparative study of different techniques.Microelectronics Reliability14, 1 (1975), 49–56","work_id":"a5f91678-737f-49cb-9580-8d1466d0434b","year":1975},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":4,"title":"Samin Aref, Andrew J Mason, and Mark C Wilson. 2020. A modeling and compu- tational study of the frustration index in signed networks.Networks75, 1 (2020), 95–110","work_id":"c547ed01-ae41-40ba-8498-bebed198d095","year":2020},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":5,"title":"Samin Aref and Zachary Neal. 2020. Detecting coalitions by optimally partitioning signed networks of political collaboration.Scientific reports10, 1 (2020), 1506","work_id":"a59a68e1-9dee-4012-a54a-ee38fffd60d2","year":2020}],"snapshot_sha256":"b19786d80e92d8972a896799c13842d332e9175a4367df5e848c0b1b06f879e5"},"source":{"id":"2605.17492","kind":"arxiv","version":1},"verdict":{"created_at":"2026-05-19T22:27:00.078223Z","id":"4432f82c-cb59-4daa-81fb-b9df16e52f17","model_set":{"reader":"grok-4.3"},"one_line_summary":"Balance rate quantifies stability in uncertain signed graphs; exact computation is NP-hard but a Rao-Blackwellized spanning-tree estimator achieves near-linear time per sample with Delta-method intervals.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"Balance rate quantifies stability in uncertain signed graphs and can be estimated efficiently even though exact computation is NP-hard.","strongest_claim":"We introduce the concept of balance rate, a metric for quantifying the degree of balance in uncertain signed graphs, and prove that computing it exactly is NP-hard... We propose a novel Rao-Blackwellized spanning-tree estimator that achieves near-linear time complexity per sample by leveraging graph decomposition and structural properties. We also construct asymptotically justified confidence intervals using the Delta method.","weakest_assumption":"The uncertainty model for signed edges permits a graph decomposition into spanning trees whose balance contributions can be Rao-Blackwellized to yield an unbiased estimator whose variance is controlled by the structural properties invoked in the proof."}},"verdict_id":"4432f82c-cb59-4daa-81fb-b9df16e52f17"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:1cbf487e574016940b6652e799c48a16b64421108d0c4df4aa2e6570367b978e","target":"record","created_at":"2026-05-20T00:04:42Z","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":"1580b882ed249cd76abaf93e187bad3ae08a8abddb6c4fc8db1a2c6b35f5d9a8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2026-05-17T15:01:11Z","title_canon_sha256":"e8406c219b8da20c9190a2283e6cb91a9dc4afc9d533b91c77fa35ef9ae4360d"},"schema_version":"1.0","source":{"id":"2605.17492","kind":"arxiv","version":1}},"canonical_sha256":"c0bf408b9b3a61af846074b65fb1e5455fd88fcbf196f5331a3c2a794f0ede41","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c0bf408b9b3a61af846074b65fb1e5455fd88fcbf196f5331a3c2a794f0ede41","first_computed_at":"2026-05-20T00:04:42.011921Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-20T00:04:42.011921Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"7skyUi8vgkqJZ/S3rzkJrQhGGwH70qoPxXhn3RfDwOWJrenSQ+FeU08nQvv/JyfnvyPKYN4Fn6++pFxSyRJeCg==","signature_status":"signed_v1","signed_at":"2026-05-20T00:04:42.012629Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.17492","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1cbf487e574016940b6652e799c48a16b64421108d0c4df4aa2e6570367b978e","sha256:087fe9332a35ff93e3283cff72f0addcf45eae5173e9bdbb4c13e12445d16bba"],"state_sha256":"451a9ecc904ea53d3d1896b09eb7f57969cb953a68391492939668f508818182"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pPihNZ3YOsBoLyTLvMICuL/NYdTRgsDYtVyQSQbYfnhT2xFXyCLIYa1TClQJ2VYxZv+t5iO2KCqvFdsnBhmVCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T21:54:44.402099Z","bundle_sha256":"129ae3b90debc301874cd372fade2b7f3ac213e60295143cab40f8a8ded864af"}}