{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:AYMH75H3TGYFQ4E47TLM6IKLUX","short_pith_number":"pith:AYMH75H3","schema_version":"1.0","canonical_sha256":"06187ff4fb99b058709cfcd6cf214ba5f6f5c0e5e1258d414c4363d07862f259","source":{"kind":"arxiv","id":"1609.07220","version":2},"attestation_state":"computed","paper":{"title":"Tight bounds on the maximum number of shortest unique substrings","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Hideo Bannai, Masayuki Takeda, Shunsuke Inenaga, Takuya Mieno","submitted_at":"2016-09-23T03:32:50Z","abstract_excerpt":"A substring Q of a string S is called a shortest unique substring (SUS) for interval [s,t] in S, if Q occurs exactly once in S, this occurrence of Q contains interval [s,t], and every substring of S which contains interval [s,t] and is shorter than Q occurs at least twice in S. The SUS problem is, given a string S, to preprocess S so that for any subsequent query interval [s,t] all the SUSs for interval [s,t] can be answered quickly. When s = t, we call the SUSs for [s,t] as point SUSs, and when s \\leq t, we call the SUSs for [s,t] as interval SUSs. There exist optimal O(n)-time preprocessing "},"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":"1609.07220","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2016-09-23T03:32:50Z","cross_cats_sorted":[],"title_canon_sha256":"73821665417e287709dbea92cd5bc1ee68a407e3a97947cda474dcfb6eafe62d","abstract_canon_sha256":"0529db4957da4672becd918b1c1aebde1bc2e0d9039c5f782fc5de8e7b01a3f1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:50:29.136682Z","signature_b64":"9IDGCyzfhpxgauT8Jj418gNLLjQc3HGJ8mcTXC+vZkPfEBnci+0xBJ0QNrxT4EKjdajLQyVeEjjUrv6Bxzu+AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"06187ff4fb99b058709cfcd6cf214ba5f6f5c0e5e1258d414c4363d07862f259","last_reissued_at":"2026-05-18T00:50:29.135950Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:50:29.135950Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Tight bounds on the maximum number of shortest unique substrings","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Hideo Bannai, Masayuki Takeda, Shunsuke Inenaga, Takuya Mieno","submitted_at":"2016-09-23T03:32:50Z","abstract_excerpt":"A substring Q of a string S is called a shortest unique substring (SUS) for interval [s,t] in S, if Q occurs exactly once in S, this occurrence of Q contains interval [s,t], and every substring of S which contains interval [s,t] and is shorter than Q occurs at least twice in S. The SUS problem is, given a string S, to preprocess S so that for any subsequent query interval [s,t] all the SUSs for interval [s,t] can be answered quickly. When s = t, we call the SUSs for [s,t] as point SUSs, and when s \\leq t, we call the SUSs for [s,t] as interval SUSs. There exist optimal O(n)-time preprocessing "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.07220","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":"1609.07220","created_at":"2026-05-18T00:50:29.136068+00:00"},{"alias_kind":"arxiv_version","alias_value":"1609.07220v2","created_at":"2026-05-18T00:50:29.136068+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.07220","created_at":"2026-05-18T00:50:29.136068+00:00"},{"alias_kind":"pith_short_12","alias_value":"AYMH75H3TGYF","created_at":"2026-05-18T12:30:07.202191+00:00"},{"alias_kind":"pith_short_16","alias_value":"AYMH75H3TGYFQ4E4","created_at":"2026-05-18T12:30:07.202191+00:00"},{"alias_kind":"pith_short_8","alias_value":"AYMH75H3","created_at":"2026-05-18T12:30:07.202191+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/AYMH75H3TGYFQ4E47TLM6IKLUX","json":"https://pith.science/pith/AYMH75H3TGYFQ4E47TLM6IKLUX.json","graph_json":"https://pith.science/api/pith-number/AYMH75H3TGYFQ4E47TLM6IKLUX/graph.json","events_json":"https://pith.science/api/pith-number/AYMH75H3TGYFQ4E47TLM6IKLUX/events.json","paper":"https://pith.science/paper/AYMH75H3"},"agent_actions":{"view_html":"https://pith.science/pith/AYMH75H3TGYFQ4E47TLM6IKLUX","download_json":"https://pith.science/pith/AYMH75H3TGYFQ4E47TLM6IKLUX.json","view_paper":"https://pith.science/paper/AYMH75H3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1609.07220&json=true","fetch_graph":"https://pith.science/api/pith-number/AYMH75H3TGYFQ4E47TLM6IKLUX/graph.json","fetch_events":"https://pith.science/api/pith-number/AYMH75H3TGYFQ4E47TLM6IKLUX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AYMH75H3TGYFQ4E47TLM6IKLUX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AYMH75H3TGYFQ4E47TLM6IKLUX/action/storage_attestation","attest_author":"https://pith.science/pith/AYMH75H3TGYFQ4E47TLM6IKLUX/action/author_attestation","sign_citation":"https://pith.science/pith/AYMH75H3TGYFQ4E47TLM6IKLUX/action/citation_signature","submit_replication":"https://pith.science/pith/AYMH75H3TGYFQ4E47TLM6IKLUX/action/replication_record"}},"created_at":"2026-05-18T00:50:29.136068+00:00","updated_at":"2026-05-18T00:50:29.136068+00:00"}