{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:GDGML2N2UCG6CORPU3JB6JFC7I","short_pith_number":"pith:GDGML2N2","schema_version":"1.0","canonical_sha256":"30ccc5e9baa08de13a2fa6d21f24a2fa11c8fa13ec544222007efaf05c624028","source":{"kind":"arxiv","id":"2508.14384","version":3},"attestation_state":"computed","paper":{"title":"Almost succinct representation of maximal palindromes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Takuya Mieno, Tomohiro I","submitted_at":"2025-08-20T03:24:54Z","abstract_excerpt":"Palindromes are strings that read the same forward and backward. The computation of palindromic structures within strings is a fundamental problem in string algorithms, being motivated by potential applications in formal language theory and bioinformatics. Although the number of palindromic factors in a string of length $n$ can be quadratic, they can be implicitly represented in $O(n \\log n)$ bits of space by storing the lengths of all maximal palindromes in an integer array, which can be computed in $O(n)$ time [Manacher, 1975]. In this paper, for any positive constant $\\epsilon < 1$, we prop"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2508.14384","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2025-08-20T03:24:54Z","cross_cats_sorted":[],"title_canon_sha256":"3cb836e1941895ce5a301577aa3b9292c420016b45f0eec113248fa6c6c58f24","abstract_canon_sha256":"25b0f4225168133d83e6f795e01b320835050e20815d5ff2733bcd35ca896117"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:39:17.698852Z","signature_b64":"xgbfIp6q1DjbxGweM5Z+Qy0sP5RIp3j9A0aQNJKZrePdINkl1/rYBKRx4nQtQmjmLNN6udZwm5e60saP8FZmAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"30ccc5e9baa08de13a2fa6d21f24a2fa11c8fa13ec544222007efaf05c624028","last_reissued_at":"2026-05-17T23:39:17.698226Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:39:17.698226Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Almost succinct representation of maximal palindromes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Takuya Mieno, Tomohiro I","submitted_at":"2025-08-20T03:24:54Z","abstract_excerpt":"Palindromes are strings that read the same forward and backward. The computation of palindromic structures within strings is a fundamental problem in string algorithms, being motivated by potential applications in formal language theory and bioinformatics. Although the number of palindromic factors in a string of length $n$ can be quadratic, they can be implicitly represented in $O(n \\log n)$ bits of space by storing the lengths of all maximal palindromes in an integer array, which can be computed in $O(n)$ time [Manacher, 1975]. In this paper, for any positive constant $\\epsilon < 1$, we prop"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2508.14384","kind":"arxiv","version":3},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2508.14384","created_at":"2026-05-17T23:39:17.698335+00:00"},{"alias_kind":"arxiv_version","alias_value":"2508.14384v3","created_at":"2026-05-17T23:39:17.698335+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2508.14384","created_at":"2026-05-17T23:39:17.698335+00:00"},{"alias_kind":"pith_short_12","alias_value":"GDGML2N2UCG6","created_at":"2026-05-18T12:33:37.589309+00:00"},{"alias_kind":"pith_short_16","alias_value":"GDGML2N2UCG6CORP","created_at":"2026-05-18T12:33:37.589309+00:00"},{"alias_kind":"pith_short_8","alias_value":"GDGML2N2","created_at":"2026-05-18T12:33:37.589309+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/GDGML2N2UCG6CORPU3JB6JFC7I","json":"https://pith.science/pith/GDGML2N2UCG6CORPU3JB6JFC7I.json","graph_json":"https://pith.science/api/pith-number/GDGML2N2UCG6CORPU3JB6JFC7I/graph.json","events_json":"https://pith.science/api/pith-number/GDGML2N2UCG6CORPU3JB6JFC7I/events.json","paper":"https://pith.science/paper/GDGML2N2"},"agent_actions":{"view_html":"https://pith.science/pith/GDGML2N2UCG6CORPU3JB6JFC7I","download_json":"https://pith.science/pith/GDGML2N2UCG6CORPU3JB6JFC7I.json","view_paper":"https://pith.science/paper/GDGML2N2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2508.14384&json=true","fetch_graph":"https://pith.science/api/pith-number/GDGML2N2UCG6CORPU3JB6JFC7I/graph.json","fetch_events":"https://pith.science/api/pith-number/GDGML2N2UCG6CORPU3JB6JFC7I/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GDGML2N2UCG6CORPU3JB6JFC7I/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GDGML2N2UCG6CORPU3JB6JFC7I/action/storage_attestation","attest_author":"https://pith.science/pith/GDGML2N2UCG6CORPU3JB6JFC7I/action/author_attestation","sign_citation":"https://pith.science/pith/GDGML2N2UCG6CORPU3JB6JFC7I/action/citation_signature","submit_replication":"https://pith.science/pith/GDGML2N2UCG6CORPU3JB6JFC7I/action/replication_record"}},"created_at":"2026-05-17T23:39:17.698335+00:00","updated_at":"2026-05-17T23:39:17.698335+00:00"}