{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:7UATDYUQQMBUSX4EYN3MKD6E7E","short_pith_number":"pith:7UATDYUQ","schema_version":"1.0","canonical_sha256":"fd0131e2908303495f84c376c50fc4f937a8def012d3eaa29d297e66847d8070","source":{"kind":"arxiv","id":"1709.05314","version":2},"attestation_state":"computed","paper":{"title":"String Attractors","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Nicola Prezza","submitted_at":"2017-09-15T17:09:54Z","abstract_excerpt":"Let $S$ be a string of length $n$. In this paper we introduce the notion of \\emph{string attractor}: a subset of the string's positions $[1,n]$ such that every distinct substring of $S$ has an occurrence crossing one of the attractor's elements. We first show that the minimum attractor's size yields upper-bounds to the string's repetitiveness as measured by its linguistic complexity and by the length of its longest repeated substring. We then prove that all known compressors for repetitive strings induce a string attractor whose size is bounded by their associated repetitiveness measure, and 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":"1709.05314","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-09-15T17:09:54Z","cross_cats_sorted":[],"title_canon_sha256":"e8ae284412ee3cd38be4df8b85b269eeaa1ecea99638385f3eecb97e75d2f019","abstract_canon_sha256":"6987b8aab0848d87aa9fd7dd1bf2b928764d69953384a8ada82ba14081643536"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:34:54.530467Z","signature_b64":"LHk0uYXItsjo/WlrmY6z1VXzTaKt8LPo2gVeWmASBNn5U1tgMZT7hwCmZXtRJKu6+Gto949vTs8bBNdLFWMVBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fd0131e2908303495f84c376c50fc4f937a8def012d3eaa29d297e66847d8070","last_reissued_at":"2026-05-18T00:34:54.529731Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:34:54.529731Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"String Attractors","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Nicola Prezza","submitted_at":"2017-09-15T17:09:54Z","abstract_excerpt":"Let $S$ be a string of length $n$. In this paper we introduce the notion of \\emph{string attractor}: a subset of the string's positions $[1,n]$ such that every distinct substring of $S$ has an occurrence crossing one of the attractor's elements. We first show that the minimum attractor's size yields upper-bounds to the string's repetitiveness as measured by its linguistic complexity and by the length of its longest repeated substring. We then prove that all known compressors for repetitive strings induce a string attractor whose size is bounded by their associated repetitiveness measure, and c"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.05314","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":"1709.05314","created_at":"2026-05-18T00:34:54.529839+00:00"},{"alias_kind":"arxiv_version","alias_value":"1709.05314v2","created_at":"2026-05-18T00:34:54.529839+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.05314","created_at":"2026-05-18T00:34:54.529839+00:00"},{"alias_kind":"pith_short_12","alias_value":"7UATDYUQQMBU","created_at":"2026-05-18T12:31:05.417338+00:00"},{"alias_kind":"pith_short_16","alias_value":"7UATDYUQQMBUSX4E","created_at":"2026-05-18T12:31:05.417338+00:00"},{"alias_kind":"pith_short_8","alias_value":"7UATDYUQ","created_at":"2026-05-18T12:31:05.417338+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"1907.04660","citing_title":"String Attractors and Combinatorics on Words","ref_index":19,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/7UATDYUQQMBUSX4EYN3MKD6E7E","json":"https://pith.science/pith/7UATDYUQQMBUSX4EYN3MKD6E7E.json","graph_json":"https://pith.science/api/pith-number/7UATDYUQQMBUSX4EYN3MKD6E7E/graph.json","events_json":"https://pith.science/api/pith-number/7UATDYUQQMBUSX4EYN3MKD6E7E/events.json","paper":"https://pith.science/paper/7UATDYUQ"},"agent_actions":{"view_html":"https://pith.science/pith/7UATDYUQQMBUSX4EYN3MKD6E7E","download_json":"https://pith.science/pith/7UATDYUQQMBUSX4EYN3MKD6E7E.json","view_paper":"https://pith.science/paper/7UATDYUQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1709.05314&json=true","fetch_graph":"https://pith.science/api/pith-number/7UATDYUQQMBUSX4EYN3MKD6E7E/graph.json","fetch_events":"https://pith.science/api/pith-number/7UATDYUQQMBUSX4EYN3MKD6E7E/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7UATDYUQQMBUSX4EYN3MKD6E7E/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7UATDYUQQMBUSX4EYN3MKD6E7E/action/storage_attestation","attest_author":"https://pith.science/pith/7UATDYUQQMBUSX4EYN3MKD6E7E/action/author_attestation","sign_citation":"https://pith.science/pith/7UATDYUQQMBUSX4EYN3MKD6E7E/action/citation_signature","submit_replication":"https://pith.science/pith/7UATDYUQQMBUSX4EYN3MKD6E7E/action/replication_record"}},"created_at":"2026-05-18T00:34:54.529839+00:00","updated_at":"2026-05-18T00:34:54.529839+00:00"}