{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:2V25A7FDUF7NIECEZ47LMLSMTV","short_pith_number":"pith:2V25A7FD","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"},"canonical_sha256":"d575d07ca3a17ed41044cf3eb62e4c9d6a8478dcd4cb485abc69e1b4705fa4d1","source":{"kind":"arxiv","id":"1902.01960","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1902.01960","created_at":"2026-05-17T23:52:45Z"},{"alias_kind":"arxiv_version","alias_value":"1902.01960v2","created_at":"2026-05-17T23:52:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.01960","created_at":"2026-05-17T23:52:45Z"},{"alias_kind":"pith_short_12","alias_value":"2V25A7FDUF7N","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_16","alias_value":"2V25A7FDUF7NIECE","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_8","alias_value":"2V25A7FD","created_at":"2026-05-18T12:33:07Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:2V25A7FDUF7NIECEZ47LMLSMTV","target":"record","payload":{"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"},"canonical_sha256":"d575d07ca3a17ed41044cf3eb62e4c9d6a8478dcd4cb485abc69e1b4705fa4d1","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"},"source_kind":"arxiv","source_id":"1902.01960","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-05-17T23:52:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6Tr2fi2jps9z0FBP/ab3qX5AYAIeYhfrFc9G4vXBtb98b23bu1WNZYEHKuxQe53EKJRLOpg7ke8+YjF4QbePAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-30T04:36:34.243453Z"},"content_sha256":"b76069fafc585b32fb732a9228038667018ef71e5da8967298460d092c7d6b29","schema_version":"1.0","event_id":"sha256:b76069fafc585b32fb732a9228038667018ef71e5da8967298460d092c7d6b29"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:2V25A7FDUF7NIECEZ47LMLSMTV","target":"graph","payload":{"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"},"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-17T23:52:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eIejOmv0lN42WRwVxmFrWDXO3KTA2cSbi1LJhlGBc0F5T2dG4LJrFWGbfUJw7SADK4CxIKuOaX7RdYEJdxslCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-30T04:36:34.243796Z"},"content_sha256":"8f12a16d09e5745c8e017af8cdbde9d35e7340db7b992fcb0a0f4c145739edcf","schema_version":"1.0","event_id":"sha256:8f12a16d09e5745c8e017af8cdbde9d35e7340db7b992fcb0a0f4c145739edcf"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2V25A7FDUF7NIECEZ47LMLSMTV/bundle.json","state_url":"https://pith.science/pith/2V25A7FDUF7NIECEZ47LMLSMTV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2V25A7FDUF7NIECEZ47LMLSMTV/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-30T04:36:34Z","links":{"resolver":"https://pith.science/pith/2V25A7FDUF7NIECEZ47LMLSMTV","bundle":"https://pith.science/pith/2V25A7FDUF7NIECEZ47LMLSMTV/bundle.json","state":"https://pith.science/pith/2V25A7FDUF7NIECEZ47LMLSMTV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2V25A7FDUF7NIECEZ47LMLSMTV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:2V25A7FDUF7NIECEZ47LMLSMTV","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":"77420fabf33b6bcbe6acfcd568e8c6874dd72dcc42e447a31d1d3ebb834bedac","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2019-02-05T22:29:03Z","title_canon_sha256":"71a22da924a783e3478de60ad6b35e7045dcb741aaf13a797b8b65989298a56c"},"schema_version":"1.0","source":{"id":"1902.01960","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1902.01960","created_at":"2026-05-17T23:52:45Z"},{"alias_kind":"arxiv_version","alias_value":"1902.01960v2","created_at":"2026-05-17T23:52:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.01960","created_at":"2026-05-17T23:52:45Z"},{"alias_kind":"pith_short_12","alias_value":"2V25A7FDUF7N","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_16","alias_value":"2V25A7FDUF7NIECE","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_8","alias_value":"2V25A7FD","created_at":"2026-05-18T12:33:07Z"}],"graph_snapshots":[{"event_id":"sha256:8f12a16d09e5745c8e017af8cdbde9d35e7340db7b992fcb0a0f4c145739edcf","target":"graph","created_at":"2026-05-17T23:52:45Z","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":"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","authors_text":"Daniel Gibney, Sharma V. Thankachan","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2019-02-05T22:29:03Z","title":"On the Hardness and Inapproximability of Recognizing Wheeler Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.01960","kind":"arxiv","version":2},"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:b76069fafc585b32fb732a9228038667018ef71e5da8967298460d092c7d6b29","target":"record","created_at":"2026-05-17T23:52:45Z","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":"77420fabf33b6bcbe6acfcd568e8c6874dd72dcc42e447a31d1d3ebb834bedac","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2019-02-05T22:29:03Z","title_canon_sha256":"71a22da924a783e3478de60ad6b35e7045dcb741aaf13a797b8b65989298a56c"},"schema_version":"1.0","source":{"id":"1902.01960","kind":"arxiv","version":2}},"canonical_sha256":"d575d07ca3a17ed41044cf3eb62e4c9d6a8478dcd4cb485abc69e1b4705fa4d1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d575d07ca3a17ed41044cf3eb62e4c9d6a8478dcd4cb485abc69e1b4705fa4d1","first_computed_at":"2026-05-17T23:52:45.323588Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:52:45.323588Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"WKDwFVpQk2ot8vijMx8/2xqjX6kTU6EwVCFO2VAs0Hr09kgcNt+GM5aqz1u2G1aUc+9L/UoRZGoyJQezBk1aDA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:52:45.324183Z","signed_message":"canonical_sha256_bytes"},"source_id":"1902.01960","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b76069fafc585b32fb732a9228038667018ef71e5da8967298460d092c7d6b29","sha256:8f12a16d09e5745c8e017af8cdbde9d35e7340db7b992fcb0a0f4c145739edcf"],"state_sha256":"8148d9c1c81d1b9df73637025558cfd54e5e60b8930b19cca77074c6f778914c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uj2PGRkDmyzOZCB0KvjUkuLLQcAUYJnV4uS4t1GDY4iR+oZ0uVYeBFOJ+VzUl25Ewd91/Zs52xuIcFxOwBA3Ag==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-30T04:36:34.245693Z","bundle_sha256":"15ce8c4dfeaace2f6448dc7c1bc6dc53711d46fd90c48434f7fbc35b39b5ce28"}}