{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:2V25A7FDUF7NIECEZ47LMLSMTV","short_pith_number":"pith:2V25A7FD","schema_version":"1.0","canonical_sha256":"d575d07ca3a17ed41044cf3eb62e4c9d6a8478dcd4cb485abc69e1b4705fa4d1","source":{"kind":"arxiv","id":"1902.01960","version":2},"attestation_state":"computed","paper":{"title":"On the Hardness and Inapproximability of Recognizing Wheeler Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Daniel Gibney, Sharma V. Thankachan","submitted_at":"2019-02-05T22:29:03Z","abstract_excerpt":"In recent years several compressed indexes based on variants of the Burrows-Wheeler transformation have been introduced. Some of these index structures far more complex than a single string, as was originally done with the FM-index [Ferragina and Manzini, J. ACM 2005]. As such, there has been an effort to better understand under which conditions such an indexing scheme is possible. This led to the introduction of Wheeler graphs [Gagie it et al., Theor. Comput. Sci., 2017]. A Wheeler graph is a directed graph with edge labels which satisfies two simple axioms. Wheeler graphs can be indexed in a"},"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":"1902.01960","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2019-02-05T22:29:03Z","cross_cats_sorted":[],"title_canon_sha256":"71a22da924a783e3478de60ad6b35e7045dcb741aaf13a797b8b65989298a56c","abstract_canon_sha256":"77420fabf33b6bcbe6acfcd568e8c6874dd72dcc42e447a31d1d3ebb834bedac"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:52:45.324183Z","signature_b64":"WKDwFVpQk2ot8vijMx8/2xqjX6kTU6EwVCFO2VAs0Hr09kgcNt+GM5aqz1u2G1aUc+9L/UoRZGoyJQezBk1aDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d575d07ca3a17ed41044cf3eb62e4c9d6a8478dcd4cb485abc69e1b4705fa4d1","last_reissued_at":"2026-05-17T23:52:45.323588Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:52:45.323588Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the Hardness and Inapproximability of Recognizing Wheeler Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Daniel Gibney, Sharma V. Thankachan","submitted_at":"2019-02-05T22:29:03Z","abstract_excerpt":"In recent years several compressed indexes based on variants of the Burrows-Wheeler transformation have been introduced. Some of these index structures far more complex than a single string, as was originally done with the FM-index [Ferragina and Manzini, J. ACM 2005]. As such, there has been an effort to better understand under which conditions such an indexing scheme is possible. This led to the introduction of Wheeler graphs [Gagie it et al., Theor. Comput. Sci., 2017]. A Wheeler graph is a directed graph with edge labels which satisfies two simple axioms. Wheeler graphs can be indexed in a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.01960","kind":"arxiv","version":2},"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":"1902.01960","created_at":"2026-05-17T23:52:45.323697+00:00"},{"alias_kind":"arxiv_version","alias_value":"1902.01960v2","created_at":"2026-05-17T23:52:45.323697+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.01960","created_at":"2026-05-17T23:52:45.323697+00:00"},{"alias_kind":"pith_short_12","alias_value":"2V25A7FDUF7N","created_at":"2026-05-18T12:33:07.085635+00:00"},{"alias_kind":"pith_short_16","alias_value":"2V25A7FDUF7NIECE","created_at":"2026-05-18T12:33:07.085635+00:00"},{"alias_kind":"pith_short_8","alias_value":"2V25A7FD","created_at":"2026-05-18T12:33:07.085635+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/2V25A7FDUF7NIECEZ47LMLSMTV","json":"https://pith.science/pith/2V25A7FDUF7NIECEZ47LMLSMTV.json","graph_json":"https://pith.science/api/pith-number/2V25A7FDUF7NIECEZ47LMLSMTV/graph.json","events_json":"https://pith.science/api/pith-number/2V25A7FDUF7NIECEZ47LMLSMTV/events.json","paper":"https://pith.science/paper/2V25A7FD"},"agent_actions":{"view_html":"https://pith.science/pith/2V25A7FDUF7NIECEZ47LMLSMTV","download_json":"https://pith.science/pith/2V25A7FDUF7NIECEZ47LMLSMTV.json","view_paper":"https://pith.science/paper/2V25A7FD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1902.01960&json=true","fetch_graph":"https://pith.science/api/pith-number/2V25A7FDUF7NIECEZ47LMLSMTV/graph.json","fetch_events":"https://pith.science/api/pith-number/2V25A7FDUF7NIECEZ47LMLSMTV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2V25A7FDUF7NIECEZ47LMLSMTV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2V25A7FDUF7NIECEZ47LMLSMTV/action/storage_attestation","attest_author":"https://pith.science/pith/2V25A7FDUF7NIECEZ47LMLSMTV/action/author_attestation","sign_citation":"https://pith.science/pith/2V25A7FDUF7NIECEZ47LMLSMTV/action/citation_signature","submit_replication":"https://pith.science/pith/2V25A7FDUF7NIECEZ47LMLSMTV/action/replication_record"}},"created_at":"2026-05-17T23:52:45.323697+00:00","updated_at":"2026-05-17T23:52:45.323697+00:00"}