{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:37WB5NTXORG46KOJN7EBSAITGE","short_pith_number":"pith:37WB5NTX","schema_version":"1.0","canonical_sha256":"dfec1eb677744dcf29c96fc8190113311270d01a990577cc5010db7f455b39a7","source":{"kind":"arxiv","id":"1608.05550","version":2},"attestation_state":"computed","paper":{"title":"Shortest unique palindromic substring queries in optimal time","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Hideo Bannai, Hiroe Inoue, Masayuki Takeda, Shunsuke Inenaga, Takuya Mieno, Yuto Nakashima","submitted_at":"2016-08-19T09:35:52Z","abstract_excerpt":"A palindrome is a string that reads the same forward and backward. A palindromic substring $P$ of a string $S$ is called a shortest unique palindromic substring ($\\mathit{SUPS}$) for an interval $[x, y]$ in $S$, if $P$ occurs exactly once in $S$, this occurrence of $P$ contains interval $[x, y]$, and every palindromic substring of $S$ which contains interval $[x, y]$ and is shorter than $P$ occurs at least twice in $S$. The $\\mathit{SUPS}$ problem is, given a string $S$, to preprocess $S$ so that for any subsequent query interval $[x, y]$ all the $\\mathit{SUPS}\\mbox{s}$ for interval $[x, y]$ c"},"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":"1608.05550","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-08-19T09:35:52Z","cross_cats_sorted":[],"title_canon_sha256":"74ff1181fd4c4fe033082c1c0384052a3af7699e35fedda64607a76fba39e7b1","abstract_canon_sha256":"c72de8a71ea9fdccf3106ab4b5b61dc5c37c7b78efa1e01b5d9efde4aeaaca01"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:41:01.742010Z","signature_b64":"voZj+Mg6CKvM9cp/Z3S3bnfKOcvApue2FMsaKRhJMWcdyYlSQIcGOOrtQ6M0HY2bwF4ntrVXlcqCkj0C6B70BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dfec1eb677744dcf29c96fc8190113311270d01a990577cc5010db7f455b39a7","last_reissued_at":"2026-05-18T00:41:01.741333Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:41:01.741333Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Shortest unique palindromic substring queries in optimal time","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Hideo Bannai, Hiroe Inoue, Masayuki Takeda, Shunsuke Inenaga, Takuya Mieno, Yuto Nakashima","submitted_at":"2016-08-19T09:35:52Z","abstract_excerpt":"A palindrome is a string that reads the same forward and backward. A palindromic substring $P$ of a string $S$ is called a shortest unique palindromic substring ($\\mathit{SUPS}$) for an interval $[x, y]$ in $S$, if $P$ occurs exactly once in $S$, this occurrence of $P$ contains interval $[x, y]$, and every palindromic substring of $S$ which contains interval $[x, y]$ and is shorter than $P$ occurs at least twice in $S$. The $\\mathit{SUPS}$ problem is, given a string $S$, to preprocess $S$ so that for any subsequent query interval $[x, y]$ all the $\\mathit{SUPS}\\mbox{s}$ for interval $[x, y]$ c"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.05550","kind":"arxiv","version":2},"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":"1608.05550","created_at":"2026-05-18T00:41:01.741455+00:00"},{"alias_kind":"arxiv_version","alias_value":"1608.05550v2","created_at":"2026-05-18T00:41:01.741455+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.05550","created_at":"2026-05-18T00:41:01.741455+00:00"},{"alias_kind":"pith_short_12","alias_value":"37WB5NTXORG4","created_at":"2026-05-18T12:29:55.572404+00:00"},{"alias_kind":"pith_short_16","alias_value":"37WB5NTXORG46KOJ","created_at":"2026-05-18T12:29:55.572404+00:00"},{"alias_kind":"pith_short_8","alias_value":"37WB5NTX","created_at":"2026-05-18T12:29:55.572404+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/37WB5NTXORG46KOJN7EBSAITGE","json":"https://pith.science/pith/37WB5NTXORG46KOJN7EBSAITGE.json","graph_json":"https://pith.science/api/pith-number/37WB5NTXORG46KOJN7EBSAITGE/graph.json","events_json":"https://pith.science/api/pith-number/37WB5NTXORG46KOJN7EBSAITGE/events.json","paper":"https://pith.science/paper/37WB5NTX"},"agent_actions":{"view_html":"https://pith.science/pith/37WB5NTXORG46KOJN7EBSAITGE","download_json":"https://pith.science/pith/37WB5NTXORG46KOJN7EBSAITGE.json","view_paper":"https://pith.science/paper/37WB5NTX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1608.05550&json=true","fetch_graph":"https://pith.science/api/pith-number/37WB5NTXORG46KOJN7EBSAITGE/graph.json","fetch_events":"https://pith.science/api/pith-number/37WB5NTXORG46KOJN7EBSAITGE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/37WB5NTXORG46KOJN7EBSAITGE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/37WB5NTXORG46KOJN7EBSAITGE/action/storage_attestation","attest_author":"https://pith.science/pith/37WB5NTXORG46KOJN7EBSAITGE/action/author_attestation","sign_citation":"https://pith.science/pith/37WB5NTXORG46KOJN7EBSAITGE/action/citation_signature","submit_replication":"https://pith.science/pith/37WB5NTXORG46KOJN7EBSAITGE/action/replication_record"}},"created_at":"2026-05-18T00:41:01.741455+00:00","updated_at":"2026-05-18T00:41:01.741455+00:00"}