{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:FFUXJBQYJ5EN5LXGU5CGIQ7FNG","short_pith_number":"pith:FFUXJBQY","canonical_record":{"source":{"id":"2605.14955","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-05-14T15:25:12Z","cross_cats_sorted":[],"title_canon_sha256":"545ca7762cf22780b4c63214f1a170e3084563afd35d3bf9cd43fee7aa11522d","abstract_canon_sha256":"0497009d330b50d64027c48d200f5730c050bec7ae07c732a07084156597926a"},"schema_version":"1.0"},"canonical_sha256":"29697486184f48deaee6a7446443e5699fde12e99095f2b3e8469b64e7e84d51","source":{"kind":"arxiv","id":"2605.14955","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.14955","created_at":"2026-05-17T23:38:55Z"},{"alias_kind":"arxiv_version","alias_value":"2605.14955v1","created_at":"2026-05-17T23:38:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.14955","created_at":"2026-05-17T23:38:55Z"},{"alias_kind":"pith_short_12","alias_value":"FFUXJBQYJ5EN","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"FFUXJBQYJ5EN5LXG","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"FFUXJBQY","created_at":"2026-05-18T12:33:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:FFUXJBQYJ5EN5LXGU5CGIQ7FNG","target":"record","payload":{"canonical_record":{"source":{"id":"2605.14955","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-05-14T15:25:12Z","cross_cats_sorted":[],"title_canon_sha256":"545ca7762cf22780b4c63214f1a170e3084563afd35d3bf9cd43fee7aa11522d","abstract_canon_sha256":"0497009d330b50d64027c48d200f5730c050bec7ae07c732a07084156597926a"},"schema_version":"1.0"},"canonical_sha256":"29697486184f48deaee6a7446443e5699fde12e99095f2b3e8469b64e7e84d51","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:38:55.348091Z","signature_b64":"C6+KigHowZOWL+IKG3v28rKOFRP+G12Of/lLcLdqdeMz8PaZYm33dBZIck1bKGLDDZ/QUPAnDZHggpcx04ELCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"29697486184f48deaee6a7446443e5699fde12e99095f2b3e8469b64e7e84d51","last_reissued_at":"2026-05-17T23:38:55.347424Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:38:55.347424Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2605.14955","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:38:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"J+cFDabhZipiDif2xucwScKCDcxW1vUYJqfKIRDZ5t0+DU+LisnchrShOn1MyVxdbZZnB9yF4RuNnfMo/HITDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-21T14:53:10.076832Z"},"content_sha256":"85a6e186eb75de1a9475ac1f4b18db419b74f0b6773b7502a63345cc483f79fd","schema_version":"1.0","event_id":"sha256:85a6e186eb75de1a9475ac1f4b18db419b74f0b6773b7502a63345cc483f79fd"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:FFUXJBQYJ5EN5LXGU5CGIQ7FNG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the Number of Rational Power Factors in a Finite Word","license":"http://creativecommons.org/licenses/by/4.0/","headline":"A finite word of length n contains at most one-eighth n squared plus lower-order terms distinct rational power factors.","cross_cats":[],"primary_cat":"math.CO","authors_text":"Shuo Li, Yuan Song","submitted_at":"2026-05-14T15:25:12Z","abstract_excerpt":"Let $w$ be a finite word of length $n$. In this paper, we study the maximum possible number of distinct rational power factors in a finite word. A rational power is a word of the form $u=p^kp'$, where $p$ is a nonempty finite word, $k$ is an integer larger than $1$, $p^k$ is a concatenation of $k$ copies of $p$ and $p'$ is a prefix of $p$. The rational powers can be recognized as a generalization of $k$-powers, and it is proved in [Li,Pachocki,Radoszewski 24] that, the number $C_k(w)$ of distinct $k$-powers in $w$ satisfies $C_k(w) \\leq \\frac{n-1}{k-1}$. However, the number of rational powers "},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"we prove that the number RP(w) of distinct rational power factors of w satisfies RP(w)≤1/8 n² + O(n)","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"The graph-theoretic representation together with the word equations fully captures every possible finite word and every possible rational power factor without omissions or overcounting.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"The maximum number of distinct rational power factors in a word of length n is at most (1/8)n² + O(n).","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"A finite word of length n contains at most one-eighth n squared plus lower-order terms distinct rational power factors.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"2686e557d667dcac9deb38302826e272676179f45207459c1c443a1a037ab342"},"source":{"id":"2605.14955","kind":"arxiv","version":1},"verdict":{"id":"e62748b8-27d7-479d-9466-8c33f3d610bb","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-15T03:16:04.714835Z","strongest_claim":"we prove that the number RP(w) of distinct rational power factors of w satisfies RP(w)≤1/8 n² + O(n)","one_line_summary":"The maximum number of distinct rational power factors in a word of length n is at most (1/8)n² + O(n).","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"The graph-theoretic representation together with the word equations fully captures every possible finite word and every possible rational power factor without omissions or overcounting.","pith_extraction_headline":"A finite word of length n contains at most one-eighth n squared plus lower-order terms distinct rational power factors."},"references":{"count":171,"sample":[{"doi":"10.1007/11505877","year":2005,"title":"Bidimensional Sturmian Sequences and Substitutions , Url =","work_id":"4c604755-5bac-4c9d-9351-bc5fbb83acf9","ref_index":1,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":null,"title":"Ali Aberkane and Sre. Suites de m. Actes des Journ","work_id":"f5c8d6ba-180a-47a2-81bf-7069517c72a2","ref_index":2,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":null,"title":"Reversals and palindromes in continued fractions , Volume =","work_id":"9d118cc7-1114-465e-a844-ddaf5d56ea29","ref_index":3,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":null,"title":"Palindromic continued fractions , Volume =","work_id":"94d436de-3abc-4567-931f-e51d48ea64e4","ref_index":4,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":null,"title":"On Repeated Factors in","work_id":"220afaf3-514b-49e3-8b9d-52e920c56992","ref_index":5,"cited_arxiv_id":"","is_internal_anchor":false}],"resolved_work":171,"snapshot_sha256":"f68cfcb3e4ddd595b3d5c3fe85411d054164406cef677b462a8c42948bed8dde","internal_anchors":0},"formal_canon":{"evidence_count":2,"snapshot_sha256":"be8a7ec1f6272b1c3d768562fd5e1281e4894ce581d34910b1519cf2001ac1ca"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"verdict_id":"e62748b8-27d7-479d-9466-8c33f3d610bb"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:38:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"464xhB1vpNzd5JPwNDjJsdJKG4tN3KyQg0IqLoGXXbzUcOCpY8kGZ1KoQPe6RWSoozK61u5fBuD/ipSxS/1jAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-21T14:53:10.077457Z"},"content_sha256":"45cb894332de6be8f612c8ac8dccbcccd8dfe932878d4a16aa8cfeb2863b6857","schema_version":"1.0","event_id":"sha256:45cb894332de6be8f612c8ac8dccbcccd8dfe932878d4a16aa8cfeb2863b6857"},{"event_type":"integrity_finding","subject_pith_number":"pith:2026:FFUXJBQYJ5EN5LXGU5CGIQ7FNG","target":"integrity","payload":{"note":"DOI in the printed bibliography is fragmented by whitespace or line breaks. A longer candidate (10.1007/11505877\\_21) was visible in the surrounding text but could not be confirmed against doi.org as printed.","snippet":"Thomas Fernique , Bibsource =. Bidimensional Sturmian Sequences and Substitutions , Url =. Developments in Language Theory, 9th International Conference,. 2005 , Bdsk-Url-1 =. doi:10.1007/11505877\\_21 , Pages =","arxiv_id":"2605.14955","detector":"doi_compliance","evidence":{"ref_index":1,"verdict_class":"incontrovertible","resolved_title":null,"printed_excerpt":"Thomas Fernique , Bibsource =. Bidimensional Sturmian Sequences and Substitutions , Url =. Developments in Language Theory, 9th International Conference,. 2005 , Bdsk-Url-1 =. doi:10.1007/11505877\\_21 , Pages =","reconstructed_doi":"10.1007/11505877\\_21"},"severity":"advisory","ref_index":1,"audited_at":"2026-05-19T05:27:40.057950Z","event_type":"pith.integrity.v1","detected_doi":"10.1007/11505877\\_21","detector_url":"https://pith.science/pith-integrity-protocol#doi_compliance","external_url":null,"finding_type":"recoverable_identifier","evidence_hash":"8574457159f62b6579447618d94072e97975ab05c061dc577c3d1979fc47a82c","paper_version":1,"verdict_class":"incontrovertible","resolved_title":null,"detector_version":"1.0.0","detected_arxiv_id":null,"integrity_event_id":12,"payload_sha256":"381a9ff54318957ab1f85dcb854f2424cc33f08240c7d8d5406d472fb40c7ff7","signature_b64":"GFIjW0fE90H9rqI9aqxFndkOGZ5T+HGm622DCdqyV6tf+MIBafNGxgkA3SpUIrv8Yk263FCABstQVNSV0MzkBA==","signing_key_id":"pith-v1-2026-05"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-19T05:31:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uskjqEoDtJnidQkqnMXBs+Y8BV4qP+tUttJuPA+zoR8aPbRmjtmboZrA5BaH7NFj4Ingvk/TnHohENM2s2WZBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-21T14:53:10.078376Z"},"content_sha256":"ef42aeb85c879068f148981822e2801c6cb085b53c08f6ba5d3b58fda1716298","schema_version":"1.0","event_id":"sha256:ef42aeb85c879068f148981822e2801c6cb085b53c08f6ba5d3b58fda1716298"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FFUXJBQYJ5EN5LXGU5CGIQ7FNG/bundle.json","state_url":"https://pith.science/pith/FFUXJBQYJ5EN5LXGU5CGIQ7FNG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FFUXJBQYJ5EN5LXGU5CGIQ7FNG/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-21T14:53:10Z","links":{"resolver":"https://pith.science/pith/FFUXJBQYJ5EN5LXGU5CGIQ7FNG","bundle":"https://pith.science/pith/FFUXJBQYJ5EN5LXGU5CGIQ7FNG/bundle.json","state":"https://pith.science/pith/FFUXJBQYJ5EN5LXGU5CGIQ7FNG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FFUXJBQYJ5EN5LXGU5CGIQ7FNG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:FFUXJBQYJ5EN5LXGU5CGIQ7FNG","merge_version":"pith-open-graph-merge-v1","event_count":3,"valid_event_count":3,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"0497009d330b50d64027c48d200f5730c050bec7ae07c732a07084156597926a","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-05-14T15:25:12Z","title_canon_sha256":"545ca7762cf22780b4c63214f1a170e3084563afd35d3bf9cd43fee7aa11522d"},"schema_version":"1.0","source":{"id":"2605.14955","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.14955","created_at":"2026-05-17T23:38:55Z"},{"alias_kind":"arxiv_version","alias_value":"2605.14955v1","created_at":"2026-05-17T23:38:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.14955","created_at":"2026-05-17T23:38:55Z"},{"alias_kind":"pith_short_12","alias_value":"FFUXJBQYJ5EN","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"FFUXJBQYJ5EN5LXG","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"FFUXJBQY","created_at":"2026-05-18T12:33:37Z"}],"graph_snapshots":[{"event_id":"sha256:45cb894332de6be8f612c8ac8dccbcccd8dfe932878d4a16aa8cfeb2863b6857","target":"graph","created_at":"2026-05-17T23:38:55Z","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 prove that the number RP(w) of distinct rational power factors of w satisfies RP(w)≤1/8 n² + O(n)"},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"The graph-theoretic representation together with the word equations fully captures every possible finite word and every possible rational power factor without omissions or overcounting."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"The maximum number of distinct rational power factors in a word of length n is at most (1/8)n² + O(n)."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"A finite word of length n contains at most one-eighth n squared plus lower-order terms distinct rational power factors."}],"snapshot_sha256":"2686e557d667dcac9deb38302826e272676179f45207459c1c443a1a037ab342"},"formal_canon":{"evidence_count":2,"snapshot_sha256":"be8a7ec1f6272b1c3d768562fd5e1281e4894ce581d34910b1519cf2001ac1ca"},"paper":{"abstract_excerpt":"Let $w$ be a finite word of length $n$. In this paper, we study the maximum possible number of distinct rational power factors in a finite word. A rational power is a word of the form $u=p^kp'$, where $p$ is a nonempty finite word, $k$ is an integer larger than $1$, $p^k$ is a concatenation of $k$ copies of $p$ and $p'$ is a prefix of $p$. The rational powers can be recognized as a generalization of $k$-powers, and it is proved in [Li,Pachocki,Radoszewski 24] that, the number $C_k(w)$ of distinct $k$-powers in $w$ satisfies $C_k(w) \\leq \\frac{n-1}{k-1}$. However, the number of rational powers ","authors_text":"Shuo Li, Yuan Song","cross_cats":[],"headline":"A finite word of length n contains at most one-eighth n squared plus lower-order terms distinct rational power factors.","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-05-14T15:25:12Z","title":"On the Number of Rational Power Factors in a Finite Word"},"references":{"count":171,"internal_anchors":0,"resolved_work":171,"sample":[{"cited_arxiv_id":"","doi":"10.1007/11505877","is_internal_anchor":false,"ref_index":1,"title":"Bidimensional Sturmian Sequences and Substitutions , Url =","work_id":"4c604755-5bac-4c9d-9351-bc5fbb83acf9","year":2005},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":2,"title":"Ali Aberkane and Sre. Suites de m. Actes des Journ","work_id":"f5c8d6ba-180a-47a2-81bf-7069517c72a2","year":null},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":3,"title":"Reversals and palindromes in continued fractions , Volume =","work_id":"9d118cc7-1114-465e-a844-ddaf5d56ea29","year":null},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":4,"title":"Palindromic continued fractions , Volume =","work_id":"94d436de-3abc-4567-931f-e51d48ea64e4","year":null},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":5,"title":"On Repeated Factors in","work_id":"220afaf3-514b-49e3-8b9d-52e920c56992","year":null}],"snapshot_sha256":"f68cfcb3e4ddd595b3d5c3fe85411d054164406cef677b462a8c42948bed8dde"},"source":{"id":"2605.14955","kind":"arxiv","version":1},"verdict":{"created_at":"2026-05-15T03:16:04.714835Z","id":"e62748b8-27d7-479d-9466-8c33f3d610bb","model_set":{"reader":"grok-4.3"},"one_line_summary":"The maximum number of distinct rational power factors in a word of length n is at most (1/8)n² + O(n).","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"A finite word of length n contains at most one-eighth n squared plus lower-order terms distinct rational power factors.","strongest_claim":"we prove that the number RP(w) of distinct rational power factors of w satisfies RP(w)≤1/8 n² + O(n)","weakest_assumption":"The graph-theoretic representation together with the word equations fully captures every possible finite word and every possible rational power factor without omissions or overcounting."}},"verdict_id":"e62748b8-27d7-479d-9466-8c33f3d610bb"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:85a6e186eb75de1a9475ac1f4b18db419b74f0b6773b7502a63345cc483f79fd","target":"record","created_at":"2026-05-17T23:38:55Z","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":"0497009d330b50d64027c48d200f5730c050bec7ae07c732a07084156597926a","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-05-14T15:25:12Z","title_canon_sha256":"545ca7762cf22780b4c63214f1a170e3084563afd35d3bf9cd43fee7aa11522d"},"schema_version":"1.0","source":{"id":"2605.14955","kind":"arxiv","version":1}},"canonical_sha256":"29697486184f48deaee6a7446443e5699fde12e99095f2b3e8469b64e7e84d51","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"29697486184f48deaee6a7446443e5699fde12e99095f2b3e8469b64e7e84d51","first_computed_at":"2026-05-17T23:38:55.347424Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:38:55.347424Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"C6+KigHowZOWL+IKG3v28rKOFRP+G12Of/lLcLdqdeMz8PaZYm33dBZIck1bKGLDDZ/QUPAnDZHggpcx04ELCA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:38:55.348091Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.14955","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:85a6e186eb75de1a9475ac1f4b18db419b74f0b6773b7502a63345cc483f79fd","sha256:45cb894332de6be8f612c8ac8dccbcccd8dfe932878d4a16aa8cfeb2863b6857","sha256:ef42aeb85c879068f148981822e2801c6cb085b53c08f6ba5d3b58fda1716298"],"state_sha256":"04c89f6c7278106f3beaca0bbf1a299db1225f06bca4455609a704cc111e34ac"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UdTyjezQyNt8a0+XWVVgBsCFdulhQo105LgkmD+p5bGvPdv3qcVZD0m3tVdVc1gd291vcXtT9zj30CO6iCoFDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-21T14:53:10.080959Z","bundle_sha256":"7c75b83d3de2bfe36ef73ce19e0eb852a33971d169f7e186baead68f9fb3d5e0"}}