{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:EFEEZAR7SARYQMMQI6Q2PHUBWB","short_pith_number":"pith:EFEEZAR7","schema_version":"1.0","canonical_sha256":"21484c823f902388319047a1a79e81b0710da1c319b3a79f5c138e8de63645e2","source":{"kind":"arxiv","id":"1810.02099","version":1},"attestation_state":"computed","paper":{"title":"Longest Property-Preserved Common Factor","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Costas S. Iliopoulos, Giovanna Rosone, Giulia Bernardini, Lorraine A.K Ayad, Nadia Pisanti, Roberto Grossi, Solon P. Pissis","submitted_at":"2018-10-04T08:39:06Z","abstract_excerpt":"In this paper we introduce a new family of string processing problems. We are given two or more strings and we are asked to compute a factor common to all strings that preserves a specific property and has maximal length. Here we consider three fundamental string properties: square-free factors, periodic factors, and palindromic factors under three different settings, one per property. In the first setting, we are given a string $x$ and we are asked to construct a data structure over $x$ answering the following type of on-line queries: given string $y$, find a longest square-free factor common"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1810.02099","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2018-10-04T08:39:06Z","cross_cats_sorted":[],"title_canon_sha256":"d00c1e4962ca968236a1e83bf2df3c0ab2e81d21ca2c4b7f18c98e72be3411af","abstract_canon_sha256":"de125807330aae0b0c735683afef434879177b29137e42423f30147d1cd22c9c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:04:06.287633Z","signature_b64":"ByzVNiLAktsceZ2UgDMx85YwBfXj547p3xcoo/aCfCetHjwc5wBzwjDUSDFBKSDcgFz7ui9CDxUxaFvPJiQnBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"21484c823f902388319047a1a79e81b0710da1c319b3a79f5c138e8de63645e2","last_reissued_at":"2026-05-18T00:04:06.286850Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:04:06.286850Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Longest Property-Preserved Common Factor","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Costas S. Iliopoulos, Giovanna Rosone, Giulia Bernardini, Lorraine A.K Ayad, Nadia Pisanti, Roberto Grossi, Solon P. Pissis","submitted_at":"2018-10-04T08:39:06Z","abstract_excerpt":"In this paper we introduce a new family of string processing problems. We are given two or more strings and we are asked to compute a factor common to all strings that preserves a specific property and has maximal length. Here we consider three fundamental string properties: square-free factors, periodic factors, and palindromic factors under three different settings, one per property. In the first setting, we are given a string $x$ and we are asked to construct a data structure over $x$ answering the following type of on-line queries: given string $y$, find a longest square-free factor common"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.02099","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1810.02099","created_at":"2026-05-18T00:04:06.286985+00:00"},{"alias_kind":"arxiv_version","alias_value":"1810.02099v1","created_at":"2026-05-18T00:04:06.286985+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.02099","created_at":"2026-05-18T00:04:06.286985+00:00"},{"alias_kind":"pith_short_12","alias_value":"EFEEZAR7SARY","created_at":"2026-05-18T12:32:22.470017+00:00"},{"alias_kind":"pith_short_16","alias_value":"EFEEZAR7SARYQMMQ","created_at":"2026-05-18T12:32:22.470017+00:00"},{"alias_kind":"pith_short_8","alias_value":"EFEEZAR7","created_at":"2026-05-18T12:32:22.470017+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/EFEEZAR7SARYQMMQI6Q2PHUBWB","json":"https://pith.science/pith/EFEEZAR7SARYQMMQI6Q2PHUBWB.json","graph_json":"https://pith.science/api/pith-number/EFEEZAR7SARYQMMQI6Q2PHUBWB/graph.json","events_json":"https://pith.science/api/pith-number/EFEEZAR7SARYQMMQI6Q2PHUBWB/events.json","paper":"https://pith.science/paper/EFEEZAR7"},"agent_actions":{"view_html":"https://pith.science/pith/EFEEZAR7SARYQMMQI6Q2PHUBWB","download_json":"https://pith.science/pith/EFEEZAR7SARYQMMQI6Q2PHUBWB.json","view_paper":"https://pith.science/paper/EFEEZAR7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1810.02099&json=true","fetch_graph":"https://pith.science/api/pith-number/EFEEZAR7SARYQMMQI6Q2PHUBWB/graph.json","fetch_events":"https://pith.science/api/pith-number/EFEEZAR7SARYQMMQI6Q2PHUBWB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EFEEZAR7SARYQMMQI6Q2PHUBWB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EFEEZAR7SARYQMMQI6Q2PHUBWB/action/storage_attestation","attest_author":"https://pith.science/pith/EFEEZAR7SARYQMMQI6Q2PHUBWB/action/author_attestation","sign_citation":"https://pith.science/pith/EFEEZAR7SARYQMMQI6Q2PHUBWB/action/citation_signature","submit_replication":"https://pith.science/pith/EFEEZAR7SARYQMMQI6Q2PHUBWB/action/replication_record"}},"created_at":"2026-05-18T00:04:06.286985+00:00","updated_at":"2026-05-18T00:04:06.286985+00:00"}