{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:57ZTWLYXUS3SGA7P7S2FOYPCGF","short_pith_number":"pith:57ZTWLYX","canonical_record":{"source":{"id":"2605.14508","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"math.CO","submitted_at":"2026-05-14T07:52:31Z","cross_cats_sorted":[],"title_canon_sha256":"f95b44bb8e90144db6f7f4fdd03c5b690a328c09399681d2ac1ab4e339820154","abstract_canon_sha256":"014dc88356c561c02a3f2ff631780aa27c4dbb2b43644611e27d2c2a09b98aab"},"schema_version":"1.0"},"canonical_sha256":"eff33b2f17a4b72303effcb45761e23140a9e5758d98f26685b3ccd2f9833dbf","source":{"kind":"arxiv","id":"2605.14508","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.14508","created_at":"2026-05-17T23:39:06Z"},{"alias_kind":"arxiv_version","alias_value":"2605.14508v1","created_at":"2026-05-17T23:39:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.14508","created_at":"2026-05-17T23:39:06Z"},{"alias_kind":"pith_short_12","alias_value":"57ZTWLYXUS3S","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"57ZTWLYXUS3SGA7P","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"57ZTWLYX","created_at":"2026-05-18T12:33:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:57ZTWLYXUS3SGA7P7S2FOYPCGF","target":"record","payload":{"canonical_record":{"source":{"id":"2605.14508","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"math.CO","submitted_at":"2026-05-14T07:52:31Z","cross_cats_sorted":[],"title_canon_sha256":"f95b44bb8e90144db6f7f4fdd03c5b690a328c09399681d2ac1ab4e339820154","abstract_canon_sha256":"014dc88356c561c02a3f2ff631780aa27c4dbb2b43644611e27d2c2a09b98aab"},"schema_version":"1.0"},"canonical_sha256":"eff33b2f17a4b72303effcb45761e23140a9e5758d98f26685b3ccd2f9833dbf","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:39:06.227481Z","signature_b64":"+0mhmcpyeKGe5kJrQPx7aEiOGATNogKogGoeTmDeYy7hJXjNo00HBHQhsTJlJZLPyVEnTnpNdyORKECr1QdxAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"eff33b2f17a4b72303effcb45761e23140a9e5758d98f26685b3ccd2f9833dbf","last_reissued_at":"2026-05-17T23:39:06.226741Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:39:06.226741Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2605.14508","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-17T23:39:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fLhXCWlolA7Rn5MxZ9ltbvH+2gpJK5z2vW8PQbYkOnP/davRReVdTsGda1E+2OzYPd+rYtTUELgvZIgkV1JYAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-22T04:31:05.696387Z"},"content_sha256":"6516614e65d5546222a50162f54fc7ecf78259380f563f7825a80ce293731892","schema_version":"1.0","event_id":"sha256:6516614e65d5546222a50162f54fc7ecf78259380f563f7825a80ce293731892"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:57ZTWLYXUS3SGA7P7S2FOYPCGF","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the Eccentricity Laplacian and Eccentricity Signless Laplacian Matrices of a Graph","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"The eccentricity Laplacian and signless Laplacian matrices share the same spectrum as the eccentricity matrix for multiple graph classes and characterize E-bipartite graphs via spectral symmetry.","cross_cats":[],"primary_cat":"math.CO","authors_text":"Anubha Jindal, Keshav Saini, K. Palpandi","submitted_at":"2026-05-14T07:52:31Z","abstract_excerpt":"In this paper, we introduce the Laplacian and the signless Laplacian for the eccentricity matrix of a connected graph, referred to as the eccentricity Laplacian and the eccentricity signless Laplacian, respectively. We establish the equivalence among the eccentricity Laplacian, eccentricity signless Laplacian, and eccentricity spectrum for different classes of graphs. We provide spectral characterization of $\\mathcal{E}$-bipartite graphs by the symmetry of $\\mathcal{E}$-spectrum and the similarity of these Laplacian matrices."},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"We establish the equivalence among the eccentricity Laplacian, eccentricity signless Laplacian, and eccentricity spectrum for different classes of graphs. We provide spectral characterization of E-bipartite graphs by the symmetry of E-spectrum and the similarity of these Laplacian matrices.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"All graphs under consideration are connected, so that every pair of vertices has a finite eccentricity and the eccentricity matrix is well-defined with no infinite entries.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"Introduces eccentricity Laplacian and signless Laplacian matrices, establishes their spectral equivalences for graph classes, and characterizes E-bipartite graphs via spectrum symmetry and matrix similarity.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"The eccentricity Laplacian and signless Laplacian matrices share the same spectrum as the eccentricity matrix for multiple graph classes and characterize E-bipartite graphs via spectral symmetry.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"96efef046426c69f8d531859ece9564e40750c9781eb39fe15618a4359e9bd61"},"source":{"id":"2605.14508","kind":"arxiv","version":1},"verdict":{"id":"aede19d4-d612-4350-a783-64b8029b7096","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-15T01:33:36.992509Z","strongest_claim":"We establish the equivalence among the eccentricity Laplacian, eccentricity signless Laplacian, and eccentricity spectrum for different classes of graphs. We provide spectral characterization of E-bipartite graphs by the symmetry of E-spectrum and the similarity of these Laplacian matrices.","one_line_summary":"Introduces eccentricity Laplacian and signless Laplacian matrices, establishes their spectral equivalences for graph classes, and characterizes E-bipartite graphs via spectrum symmetry and matrix similarity.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"All graphs under consideration are connected, so that every pair of vertices has a finite eccentricity and the eccentricity matrix is well-defined with no infinite entries.","pith_extraction_headline":"The eccentricity Laplacian and signless Laplacian matrices share the same spectrum as the eccentricity matrix for multiple graph classes and characterize E-bipartite graphs via spectral symmetry."},"references":{"count":20,"sample":[{"doi":"10.1016/j.laa.2013.02.030","year":2013,"title":"Aouchiche, M., & Hansen, P. (2013). Two Laplacians for the distance matrix of a graph.Linear Algebra and its Applications, 439(1), 21-33. https://doi.org/10.1016/j.laa.2013.02.030","work_id":"08063653-48a4-4590-8066-fe11a33a2a1e","ref_index":1,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"10.1007/s10587-014-","year":2014,"title":"Some properties of the distance Laplacian eigen- values of a graph.Czech Math J64, 751-761","work_id":"2e6c1f61-8372-421c-adf7-f13cee107f31","ref_index":2,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"10.1080/03081087.2015.1073215","year":2016,"title":"L-structured quaternion matrices and quaternion linear matrix equations","work_id":"c5ccdff8-e093-446a-9c8f-fd45303f180a","ref_index":3,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2017,"title":"Aouchiche, M., & Hansen, P. (2017). Distance Laplacian Eigenval- ues and Chromatic Number in Graphs.Filomat, 31(9), 2545-2555. http://www.jstor.org/stable/26194990","work_id":"4450b908-32a3-47b4-bd93-01dea8859d35","ref_index":4,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"10.1016/j.laa.2014.07.025","year":2014,"title":"Nath, M., & Paul, S. (2014). On the distance Laplacian spectra of graphs.Linear Algebra and its Applications, 460, 97-110. https://doi.org/10.1016/j.laa.2014.07.025","work_id":"3fda25bb-45c6-4fba-9914-90948c680234","ref_index":5,"cited_arxiv_id":"","is_internal_anchor":false}],"resolved_work":20,"snapshot_sha256":"759692047cf42f8238f4f821bc127018a6bc694495256c7f8864785326c5a829","internal_anchors":0},"formal_canon":{"evidence_count":2,"snapshot_sha256":"843638006cf7989fdbd040c39c0d6d0367cc323bb85b976ad10ba8edee221d5f"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"verdict_id":"aede19d4-d612-4350-a783-64b8029b7096"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:39:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+LPwXbe4qsjWukWKHhke3+/14YRbO59C27XkvwiwlQWCVCgbyfSS4g7JclM/VWC6BRk2wG9ja8x2TrBWruXUCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-22T04:31:05.697384Z"},"content_sha256":"e920b747374ffb0612df6770fb25c861cba76f79ef13045096a5153ff1815087","schema_version":"1.0","event_id":"sha256:e920b747374ffb0612df6770fb25c861cba76f79ef13045096a5153ff1815087"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/57ZTWLYXUS3SGA7P7S2FOYPCGF/bundle.json","state_url":"https://pith.science/pith/57ZTWLYXUS3SGA7P7S2FOYPCGF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/57ZTWLYXUS3SGA7P7S2FOYPCGF/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-22T04:31:05Z","links":{"resolver":"https://pith.science/pith/57ZTWLYXUS3SGA7P7S2FOYPCGF","bundle":"https://pith.science/pith/57ZTWLYXUS3SGA7P7S2FOYPCGF/bundle.json","state":"https://pith.science/pith/57ZTWLYXUS3SGA7P7S2FOYPCGF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/57ZTWLYXUS3SGA7P7S2FOYPCGF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:57ZTWLYXUS3SGA7P7S2FOYPCGF","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":"014dc88356c561c02a3f2ff631780aa27c4dbb2b43644611e27d2c2a09b98aab","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"math.CO","submitted_at":"2026-05-14T07:52:31Z","title_canon_sha256":"f95b44bb8e90144db6f7f4fdd03c5b690a328c09399681d2ac1ab4e339820154"},"schema_version":"1.0","source":{"id":"2605.14508","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.14508","created_at":"2026-05-17T23:39:06Z"},{"alias_kind":"arxiv_version","alias_value":"2605.14508v1","created_at":"2026-05-17T23:39:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.14508","created_at":"2026-05-17T23:39:06Z"},{"alias_kind":"pith_short_12","alias_value":"57ZTWLYXUS3S","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"57ZTWLYXUS3SGA7P","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"57ZTWLYX","created_at":"2026-05-18T12:33:37Z"}],"graph_snapshots":[{"event_id":"sha256:e920b747374ffb0612df6770fb25c861cba76f79ef13045096a5153ff1815087","target":"graph","created_at":"2026-05-17T23:39:06Z","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 establish the equivalence among the eccentricity Laplacian, eccentricity signless Laplacian, and eccentricity spectrum for different classes of graphs. We provide spectral characterization of E-bipartite graphs by the symmetry of E-spectrum and the similarity of these Laplacian matrices."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"All graphs under consideration are connected, so that every pair of vertices has a finite eccentricity and the eccentricity matrix is well-defined with no infinite entries."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"Introduces eccentricity Laplacian and signless Laplacian matrices, establishes their spectral equivalences for graph classes, and characterizes E-bipartite graphs via spectrum symmetry and matrix similarity."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"The eccentricity Laplacian and signless Laplacian matrices share the same spectrum as the eccentricity matrix for multiple graph classes and characterize E-bipartite graphs via spectral symmetry."}],"snapshot_sha256":"96efef046426c69f8d531859ece9564e40750c9781eb39fe15618a4359e9bd61"},"formal_canon":{"evidence_count":2,"snapshot_sha256":"843638006cf7989fdbd040c39c0d6d0367cc323bb85b976ad10ba8edee221d5f"},"paper":{"abstract_excerpt":"In this paper, we introduce the Laplacian and the signless Laplacian for the eccentricity matrix of a connected graph, referred to as the eccentricity Laplacian and the eccentricity signless Laplacian, respectively. We establish the equivalence among the eccentricity Laplacian, eccentricity signless Laplacian, and eccentricity spectrum for different classes of graphs. We provide spectral characterization of $\\mathcal{E}$-bipartite graphs by the symmetry of $\\mathcal{E}$-spectrum and the similarity of these Laplacian matrices.","authors_text":"Anubha Jindal, Keshav Saini, K. Palpandi","cross_cats":[],"headline":"The eccentricity Laplacian and signless Laplacian matrices share the same spectrum as the eccentricity matrix for multiple graph classes and characterize E-bipartite graphs via spectral symmetry.","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"math.CO","submitted_at":"2026-05-14T07:52:31Z","title":"On the Eccentricity Laplacian and Eccentricity Signless Laplacian Matrices of a Graph"},"references":{"count":20,"internal_anchors":0,"resolved_work":20,"sample":[{"cited_arxiv_id":"","doi":"10.1016/j.laa.2013.02.030","is_internal_anchor":false,"ref_index":1,"title":"Aouchiche, M., & Hansen, P. (2013). Two Laplacians for the distance matrix of a graph.Linear Algebra and its Applications, 439(1), 21-33. https://doi.org/10.1016/j.laa.2013.02.030","work_id":"08063653-48a4-4590-8066-fe11a33a2a1e","year":2013},{"cited_arxiv_id":"","doi":"10.1007/s10587-014-","is_internal_anchor":false,"ref_index":2,"title":"Some properties of the distance Laplacian eigen- values of a graph.Czech Math J64, 751-761","work_id":"2e6c1f61-8372-421c-adf7-f13cee107f31","year":2014},{"cited_arxiv_id":"","doi":"10.1080/03081087.2015.1073215","is_internal_anchor":false,"ref_index":3,"title":"L-structured quaternion matrices and quaternion linear matrix equations","work_id":"c5ccdff8-e093-446a-9c8f-fd45303f180a","year":2016},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":4,"title":"Aouchiche, M., & Hansen, P. (2017). Distance Laplacian Eigenval- ues and Chromatic Number in Graphs.Filomat, 31(9), 2545-2555. http://www.jstor.org/stable/26194990","work_id":"4450b908-32a3-47b4-bd93-01dea8859d35","year":2017},{"cited_arxiv_id":"","doi":"10.1016/j.laa.2014.07.025","is_internal_anchor":false,"ref_index":5,"title":"Nath, M., & Paul, S. (2014). On the distance Laplacian spectra of graphs.Linear Algebra and its Applications, 460, 97-110. https://doi.org/10.1016/j.laa.2014.07.025","work_id":"3fda25bb-45c6-4fba-9914-90948c680234","year":2014}],"snapshot_sha256":"759692047cf42f8238f4f821bc127018a6bc694495256c7f8864785326c5a829"},"source":{"id":"2605.14508","kind":"arxiv","version":1},"verdict":{"created_at":"2026-05-15T01:33:36.992509Z","id":"aede19d4-d612-4350-a783-64b8029b7096","model_set":{"reader":"grok-4.3"},"one_line_summary":"Introduces eccentricity Laplacian and signless Laplacian matrices, establishes their spectral equivalences for graph classes, and characterizes E-bipartite graphs via spectrum symmetry and matrix similarity.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"The eccentricity Laplacian and signless Laplacian matrices share the same spectrum as the eccentricity matrix for multiple graph classes and characterize E-bipartite graphs via spectral symmetry.","strongest_claim":"We establish the equivalence among the eccentricity Laplacian, eccentricity signless Laplacian, and eccentricity spectrum for different classes of graphs. We provide spectral characterization of E-bipartite graphs by the symmetry of E-spectrum and the similarity of these Laplacian matrices.","weakest_assumption":"All graphs under consideration are connected, so that every pair of vertices has a finite eccentricity and the eccentricity matrix is well-defined with no infinite entries."}},"verdict_id":"aede19d4-d612-4350-a783-64b8029b7096"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:6516614e65d5546222a50162f54fc7ecf78259380f563f7825a80ce293731892","target":"record","created_at":"2026-05-17T23:39:06Z","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":"014dc88356c561c02a3f2ff631780aa27c4dbb2b43644611e27d2c2a09b98aab","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"math.CO","submitted_at":"2026-05-14T07:52:31Z","title_canon_sha256":"f95b44bb8e90144db6f7f4fdd03c5b690a328c09399681d2ac1ab4e339820154"},"schema_version":"1.0","source":{"id":"2605.14508","kind":"arxiv","version":1}},"canonical_sha256":"eff33b2f17a4b72303effcb45761e23140a9e5758d98f26685b3ccd2f9833dbf","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"eff33b2f17a4b72303effcb45761e23140a9e5758d98f26685b3ccd2f9833dbf","first_computed_at":"2026-05-17T23:39:06.226741Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:39:06.226741Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"+0mhmcpyeKGe5kJrQPx7aEiOGATNogKogGoeTmDeYy7hJXjNo00HBHQhsTJlJZLPyVEnTnpNdyORKECr1QdxAA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:39:06.227481Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.14508","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6516614e65d5546222a50162f54fc7ecf78259380f563f7825a80ce293731892","sha256:e920b747374ffb0612df6770fb25c861cba76f79ef13045096a5153ff1815087"],"state_sha256":"588b13695211763d01ca73394cea5e2f3162f011b314d8c15b85df1185ad2ca8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jrqkDYT1CupS5GqkD9Egy61z2BaFPBw/hwI3OyCAVE1c7emDixmFQSIU09ZGpQZs52DGTrHLX1HL6f+7Z41WBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-22T04:31:05.701981Z","bundle_sha256":"9e922c606dcd2c22a9d50aeef3f2070a2d525a9b98139b7971e3e86891f50b27"}}