{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:37WB5NTXORG46KOJN7EBSAITGE","short_pith_number":"pith:37WB5NTX","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"},"canonical_sha256":"dfec1eb677744dcf29c96fc8190113311270d01a990577cc5010db7f455b39a7","source":{"kind":"arxiv","id":"1608.05550","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1608.05550","created_at":"2026-05-18T00:41:01Z"},{"alias_kind":"arxiv_version","alias_value":"1608.05550v2","created_at":"2026-05-18T00:41:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.05550","created_at":"2026-05-18T00:41:01Z"},{"alias_kind":"pith_short_12","alias_value":"37WB5NTXORG4","created_at":"2026-05-18T12:29:55Z"},{"alias_kind":"pith_short_16","alias_value":"37WB5NTXORG46KOJ","created_at":"2026-05-18T12:29:55Z"},{"alias_kind":"pith_short_8","alias_value":"37WB5NTX","created_at":"2026-05-18T12:29:55Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:37WB5NTXORG46KOJN7EBSAITGE","target":"record","payload":{"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"},"canonical_sha256":"dfec1eb677744dcf29c96fc8190113311270d01a990577cc5010db7f455b39a7","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"},"source_kind":"arxiv","source_id":"1608.05550","source_version":2,"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-18T00:41:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dTh+KtoWbvJmnv+ySmbMPSnXgfj5UHdXCpUGpYsxY+O64wKsf6JUdkKQGZHCfRZ7yfMLDvhAXR3NQxLfKqhZBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T05:59:47.678298Z"},"content_sha256":"9c8c111068629081876f7ddcb5a50850d262ceb75d783e17a424c27da80f83bd","schema_version":"1.0","event_id":"sha256:9c8c111068629081876f7ddcb5a50850d262ceb75d783e17a424c27da80f83bd"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:37WB5NTXORG46KOJN7EBSAITGE","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:41:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oMF4gLFP5mOwdLNYTy7SgCJSQNHzm9A+GaceLotyfc6PSASqRAS7kgt4CcZKHHczyBzz4WgiIHRz1yU1GDZLDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T05:59:47.678661Z"},"content_sha256":"e57b45dbf2dba5d2e0c7e674003b4cd60fc7f5942408e0f0e8cfe8ef0a6c7cfa","schema_version":"1.0","event_id":"sha256:e57b45dbf2dba5d2e0c7e674003b4cd60fc7f5942408e0f0e8cfe8ef0a6c7cfa"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/37WB5NTXORG46KOJN7EBSAITGE/bundle.json","state_url":"https://pith.science/pith/37WB5NTXORG46KOJN7EBSAITGE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/37WB5NTXORG46KOJN7EBSAITGE/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-28T05:59:47Z","links":{"resolver":"https://pith.science/pith/37WB5NTXORG46KOJN7EBSAITGE","bundle":"https://pith.science/pith/37WB5NTXORG46KOJN7EBSAITGE/bundle.json","state":"https://pith.science/pith/37WB5NTXORG46KOJN7EBSAITGE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/37WB5NTXORG46KOJN7EBSAITGE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:37WB5NTXORG46KOJN7EBSAITGE","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":"c72de8a71ea9fdccf3106ab4b5b61dc5c37c7b78efa1e01b5d9efde4aeaaca01","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-08-19T09:35:52Z","title_canon_sha256":"74ff1181fd4c4fe033082c1c0384052a3af7699e35fedda64607a76fba39e7b1"},"schema_version":"1.0","source":{"id":"1608.05550","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1608.05550","created_at":"2026-05-18T00:41:01Z"},{"alias_kind":"arxiv_version","alias_value":"1608.05550v2","created_at":"2026-05-18T00:41:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.05550","created_at":"2026-05-18T00:41:01Z"},{"alias_kind":"pith_short_12","alias_value":"37WB5NTXORG4","created_at":"2026-05-18T12:29:55Z"},{"alias_kind":"pith_short_16","alias_value":"37WB5NTXORG46KOJ","created_at":"2026-05-18T12:29:55Z"},{"alias_kind":"pith_short_8","alias_value":"37WB5NTX","created_at":"2026-05-18T12:29:55Z"}],"graph_snapshots":[{"event_id":"sha256:e57b45dbf2dba5d2e0c7e674003b4cd60fc7f5942408e0f0e8cfe8ef0a6c7cfa","target":"graph","created_at":"2026-05-18T00:41:01Z","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":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Hideo Bannai, Hiroe Inoue, Masayuki Takeda, Shunsuke Inenaga, Takuya Mieno, Yuto Nakashima","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-08-19T09:35:52Z","title":"Shortest unique palindromic substring queries in optimal time"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.05550","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:9c8c111068629081876f7ddcb5a50850d262ceb75d783e17a424c27da80f83bd","target":"record","created_at":"2026-05-18T00:41:01Z","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":"c72de8a71ea9fdccf3106ab4b5b61dc5c37c7b78efa1e01b5d9efde4aeaaca01","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-08-19T09:35:52Z","title_canon_sha256":"74ff1181fd4c4fe033082c1c0384052a3af7699e35fedda64607a76fba39e7b1"},"schema_version":"1.0","source":{"id":"1608.05550","kind":"arxiv","version":2}},"canonical_sha256":"dfec1eb677744dcf29c96fc8190113311270d01a990577cc5010db7f455b39a7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"dfec1eb677744dcf29c96fc8190113311270d01a990577cc5010db7f455b39a7","first_computed_at":"2026-05-18T00:41:01.741333Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:41:01.741333Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"voZj+Mg6CKvM9cp/Z3S3bnfKOcvApue2FMsaKRhJMWcdyYlSQIcGOOrtQ6M0HY2bwF4ntrVXlcqCkj0C6B70BQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:41:01.742010Z","signed_message":"canonical_sha256_bytes"},"source_id":"1608.05550","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9c8c111068629081876f7ddcb5a50850d262ceb75d783e17a424c27da80f83bd","sha256:e57b45dbf2dba5d2e0c7e674003b4cd60fc7f5942408e0f0e8cfe8ef0a6c7cfa"],"state_sha256":"f29217aff44baea006525066b7ac8e24647a639959f4836ab808bef837600a84"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/L7IU0hLnKxEdyNzGupbXmnxMw454jyIb6QJyTvECMsHfxu5Kqe2AoN7zK4udSinwXMWrqeMMG5RWeDARXi2Bw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T05:59:47.680670Z","bundle_sha256":"ea1e204b9d57d7796d5728b9f56091f990ee555821613ce65e8b72004e27f83e"}}