{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:IRTY6M26V6JAJ5J7YRSXPDOPEU","short_pith_number":"pith:IRTY6M26","canonical_record":{"source":{"id":"1803.02807","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-03-07T18:34:11Z","cross_cats_sorted":["cs.IR"],"title_canon_sha256":"72bf5d605c3848b82c1623698390d842edd0f7acdd4a874c404c23202b3aec5a","abstract_canon_sha256":"1693b9e6b1a2fb9a5b63cab26da6ed7bb74f22ac42ba79b46a695cdb8a3c3831"},"schema_version":"1.0"},"canonical_sha256":"44678f335eaf9204f53fc465778dcf2539ebccf762deeba03f867697b283642b","source":{"kind":"arxiv","id":"1803.02807","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1803.02807","created_at":"2026-05-18T00:21:49Z"},{"alias_kind":"arxiv_version","alias_value":"1803.02807v1","created_at":"2026-05-18T00:21:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.02807","created_at":"2026-05-18T00:21:49Z"},{"alias_kind":"pith_short_12","alias_value":"IRTY6M26V6JA","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_16","alias_value":"IRTY6M26V6JAJ5J7","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_8","alias_value":"IRTY6M26","created_at":"2026-05-18T12:32:31Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:IRTY6M26V6JAJ5J7YRSXPDOPEU","target":"record","payload":{"canonical_record":{"source":{"id":"1803.02807","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-03-07T18:34:11Z","cross_cats_sorted":["cs.IR"],"title_canon_sha256":"72bf5d605c3848b82c1623698390d842edd0f7acdd4a874c404c23202b3aec5a","abstract_canon_sha256":"1693b9e6b1a2fb9a5b63cab26da6ed7bb74f22ac42ba79b46a695cdb8a3c3831"},"schema_version":"1.0"},"canonical_sha256":"44678f335eaf9204f53fc465778dcf2539ebccf762deeba03f867697b283642b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:21:49.194511Z","signature_b64":"fS/FNNchrR0ezrk2yfk1LAroxx0FL89U7wVoFUa5k//Ig90DLyOqQDCdeqFZCB/Y5qeHK8RQVDqI5wyQS5AlBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"44678f335eaf9204f53fc465778dcf2539ebccf762deeba03f867697b283642b","last_reissued_at":"2026-05-18T00:21:49.193871Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:21:49.193871Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1803.02807","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:21:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/fdipcbXQRP/D7uXDl7GKgE2qT1Aj/Nt+4JchZR3WezJ47pLW7MOWK9mH1niUdNNbmpfcDrr6CML/rUEf+lmDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-21T22:47:30.272042Z"},"content_sha256":"b495b7d547a2a5b75ebfe5ca1e171385a868a5bf6c781d0577359c04645ab7b9","schema_version":"1.0","event_id":"sha256:b495b7d547a2a5b75ebfe5ca1e171385a868a5bf6c781d0577359c04645ab7b9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:IRTY6M26V6JAJ5J7YRSXPDOPEU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Flexible and Efficient Algorithms for Abelian Matching in Strings","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IR"],"primary_cat":"cs.DS","authors_text":"Arianna Pavone, Simone Faro","submitted_at":"2018-03-07T18:34:11Z","abstract_excerpt":"The abelian pattern matching problem consists in finding all substrings of a text which are permutations of a given pattern. This problem finds application in many areas and can be solved in linear time by a naive sliding window approach. In this short communication we present a new class of algorithms based on a new efficient fingerprint computation approach, called Heap-Counting, which turns out to be fast, flexible and easy to be implemented. It can be proved that our solutions have a linear worst case time complexity and, in addition, we present an extensive experimental evaluation which s"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.02807","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:21:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"M+VDTtjMWf4jXP3vBgQ/SKSCUuwD6nJFWJ3/OdA+xC7Oo6onEzR42FNBPnc68/FFWhw8RlsOgPd0BZI4YrVLAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-21T22:47:30.272391Z"},"content_sha256":"9fea28199b482b168af66a6f614f04dbccf893a83d1b9adf005f3700d805a242","schema_version":"1.0","event_id":"sha256:9fea28199b482b168af66a6f614f04dbccf893a83d1b9adf005f3700d805a242"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IRTY6M26V6JAJ5J7YRSXPDOPEU/bundle.json","state_url":"https://pith.science/pith/IRTY6M26V6JAJ5J7YRSXPDOPEU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IRTY6M26V6JAJ5J7YRSXPDOPEU/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-21T22:47:30Z","links":{"resolver":"https://pith.science/pith/IRTY6M26V6JAJ5J7YRSXPDOPEU","bundle":"https://pith.science/pith/IRTY6M26V6JAJ5J7YRSXPDOPEU/bundle.json","state":"https://pith.science/pith/IRTY6M26V6JAJ5J7YRSXPDOPEU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IRTY6M26V6JAJ5J7YRSXPDOPEU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:IRTY6M26V6JAJ5J7YRSXPDOPEU","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":"1693b9e6b1a2fb9a5b63cab26da6ed7bb74f22ac42ba79b46a695cdb8a3c3831","cross_cats_sorted":["cs.IR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-03-07T18:34:11Z","title_canon_sha256":"72bf5d605c3848b82c1623698390d842edd0f7acdd4a874c404c23202b3aec5a"},"schema_version":"1.0","source":{"id":"1803.02807","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1803.02807","created_at":"2026-05-18T00:21:49Z"},{"alias_kind":"arxiv_version","alias_value":"1803.02807v1","created_at":"2026-05-18T00:21:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.02807","created_at":"2026-05-18T00:21:49Z"},{"alias_kind":"pith_short_12","alias_value":"IRTY6M26V6JA","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_16","alias_value":"IRTY6M26V6JAJ5J7","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_8","alias_value":"IRTY6M26","created_at":"2026-05-18T12:32:31Z"}],"graph_snapshots":[{"event_id":"sha256:9fea28199b482b168af66a6f614f04dbccf893a83d1b9adf005f3700d805a242","target":"graph","created_at":"2026-05-18T00:21:49Z","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 abelian pattern matching problem consists in finding all substrings of a text which are permutations of a given pattern. This problem finds application in many areas and can be solved in linear time by a naive sliding window approach. In this short communication we present a new class of algorithms based on a new efficient fingerprint computation approach, called Heap-Counting, which turns out to be fast, flexible and easy to be implemented. It can be proved that our solutions have a linear worst case time complexity and, in addition, we present an extensive experimental evaluation which s","authors_text":"Arianna Pavone, Simone Faro","cross_cats":["cs.IR"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-03-07T18:34:11Z","title":"Flexible and Efficient Algorithms for Abelian Matching in Strings"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.02807","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:b495b7d547a2a5b75ebfe5ca1e171385a868a5bf6c781d0577359c04645ab7b9","target":"record","created_at":"2026-05-18T00:21:49Z","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":"1693b9e6b1a2fb9a5b63cab26da6ed7bb74f22ac42ba79b46a695cdb8a3c3831","cross_cats_sorted":["cs.IR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-03-07T18:34:11Z","title_canon_sha256":"72bf5d605c3848b82c1623698390d842edd0f7acdd4a874c404c23202b3aec5a"},"schema_version":"1.0","source":{"id":"1803.02807","kind":"arxiv","version":1}},"canonical_sha256":"44678f335eaf9204f53fc465778dcf2539ebccf762deeba03f867697b283642b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"44678f335eaf9204f53fc465778dcf2539ebccf762deeba03f867697b283642b","first_computed_at":"2026-05-18T00:21:49.193871Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:21:49.193871Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"fS/FNNchrR0ezrk2yfk1LAroxx0FL89U7wVoFUa5k//Ig90DLyOqQDCdeqFZCB/Y5qeHK8RQVDqI5wyQS5AlBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:21:49.194511Z","signed_message":"canonical_sha256_bytes"},"source_id":"1803.02807","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b495b7d547a2a5b75ebfe5ca1e171385a868a5bf6c781d0577359c04645ab7b9","sha256:9fea28199b482b168af66a6f614f04dbccf893a83d1b9adf005f3700d805a242"],"state_sha256":"37aa83ae748d7c7b4aad4cc694b1c6ebc6c8be01616639a817adfd97893f95fa"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"x7QTLe/736TpmJUkMXdC3VrMffHfD6l0uINP8H0rCsmIYn6SKPg+YtbmYb5YQTdvlgYJUQnLxo5+Q0Uu3v0cBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-21T22:47:30.274704Z","bundle_sha256":"9a0d02ba08cef932b6f6548e8657fe1f6e52041d6e3d67f39d8b7dece6aba205"}}