{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:CQ25AW3PADEWIL6AC3F5YOZHUJ","short_pith_number":"pith:CQ25AW3P","schema_version":"1.0","canonical_sha256":"1435d05b6f00c9642fc016cbdc3b27a24bb558d11b6d37c6234005a40619252c","source":{"kind":"arxiv","id":"1805.10646","version":1},"attestation_state":"computed","paper":{"title":"Palindromes in starlike trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Amy Glen, Jamie Simpson, W. F. Smyth","submitted_at":"2018-05-27T15:57:56Z","abstract_excerpt":"In this note, we obtain an upper bound on the maximum number of distinct non-empty palindromes in starlike trees. This bound implies, in particular, that there are at most $4n$ distinct non-empty palindromes in a starlike tree with three branches each of length $n$. For such starlike trees labelled with a binary alphabet, we sharpen the upper bound to $4n-1$ and conjecture that the actual maximum is $4n-2$. It is intriguing that this simple conjecture seems difficult to prove, in contrast to the straightforward proof of the bound."},"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":"1805.10646","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-05-27T15:57:56Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"c978e4635c1d7a9924f3fadbd669faafb520ad82893536548d20f681c0e6ddf0","abstract_canon_sha256":"a9091fc913016bfe8ed55e523bd3d3a168673ce6036f59f9f6ef2f82aee21b48"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:14:51.810790Z","signature_b64":"9fXUKS7igD+0m2nr6XSUyksOAUt0Nnux9DZO0M1HL9pUE/7AVeIM65N/emuTJfZV8OrWcci4lvkblmm9xrs0DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1435d05b6f00c9642fc016cbdc3b27a24bb558d11b6d37c6234005a40619252c","last_reissued_at":"2026-05-18T00:14:51.810262Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:14:51.810262Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Palindromes in starlike trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Amy Glen, Jamie Simpson, W. F. Smyth","submitted_at":"2018-05-27T15:57:56Z","abstract_excerpt":"In this note, we obtain an upper bound on the maximum number of distinct non-empty palindromes in starlike trees. This bound implies, in particular, that there are at most $4n$ distinct non-empty palindromes in a starlike tree with three branches each of length $n$. For such starlike trees labelled with a binary alphabet, we sharpen the upper bound to $4n-1$ and conjecture that the actual maximum is $4n-2$. It is intriguing that this simple conjecture seems difficult to prove, in contrast to the straightforward proof of the bound."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.10646","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":"1805.10646","created_at":"2026-05-18T00:14:51.810326+00:00"},{"alias_kind":"arxiv_version","alias_value":"1805.10646v1","created_at":"2026-05-18T00:14:51.810326+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.10646","created_at":"2026-05-18T00:14:51.810326+00:00"},{"alias_kind":"pith_short_12","alias_value":"CQ25AW3PADEW","created_at":"2026-05-18T12:32:16.446611+00:00"},{"alias_kind":"pith_short_16","alias_value":"CQ25AW3PADEWIL6A","created_at":"2026-05-18T12:32:16.446611+00:00"},{"alias_kind":"pith_short_8","alias_value":"CQ25AW3P","created_at":"2026-05-18T12:32:16.446611+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/CQ25AW3PADEWIL6AC3F5YOZHUJ","json":"https://pith.science/pith/CQ25AW3PADEWIL6AC3F5YOZHUJ.json","graph_json":"https://pith.science/api/pith-number/CQ25AW3PADEWIL6AC3F5YOZHUJ/graph.json","events_json":"https://pith.science/api/pith-number/CQ25AW3PADEWIL6AC3F5YOZHUJ/events.json","paper":"https://pith.science/paper/CQ25AW3P"},"agent_actions":{"view_html":"https://pith.science/pith/CQ25AW3PADEWIL6AC3F5YOZHUJ","download_json":"https://pith.science/pith/CQ25AW3PADEWIL6AC3F5YOZHUJ.json","view_paper":"https://pith.science/paper/CQ25AW3P","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1805.10646&json=true","fetch_graph":"https://pith.science/api/pith-number/CQ25AW3PADEWIL6AC3F5YOZHUJ/graph.json","fetch_events":"https://pith.science/api/pith-number/CQ25AW3PADEWIL6AC3F5YOZHUJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CQ25AW3PADEWIL6AC3F5YOZHUJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CQ25AW3PADEWIL6AC3F5YOZHUJ/action/storage_attestation","attest_author":"https://pith.science/pith/CQ25AW3PADEWIL6AC3F5YOZHUJ/action/author_attestation","sign_citation":"https://pith.science/pith/CQ25AW3PADEWIL6AC3F5YOZHUJ/action/citation_signature","submit_replication":"https://pith.science/pith/CQ25AW3PADEWIL6AC3F5YOZHUJ/action/replication_record"}},"created_at":"2026-05-18T00:14:51.810326+00:00","updated_at":"2026-05-18T00:14:51.810326+00:00"}