{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:6MACNZIPIXXEDDEULLA75ZROM7","short_pith_number":"pith:6MACNZIP","schema_version":"1.0","canonical_sha256":"f30026e50f45ee418c945ac1fee62e67e2deeed044a9d8a2275f9725b5471013","source":{"kind":"arxiv","id":"1404.5244","version":4},"attestation_state":"computed","paper":{"title":"$\\mathrm{Pal}^k$ Is Linear Recognizable Online","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.FL","authors_text":"Arseny M. Shur, Dmitry Kosolobov, Mikhail Rubinchik","submitted_at":"2014-04-21T17:07:52Z","abstract_excerpt":"Given a language $L$ that is online recognizable in linear time and space, we construct a linear time and space online recognition algorithm for the language $L\\cdot\\mathrm{Pal}$, where $\\mathrm{Pal}$ is the language of all nonempty palindromes. Hence for every fixed positive $k$, $\\mathrm{Pal}^k$ is online recognizable in linear time and space. Thus we solve an open problem posed by Galil and Seiferas in 1978."},"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":"1404.5244","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2014-04-21T17:07:52Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"3eb71c0083e1d4921c3079c940817204595ba6ac1723c94e22c374c62c2b0eb2","abstract_canon_sha256":"e50c1b89bb774266daf9473e13ed9aa8943ee8a134075983f4947ae182decae5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:20:00.068408Z","signature_b64":"DPXTnYg1fhbUU0uOw6+83rB/Nx0wvqmEfAxtf36tKxoW8JFx/GCky59bwiP74/siP02tCHq/5oDaZqbmQDKJDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f30026e50f45ee418c945ac1fee62e67e2deeed044a9d8a2275f9725b5471013","last_reissued_at":"2026-05-18T02:20:00.067592Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:20:00.067592Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"$\\mathrm{Pal}^k$ Is Linear Recognizable Online","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.FL","authors_text":"Arseny M. Shur, Dmitry Kosolobov, Mikhail Rubinchik","submitted_at":"2014-04-21T17:07:52Z","abstract_excerpt":"Given a language $L$ that is online recognizable in linear time and space, we construct a linear time and space online recognition algorithm for the language $L\\cdot\\mathrm{Pal}$, where $\\mathrm{Pal}$ is the language of all nonempty palindromes. Hence for every fixed positive $k$, $\\mathrm{Pal}^k$ is online recognizable in linear time and space. Thus we solve an open problem posed by Galil and Seiferas in 1978."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.5244","kind":"arxiv","version":4},"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":"1404.5244","created_at":"2026-05-18T02:20:00.067728+00:00"},{"alias_kind":"arxiv_version","alias_value":"1404.5244v4","created_at":"2026-05-18T02:20:00.067728+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.5244","created_at":"2026-05-18T02:20:00.067728+00:00"},{"alias_kind":"pith_short_12","alias_value":"6MACNZIPIXXE","created_at":"2026-05-18T12:28:16.859392+00:00"},{"alias_kind":"pith_short_16","alias_value":"6MACNZIPIXXEDDEU","created_at":"2026-05-18T12:28:16.859392+00:00"},{"alias_kind":"pith_short_8","alias_value":"6MACNZIP","created_at":"2026-05-18T12:28:16.859392+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/6MACNZIPIXXEDDEULLA75ZROM7","json":"https://pith.science/pith/6MACNZIPIXXEDDEULLA75ZROM7.json","graph_json":"https://pith.science/api/pith-number/6MACNZIPIXXEDDEULLA75ZROM7/graph.json","events_json":"https://pith.science/api/pith-number/6MACNZIPIXXEDDEULLA75ZROM7/events.json","paper":"https://pith.science/paper/6MACNZIP"},"agent_actions":{"view_html":"https://pith.science/pith/6MACNZIPIXXEDDEULLA75ZROM7","download_json":"https://pith.science/pith/6MACNZIPIXXEDDEULLA75ZROM7.json","view_paper":"https://pith.science/paper/6MACNZIP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1404.5244&json=true","fetch_graph":"https://pith.science/api/pith-number/6MACNZIPIXXEDDEULLA75ZROM7/graph.json","fetch_events":"https://pith.science/api/pith-number/6MACNZIPIXXEDDEULLA75ZROM7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6MACNZIPIXXEDDEULLA75ZROM7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6MACNZIPIXXEDDEULLA75ZROM7/action/storage_attestation","attest_author":"https://pith.science/pith/6MACNZIPIXXEDDEULLA75ZROM7/action/author_attestation","sign_citation":"https://pith.science/pith/6MACNZIPIXXEDDEULLA75ZROM7/action/citation_signature","submit_replication":"https://pith.science/pith/6MACNZIPIXXEDDEULLA75ZROM7/action/replication_record"}},"created_at":"2026-05-18T02:20:00.067728+00:00","updated_at":"2026-05-18T02:20:00.067728+00:00"}