{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:CO2DVI3AUBXTAANQLL2LROEUVS","short_pith_number":"pith:CO2DVI3A","schema_version":"1.0","canonical_sha256":"13b43aa360a06f3001b05af4b8b894acad759b49be45d712b8154ddad7def1aa","source":{"kind":"arxiv","id":"1308.3466","version":3},"attestation_state":"computed","paper":{"title":"Palindrome Recognition In The Streaming Model","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Erfan Sadeqi Azer, Frederik Mallmann-Trenn, Funda Erg\\\"un, Petra Berenbrink","submitted_at":"2013-08-15T18:04:24Z","abstract_excerpt":"In the Palindrome Problem one tries to find all palindromes (palindromic substrings) in a given string. A palindrome is defined as a string which reads forwards the same as backwards, e.g., the string \"racecar\". A related problem is the Longest Palindromic Substring Problem in which finding an arbitrary one of the longest palindromes in the given string suffices. We regard the streaming version of both problems. In the streaming model the input arrives over time and at every point in time we are only allowed to use sublinear space. The main algorithms in this paper are the following: The first"},"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":"1308.3466","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-08-15T18:04:24Z","cross_cats_sorted":[],"title_canon_sha256":"731ac701789c696710f3a76fd2ce91541d9ced9d4ec9fcf76fc9c9a64fcc641d","abstract_canon_sha256":"50046854bb88aaa2b8c6669a3ec768950c9b45402a35c14ab35031bf121a5c66"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:21:45.378204Z","signature_b64":"WnsjSP9t2A3W+elMK7kr4gaGySm7zQ0xeSwFi+z7Cfn69QVO3gkZF0Z6G7WYzK+9E8C9Zw/Nb1QYjJjzpNQoDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"13b43aa360a06f3001b05af4b8b894acad759b49be45d712b8154ddad7def1aa","last_reissued_at":"2026-05-18T01:21:45.377446Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:21:45.377446Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Palindrome Recognition In The Streaming Model","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Erfan Sadeqi Azer, Frederik Mallmann-Trenn, Funda Erg\\\"un, Petra Berenbrink","submitted_at":"2013-08-15T18:04:24Z","abstract_excerpt":"In the Palindrome Problem one tries to find all palindromes (palindromic substrings) in a given string. A palindrome is defined as a string which reads forwards the same as backwards, e.g., the string \"racecar\". A related problem is the Longest Palindromic Substring Problem in which finding an arbitrary one of the longest palindromes in the given string suffices. We regard the streaming version of both problems. In the streaming model the input arrives over time and at every point in time we are only allowed to use sublinear space. The main algorithms in this paper are the following: The first"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1308.3466","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1308.3466","created_at":"2026-05-18T01:21:45.377585+00:00"},{"alias_kind":"arxiv_version","alias_value":"1308.3466v3","created_at":"2026-05-18T01:21:45.377585+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1308.3466","created_at":"2026-05-18T01:21:45.377585+00:00"},{"alias_kind":"pith_short_12","alias_value":"CO2DVI3AUBXT","created_at":"2026-05-18T12:27:40.988391+00:00"},{"alias_kind":"pith_short_16","alias_value":"CO2DVI3AUBXTAANQ","created_at":"2026-05-18T12:27:40.988391+00:00"},{"alias_kind":"pith_short_8","alias_value":"CO2DVI3A","created_at":"2026-05-18T12:27:40.988391+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/CO2DVI3AUBXTAANQLL2LROEUVS","json":"https://pith.science/pith/CO2DVI3AUBXTAANQLL2LROEUVS.json","graph_json":"https://pith.science/api/pith-number/CO2DVI3AUBXTAANQLL2LROEUVS/graph.json","events_json":"https://pith.science/api/pith-number/CO2DVI3AUBXTAANQLL2LROEUVS/events.json","paper":"https://pith.science/paper/CO2DVI3A"},"agent_actions":{"view_html":"https://pith.science/pith/CO2DVI3AUBXTAANQLL2LROEUVS","download_json":"https://pith.science/pith/CO2DVI3AUBXTAANQLL2LROEUVS.json","view_paper":"https://pith.science/paper/CO2DVI3A","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1308.3466&json=true","fetch_graph":"https://pith.science/api/pith-number/CO2DVI3AUBXTAANQLL2LROEUVS/graph.json","fetch_events":"https://pith.science/api/pith-number/CO2DVI3AUBXTAANQLL2LROEUVS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CO2DVI3AUBXTAANQLL2LROEUVS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CO2DVI3AUBXTAANQLL2LROEUVS/action/storage_attestation","attest_author":"https://pith.science/pith/CO2DVI3AUBXTAANQLL2LROEUVS/action/author_attestation","sign_citation":"https://pith.science/pith/CO2DVI3AUBXTAANQLL2LROEUVS/action/citation_signature","submit_replication":"https://pith.science/pith/CO2DVI3AUBXTAANQLL2LROEUVS/action/replication_record"}},"created_at":"2026-05-18T01:21:45.377585+00:00","updated_at":"2026-05-18T01:21:45.377585+00:00"}