{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:IRGSINGT6FK5RAG2YQKZU4UCQN","short_pith_number":"pith:IRGSINGT","canonical_record":{"source":{"id":"1206.3877","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-06-18T10:30:02Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"466341ba87265f049210d656b846cbb2a58f7dd9caa294d7782b340c461eaf84","abstract_canon_sha256":"f457fd4bb74f6c576027f964063fd7fcbf3567dddad886686c7284ff38cf3032"},"schema_version":"1.0"},"canonical_sha256":"444d2434d3f155d880dac4159a72828366dea637b7dbfd72913199cffb7c69a9","source":{"kind":"arxiv","id":"1206.3877","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1206.3877","created_at":"2026-05-18T03:53:18Z"},{"alias_kind":"arxiv_version","alias_value":"1206.3877v1","created_at":"2026-05-18T03:53:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1206.3877","created_at":"2026-05-18T03:53:18Z"},{"alias_kind":"pith_short_12","alias_value":"IRGSINGT6FK5","created_at":"2026-05-18T12:27:09Z"},{"alias_kind":"pith_short_16","alias_value":"IRGSINGT6FK5RAG2","created_at":"2026-05-18T12:27:09Z"},{"alias_kind":"pith_short_8","alias_value":"IRGSINGT","created_at":"2026-05-18T12:27:09Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:IRGSINGT6FK5RAG2YQKZU4UCQN","target":"record","payload":{"canonical_record":{"source":{"id":"1206.3877","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-06-18T10:30:02Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"466341ba87265f049210d656b846cbb2a58f7dd9caa294d7782b340c461eaf84","abstract_canon_sha256":"f457fd4bb74f6c576027f964063fd7fcbf3567dddad886686c7284ff38cf3032"},"schema_version":"1.0"},"canonical_sha256":"444d2434d3f155d880dac4159a72828366dea637b7dbfd72913199cffb7c69a9","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:53:18.559831Z","signature_b64":"IjZyz63hCuDbZf639LL49Fu7suFMiD7rHdgFylZbSvPxz5mdOhC9HDv95yJihjv8uZ21Ybt/T2pm0ksHScXpDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"444d2434d3f155d880dac4159a72828366dea637b7dbfd72913199cffb7c69a9","last_reissued_at":"2026-05-18T03:53:18.559134Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:53:18.559134Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1206.3877","source_version":1,"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-18T03:53:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+0Ava/oBAJ9nbIWPThayXZ4t7CtDJvRXA0blrI/CC02+nQ571vno2vLfrHDowqvQBe8n/+HxIqArmN702kv0BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T22:58:20.404971Z"},"content_sha256":"c9d73b73e77c5fdea27b455da3c3aa628481f6518df5b89b2817c23c85d6474e","schema_version":"1.0","event_id":"sha256:c9d73b73e77c5fdea27b455da3c3aa628481f6518df5b89b2817c23c85d6474e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:IRGSINGT6FK5RAG2YQKZU4UCQN","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the combinatorics of suffix arrays","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DS","authors_text":"Gregory Kucherov, Lilla T\\'othm\\'er\\'esz, St\\'ephane Vialette","submitted_at":"2012-06-18T10:30:02Z","abstract_excerpt":"We prove several combinatorial properties of suffix arrays, including a characterization of suffix arrays through a bijection with a certain well-defined class of permutations. Our approach is based on the characterization of Burrows-Wheeler arrays given in [1], that we apply by reducing suffix sorting to cyclic shift sorting through the use of an additional sentinel symbol. We show that the characterization of suffix arrays for a special case of binary alphabet given in [2] easily follows from our characterization. Based on our results, we also provide simple proofs for the enumeration result"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1206.3877","kind":"arxiv","version":1},"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-18T03:53:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VYaae/UF6L3y/JrsQYh9+AWLvRe1zQUNTZ/8RhgsEuys9SyxIhKMTxPLT93JMef78KVuCO8K22NxvMFV9n4/DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T22:58:20.405662Z"},"content_sha256":"7b665d7baadb13ede440ceb45bd7db182fa6809d970d68e9701a7fe137b49124","schema_version":"1.0","event_id":"sha256:7b665d7baadb13ede440ceb45bd7db182fa6809d970d68e9701a7fe137b49124"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IRGSINGT6FK5RAG2YQKZU4UCQN/bundle.json","state_url":"https://pith.science/pith/IRGSINGT6FK5RAG2YQKZU4UCQN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IRGSINGT6FK5RAG2YQKZU4UCQN/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-04T22:58:20Z","links":{"resolver":"https://pith.science/pith/IRGSINGT6FK5RAG2YQKZU4UCQN","bundle":"https://pith.science/pith/IRGSINGT6FK5RAG2YQKZU4UCQN/bundle.json","state":"https://pith.science/pith/IRGSINGT6FK5RAG2YQKZU4UCQN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IRGSINGT6FK5RAG2YQKZU4UCQN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:IRGSINGT6FK5RAG2YQKZU4UCQN","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":"f457fd4bb74f6c576027f964063fd7fcbf3567dddad886686c7284ff38cf3032","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-06-18T10:30:02Z","title_canon_sha256":"466341ba87265f049210d656b846cbb2a58f7dd9caa294d7782b340c461eaf84"},"schema_version":"1.0","source":{"id":"1206.3877","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1206.3877","created_at":"2026-05-18T03:53:18Z"},{"alias_kind":"arxiv_version","alias_value":"1206.3877v1","created_at":"2026-05-18T03:53:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1206.3877","created_at":"2026-05-18T03:53:18Z"},{"alias_kind":"pith_short_12","alias_value":"IRGSINGT6FK5","created_at":"2026-05-18T12:27:09Z"},{"alias_kind":"pith_short_16","alias_value":"IRGSINGT6FK5RAG2","created_at":"2026-05-18T12:27:09Z"},{"alias_kind":"pith_short_8","alias_value":"IRGSINGT","created_at":"2026-05-18T12:27:09Z"}],"graph_snapshots":[{"event_id":"sha256:7b665d7baadb13ede440ceb45bd7db182fa6809d970d68e9701a7fe137b49124","target":"graph","created_at":"2026-05-18T03:53: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":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"We prove several combinatorial properties of suffix arrays, including a characterization of suffix arrays through a bijection with a certain well-defined class of permutations. Our approach is based on the characterization of Burrows-Wheeler arrays given in [1], that we apply by reducing suffix sorting to cyclic shift sorting through the use of an additional sentinel symbol. We show that the characterization of suffix arrays for a special case of binary alphabet given in [2] easily follows from our characterization. Based on our results, we also provide simple proofs for the enumeration result","authors_text":"Gregory Kucherov, Lilla T\\'othm\\'er\\'esz, St\\'ephane Vialette","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-06-18T10:30:02Z","title":"On the combinatorics of suffix arrays"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1206.3877","kind":"arxiv","version":1},"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:c9d73b73e77c5fdea27b455da3c3aa628481f6518df5b89b2817c23c85d6474e","target":"record","created_at":"2026-05-18T03:53: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":"f457fd4bb74f6c576027f964063fd7fcbf3567dddad886686c7284ff38cf3032","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-06-18T10:30:02Z","title_canon_sha256":"466341ba87265f049210d656b846cbb2a58f7dd9caa294d7782b340c461eaf84"},"schema_version":"1.0","source":{"id":"1206.3877","kind":"arxiv","version":1}},"canonical_sha256":"444d2434d3f155d880dac4159a72828366dea637b7dbfd72913199cffb7c69a9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"444d2434d3f155d880dac4159a72828366dea637b7dbfd72913199cffb7c69a9","first_computed_at":"2026-05-18T03:53:18.559134Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:53:18.559134Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"IjZyz63hCuDbZf639LL49Fu7suFMiD7rHdgFylZbSvPxz5mdOhC9HDv95yJihjv8uZ21Ybt/T2pm0ksHScXpDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:53:18.559831Z","signed_message":"canonical_sha256_bytes"},"source_id":"1206.3877","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c9d73b73e77c5fdea27b455da3c3aa628481f6518df5b89b2817c23c85d6474e","sha256:7b665d7baadb13ede440ceb45bd7db182fa6809d970d68e9701a7fe137b49124"],"state_sha256":"7afe1706f5e7c28d3ba4f9fe1f416463c116087cde39cf3fe2946782aaf8c905"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HMykYjm+lC4Hg31GqWJePfakqOaWvgYd7TZ2ifGLMksQcUkUsDEARLfLWZ1AvTsmWdQffwZqFdZs2tgt1xwSAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T22:58:20.409639Z","bundle_sha256":"98fb36892caace31ce4a372b0ac2b85cbaa8e0786239b9145a4ab6505f1aad0f"}}