{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:3732IHEHSKDCCLCZNRIYBX6QZY","short_pith_number":"pith:3732IHEH","canonical_record":{"source":{"id":"2604.27548","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2026-04-30T07:54:25Z","cross_cats_sorted":[],"title_canon_sha256":"5d45fab2af411df5e9a2ae750f3295de261d069e7a24f0af1c0263da1d7883ee","abstract_canon_sha256":"c3e33610471966eb4ef6b5940642a2e551738fa33c466774ce07fee22a080c70"},"schema_version":"1.0"},"canonical_sha256":"dff7a41c879286212c596c5180dfd0ce29ee044689515c910418ae79c84627d0","source":{"kind":"arxiv","id":"2604.27548","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2604.27548","created_at":"2026-06-02T02:04:18Z"},{"alias_kind":"arxiv_version","alias_value":"2604.27548v2","created_at":"2026-06-02T02:04:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2604.27548","created_at":"2026-06-02T02:04:18Z"},{"alias_kind":"pith_short_12","alias_value":"3732IHEHSKDC","created_at":"2026-06-02T02:04:18Z"},{"alias_kind":"pith_short_16","alias_value":"3732IHEHSKDCCLCZ","created_at":"2026-06-02T02:04:18Z"},{"alias_kind":"pith_short_8","alias_value":"3732IHEH","created_at":"2026-06-02T02:04:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:3732IHEHSKDCCLCZNRIYBX6QZY","target":"record","payload":{"canonical_record":{"source":{"id":"2604.27548","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2026-04-30T07:54:25Z","cross_cats_sorted":[],"title_canon_sha256":"5d45fab2af411df5e9a2ae750f3295de261d069e7a24f0af1c0263da1d7883ee","abstract_canon_sha256":"c3e33610471966eb4ef6b5940642a2e551738fa33c466774ce07fee22a080c70"},"schema_version":"1.0"},"canonical_sha256":"dff7a41c879286212c596c5180dfd0ce29ee044689515c910418ae79c84627d0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-02T02:04:18.300420Z","signature_b64":"hsjjdrh38mWHC9/tYKaTKWW817KFaaCECFxJCruRk2gy3UO3hevH8pSpfPQOon/ETJC9VNZ3N8Nt4zy2OiVaAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dff7a41c879286212c596c5180dfd0ce29ee044689515c910418ae79c84627d0","last_reissued_at":"2026-06-02T02:04:18.299983Z","signature_status":"signed_v1","first_computed_at":"2026-06-02T02:04:18.299983Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2604.27548","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-06-02T02:04:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AMSp8GZRP/Tf2oHe4kcFMgrajsmVR/kDYpfjU/EDiTiz5EYmmGzsmCfZGtz+w5UCzMmQpdi+lxNwKhGosB57Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-04T04:43:45.811661Z"},"content_sha256":"5931240f0d77307ab75c5a89898bb8dd3d192ce062e734665575ddba72c34483","schema_version":"1.0","event_id":"sha256:5931240f0d77307ab75c5a89898bb8dd3d192ce062e734665575ddba72c34483"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:3732IHEHSKDCCLCZNRIYBX6QZY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Smallest suffixient set maintenance in near-real-time","license":"http://creativecommons.org/licenses/by/4.0/","headline":"The smallest suffixient set of a string can be maintained online with polyloglog time per letter using Weiner's suffix tree.","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Dominik K\\\"oppl, Gregory Kucherov","submitted_at":"2026-04-30T07:54:25Z","abstract_excerpt":"The size of the \\textit{smallest suffixient set} of positions of a string recently emerged as a new measure of string \\textit{repetitiveness} -- a measure reflecting how much of repetitive content the string contains. We study how to maintain the smallest suffixient set online in near-real-time, that is with small (in our case, polyloglog) worst-case time on processing each letter. Two frameworks are considered: when the text is given letter-by-letter in either a right-to-left or left-to-right direction. Our central algorithmic tool is Weiner's suffix tree algorithm and associated algorithmic "},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"We study how to maintain the smallest suffixient set online in near-real-time, that is with small (in our case, polyloglog) worst-case time on processing each letter. Two frameworks are considered: when the text is given letter-by-letter in either a right-to-left or left-to-right direction. Our central algorithmic tool is Weiner's suffix tree algorithm and associated algorithmic primitives for its efficient implementation.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"That Weiner's suffix tree algorithm and its primitives can be adapted and implemented to support online maintenance with only polyloglog time per letter without additional logarithmic or worse factors depending on alphabet size or other hidden costs.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"The smallest suffixient set can be maintained online in polyloglog time per letter in either left-to-right or right-to-left direction via Weiner's suffix tree primitives.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"The smallest suffixient set of a string can be maintained online with polyloglog time per letter using Weiner's suffix tree.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"1ca0ddd0e55337ca656449c2dc0ee6a36de3337cf2913654f8d893c9a292e7cb"},"source":{"id":"2604.27548","kind":"arxiv","version":2},"verdict":{"id":"9d07a651-040f-448e-9bd0-bd04e3f282d0","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-07T08:38:44.037593Z","strongest_claim":"We study how to maintain the smallest suffixient set online in near-real-time, that is with small (in our case, polyloglog) worst-case time on processing each letter. Two frameworks are considered: when the text is given letter-by-letter in either a right-to-left or left-to-right direction. Our central algorithmic tool is Weiner's suffix tree algorithm and associated algorithmic primitives for its efficient implementation.","one_line_summary":"The smallest suffixient set can be maintained online in polyloglog time per letter in either left-to-right or right-to-left direction via Weiner's suffix tree primitives.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"That Weiner's suffix tree algorithm and its primitives can be adapted and implemented to support online maintenance with only polyloglog time per letter without additional logarithmic or worse factors depending on alphabet size or other hidden costs.","pith_extraction_headline":"The smallest suffixient set of a string can be maintained online with polyloglog time per letter using Weiner's suffix tree."},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2604.27548/integrity.json","findings":[],"available":true,"detectors_run":[{"name":"ai_meta_artifact","ran_at":"2026-05-20T22:33:30.280648Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"doi_compliance","ran_at":"2026-05-19T19:04:51.059618Z","status":"completed","version":"1.0.0","findings_count":0}],"snapshot_sha256":"ca226d69f267cd8edc7d727c124f56691a9b625809dc600698158effcb05448c"},"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":"9d07a651-040f-448e-9bd0-bd04e3f282d0"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-06-02T02:04:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ueaizzz8hD4EdT88yMaYZzma4PeiUWtltYDCeQH4RtxeJxQ2JnHw+UwHc6R5R+f5duI6q8RvcvXvfEunxdR1BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-04T04:43:45.812157Z"},"content_sha256":"060ffb2918af6a41194f7a21b2094ae4cfa3e3ab069c491ea487ecd7da1cc135","schema_version":"1.0","event_id":"sha256:060ffb2918af6a41194f7a21b2094ae4cfa3e3ab069c491ea487ecd7da1cc135"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3732IHEHSKDCCLCZNRIYBX6QZY/bundle.json","state_url":"https://pith.science/pith/3732IHEHSKDCCLCZNRIYBX6QZY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3732IHEHSKDCCLCZNRIYBX6QZY/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-07-04T04:43:45Z","links":{"resolver":"https://pith.science/pith/3732IHEHSKDCCLCZNRIYBX6QZY","bundle":"https://pith.science/pith/3732IHEHSKDCCLCZNRIYBX6QZY/bundle.json","state":"https://pith.science/pith/3732IHEHSKDCCLCZNRIYBX6QZY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3732IHEHSKDCCLCZNRIYBX6QZY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:3732IHEHSKDCCLCZNRIYBX6QZY","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":"c3e33610471966eb4ef6b5940642a2e551738fa33c466774ce07fee22a080c70","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2026-04-30T07:54:25Z","title_canon_sha256":"5d45fab2af411df5e9a2ae750f3295de261d069e7a24f0af1c0263da1d7883ee"},"schema_version":"1.0","source":{"id":"2604.27548","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2604.27548","created_at":"2026-06-02T02:04:18Z"},{"alias_kind":"arxiv_version","alias_value":"2604.27548v2","created_at":"2026-06-02T02:04:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2604.27548","created_at":"2026-06-02T02:04:18Z"},{"alias_kind":"pith_short_12","alias_value":"3732IHEHSKDC","created_at":"2026-06-02T02:04:18Z"},{"alias_kind":"pith_short_16","alias_value":"3732IHEHSKDCCLCZ","created_at":"2026-06-02T02:04:18Z"},{"alias_kind":"pith_short_8","alias_value":"3732IHEH","created_at":"2026-06-02T02:04:18Z"}],"graph_snapshots":[{"event_id":"sha256:060ffb2918af6a41194f7a21b2094ae4cfa3e3ab069c491ea487ecd7da1cc135","target":"graph","created_at":"2026-06-02T02:04:18Z","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 study how to maintain the smallest suffixient set online in near-real-time, that is with small (in our case, polyloglog) worst-case time on processing each letter. Two frameworks are considered: when the text is given letter-by-letter in either a right-to-left or left-to-right direction. Our central algorithmic tool is Weiner's suffix tree algorithm and associated algorithmic primitives for its efficient implementation."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"That Weiner's suffix tree algorithm and its primitives can be adapted and implemented to support online maintenance with only polyloglog time per letter without additional logarithmic or worse factors depending on alphabet size or other hidden costs."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"The smallest suffixient set can be maintained online in polyloglog time per letter in either left-to-right or right-to-left direction via Weiner's suffix tree primitives."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"The smallest suffixient set of a string can be maintained online with polyloglog time per letter using Weiner's suffix tree."}],"snapshot_sha256":"1ca0ddd0e55337ca656449c2dc0ee6a36de3337cf2913654f8d893c9a292e7cb"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[{"findings_count":0,"name":"ai_meta_artifact","ran_at":"2026-05-20T22:33:30.280648Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"doi_compliance","ran_at":"2026-05-19T19:04:51.059618Z","status":"completed","version":"1.0.0"}],"endpoint":"/pith/2604.27548/integrity.json","findings":[],"snapshot_sha256":"ca226d69f267cd8edc7d727c124f56691a9b625809dc600698158effcb05448c","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The size of the \\textit{smallest suffixient set} of positions of a string recently emerged as a new measure of string \\textit{repetitiveness} -- a measure reflecting how much of repetitive content the string contains. We study how to maintain the smallest suffixient set online in near-real-time, that is with small (in our case, polyloglog) worst-case time on processing each letter. Two frameworks are considered: when the text is given letter-by-letter in either a right-to-left or left-to-right direction. Our central algorithmic tool is Weiner's suffix tree algorithm and associated algorithmic ","authors_text":"Dominik K\\\"oppl, Gregory Kucherov","cross_cats":[],"headline":"The smallest suffixient set of a string can be maintained online with polyloglog time per letter using Weiner's suffix tree.","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2026-04-30T07:54:25Z","title":"Smallest suffixient set maintenance in near-real-time"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2604.27548","kind":"arxiv","version":2},"verdict":{"created_at":"2026-05-07T08:38:44.037593Z","id":"9d07a651-040f-448e-9bd0-bd04e3f282d0","model_set":{"reader":"grok-4.3"},"one_line_summary":"The smallest suffixient set can be maintained online in polyloglog time per letter in either left-to-right or right-to-left direction via Weiner's suffix tree primitives.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"The smallest suffixient set of a string can be maintained online with polyloglog time per letter using Weiner's suffix tree.","strongest_claim":"We study how to maintain the smallest suffixient set online in near-real-time, that is with small (in our case, polyloglog) worst-case time on processing each letter. Two frameworks are considered: when the text is given letter-by-letter in either a right-to-left or left-to-right direction. Our central algorithmic tool is Weiner's suffix tree algorithm and associated algorithmic primitives for its efficient implementation.","weakest_assumption":"That Weiner's suffix tree algorithm and its primitives can be adapted and implemented to support online maintenance with only polyloglog time per letter without additional logarithmic or worse factors depending on alphabet size or other hidden costs."}},"verdict_id":"9d07a651-040f-448e-9bd0-bd04e3f282d0"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:5931240f0d77307ab75c5a89898bb8dd3d192ce062e734665575ddba72c34483","target":"record","created_at":"2026-06-02T02:04:18Z","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":"c3e33610471966eb4ef6b5940642a2e551738fa33c466774ce07fee22a080c70","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2026-04-30T07:54:25Z","title_canon_sha256":"5d45fab2af411df5e9a2ae750f3295de261d069e7a24f0af1c0263da1d7883ee"},"schema_version":"1.0","source":{"id":"2604.27548","kind":"arxiv","version":2}},"canonical_sha256":"dff7a41c879286212c596c5180dfd0ce29ee044689515c910418ae79c84627d0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"dff7a41c879286212c596c5180dfd0ce29ee044689515c910418ae79c84627d0","first_computed_at":"2026-06-02T02:04:18.299983Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-02T02:04:18.299983Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"hsjjdrh38mWHC9/tYKaTKWW817KFaaCECFxJCruRk2gy3UO3hevH8pSpfPQOon/ETJC9VNZ3N8Nt4zy2OiVaAQ==","signature_status":"signed_v1","signed_at":"2026-06-02T02:04:18.300420Z","signed_message":"canonical_sha256_bytes"},"source_id":"2604.27548","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5931240f0d77307ab75c5a89898bb8dd3d192ce062e734665575ddba72c34483","sha256:060ffb2918af6a41194f7a21b2094ae4cfa3e3ab069c491ea487ecd7da1cc135"],"state_sha256":"d14c562eb088611fd6dfb9f3f50a38588c42e585d756a418f777f0dc1e1ff295"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+JDyljfCfN6JkFDOSsFSMElyzKhIs/Eys5zKXcEW7yoiopSfC8cQjIz+jgiSMeOvATF2gDZPct9845zVpwWzBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-04T04:43:45.814644Z","bundle_sha256":"466b32b6210ee0c7b7dca246d41ffc025deaecdfce3167ff5bd86162308b8713"}}