{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:HCG6RWYZJV423FOF3LOGMJTYUB","short_pith_number":"pith:HCG6RWYZ","canonical_record":{"source":{"id":"2605.14140","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"math.CO","submitted_at":"2026-05-13T21:46:47Z","cross_cats_sorted":[],"title_canon_sha256":"6aa26622ab3e18b30aef5e43a430fce4e78a5e1ea948122020b557fc6fe79169","abstract_canon_sha256":"a24eba99ae13e454d966dcf22697201e2644886d98df17f3006cd9979efd6152"},"schema_version":"1.0"},"canonical_sha256":"388de8db194d79ad95c5dadc662678a06ba270b61b71166618d6be5415f2badc","source":{"kind":"arxiv","id":"2605.14140","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.14140","created_at":"2026-05-17T23:39:11Z"},{"alias_kind":"arxiv_version","alias_value":"2605.14140v1","created_at":"2026-05-17T23:39:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.14140","created_at":"2026-05-17T23:39:11Z"},{"alias_kind":"pith_short_12","alias_value":"HCG6RWYZJV42","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"HCG6RWYZJV423FOF","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"HCG6RWYZ","created_at":"2026-05-18T12:33:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:HCG6RWYZJV423FOF3LOGMJTYUB","target":"record","payload":{"canonical_record":{"source":{"id":"2605.14140","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"math.CO","submitted_at":"2026-05-13T21:46:47Z","cross_cats_sorted":[],"title_canon_sha256":"6aa26622ab3e18b30aef5e43a430fce4e78a5e1ea948122020b557fc6fe79169","abstract_canon_sha256":"a24eba99ae13e454d966dcf22697201e2644886d98df17f3006cd9979efd6152"},"schema_version":"1.0"},"canonical_sha256":"388de8db194d79ad95c5dadc662678a06ba270b61b71166618d6be5415f2badc","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:39:11.698210Z","signature_b64":"jEHkgU8+03OQ7tAD/Dlh8kH12CY0mUyChSXFEnr0duZeVtBOl5v6uzg49tRX4NsA8Um5amVW4gedQVUYqU+kBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"388de8db194d79ad95c5dadc662678a06ba270b61b71166618d6be5415f2badc","last_reissued_at":"2026-05-17T23:39:11.697517Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:39:11.697517Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2605.14140","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:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"j3gzGe6D4wG8rYFZtlt/SpAsy0kRL3OUeOqdwl+9fFYocXAu38oB46GkFzEB/VPN+n4B4blK5d23koH1s2ijAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-18T20:36:23.842926Z"},"content_sha256":"bc5a785b091c9584014e349df9cd9d1a7bcfb2869dcd3fecfee3f7640539f47e","schema_version":"1.0","event_id":"sha256:bc5a785b091c9584014e349df9cd9d1a7bcfb2869dcd3fecfee3f7640539f47e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:HCG6RWYZJV423FOF3LOGMJTYUB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A study on Type-2 isomorphic circulant graphs. PART 9: Computer programs to show Type-1 $\\&$ -2 isomorphic circulant graphs","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"Computer programs generate families of Type-2 isomorphic circulant graphs for m values 2, 3, 5, 7 and odd primes p.","cross_cats":[],"primary_cat":"math.CO","authors_text":"Vilfred Kamalappan, Wilson Peraprakash","submitted_at":"2026-05-13T21:46:47Z","abstract_excerpt":"Elspas and Turner \\cite{eltu} raised a question on the isomorphism of $C_{16}(1,3,7)$ and $C_{16}(2,3,5)$ and Vilfred \\cite{v96} gave its answer by defining Type-2 isomorphism of $C_n(R)$ w.r.t. $m$ $\\ni$ $m$ = $\\gcd(n, r) > 1$, $r\\in R$ and $r,n\\in\\mathbb{N}$ and studied such graphs for $m$ = 2 in \\cite{v13,v20}. But obtaining Type-2 isomorphic circulant graphs is not easy. Using a $C^{++}$ computer program, the authors obtained families of Type-2 isomorphic $C_{n}(R)$ w.r.t. $m$ = 2,3,5,7 for $n\\in\\mathbb{N}$ as well as $C_{np^3}(R)$ w.r.t. $m$ = $p$ for $n\\in\\mathbb{N}$ and $p$ is an odd pr"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"Using a C++ computer program, the authors obtained families of Type-2 isomorphic C_n(R) w.r.t. m = 2,3,5,7 for n in natural numbers as well as C_{np^3}(R) w.r.t. m = p for odd prime p.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"The programs correctly implement the definitions of Type-1 and Type-2 isomorphism from the cited prior papers without coding errors or missed cases.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"Computer programs are supplied to generate families of Type-2 isomorphic circulant graphs C_n(R) for m=2,3,5,7 and to demonstrate how Type-1 and Type-2 isomorphisms occur.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"Computer programs generate families of Type-2 isomorphic circulant graphs for m values 2, 3, 5, 7 and odd primes p.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"3c4b7273fb4780b744e493870b39e1c48eb7222fbcb3f194a5c11178bcaa4256"},"source":{"id":"2605.14140","kind":"arxiv","version":1},"verdict":{"id":"f0e42807-d5e7-4d54-82d7-7112bc309a50","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-15T02:11:18.171518Z","strongest_claim":"Using a C++ computer program, the authors obtained families of Type-2 isomorphic C_n(R) w.r.t. m = 2,3,5,7 for n in natural numbers as well as C_{np^3}(R) w.r.t. m = p for odd prime p.","one_line_summary":"Computer programs are supplied to generate families of Type-2 isomorphic circulant graphs C_n(R) for m=2,3,5,7 and to demonstrate how Type-1 and Type-2 isomorphisms occur.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"The programs correctly implement the definitions of Type-1 and Type-2 isomorphism from the cited prior papers without coding errors or missed cases.","pith_extraction_headline":"Computer programs generate families of Type-2 isomorphic circulant graphs for m values 2, 3, 5, 7 and odd primes p."},"references":{"count":25,"sample":[{"doi":"","year":1967,"title":"A. Adam,Research problem 2-10, J. Combinatorial Theory,3(1967), 393","work_id":"7a43d6b0-2dfb-4412-99ad-96186a8a7489","ref_index":1,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2013,"title":"Bjarne Stroustrup,The C++ Programming Language, Addison-Wesley, 2013","work_id":"49961b69-5f89-485d-ac7f-ca5f2637357c","ref_index":2,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":1970,"title":"B. Elspas and J. Turner,Graphs with circulant adjacency matrices, J. Combinatorial Theory,9(1970), 297-307","work_id":"d1c668b3-b8ac-436d-9047-2408b9c6f3ec","ref_index":3,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2015,"title":"Fisher Larence,Visual Basic.NET: An Introduction to Computer Programming, Kendall Hunt Publishing, USA","work_id":"86224c76-0cff-4f7d-8663-c9d0f1dc3fd0","ref_index":4,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2020,"title":"Martin Grohe and Pascal Schweitzer,The graph isomorphism problem, Communication ACM,63 (11)(2020), 128–","work_id":"0f860eba-400e-4d08-9161-3bf95d5c109c","ref_index":5,"cited_arxiv_id":"","is_internal_anchor":false}],"resolved_work":25,"snapshot_sha256":"fbea74ca420ab9f471674ce151f899eef3eb38acedbcfe8fe2138442ae597731","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":"f0e42807-d5e7-4d54-82d7-7112bc309a50"},"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:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BzQVHU1DtV9IimeVs8kOaivG9cGJtt1enh0l7e3e+Qx41XrdBMtETefjS2/cQQHO+YtDQtR02REa5HiRqJiwAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-18T20:36:23.844145Z"},"content_sha256":"ef4b1d1f402ca56fa9cc29b3eacd4a8abf2cca63264d2acd758428d680ab7422","schema_version":"1.0","event_id":"sha256:ef4b1d1f402ca56fa9cc29b3eacd4a8abf2cca63264d2acd758428d680ab7422"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HCG6RWYZJV423FOF3LOGMJTYUB/bundle.json","state_url":"https://pith.science/pith/HCG6RWYZJV423FOF3LOGMJTYUB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HCG6RWYZJV423FOF3LOGMJTYUB/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-18T20:36:23Z","links":{"resolver":"https://pith.science/pith/HCG6RWYZJV423FOF3LOGMJTYUB","bundle":"https://pith.science/pith/HCG6RWYZJV423FOF3LOGMJTYUB/bundle.json","state":"https://pith.science/pith/HCG6RWYZJV423FOF3LOGMJTYUB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HCG6RWYZJV423FOF3LOGMJTYUB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:HCG6RWYZJV423FOF3LOGMJTYUB","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":"a24eba99ae13e454d966dcf22697201e2644886d98df17f3006cd9979efd6152","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"math.CO","submitted_at":"2026-05-13T21:46:47Z","title_canon_sha256":"6aa26622ab3e18b30aef5e43a430fce4e78a5e1ea948122020b557fc6fe79169"},"schema_version":"1.0","source":{"id":"2605.14140","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.14140","created_at":"2026-05-17T23:39:11Z"},{"alias_kind":"arxiv_version","alias_value":"2605.14140v1","created_at":"2026-05-17T23:39:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.14140","created_at":"2026-05-17T23:39:11Z"},{"alias_kind":"pith_short_12","alias_value":"HCG6RWYZJV42","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"HCG6RWYZJV423FOF","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"HCG6RWYZ","created_at":"2026-05-18T12:33:37Z"}],"graph_snapshots":[{"event_id":"sha256:ef4b1d1f402ca56fa9cc29b3eacd4a8abf2cca63264d2acd758428d680ab7422","target":"graph","created_at":"2026-05-17T23:39:11Z","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":"Using a C++ computer program, the authors obtained families of Type-2 isomorphic C_n(R) w.r.t. m = 2,3,5,7 for n in natural numbers as well as C_{np^3}(R) w.r.t. m = p for odd prime p."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"The programs correctly implement the definitions of Type-1 and Type-2 isomorphism from the cited prior papers without coding errors or missed cases."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"Computer programs are supplied to generate families of Type-2 isomorphic circulant graphs C_n(R) for m=2,3,5,7 and to demonstrate how Type-1 and Type-2 isomorphisms occur."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"Computer programs generate families of Type-2 isomorphic circulant graphs for m values 2, 3, 5, 7 and odd primes p."}],"snapshot_sha256":"3c4b7273fb4780b744e493870b39e1c48eb7222fbcb3f194a5c11178bcaa4256"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"Elspas and Turner \\cite{eltu} raised a question on the isomorphism of $C_{16}(1,3,7)$ and $C_{16}(2,3,5)$ and Vilfred \\cite{v96} gave its answer by defining Type-2 isomorphism of $C_n(R)$ w.r.t. $m$ $\\ni$ $m$ = $\\gcd(n, r) > 1$, $r\\in R$ and $r,n\\in\\mathbb{N}$ and studied such graphs for $m$ = 2 in \\cite{v13,v20}. But obtaining Type-2 isomorphic circulant graphs is not easy. Using a $C^{++}$ computer program, the authors obtained families of Type-2 isomorphic $C_{n}(R)$ w.r.t. $m$ = 2,3,5,7 for $n\\in\\mathbb{N}$ as well as $C_{np^3}(R)$ w.r.t. $m$ = $p$ for $n\\in\\mathbb{N}$ and $p$ is an odd pr","authors_text":"Vilfred Kamalappan, Wilson Peraprakash","cross_cats":[],"headline":"Computer programs generate families of Type-2 isomorphic circulant graphs for m values 2, 3, 5, 7 and odd primes p.","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"math.CO","submitted_at":"2026-05-13T21:46:47Z","title":"A study on Type-2 isomorphic circulant graphs. PART 9: Computer programs to show Type-1 $\\&$ -2 isomorphic circulant graphs"},"references":{"count":25,"internal_anchors":0,"resolved_work":25,"sample":[{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":1,"title":"A. Adam,Research problem 2-10, J. Combinatorial Theory,3(1967), 393","work_id":"7a43d6b0-2dfb-4412-99ad-96186a8a7489","year":1967},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":2,"title":"Bjarne Stroustrup,The C++ Programming Language, Addison-Wesley, 2013","work_id":"49961b69-5f89-485d-ac7f-ca5f2637357c","year":2013},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":3,"title":"B. Elspas and J. Turner,Graphs with circulant adjacency matrices, J. Combinatorial Theory,9(1970), 297-307","work_id":"d1c668b3-b8ac-436d-9047-2408b9c6f3ec","year":1970},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":4,"title":"Fisher Larence,Visual Basic.NET: An Introduction to Computer Programming, Kendall Hunt Publishing, USA","work_id":"86224c76-0cff-4f7d-8663-c9d0f1dc3fd0","year":2015},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":5,"title":"Martin Grohe and Pascal Schweitzer,The graph isomorphism problem, Communication ACM,63 (11)(2020), 128–","work_id":"0f860eba-400e-4d08-9161-3bf95d5c109c","year":2020}],"snapshot_sha256":"fbea74ca420ab9f471674ce151f899eef3eb38acedbcfe8fe2138442ae597731"},"source":{"id":"2605.14140","kind":"arxiv","version":1},"verdict":{"created_at":"2026-05-15T02:11:18.171518Z","id":"f0e42807-d5e7-4d54-82d7-7112bc309a50","model_set":{"reader":"grok-4.3"},"one_line_summary":"Computer programs are supplied to generate families of Type-2 isomorphic circulant graphs C_n(R) for m=2,3,5,7 and to demonstrate how Type-1 and Type-2 isomorphisms occur.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"Computer programs generate families of Type-2 isomorphic circulant graphs for m values 2, 3, 5, 7 and odd primes p.","strongest_claim":"Using a C++ computer program, the authors obtained families of Type-2 isomorphic C_n(R) w.r.t. m = 2,3,5,7 for n in natural numbers as well as C_{np^3}(R) w.r.t. m = p for odd prime p.","weakest_assumption":"The programs correctly implement the definitions of Type-1 and Type-2 isomorphism from the cited prior papers without coding errors or missed cases."}},"verdict_id":"f0e42807-d5e7-4d54-82d7-7112bc309a50"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:bc5a785b091c9584014e349df9cd9d1a7bcfb2869dcd3fecfee3f7640539f47e","target":"record","created_at":"2026-05-17T23:39:11Z","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":"a24eba99ae13e454d966dcf22697201e2644886d98df17f3006cd9979efd6152","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"math.CO","submitted_at":"2026-05-13T21:46:47Z","title_canon_sha256":"6aa26622ab3e18b30aef5e43a430fce4e78a5e1ea948122020b557fc6fe79169"},"schema_version":"1.0","source":{"id":"2605.14140","kind":"arxiv","version":1}},"canonical_sha256":"388de8db194d79ad95c5dadc662678a06ba270b61b71166618d6be5415f2badc","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"388de8db194d79ad95c5dadc662678a06ba270b61b71166618d6be5415f2badc","first_computed_at":"2026-05-17T23:39:11.697517Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:39:11.697517Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"jEHkgU8+03OQ7tAD/Dlh8kH12CY0mUyChSXFEnr0duZeVtBOl5v6uzg49tRX4NsA8Um5amVW4gedQVUYqU+kBQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:39:11.698210Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.14140","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bc5a785b091c9584014e349df9cd9d1a7bcfb2869dcd3fecfee3f7640539f47e","sha256:ef4b1d1f402ca56fa9cc29b3eacd4a8abf2cca63264d2acd758428d680ab7422"],"state_sha256":"1850d7fc6008d241e0a83533cbc9f8e538ba171b8054a5d3cb221ec19106e6ab"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"A35xvB3ATWZDNAHNgLiDs2tZcdX/fCyj8dMOQubmgol8y6YSUlV5v6/vLDEiaWIYgo+i1DsPlsd3IUr/SHAzCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-18T20:36:23.847425Z","bundle_sha256":"ba2d8c7cfbeed5ade3766a80f40b866bc999676a8927f65b88d112a4f59524e3"}}