{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:MPHJGVFA7A67ARF6OU56YW5FE5","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":"c72633bbd0ff0f3becbf3a74189a55633a9beb1e0b2fa524d483e5f2dc131014","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-04-18T16:45:46Z","title_canon_sha256":"b8b78f804db6f52a0fdaa1abcc8af87c9a74e871dbad5c3c9fcc526d5bc9a7b0"},"schema_version":"1.0","source":{"id":"1804.06809","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1804.06809","created_at":"2026-05-18T00:18:05Z"},{"alias_kind":"arxiv_version","alias_value":"1804.06809v1","created_at":"2026-05-18T00:18:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.06809","created_at":"2026-05-18T00:18:05Z"},{"alias_kind":"pith_short_12","alias_value":"MPHJGVFA7A67","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_16","alias_value":"MPHJGVFA7A67ARF6","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_8","alias_value":"MPHJGVFA","created_at":"2026-05-18T12:32:40Z"}],"graph_snapshots":[{"event_id":"sha256:7b904765c3ee7aea71975b0997fa131450ad258bd06b81ea78ba7ba2b9299df1","target":"graph","created_at":"2026-05-18T00:18:05Z","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":"We consider the Abelian longest common factor problem in two scenarios: when input strings are uncompressed and are of size $n$, and when the input strings are run-length encoded and their compressed representations have size at most $m$. The alphabet size is denoted by $\\sigma$. For the uncompressed problem, we show an $o(n^2)$-time and $\\Oh(n)$-space algorithm in the case of $\\sigma=\\Oh(1)$, making a non-trivial use of tabulation. For the RLE-compressed problem, we show two algorithms: one working in $\\Oh(m^2\\sigma^2 \\log^3 m)$ time and $\\Oh(m (\\sigma^2+\\log^2 m))$ space, which employs line ","authors_text":"Jakub Radoszewski, Szymon Grabowski, Tomasz Kociumaka","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-04-18T16:45:46Z","title":"On Abelian Longest Common Factor with and without RLE"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.06809","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:5982bc65b3df19734659396049dd81ff8c939fdff903dd8fbc87450c1287f0a1","target":"record","created_at":"2026-05-18T00:18:05Z","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":"c72633bbd0ff0f3becbf3a74189a55633a9beb1e0b2fa524d483e5f2dc131014","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-04-18T16:45:46Z","title_canon_sha256":"b8b78f804db6f52a0fdaa1abcc8af87c9a74e871dbad5c3c9fcc526d5bc9a7b0"},"schema_version":"1.0","source":{"id":"1804.06809","kind":"arxiv","version":1}},"canonical_sha256":"63ce9354a0f83df044be753bec5ba527561f7054ccd270b40cd8cf493aee04d9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"63ce9354a0f83df044be753bec5ba527561f7054ccd270b40cd8cf493aee04d9","first_computed_at":"2026-05-18T00:18:05.700990Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:18:05.700990Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ahTSWKh4csq/Mq6qHPDRzzzecKpZl7wysPWEF4GbvWL6A4Tw3iRWMXBoyiPKiPPXoR83sJIbGV6fPPYAy/AZCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:18:05.701720Z","signed_message":"canonical_sha256_bytes"},"source_id":"1804.06809","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5982bc65b3df19734659396049dd81ff8c939fdff903dd8fbc87450c1287f0a1","sha256:7b904765c3ee7aea71975b0997fa131450ad258bd06b81ea78ba7ba2b9299df1"],"state_sha256":"7e67bc79be365658eefc686854a7f29409370954ed2f7957810b76999e072ae3"}