{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:FL67QWONEJTQKVSWKLIE2BYXNX","short_pith_number":"pith:FL67QWON","canonical_record":{"source":{"id":"1606.04763","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-06-15T13:57:26Z","cross_cats_sorted":[],"title_canon_sha256":"829cfd76064c304e2c179086b1ab001699a3bdf090873fee1322bf11f2c69913","abstract_canon_sha256":"a045317c7ec6266605d9dd41eea4bc4abf6862d0f13ba54440dda3929a54d21b"},"schema_version":"1.0"},"canonical_sha256":"2afdf859cd226705565652d04d07176dd90e8aa8f317878ffeafa06679023ad3","source":{"kind":"arxiv","id":"1606.04763","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1606.04763","created_at":"2026-05-18T00:05:00Z"},{"alias_kind":"arxiv_version","alias_value":"1606.04763v3","created_at":"2026-05-18T00:05:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.04763","created_at":"2026-05-18T00:05:00Z"},{"alias_kind":"pith_short_12","alias_value":"FL67QWONEJTQ","created_at":"2026-05-18T12:30:15Z"},{"alias_kind":"pith_short_16","alias_value":"FL67QWONEJTQKVSW","created_at":"2026-05-18T12:30:15Z"},{"alias_kind":"pith_short_8","alias_value":"FL67QWON","created_at":"2026-05-18T12:30:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:FL67QWONEJTQKVSWKLIE2BYXNX","target":"record","payload":{"canonical_record":{"source":{"id":"1606.04763","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-06-15T13:57:26Z","cross_cats_sorted":[],"title_canon_sha256":"829cfd76064c304e2c179086b1ab001699a3bdf090873fee1322bf11f2c69913","abstract_canon_sha256":"a045317c7ec6266605d9dd41eea4bc4abf6862d0f13ba54440dda3929a54d21b"},"schema_version":"1.0"},"canonical_sha256":"2afdf859cd226705565652d04d07176dd90e8aa8f317878ffeafa06679023ad3","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:05:00.818933Z","signature_b64":"xUsXz7tfCiKSB3vXJMDWFDd9EqUpkBOCD1JGdleMOoc9xPxwm7OpdzBJAWM9Ys9j4Gk/i/C2GEhNDhdMxKqlCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2afdf859cd226705565652d04d07176dd90e8aa8f317878ffeafa06679023ad3","last_reissued_at":"2026-05-18T00:05:00.818339Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:05:00.818339Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1606.04763","source_version":3,"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:05:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hah7ob5EV2ArDExeIxQ+D7A7WwffBAyp2cA3lJWa5Xs+D7PV2mJN/+kvqKLaZ21uABi9vmlazU8CBMTxW+7LBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T20:08:04.813493Z"},"content_sha256":"6daa835733c4e2ce2bac367a1fb6812973cff1ff5568fdf762a90f69e0db15d9","schema_version":"1.0","event_id":"sha256:6daa835733c4e2ce2bac367a1fb6812973cff1ff5568fdf762a90f69e0db15d9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:FL67QWONEJTQKVSWKLIE2BYXNX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Simple Streaming Bit-parallel Algorithm for Swap Pattern Matching","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Ond\\v{r}ej Such\\'y, Tom\\'a\\v{s} Valla, V\\'aclav Bla\\v{z}ej","submitted_at":"2016-06-15T13:57:26Z","abstract_excerpt":"The pattern matching problem with swaps is to find all occurrences of a pattern in a text while allowing the pattern to swap adjacent symbols. The goal is to design fast matching algorithm that takes advantage of the bit parallelism of bitwise machine instructions and has only streaming access to the input. We introduce a new approach to solve this problem based on the graph theoretic model and compare its performance to previously known algorithms. We also show that an approach using deterministic finite automata cannot achieve similarly efficient algorithms. Furthermore, we describe a fatal "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.04763","kind":"arxiv","version":3},"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:05:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Qps+QCoIG5yUisvoSfYEjcqCnuEiXtig2ky+AIolbJRxBeTZtKYIPPRvRzpolPwmZnM011ciwQFsjmlC3CjFCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T20:08:04.814226Z"},"content_sha256":"900463f38232ece6d06f3f3839b039fc4841e686b12492c39c02e8405e32fec3","schema_version":"1.0","event_id":"sha256:900463f38232ece6d06f3f3839b039fc4841e686b12492c39c02e8405e32fec3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FL67QWONEJTQKVSWKLIE2BYXNX/bundle.json","state_url":"https://pith.science/pith/FL67QWONEJTQKVSWKLIE2BYXNX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FL67QWONEJTQKVSWKLIE2BYXNX/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-31T20:08:04Z","links":{"resolver":"https://pith.science/pith/FL67QWONEJTQKVSWKLIE2BYXNX","bundle":"https://pith.science/pith/FL67QWONEJTQKVSWKLIE2BYXNX/bundle.json","state":"https://pith.science/pith/FL67QWONEJTQKVSWKLIE2BYXNX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FL67QWONEJTQKVSWKLIE2BYXNX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:FL67QWONEJTQKVSWKLIE2BYXNX","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":"a045317c7ec6266605d9dd41eea4bc4abf6862d0f13ba54440dda3929a54d21b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-06-15T13:57:26Z","title_canon_sha256":"829cfd76064c304e2c179086b1ab001699a3bdf090873fee1322bf11f2c69913"},"schema_version":"1.0","source":{"id":"1606.04763","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1606.04763","created_at":"2026-05-18T00:05:00Z"},{"alias_kind":"arxiv_version","alias_value":"1606.04763v3","created_at":"2026-05-18T00:05:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.04763","created_at":"2026-05-18T00:05:00Z"},{"alias_kind":"pith_short_12","alias_value":"FL67QWONEJTQ","created_at":"2026-05-18T12:30:15Z"},{"alias_kind":"pith_short_16","alias_value":"FL67QWONEJTQKVSW","created_at":"2026-05-18T12:30:15Z"},{"alias_kind":"pith_short_8","alias_value":"FL67QWON","created_at":"2026-05-18T12:30:15Z"}],"graph_snapshots":[{"event_id":"sha256:900463f38232ece6d06f3f3839b039fc4841e686b12492c39c02e8405e32fec3","target":"graph","created_at":"2026-05-18T00:05:00Z","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":"The pattern matching problem with swaps is to find all occurrences of a pattern in a text while allowing the pattern to swap adjacent symbols. The goal is to design fast matching algorithm that takes advantage of the bit parallelism of bitwise machine instructions and has only streaming access to the input. We introduce a new approach to solve this problem based on the graph theoretic model and compare its performance to previously known algorithms. We also show that an approach using deterministic finite automata cannot achieve similarly efficient algorithms. Furthermore, we describe a fatal ","authors_text":"Ond\\v{r}ej Such\\'y, Tom\\'a\\v{s} Valla, V\\'aclav Bla\\v{z}ej","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-06-15T13:57:26Z","title":"A Simple Streaming Bit-parallel Algorithm for Swap Pattern Matching"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.04763","kind":"arxiv","version":3},"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:6daa835733c4e2ce2bac367a1fb6812973cff1ff5568fdf762a90f69e0db15d9","target":"record","created_at":"2026-05-18T00:05:00Z","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":"a045317c7ec6266605d9dd41eea4bc4abf6862d0f13ba54440dda3929a54d21b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-06-15T13:57:26Z","title_canon_sha256":"829cfd76064c304e2c179086b1ab001699a3bdf090873fee1322bf11f2c69913"},"schema_version":"1.0","source":{"id":"1606.04763","kind":"arxiv","version":3}},"canonical_sha256":"2afdf859cd226705565652d04d07176dd90e8aa8f317878ffeafa06679023ad3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2afdf859cd226705565652d04d07176dd90e8aa8f317878ffeafa06679023ad3","first_computed_at":"2026-05-18T00:05:00.818339Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:05:00.818339Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"xUsXz7tfCiKSB3vXJMDWFDd9EqUpkBOCD1JGdleMOoc9xPxwm7OpdzBJAWM9Ys9j4Gk/i/C2GEhNDhdMxKqlCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:05:00.818933Z","signed_message":"canonical_sha256_bytes"},"source_id":"1606.04763","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6daa835733c4e2ce2bac367a1fb6812973cff1ff5568fdf762a90f69e0db15d9","sha256:900463f38232ece6d06f3f3839b039fc4841e686b12492c39c02e8405e32fec3"],"state_sha256":"5ac8804a88e52a07d3f37d7d5d9607251c5d08528ca56380bcc1c8d20fe227ab"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/KQGgO2e+JkN3SRX0NrJDTJm37eLynY4Ft08ZgJhL5nnQqUve0WSTUotHnoCUO1CtOOKBkH4qFPEdi2PuWWUCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T20:08:04.818363Z","bundle_sha256":"f769765939f1a02577cac35861f6d28ce3f5aa52cb282e1d8be422db1e267dd9"}}