{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:HXJ6AOFME3CFUAC3KFIY34UENE","short_pith_number":"pith:HXJ6AOFM","schema_version":"1.0","canonical_sha256":"3dd3e038ac26c45a005b51518df284691533704bbdb1ef22cbf2d16e6dc57b5c","source":{"kind":"arxiv","id":"1901.07502","version":1},"attestation_state":"computed","paper":{"title":"Palindromic Subsequences in Finite Words","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.CO"],"primary_cat":"cs.FL","authors_text":"Andrew Ryzhikov, Clemens M\\\"ullner","submitted_at":"2019-01-22T18:24:32Z","abstract_excerpt":"In 1999 Lyngs{\\o} and Pedersen proposed a conjecture stating that every binary circular word of length $n$ with equal number of zeros and ones has an antipalindromic linear subsequence of length at least $\\frac{2}{3}n$. No progress over a trivial $\\frac{1}{2}n$ bound has been achieved since then. We suggest a palindromic counterpart to this conjecture and provide a non-trivial infinite series of circular words which prove the upper bound of $\\frac{2}{3}n$ for both conjectures at the same time. The construction also works for words over an alphabet of size $k$ and gives rise to a generalization"},"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":"1901.07502","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2019-01-22T18:24:32Z","cross_cats_sorted":["cs.DM","math.CO"],"title_canon_sha256":"d7373e2194b6d3a12e86ad3c9f7ba8f9dbb712e0797596cab4274204aa12a618","abstract_canon_sha256":"2fcc9427aff3425c4ead428edb12274d7b414bc02875e49df563fc79e8dd5311"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:55:44.613389Z","signature_b64":"ZVAzuzMvDpOWNVnmobGeJG4nXYScWVmfHJG04rgC9bEDugL8wuvK3oqRsQk+JX2/pmPYg5YdPtHBtihGFUOsDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3dd3e038ac26c45a005b51518df284691533704bbdb1ef22cbf2d16e6dc57b5c","last_reissued_at":"2026-05-17T23:55:44.612741Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:55:44.612741Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Palindromic Subsequences in Finite Words","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.CO"],"primary_cat":"cs.FL","authors_text":"Andrew Ryzhikov, Clemens M\\\"ullner","submitted_at":"2019-01-22T18:24:32Z","abstract_excerpt":"In 1999 Lyngs{\\o} and Pedersen proposed a conjecture stating that every binary circular word of length $n$ with equal number of zeros and ones has an antipalindromic linear subsequence of length at least $\\frac{2}{3}n$. No progress over a trivial $\\frac{1}{2}n$ bound has been achieved since then. We suggest a palindromic counterpart to this conjecture and provide a non-trivial infinite series of circular words which prove the upper bound of $\\frac{2}{3}n$ for both conjectures at the same time. The construction also works for words over an alphabet of size $k$ and gives rise to a generalization"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.07502","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":"1901.07502","created_at":"2026-05-17T23:55:44.612866+00:00"},{"alias_kind":"arxiv_version","alias_value":"1901.07502v1","created_at":"2026-05-17T23:55:44.612866+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.07502","created_at":"2026-05-17T23:55:44.612866+00:00"},{"alias_kind":"pith_short_12","alias_value":"HXJ6AOFME3CF","created_at":"2026-05-18T12:33:18.533446+00:00"},{"alias_kind":"pith_short_16","alias_value":"HXJ6AOFME3CFUAC3","created_at":"2026-05-18T12:33:18.533446+00:00"},{"alias_kind":"pith_short_8","alias_value":"HXJ6AOFM","created_at":"2026-05-18T12:33:18.533446+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/HXJ6AOFME3CFUAC3KFIY34UENE","json":"https://pith.science/pith/HXJ6AOFME3CFUAC3KFIY34UENE.json","graph_json":"https://pith.science/api/pith-number/HXJ6AOFME3CFUAC3KFIY34UENE/graph.json","events_json":"https://pith.science/api/pith-number/HXJ6AOFME3CFUAC3KFIY34UENE/events.json","paper":"https://pith.science/paper/HXJ6AOFM"},"agent_actions":{"view_html":"https://pith.science/pith/HXJ6AOFME3CFUAC3KFIY34UENE","download_json":"https://pith.science/pith/HXJ6AOFME3CFUAC3KFIY34UENE.json","view_paper":"https://pith.science/paper/HXJ6AOFM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1901.07502&json=true","fetch_graph":"https://pith.science/api/pith-number/HXJ6AOFME3CFUAC3KFIY34UENE/graph.json","fetch_events":"https://pith.science/api/pith-number/HXJ6AOFME3CFUAC3KFIY34UENE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HXJ6AOFME3CFUAC3KFIY34UENE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HXJ6AOFME3CFUAC3KFIY34UENE/action/storage_attestation","attest_author":"https://pith.science/pith/HXJ6AOFME3CFUAC3KFIY34UENE/action/author_attestation","sign_citation":"https://pith.science/pith/HXJ6AOFME3CFUAC3KFIY34UENE/action/citation_signature","submit_replication":"https://pith.science/pith/HXJ6AOFME3CFUAC3KFIY34UENE/action/replication_record"}},"created_at":"2026-05-17T23:55:44.612866+00:00","updated_at":"2026-05-17T23:55:44.612866+00:00"}