{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:S46JWG5CUWCAHHR2AO4JFAV2GW","short_pith_number":"pith:S46JWG5C","canonical_record":{"source":{"id":"2312.01359","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2023-12-03T11:53:55Z","cross_cats_sorted":[],"title_canon_sha256":"19d8aec9a2b2645617115b1cb2548608cb51e541641315362218d2d0b7a5d7c1","abstract_canon_sha256":"30bc25ca8e994df03e7ce8137660806c96975bc78de41bc845f16988c05bcde9"},"schema_version":"1.0"},"canonical_sha256":"973c9b1ba2a584039e3a03b89282ba35aba963b9361246e29ff52069f9f643fc","source":{"kind":"arxiv","id":"2312.01359","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2312.01359","created_at":"2026-07-05T08:27:23Z"},{"alias_kind":"arxiv_version","alias_value":"2312.01359v3","created_at":"2026-07-05T08:27:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2312.01359","created_at":"2026-07-05T08:27:23Z"},{"alias_kind":"pith_short_12","alias_value":"S46JWG5CUWCA","created_at":"2026-07-05T08:27:23Z"},{"alias_kind":"pith_short_16","alias_value":"S46JWG5CUWCAHHR2","created_at":"2026-07-05T08:27:23Z"},{"alias_kind":"pith_short_8","alias_value":"S46JWG5C","created_at":"2026-07-05T08:27:23Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:S46JWG5CUWCAHHR2AO4JFAV2GW","target":"record","payload":{"canonical_record":{"source":{"id":"2312.01359","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2023-12-03T11:53:55Z","cross_cats_sorted":[],"title_canon_sha256":"19d8aec9a2b2645617115b1cb2548608cb51e541641315362218d2d0b7a5d7c1","abstract_canon_sha256":"30bc25ca8e994df03e7ce8137660806c96975bc78de41bc845f16988c05bcde9"},"schema_version":"1.0"},"canonical_sha256":"973c9b1ba2a584039e3a03b89282ba35aba963b9361246e29ff52069f9f643fc","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:27:23.824746Z","signature_b64":"lYU+tFRSGVVH6PAnbRU44mdzIIPBFRvgniR4J+7LRArN/xoQfSQBpzMMtU4Xwwqz4nWtXOICmvot68tbT0RYAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"973c9b1ba2a584039e3a03b89282ba35aba963b9361246e29ff52069f9f643fc","last_reissued_at":"2026-07-05T08:27:23.824255Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:27:23.824255Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2312.01359","source_version":3,"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-07-05T08:27:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"f+f+TPFpxNF9okTDtVwrztG5dj6myejWb0utTyL2laE1YKbBkSBd0eERKL1LDuJxZZlL6EkIyG5tnY32UzISDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-23T13:34:06.517824Z"},"content_sha256":"a611b9986acceeb2605f7eacc04b566881b915f59f3cba3ad0e6fd2f718a7de0","schema_version":"1.0","event_id":"sha256:a611b9986acceeb2605f7eacc04b566881b915f59f3cba3ad0e6fd2f718a7de0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:S46JWG5CUWCAHHR2AO4JFAV2GW","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Suffixient Sets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Ben Langmead, Giovanni Manzini, Lore Depuydt, Nicola Prezza, Travis Gagie","submitted_at":"2023-12-03T11:53:55Z","abstract_excerpt":"We define a suffixient set for a text $T [1..n]$ to be a set $S$ of positions between 1 and $n$ such that, for any edge descending from a node $u$ to a node $v$ in the suffix tree of $T$, there is an element $s \\in S$ such that $u$'s path label is a suffix of $T [1..s - 1]$ and $T [s]$ is the first character of $(u, v)$'s edge label. We first show there is a suffixient set of cardinality at most $2 \\bar{r}$, where $\\bar{r}$ is the number of runs in the Burrows-Wheeler Transform of the reverse of $T$. We then show that, given a straight-line program for $T$ with $g$ rules, we can build an $O (\\"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2312.01359","kind":"arxiv","version":3},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2312.01359/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":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-07-05T08:27:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3+1IYZTeLP8F8tk/Hp47lCp70GeuZihItkTGw5m3wwt0hZ/zqZq6UzfDV/bbEN9TpcurnJ8PVhJam/mkwzKoDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-23T13:34:06.518319Z"},"content_sha256":"7399378bfb9bc58e81e0876143dc8b61e45975d84e680992e310b87ef21d1f38","schema_version":"1.0","event_id":"sha256:7399378bfb9bc58e81e0876143dc8b61e45975d84e680992e310b87ef21d1f38"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/S46JWG5CUWCAHHR2AO4JFAV2GW/bundle.json","state_url":"https://pith.science/pith/S46JWG5CUWCAHHR2AO4JFAV2GW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/S46JWG5CUWCAHHR2AO4JFAV2GW/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-08-23T13:34:06Z","links":{"resolver":"https://pith.science/pith/S46JWG5CUWCAHHR2AO4JFAV2GW","bundle":"https://pith.science/pith/S46JWG5CUWCAHHR2AO4JFAV2GW/bundle.json","state":"https://pith.science/pith/S46JWG5CUWCAHHR2AO4JFAV2GW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/S46JWG5CUWCAHHR2AO4JFAV2GW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:S46JWG5CUWCAHHR2AO4JFAV2GW","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":"30bc25ca8e994df03e7ce8137660806c96975bc78de41bc845f16988c05bcde9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2023-12-03T11:53:55Z","title_canon_sha256":"19d8aec9a2b2645617115b1cb2548608cb51e541641315362218d2d0b7a5d7c1"},"schema_version":"1.0","source":{"id":"2312.01359","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2312.01359","created_at":"2026-07-05T08:27:23Z"},{"alias_kind":"arxiv_version","alias_value":"2312.01359v3","created_at":"2026-07-05T08:27:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2312.01359","created_at":"2026-07-05T08:27:23Z"},{"alias_kind":"pith_short_12","alias_value":"S46JWG5CUWCA","created_at":"2026-07-05T08:27:23Z"},{"alias_kind":"pith_short_16","alias_value":"S46JWG5CUWCAHHR2","created_at":"2026-07-05T08:27:23Z"},{"alias_kind":"pith_short_8","alias_value":"S46JWG5C","created_at":"2026-07-05T08:27:23Z"}],"graph_snapshots":[{"event_id":"sha256:7399378bfb9bc58e81e0876143dc8b61e45975d84e680992e310b87ef21d1f38","target":"graph","created_at":"2026-07-05T08:27:23Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2312.01359/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We define a suffixient set for a text $T [1..n]$ to be a set $S$ of positions between 1 and $n$ such that, for any edge descending from a node $u$ to a node $v$ in the suffix tree of $T$, there is an element $s \\in S$ such that $u$'s path label is a suffix of $T [1..s - 1]$ and $T [s]$ is the first character of $(u, v)$'s edge label. We first show there is a suffixient set of cardinality at most $2 \\bar{r}$, where $\\bar{r}$ is the number of runs in the Burrows-Wheeler Transform of the reverse of $T$. We then show that, given a straight-line program for $T$ with $g$ rules, we can build an $O (\\","authors_text":"Ben Langmead, Giovanni Manzini, Lore Depuydt, Nicola Prezza, Travis Gagie","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2023-12-03T11:53:55Z","title":"Suffixient Sets"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2312.01359","kind":"arxiv","version":3},"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:a611b9986acceeb2605f7eacc04b566881b915f59f3cba3ad0e6fd2f718a7de0","target":"record","created_at":"2026-07-05T08:27:23Z","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":"30bc25ca8e994df03e7ce8137660806c96975bc78de41bc845f16988c05bcde9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2023-12-03T11:53:55Z","title_canon_sha256":"19d8aec9a2b2645617115b1cb2548608cb51e541641315362218d2d0b7a5d7c1"},"schema_version":"1.0","source":{"id":"2312.01359","kind":"arxiv","version":3}},"canonical_sha256":"973c9b1ba2a584039e3a03b89282ba35aba963b9361246e29ff52069f9f643fc","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"973c9b1ba2a584039e3a03b89282ba35aba963b9361246e29ff52069f9f643fc","first_computed_at":"2026-07-05T08:27:23.824255Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T08:27:23.824255Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"lYU+tFRSGVVH6PAnbRU44mdzIIPBFRvgniR4J+7LRArN/xoQfSQBpzMMtU4Xwwqz4nWtXOICmvot68tbT0RYAw==","signature_status":"signed_v1","signed_at":"2026-07-05T08:27:23.824746Z","signed_message":"canonical_sha256_bytes"},"source_id":"2312.01359","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a611b9986acceeb2605f7eacc04b566881b915f59f3cba3ad0e6fd2f718a7de0","sha256:7399378bfb9bc58e81e0876143dc8b61e45975d84e680992e310b87ef21d1f38"],"state_sha256":"52545964694f9df3fc165d94ae4077762a6371be8712a3d0bd5b1e88c0fd1465"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OzwSnMexzPKspChu+IgeVfgEybSYkrArm/6fWaTw+H85pxhW4TdHlbYgEESVGh/ZJxs++W0dM3VfRCTr4XMHAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-23T13:34:06.523437Z","bundle_sha256":"4c1c4fa39683f0d0190d322c9cb1f34d96376920ad9bf734069caf0876c88557"}}