{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:J2NNRUXBH5LIQPHUCB6IBSQH2V","short_pith_number":"pith:J2NNRUXB","canonical_record":{"source":{"id":"2506.05638","kind":"arxiv","version":6},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2025-06-05T23:58:03Z","cross_cats_sorted":["cs.DS","math.CO"],"title_canon_sha256":"6faf0b39089c0898146278ffcc2c89366dc1c250eba093fe687c049e5382a108","abstract_canon_sha256":"17c45dac4c9e6bf9c092a07cb530480ee282906c9f0b453ccfc106b6cbfbad8d"},"schema_version":"1.0"},"canonical_sha256":"4e9ad8d2e13f56883cf4107c80ca07d54a3b1b34623366eaf89d2107380ed398","source":{"kind":"arxiv","id":"2506.05638","version":6},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2506.05638","created_at":"2026-05-29T02:05:35Z"},{"alias_kind":"arxiv_version","alias_value":"2506.05638v6","created_at":"2026-05-29T02:05:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.05638","created_at":"2026-05-29T02:05:35Z"},{"alias_kind":"pith_short_12","alias_value":"J2NNRUXBH5LI","created_at":"2026-05-29T02:05:35Z"},{"alias_kind":"pith_short_16","alias_value":"J2NNRUXBH5LIQPHU","created_at":"2026-05-29T02:05:35Z"},{"alias_kind":"pith_short_8","alias_value":"J2NNRUXB","created_at":"2026-05-29T02:05:35Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:J2NNRUXBH5LIQPHUCB6IBSQH2V","target":"record","payload":{"canonical_record":{"source":{"id":"2506.05638","kind":"arxiv","version":6},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2025-06-05T23:58:03Z","cross_cats_sorted":["cs.DS","math.CO"],"title_canon_sha256":"6faf0b39089c0898146278ffcc2c89366dc1c250eba093fe687c049e5382a108","abstract_canon_sha256":"17c45dac4c9e6bf9c092a07cb530480ee282906c9f0b453ccfc106b6cbfbad8d"},"schema_version":"1.0"},"canonical_sha256":"4e9ad8d2e13f56883cf4107c80ca07d54a3b1b34623366eaf89d2107380ed398","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-29T02:05:35.022914Z","signature_b64":"rOt5vgshMeAzaUrxfOfUlk+IAar6r73FpL6wz73yR3WwYsX7O2cCLdTUwYeBAkj19kyn2GYnc/8G1pLojvwoCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4e9ad8d2e13f56883cf4107c80ca07d54a3b1b34623366eaf89d2107380ed398","last_reissued_at":"2026-05-29T02:05:35.022367Z","signature_status":"signed_v1","first_computed_at":"2026-05-29T02:05:35.022367Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2506.05638","source_version":6,"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-29T02:05:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bcl3ZDr+ieNv4iacfRuOWFoCh5hc3G5Ek5TfFlhTWF6WLLeqOkInzWlB+ukH8TspboRHnA/uJ/mHLSJzmnnoAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T00:40:32.647408Z"},"content_sha256":"170bf624adb910917f2bf709b7e445a7899922e8f43b38c6c1e2b3dd96c61638","schema_version":"1.0","event_id":"sha256:170bf624adb910917f2bf709b7e445a7899922e8f43b38c6c1e2b3dd96c61638"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:J2NNRUXBH5LIQPHUCB6IBSQH2V","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Smallest Suffixient Sets: Effectiveness, Resilience, and Calculation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"The size of the smallest suffixient set is at most linear in the number of Burrows-Wheeler runs and strictly smaller than the smallest lexicographic parse on some string families.","cross_cats":["cs.DS","math.CO"],"primary_cat":"cs.FL","authors_text":"Cristian Urbina, Giuseppe Romana, Gonzalo Navarro, Hiroto Fujimaru","submitted_at":"2025-06-05T23:58:03Z","abstract_excerpt":"A suffixient set is a novel combinatorial object that captures the essential information of repetitive strings in a way that, provided with a random access mechanism, supports various forms of pattern matching. In this paper, we study the size $\\chi$ of the smallest suffixient set as a repetitiveness measure.\n  First, we study its sensitivity to various string operations. We show that $\\chi$ cannot increase by more than 2 after appending or prepending a character to the string. As a consequence, we are able to give simple linear-time online algorithms to compute smallest suffixient sets. We al"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"We show that χ = O(r) (where r is the number of runs in the Burrows-Wheeler Transform of the string), that there are string families where χ=o(v) (where v is the size of the smallest lexicographic parse of the string), and that χ ≤ σ+2 on episturmian words over alphabets of size σ.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"The definition and utility of a suffixient set rests on the assumption that, provided with a random access mechanism, it supports various forms of pattern matching on the underlying repetitive string.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"Smallest suffixient set size χ is O(r) for BWT runs r, o(v) for some lex parses, bounded by σ+2 on episturmian words, increases by at most 2 on append/prepend, and can increase by Ω(√n) under edits or rotations.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"The size of the smallest suffixient set is at most linear in the number of Burrows-Wheeler runs and strictly smaller than the smallest lexicographic parse on some string families.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"ee2b46e2711ed47c1de21fe591b5ff73f3299d6213ecb4c88f3b7576791eaa00"},"source":{"id":"2506.05638","kind":"arxiv","version":6},"verdict":{"id":"d439ae4c-b031-48c8-8ea4-9192d26a39ce","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-19T10:59:09.352041Z","strongest_claim":"We show that χ = O(r) (where r is the number of runs in the Burrows-Wheeler Transform of the string), that there are string families where χ=o(v) (where v is the size of the smallest lexicographic parse of the string), and that χ ≤ σ+2 on episturmian words over alphabets of size σ.","one_line_summary":"Smallest suffixient set size χ is O(r) for BWT runs r, o(v) for some lex parses, bounded by σ+2 on episturmian words, increases by at most 2 on append/prepend, and can increase by Ω(√n) under edits or rotations.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"The definition and utility of a suffixient set rests on the assumption that, provided with a random access mechanism, it supports various forms of pattern matching on the underlying repetitive string.","pith_extraction_headline":"The size of the smallest suffixient set is at most linear in the number of Burrows-Wheeler runs and strictly smaller than the smallest lexicographic parse on some string families."},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2506.05638/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":2,"snapshot_sha256":"a7662297e5524a5edf8c4400a1810de5016ccd721bd1d1f2191e02f2b2b40e9b"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"verdict_id":"d439ae4c-b031-48c8-8ea4-9192d26a39ce"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-29T02:05:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KocQGaYM8lf3oXa9ptOM2E5AcFqlFbbV/86pXIHY2HtzIZKDJ9wCyYx0kZNFwLS0fWwD/GVGpACigS4dblJJBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T00:40:32.648487Z"},"content_sha256":"ff6df8164f3b3dbf25fe183a5364d59f73c17e6b62a29b66d954e8aa06063b0e","schema_version":"1.0","event_id":"sha256:ff6df8164f3b3dbf25fe183a5364d59f73c17e6b62a29b66d954e8aa06063b0e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/J2NNRUXBH5LIQPHUCB6IBSQH2V/bundle.json","state_url":"https://pith.science/pith/J2NNRUXBH5LIQPHUCB6IBSQH2V/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/J2NNRUXBH5LIQPHUCB6IBSQH2V/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-06-01T00:40:32Z","links":{"resolver":"https://pith.science/pith/J2NNRUXBH5LIQPHUCB6IBSQH2V","bundle":"https://pith.science/pith/J2NNRUXBH5LIQPHUCB6IBSQH2V/bundle.json","state":"https://pith.science/pith/J2NNRUXBH5LIQPHUCB6IBSQH2V/state.json","well_known_bundle":"https://pith.science/.well-known/pith/J2NNRUXBH5LIQPHUCB6IBSQH2V/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:J2NNRUXBH5LIQPHUCB6IBSQH2V","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":"17c45dac4c9e6bf9c092a07cb530480ee282906c9f0b453ccfc106b6cbfbad8d","cross_cats_sorted":["cs.DS","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2025-06-05T23:58:03Z","title_canon_sha256":"6faf0b39089c0898146278ffcc2c89366dc1c250eba093fe687c049e5382a108"},"schema_version":"1.0","source":{"id":"2506.05638","kind":"arxiv","version":6}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2506.05638","created_at":"2026-05-29T02:05:35Z"},{"alias_kind":"arxiv_version","alias_value":"2506.05638v6","created_at":"2026-05-29T02:05:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.05638","created_at":"2026-05-29T02:05:35Z"},{"alias_kind":"pith_short_12","alias_value":"J2NNRUXBH5LI","created_at":"2026-05-29T02:05:35Z"},{"alias_kind":"pith_short_16","alias_value":"J2NNRUXBH5LIQPHU","created_at":"2026-05-29T02:05:35Z"},{"alias_kind":"pith_short_8","alias_value":"J2NNRUXB","created_at":"2026-05-29T02:05:35Z"}],"graph_snapshots":[{"event_id":"sha256:ff6df8164f3b3dbf25fe183a5364d59f73c17e6b62a29b66d954e8aa06063b0e","target":"graph","created_at":"2026-05-29T02:05:35Z","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":4,"items":[{"attestation":"unclaimed","claim_id":"C1","kind":"strongest_claim","source":"verdict.strongest_claim","status":"machine_extracted","text":"We show that χ = O(r) (where r is the number of runs in the Burrows-Wheeler Transform of the string), that there are string families where χ=o(v) (where v is the size of the smallest lexicographic parse of the string), and that χ ≤ σ+2 on episturmian words over alphabets of size σ."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"The definition and utility of a suffixient set rests on the assumption that, provided with a random access mechanism, it supports various forms of pattern matching on the underlying repetitive string."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"Smallest suffixient set size χ is O(r) for BWT runs r, o(v) for some lex parses, bounded by σ+2 on episturmian words, increases by at most 2 on append/prepend, and can increase by Ω(√n) under edits or rotations."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"The size of the smallest suffixient set is at most linear in the number of Burrows-Wheeler runs and strictly smaller than the smallest lexicographic parse on some string families."}],"snapshot_sha256":"ee2b46e2711ed47c1de21fe591b5ff73f3299d6213ecb4c88f3b7576791eaa00"},"formal_canon":{"evidence_count":2,"snapshot_sha256":"a7662297e5524a5edf8c4400a1810de5016ccd721bd1d1f2191e02f2b2b40e9b"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2506.05638/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"A suffixient set is a novel combinatorial object that captures the essential information of repetitive strings in a way that, provided with a random access mechanism, supports various forms of pattern matching. In this paper, we study the size $\\chi$ of the smallest suffixient set as a repetitiveness measure.\n  First, we study its sensitivity to various string operations. We show that $\\chi$ cannot increase by more than 2 after appending or prepending a character to the string. As a consequence, we are able to give simple linear-time online algorithms to compute smallest suffixient sets. We al","authors_text":"Cristian Urbina, Giuseppe Romana, Gonzalo Navarro, Hiroto Fujimaru","cross_cats":["cs.DS","math.CO"],"headline":"The size of the smallest suffixient set is at most linear in the number of Burrows-Wheeler runs and strictly smaller than the smallest lexicographic parse on some string families.","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2025-06-05T23:58:03Z","title":"Smallest Suffixient Sets: Effectiveness, Resilience, and Calculation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.05638","kind":"arxiv","version":6},"verdict":{"created_at":"2026-05-19T10:59:09.352041Z","id":"d439ae4c-b031-48c8-8ea4-9192d26a39ce","model_set":{"reader":"grok-4.3"},"one_line_summary":"Smallest suffixient set size χ is O(r) for BWT runs r, o(v) for some lex parses, bounded by σ+2 on episturmian words, increases by at most 2 on append/prepend, and can increase by Ω(√n) under edits or rotations.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"The size of the smallest suffixient set is at most linear in the number of Burrows-Wheeler runs and strictly smaller than the smallest lexicographic parse on some string families.","strongest_claim":"We show that χ = O(r) (where r is the number of runs in the Burrows-Wheeler Transform of the string), that there are string families where χ=o(v) (where v is the size of the smallest lexicographic parse of the string), and that χ ≤ σ+2 on episturmian words over alphabets of size σ.","weakest_assumption":"The definition and utility of a suffixient set rests on the assumption that, provided with a random access mechanism, it supports various forms of pattern matching on the underlying repetitive string."}},"verdict_id":"d439ae4c-b031-48c8-8ea4-9192d26a39ce"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:170bf624adb910917f2bf709b7e445a7899922e8f43b38c6c1e2b3dd96c61638","target":"record","created_at":"2026-05-29T02:05:35Z","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":"17c45dac4c9e6bf9c092a07cb530480ee282906c9f0b453ccfc106b6cbfbad8d","cross_cats_sorted":["cs.DS","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2025-06-05T23:58:03Z","title_canon_sha256":"6faf0b39089c0898146278ffcc2c89366dc1c250eba093fe687c049e5382a108"},"schema_version":"1.0","source":{"id":"2506.05638","kind":"arxiv","version":6}},"canonical_sha256":"4e9ad8d2e13f56883cf4107c80ca07d54a3b1b34623366eaf89d2107380ed398","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4e9ad8d2e13f56883cf4107c80ca07d54a3b1b34623366eaf89d2107380ed398","first_computed_at":"2026-05-29T02:05:35.022367Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-29T02:05:35.022367Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"rOt5vgshMeAzaUrxfOfUlk+IAar6r73FpL6wz73yR3WwYsX7O2cCLdTUwYeBAkj19kyn2GYnc/8G1pLojvwoCw==","signature_status":"signed_v1","signed_at":"2026-05-29T02:05:35.022914Z","signed_message":"canonical_sha256_bytes"},"source_id":"2506.05638","source_kind":"arxiv","source_version":6}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:170bf624adb910917f2bf709b7e445a7899922e8f43b38c6c1e2b3dd96c61638","sha256:ff6df8164f3b3dbf25fe183a5364d59f73c17e6b62a29b66d954e8aa06063b0e"],"state_sha256":"0db07e4e07058013c28efd071b6279be50ac7e0ed8a5bd9e224948352ef44008"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VJZtbZ9WhC/yAQC4mInmnbGvPTY80gZDcis71IQSqewqcGer3hDc+Xe614cNmVy/sxnGJoVORuyTUqqc+rO8Dg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T00:40:32.653524Z","bundle_sha256":"c4ae2c04ddb75c8801c5bf71c4ace6d2b6b6ed981fa79d1e94e24d2770b1aebe"}}