{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:7UATDYUQQMBUSX4EYN3MKD6E7E","short_pith_number":"pith:7UATDYUQ","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"},"canonical_sha256":"fd0131e2908303495f84c376c50fc4f937a8def012d3eaa29d297e66847d8070","source":{"kind":"arxiv","id":"1709.05314","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1709.05314","created_at":"2026-05-18T00:34:54Z"},{"alias_kind":"arxiv_version","alias_value":"1709.05314v2","created_at":"2026-05-18T00:34:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.05314","created_at":"2026-05-18T00:34:54Z"},{"alias_kind":"pith_short_12","alias_value":"7UATDYUQQMBU","created_at":"2026-05-18T12:31:05Z"},{"alias_kind":"pith_short_16","alias_value":"7UATDYUQQMBUSX4E","created_at":"2026-05-18T12:31:05Z"},{"alias_kind":"pith_short_8","alias_value":"7UATDYUQ","created_at":"2026-05-18T12:31:05Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:7UATDYUQQMBUSX4EYN3MKD6E7E","target":"record","payload":{"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"},"canonical_sha256":"fd0131e2908303495f84c376c50fc4f937a8def012d3eaa29d297e66847d8070","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"},"source_kind":"arxiv","source_id":"1709.05314","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:34:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XJX5cLU8FwwF2HBaJy8pfwBpd91KJa42Fdd9SDYiMQqeTNwZdRsMCi5cHVjmM+FfcQ5ecmluUsJeETaj52dQCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T01:47:43.954737Z"},"content_sha256":"5e85dfe8edfaf29846e58ec2ead04add211f59a14910ad94c6e098983d1a846d","schema_version":"1.0","event_id":"sha256:5e85dfe8edfaf29846e58ec2ead04add211f59a14910ad94c6e098983d1a846d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:7UATDYUQQMBUSX4EYN3MKD6E7E","target":"graph","payload":{"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"},"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:34:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MF7qxiViApmz8FDEXosv7CDVw63iN5V5MZLrd6wUkkgW1M05h5tGCud9tlEg9wi3DYSnQ/FjLRNJR8kXTTpjDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T01:47:43.955175Z"},"content_sha256":"4e824ce26549a50e33aaf4281def077960cf541efd3b58ad523dff98090a60c5","schema_version":"1.0","event_id":"sha256:4e824ce26549a50e33aaf4281def077960cf541efd3b58ad523dff98090a60c5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7UATDYUQQMBUSX4EYN3MKD6E7E/bundle.json","state_url":"https://pith.science/pith/7UATDYUQQMBUSX4EYN3MKD6E7E/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7UATDYUQQMBUSX4EYN3MKD6E7E/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-26T01:47:43Z","links":{"resolver":"https://pith.science/pith/7UATDYUQQMBUSX4EYN3MKD6E7E","bundle":"https://pith.science/pith/7UATDYUQQMBUSX4EYN3MKD6E7E/bundle.json","state":"https://pith.science/pith/7UATDYUQQMBUSX4EYN3MKD6E7E/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7UATDYUQQMBUSX4EYN3MKD6E7E/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:7UATDYUQQMBUSX4EYN3MKD6E7E","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":"6987b8aab0848d87aa9fd7dd1bf2b928764d69953384a8ada82ba14081643536","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-09-15T17:09:54Z","title_canon_sha256":"e8ae284412ee3cd38be4df8b85b269eeaa1ecea99638385f3eecb97e75d2f019"},"schema_version":"1.0","source":{"id":"1709.05314","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1709.05314","created_at":"2026-05-18T00:34:54Z"},{"alias_kind":"arxiv_version","alias_value":"1709.05314v2","created_at":"2026-05-18T00:34:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.05314","created_at":"2026-05-18T00:34:54Z"},{"alias_kind":"pith_short_12","alias_value":"7UATDYUQQMBU","created_at":"2026-05-18T12:31:05Z"},{"alias_kind":"pith_short_16","alias_value":"7UATDYUQQMBUSX4E","created_at":"2026-05-18T12:31:05Z"},{"alias_kind":"pith_short_8","alias_value":"7UATDYUQ","created_at":"2026-05-18T12:31:05Z"}],"graph_snapshots":[{"event_id":"sha256:4e824ce26549a50e33aaf4281def077960cf541efd3b58ad523dff98090a60c5","target":"graph","created_at":"2026-05-18T00:34:54Z","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":"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","authors_text":"Nicola Prezza","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-09-15T17:09:54Z","title":"String Attractors"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.05314","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:5e85dfe8edfaf29846e58ec2ead04add211f59a14910ad94c6e098983d1a846d","target":"record","created_at":"2026-05-18T00:34:54Z","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":"6987b8aab0848d87aa9fd7dd1bf2b928764d69953384a8ada82ba14081643536","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-09-15T17:09:54Z","title_canon_sha256":"e8ae284412ee3cd38be4df8b85b269eeaa1ecea99638385f3eecb97e75d2f019"},"schema_version":"1.0","source":{"id":"1709.05314","kind":"arxiv","version":2}},"canonical_sha256":"fd0131e2908303495f84c376c50fc4f937a8def012d3eaa29d297e66847d8070","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fd0131e2908303495f84c376c50fc4f937a8def012d3eaa29d297e66847d8070","first_computed_at":"2026-05-18T00:34:54.529731Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:34:54.529731Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"LHk0uYXItsjo/WlrmY6z1VXzTaKt8LPo2gVeWmASBNn5U1tgMZT7hwCmZXtRJKu6+Gto949vTs8bBNdLFWMVBA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:34:54.530467Z","signed_message":"canonical_sha256_bytes"},"source_id":"1709.05314","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5e85dfe8edfaf29846e58ec2ead04add211f59a14910ad94c6e098983d1a846d","sha256:4e824ce26549a50e33aaf4281def077960cf541efd3b58ad523dff98090a60c5"],"state_sha256":"fbcc6b618bed46f9c1fe21e19c51e0c384d08dd9a431c3585db9c7ac42d01a21"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SWXpz1AkJ+WSYOgwCia6jlG1/Td4mYxUcUjFFCSpTNz1caK54QGrmZaXSnHhcmQpMNR2nT939F8VRaNcEBJmBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T01:47:43.958968Z","bundle_sha256":"51aadd4e00216579480e54ac0817e309937d14620cb8949f71f6adf4497c9137"}}