{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:7PQVMMR3KW6KIXDQOEKH3SGRLI","short_pith_number":"pith:7PQVMMR3","canonical_record":{"source":{"id":"1406.5480","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-06-20T18:37:14Z","cross_cats_sorted":[],"title_canon_sha256":"602992fdfeb89f58a34fc75318b5cd525e1be5b64a9d10747b0773c3327975ee","abstract_canon_sha256":"299f5d286988555b8bee137bb35d19a8e02cff7ed4aadcabd37e6f48960ab236"},"schema_version":"1.0"},"canonical_sha256":"fbe156323b55bca45c7071147dc8d15a3b802d8a0cd68a4505402ded2f557b1a","source":{"kind":"arxiv","id":"1406.5480","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1406.5480","created_at":"2026-05-18T01:16:26Z"},{"alias_kind":"arxiv_version","alias_value":"1406.5480v2","created_at":"2026-05-18T01:16:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1406.5480","created_at":"2026-05-18T01:16:26Z"},{"alias_kind":"pith_short_12","alias_value":"7PQVMMR3KW6K","created_at":"2026-05-18T12:28:19Z"},{"alias_kind":"pith_short_16","alias_value":"7PQVMMR3KW6KIXDQ","created_at":"2026-05-18T12:28:19Z"},{"alias_kind":"pith_short_8","alias_value":"7PQVMMR3","created_at":"2026-05-18T12:28:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:7PQVMMR3KW6KIXDQOEKH3SGRLI","target":"record","payload":{"canonical_record":{"source":{"id":"1406.5480","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-06-20T18:37:14Z","cross_cats_sorted":[],"title_canon_sha256":"602992fdfeb89f58a34fc75318b5cd525e1be5b64a9d10747b0773c3327975ee","abstract_canon_sha256":"299f5d286988555b8bee137bb35d19a8e02cff7ed4aadcabd37e6f48960ab236"},"schema_version":"1.0"},"canonical_sha256":"fbe156323b55bca45c7071147dc8d15a3b802d8a0cd68a4505402ded2f557b1a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:16:26.764950Z","signature_b64":"Qgrjx6xUqWnaEGHXZyYRVkWu5N1XQXQ4iar8MsRrwGfaMtsCygwkPdBJY6X7+zvGGxOL/NdYXT9Aj1VrunUdBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fbe156323b55bca45c7071147dc8d15a3b802d8a0cd68a4505402ded2f557b1a","last_reissued_at":"2026-05-18T01:16:26.764555Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:16:26.764555Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1406.5480","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-18T01:16:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3tVuLW/Fk31QKlMM802Fakp9CSBma/S3fVqi1dv1ulLp6/6yJ+SeNmCrwZeBMxq7to+HhXy5xJ3U6CD+l1EpAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T00:15:40.289041Z"},"content_sha256":"d4dac0edfafe6ea55dfa84d11672d0d883f0e2b3328bbf941c4ba2dca7ec5031","schema_version":"1.0","event_id":"sha256:d4dac0edfafe6ea55dfa84d11672d0d883f0e2b3328bbf941c4ba2dca7ec5031"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:7PQVMMR3KW6KIXDQOEKH3SGRLI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Average-Case Optimal Approximate Circular String Matching","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Carl Barton, Costas S. Iliopoulos, Solon P. Pissis","submitted_at":"2014-06-20T18:37:14Z","abstract_excerpt":"Approximate string matching is the problem of finding all factors of a text t of length n that are at a distance at most k from a pattern x of length m. Approximate circular string matching is the problem of finding all factors of t that are at a distance at most k from x or from any of its rotations. In this article, we present a new algorithm for approximate circular string matching under the edit distance model with optimal average-case search time O(n(k + log m)/m). Optimal average-case search time can also be achieved by the algorithms for multiple approximate string matching (Fredriksson"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1406.5480","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-18T01:16:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tP/CYh3685559AsfNcdm9OjOt/2yhrCmgxhm7LcoxpMzj7dAgYqb8dUpNNb2X8n21A1tSLabgQWVsGanPEL+AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T00:15:40.289420Z"},"content_sha256":"8c595d9b329f827a988f8b622646e822372c6c75a82d9e37a7692038d652a9c6","schema_version":"1.0","event_id":"sha256:8c595d9b329f827a988f8b622646e822372c6c75a82d9e37a7692038d652a9c6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7PQVMMR3KW6KIXDQOEKH3SGRLI/bundle.json","state_url":"https://pith.science/pith/7PQVMMR3KW6KIXDQOEKH3SGRLI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7PQVMMR3KW6KIXDQOEKH3SGRLI/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-31T00:15:40Z","links":{"resolver":"https://pith.science/pith/7PQVMMR3KW6KIXDQOEKH3SGRLI","bundle":"https://pith.science/pith/7PQVMMR3KW6KIXDQOEKH3SGRLI/bundle.json","state":"https://pith.science/pith/7PQVMMR3KW6KIXDQOEKH3SGRLI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7PQVMMR3KW6KIXDQOEKH3SGRLI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:7PQVMMR3KW6KIXDQOEKH3SGRLI","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":"299f5d286988555b8bee137bb35d19a8e02cff7ed4aadcabd37e6f48960ab236","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-06-20T18:37:14Z","title_canon_sha256":"602992fdfeb89f58a34fc75318b5cd525e1be5b64a9d10747b0773c3327975ee"},"schema_version":"1.0","source":{"id":"1406.5480","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1406.5480","created_at":"2026-05-18T01:16:26Z"},{"alias_kind":"arxiv_version","alias_value":"1406.5480v2","created_at":"2026-05-18T01:16:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1406.5480","created_at":"2026-05-18T01:16:26Z"},{"alias_kind":"pith_short_12","alias_value":"7PQVMMR3KW6K","created_at":"2026-05-18T12:28:19Z"},{"alias_kind":"pith_short_16","alias_value":"7PQVMMR3KW6KIXDQ","created_at":"2026-05-18T12:28:19Z"},{"alias_kind":"pith_short_8","alias_value":"7PQVMMR3","created_at":"2026-05-18T12:28:19Z"}],"graph_snapshots":[{"event_id":"sha256:8c595d9b329f827a988f8b622646e822372c6c75a82d9e37a7692038d652a9c6","target":"graph","created_at":"2026-05-18T01:16:26Z","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":"Approximate string matching is the problem of finding all factors of a text t of length n that are at a distance at most k from a pattern x of length m. Approximate circular string matching is the problem of finding all factors of t that are at a distance at most k from x or from any of its rotations. In this article, we present a new algorithm for approximate circular string matching under the edit distance model with optimal average-case search time O(n(k + log m)/m). Optimal average-case search time can also be achieved by the algorithms for multiple approximate string matching (Fredriksson","authors_text":"Carl Barton, Costas S. Iliopoulos, Solon P. Pissis","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-06-20T18:37:14Z","title":"Average-Case Optimal Approximate Circular String Matching"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1406.5480","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:d4dac0edfafe6ea55dfa84d11672d0d883f0e2b3328bbf941c4ba2dca7ec5031","target":"record","created_at":"2026-05-18T01:16:26Z","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":"299f5d286988555b8bee137bb35d19a8e02cff7ed4aadcabd37e6f48960ab236","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-06-20T18:37:14Z","title_canon_sha256":"602992fdfeb89f58a34fc75318b5cd525e1be5b64a9d10747b0773c3327975ee"},"schema_version":"1.0","source":{"id":"1406.5480","kind":"arxiv","version":2}},"canonical_sha256":"fbe156323b55bca45c7071147dc8d15a3b802d8a0cd68a4505402ded2f557b1a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fbe156323b55bca45c7071147dc8d15a3b802d8a0cd68a4505402ded2f557b1a","first_computed_at":"2026-05-18T01:16:26.764555Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:16:26.764555Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Qgrjx6xUqWnaEGHXZyYRVkWu5N1XQXQ4iar8MsRrwGfaMtsCygwkPdBJY6X7+zvGGxOL/NdYXT9Aj1VrunUdBw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:16:26.764950Z","signed_message":"canonical_sha256_bytes"},"source_id":"1406.5480","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d4dac0edfafe6ea55dfa84d11672d0d883f0e2b3328bbf941c4ba2dca7ec5031","sha256:8c595d9b329f827a988f8b622646e822372c6c75a82d9e37a7692038d652a9c6"],"state_sha256":"335728e1cf220e7e19d2124a45bee77b01e8a4880519ca5d24ae7feecf4435ca"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jCQ5SwwdIPeowE3bCuKZjSQWkkRuLdVmUURyx9Nd6gPLxGXCG/BtR5HgLj5R00S/nRR29baTAvWBQpFDy42+Aw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T00:15:40.291530Z","bundle_sha256":"cc4328b65fd50d24097125eef58b2969b86dfbf9b9389748f90efb6d40bc3be4"}}