{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:LAFMGJCJQZSVM3EIWEBKIFTDTV","short_pith_number":"pith:LAFMGJCJ","schema_version":"1.0","canonical_sha256":"580ac324498665566c88b102a416639d5f108b381f92cd5c2a6f7d5c688b2308","source":{"kind":"arxiv","id":"1305.2540","version":1},"attestation_state":"computed","paper":{"title":"Finding Distinct Subpalindromes Online","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Arseny M. Shur, Dmitry Kosolobov, Mikhail Rubinchik","submitted_at":"2013-05-11T20:33:09Z","abstract_excerpt":"We exhibit an online algorithm finding all distinct palindromes inside a given string in time $\\Theta(n\\log|\\Sigma|)$ over an ordered alphabet and in time $\\Theta(n|\\Sigma|)$ over an unordered alphabet. Using a reduction from a dictionary-like data structure, we prove the optimality of this algorithm in the comparison-based computation model."},"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":"1305.2540","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-05-11T20:33:09Z","cross_cats_sorted":[],"title_canon_sha256":"d11ded2729a031e1349f137b64fff8a1a44c07b6fa934f8d1edf39c26839e764","abstract_canon_sha256":"af5ad4a9d8d60e6ea665e91898ba555ce3d063d27b96e53bc8b213db5db375d8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:25:57.608854Z","signature_b64":"ixCak2pSGwhM/etXMH7RIWi/ubsX70zAFqaxV2vua55p3BWyTBYbGZs7KItJ8txN+Jkifd2tk6kg3f0CfTdlAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"580ac324498665566c88b102a416639d5f108b381f92cd5c2a6f7d5c688b2308","last_reissued_at":"2026-05-18T03:25:57.608050Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:25:57.608050Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Finding Distinct Subpalindromes Online","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Arseny M. Shur, Dmitry Kosolobov, Mikhail Rubinchik","submitted_at":"2013-05-11T20:33:09Z","abstract_excerpt":"We exhibit an online algorithm finding all distinct palindromes inside a given string in time $\\Theta(n\\log|\\Sigma|)$ over an ordered alphabet and in time $\\Theta(n|\\Sigma|)$ over an unordered alphabet. Using a reduction from a dictionary-like data structure, we prove the optimality of this algorithm in the comparison-based computation model."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1305.2540","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":"1305.2540","created_at":"2026-05-18T03:25:57.608180+00:00"},{"alias_kind":"arxiv_version","alias_value":"1305.2540v1","created_at":"2026-05-18T03:25:57.608180+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1305.2540","created_at":"2026-05-18T03:25:57.608180+00:00"},{"alias_kind":"pith_short_12","alias_value":"LAFMGJCJQZSV","created_at":"2026-05-18T12:27:51.066281+00:00"},{"alias_kind":"pith_short_16","alias_value":"LAFMGJCJQZSVM3EI","created_at":"2026-05-18T12:27:51.066281+00:00"},{"alias_kind":"pith_short_8","alias_value":"LAFMGJCJ","created_at":"2026-05-18T12:27:51.066281+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/LAFMGJCJQZSVM3EIWEBKIFTDTV","json":"https://pith.science/pith/LAFMGJCJQZSVM3EIWEBKIFTDTV.json","graph_json":"https://pith.science/api/pith-number/LAFMGJCJQZSVM3EIWEBKIFTDTV/graph.json","events_json":"https://pith.science/api/pith-number/LAFMGJCJQZSVM3EIWEBKIFTDTV/events.json","paper":"https://pith.science/paper/LAFMGJCJ"},"agent_actions":{"view_html":"https://pith.science/pith/LAFMGJCJQZSVM3EIWEBKIFTDTV","download_json":"https://pith.science/pith/LAFMGJCJQZSVM3EIWEBKIFTDTV.json","view_paper":"https://pith.science/paper/LAFMGJCJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1305.2540&json=true","fetch_graph":"https://pith.science/api/pith-number/LAFMGJCJQZSVM3EIWEBKIFTDTV/graph.json","fetch_events":"https://pith.science/api/pith-number/LAFMGJCJQZSVM3EIWEBKIFTDTV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LAFMGJCJQZSVM3EIWEBKIFTDTV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LAFMGJCJQZSVM3EIWEBKIFTDTV/action/storage_attestation","attest_author":"https://pith.science/pith/LAFMGJCJQZSVM3EIWEBKIFTDTV/action/author_attestation","sign_citation":"https://pith.science/pith/LAFMGJCJQZSVM3EIWEBKIFTDTV/action/citation_signature","submit_replication":"https://pith.science/pith/LAFMGJCJQZSVM3EIWEBKIFTDTV/action/replication_record"}},"created_at":"2026-05-18T03:25:57.608180+00:00","updated_at":"2026-05-18T03:25:57.608180+00:00"}