{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:2JKLODZEYEYLNPQIHQVRHZ6CYC","short_pith_number":"pith:2JKLODZE","canonical_record":{"source":{"id":"1705.04022","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-05-11T05:52:51Z","cross_cats_sorted":[],"title_canon_sha256":"6c27c51392b6faa99fe59b75af5ae22793bcee060b926179555116d83ad35d80","abstract_canon_sha256":"8d44a1e05c0f0a09ed5578b4546e9e3809fbd7e6dd7b8bd726da72a51dd784cd"},"schema_version":"1.0"},"canonical_sha256":"d254b70f24c130b6be083c2b13e7c2c098eb8c52aaeef39db9669cbce9a0c6e4","source":{"kind":"arxiv","id":"1705.04022","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.04022","created_at":"2026-05-18T00:44:41Z"},{"alias_kind":"arxiv_version","alias_value":"1705.04022v1","created_at":"2026-05-18T00:44:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.04022","created_at":"2026-05-18T00:44:41Z"},{"alias_kind":"pith_short_12","alias_value":"2JKLODZEYEYL","created_at":"2026-05-18T12:30:55Z"},{"alias_kind":"pith_short_16","alias_value":"2JKLODZEYEYLNPQI","created_at":"2026-05-18T12:30:55Z"},{"alias_kind":"pith_short_8","alias_value":"2JKLODZE","created_at":"2026-05-18T12:30:55Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:2JKLODZEYEYLNPQIHQVRHZ6CYC","target":"record","payload":{"canonical_record":{"source":{"id":"1705.04022","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-05-11T05:52:51Z","cross_cats_sorted":[],"title_canon_sha256":"6c27c51392b6faa99fe59b75af5ae22793bcee060b926179555116d83ad35d80","abstract_canon_sha256":"8d44a1e05c0f0a09ed5578b4546e9e3809fbd7e6dd7b8bd726da72a51dd784cd"},"schema_version":"1.0"},"canonical_sha256":"d254b70f24c130b6be083c2b13e7c2c098eb8c52aaeef39db9669cbce9a0c6e4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:44:41.608783Z","signature_b64":"eeWjDN1e/HCT/p2CZ8ndytaVhYjK6tPkzPQiiEQdFW2duCS4teKmINAbGRQBew8WfH5GkSIyWg+OzD1Q/i62AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d254b70f24c130b6be083c2b13e7c2c098eb8c52aaeef39db9669cbce9a0c6e4","last_reissued_at":"2026-05-18T00:44:41.608277Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:44:41.608277Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1705.04022","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-18T00:44:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5yBUPK41RLHkhZ+fgKx3JNuwVpl2Y0fOFOfTfhbl9TTGTkBFgC0MZ7xk1vguMcBO2JCKjbubCuTzzVV5y7zjBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T07:45:49.189920Z"},"content_sha256":"30bc38360b7e18790aa2f6831dbf14fa36e4929c2e0aa4ea1badc476ca838954","schema_version":"1.0","event_id":"sha256:30bc38360b7e18790aa2f6831dbf14fa36e4929c2e0aa4ea1badc476ca838954"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:2JKLODZEYEYLNPQIHQVRHZ6CYC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Faster algorithms for 1-mappability of a sequence","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Costas S. Iliopoulos, Jakub Radoszewski, Mai Alzamel, Panagiotis Charalampopoulos, Solon P. Pissis, Wing-Kin Sung","submitted_at":"2017-05-11T05:52:51Z","abstract_excerpt":"In the k-mappability problem, we are given a string x of length n and integers m and k, and we are asked to count, for each length-m factor y of x, the number of other factors of length m of x that are at Hamming distance at most k from y. We focus here on the version of the problem where k = 1. The fastest known algorithm for k = 1 requires time O(mn log n/ log log n) and space O(n). We present two algorithms that require worst-case time O(mn) and O(n log^2 n), respectively, and space O(n), thus greatly improving the state of the art. Moreover, we present an algorithm that requires average-ca"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.04022","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-18T00:44:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Bz2KIPmo8hiFoufvjcmKAqbDUtC050UCzZuf8QtbZkhDSxWtC8uRdAzbtWS+Kx/9X3gbo3Jjugi5kzODrwIhCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T07:45:49.190568Z"},"content_sha256":"d44cb081a2b3b0093bee12f16307ba687b0ffb0bd265ac38d928e3d3355cc552","schema_version":"1.0","event_id":"sha256:d44cb081a2b3b0093bee12f16307ba687b0ffb0bd265ac38d928e3d3355cc552"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2JKLODZEYEYLNPQIHQVRHZ6CYC/bundle.json","state_url":"https://pith.science/pith/2JKLODZEYEYLNPQIHQVRHZ6CYC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2JKLODZEYEYLNPQIHQVRHZ6CYC/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-05-30T07:45:49Z","links":{"resolver":"https://pith.science/pith/2JKLODZEYEYLNPQIHQVRHZ6CYC","bundle":"https://pith.science/pith/2JKLODZEYEYLNPQIHQVRHZ6CYC/bundle.json","state":"https://pith.science/pith/2JKLODZEYEYLNPQIHQVRHZ6CYC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2JKLODZEYEYLNPQIHQVRHZ6CYC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:2JKLODZEYEYLNPQIHQVRHZ6CYC","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":"8d44a1e05c0f0a09ed5578b4546e9e3809fbd7e6dd7b8bd726da72a51dd784cd","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-05-11T05:52:51Z","title_canon_sha256":"6c27c51392b6faa99fe59b75af5ae22793bcee060b926179555116d83ad35d80"},"schema_version":"1.0","source":{"id":"1705.04022","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.04022","created_at":"2026-05-18T00:44:41Z"},{"alias_kind":"arxiv_version","alias_value":"1705.04022v1","created_at":"2026-05-18T00:44:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.04022","created_at":"2026-05-18T00:44:41Z"},{"alias_kind":"pith_short_12","alias_value":"2JKLODZEYEYL","created_at":"2026-05-18T12:30:55Z"},{"alias_kind":"pith_short_16","alias_value":"2JKLODZEYEYLNPQI","created_at":"2026-05-18T12:30:55Z"},{"alias_kind":"pith_short_8","alias_value":"2JKLODZE","created_at":"2026-05-18T12:30:55Z"}],"graph_snapshots":[{"event_id":"sha256:d44cb081a2b3b0093bee12f16307ba687b0ffb0bd265ac38d928e3d3355cc552","target":"graph","created_at":"2026-05-18T00:44:41Z","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 the k-mappability problem, we are given a string x of length n and integers m and k, and we are asked to count, for each length-m factor y of x, the number of other factors of length m of x that are at Hamming distance at most k from y. We focus here on the version of the problem where k = 1. The fastest known algorithm for k = 1 requires time O(mn log n/ log log n) and space O(n). We present two algorithms that require worst-case time O(mn) and O(n log^2 n), respectively, and space O(n), thus greatly improving the state of the art. Moreover, we present an algorithm that requires average-ca","authors_text":"Costas S. Iliopoulos, Jakub Radoszewski, Mai Alzamel, Panagiotis Charalampopoulos, Solon P. Pissis, Wing-Kin Sung","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-05-11T05:52:51Z","title":"Faster algorithms for 1-mappability of a sequence"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.04022","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:30bc38360b7e18790aa2f6831dbf14fa36e4929c2e0aa4ea1badc476ca838954","target":"record","created_at":"2026-05-18T00:44:41Z","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":"8d44a1e05c0f0a09ed5578b4546e9e3809fbd7e6dd7b8bd726da72a51dd784cd","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-05-11T05:52:51Z","title_canon_sha256":"6c27c51392b6faa99fe59b75af5ae22793bcee060b926179555116d83ad35d80"},"schema_version":"1.0","source":{"id":"1705.04022","kind":"arxiv","version":1}},"canonical_sha256":"d254b70f24c130b6be083c2b13e7c2c098eb8c52aaeef39db9669cbce9a0c6e4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d254b70f24c130b6be083c2b13e7c2c098eb8c52aaeef39db9669cbce9a0c6e4","first_computed_at":"2026-05-18T00:44:41.608277Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:44:41.608277Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"eeWjDN1e/HCT/p2CZ8ndytaVhYjK6tPkzPQiiEQdFW2duCS4teKmINAbGRQBew8WfH5GkSIyWg+OzD1Q/i62AQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:44:41.608783Z","signed_message":"canonical_sha256_bytes"},"source_id":"1705.04022","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:30bc38360b7e18790aa2f6831dbf14fa36e4929c2e0aa4ea1badc476ca838954","sha256:d44cb081a2b3b0093bee12f16307ba687b0ffb0bd265ac38d928e3d3355cc552"],"state_sha256":"bf6c7d1b5259d4d571727cbb5c74125afac61ac7d0d95a67417042bb77135e04"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RdIb5R5xYwFjz/uT//WZvalgpmktR4pE27Z8yQnOjVzkBsx7h6UDD/U0g3Rd1aOIzSmuSabhXHWyhgT2RS1WAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T07:45:49.193715Z","bundle_sha256":"7081bd6959f861b30d48eaf82093aa510dbcc876290fb6efe4f5ccea144e8f5d"}}