{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:IRGSINGT6FK5RAG2YQKZU4UCQN","short_pith_number":"pith:IRGSINGT","schema_version":"1.0","canonical_sha256":"444d2434d3f155d880dac4159a72828366dea637b7dbfd72913199cffb7c69a9","source":{"kind":"arxiv","id":"1206.3877","version":1},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1206.3877","created_at":"2026-05-18T03:53:18.559281+00:00"},{"alias_kind":"arxiv_version","alias_value":"1206.3877v1","created_at":"2026-05-18T03:53:18.559281+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1206.3877","created_at":"2026-05-18T03:53:18.559281+00:00"},{"alias_kind":"pith_short_12","alias_value":"IRGSINGT6FK5","created_at":"2026-05-18T12:27:09.501522+00:00"},{"alias_kind":"pith_short_16","alias_value":"IRGSINGT6FK5RAG2","created_at":"2026-05-18T12:27:09.501522+00:00"},{"alias_kind":"pith_short_8","alias_value":"IRGSINGT","created_at":"2026-05-18T12:27:09.501522+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/IRGSINGT6FK5RAG2YQKZU4UCQN","json":"https://pith.science/pith/IRGSINGT6FK5RAG2YQKZU4UCQN.json","graph_json":"https://pith.science/api/pith-number/IRGSINGT6FK5RAG2YQKZU4UCQN/graph.json","events_json":"https://pith.science/api/pith-number/IRGSINGT6FK5RAG2YQKZU4UCQN/events.json","paper":"https://pith.science/paper/IRGSINGT"},"agent_actions":{"view_html":"https://pith.science/pith/IRGSINGT6FK5RAG2YQKZU4UCQN","download_json":"https://pith.science/pith/IRGSINGT6FK5RAG2YQKZU4UCQN.json","view_paper":"https://pith.science/paper/IRGSINGT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1206.3877&json=true","fetch_graph":"https://pith.science/api/pith-number/IRGSINGT6FK5RAG2YQKZU4UCQN/graph.json","fetch_events":"https://pith.science/api/pith-number/IRGSINGT6FK5RAG2YQKZU4UCQN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IRGSINGT6FK5RAG2YQKZU4UCQN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IRGSINGT6FK5RAG2YQKZU4UCQN/action/storage_attestation","attest_author":"https://pith.science/pith/IRGSINGT6FK5RAG2YQKZU4UCQN/action/author_attestation","sign_citation":"https://pith.science/pith/IRGSINGT6FK5RAG2YQKZU4UCQN/action/citation_signature","submit_replication":"https://pith.science/pith/IRGSINGT6FK5RAG2YQKZU4UCQN/action/replication_record"}},"created_at":"2026-05-18T03:53:18.559281+00:00","updated_at":"2026-05-18T03:53:18.559281+00:00"}