{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:HXJ6AOFME3CFUAC3KFIY34UENE","short_pith_number":"pith:HXJ6AOFM","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"},"canonical_sha256":"3dd3e038ac26c45a005b51518df284691533704bbdb1ef22cbf2d16e6dc57b5c","source":{"kind":"arxiv","id":"1901.07502","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1901.07502","created_at":"2026-05-17T23:55:44Z"},{"alias_kind":"arxiv_version","alias_value":"1901.07502v1","created_at":"2026-05-17T23:55:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.07502","created_at":"2026-05-17T23:55:44Z"},{"alias_kind":"pith_short_12","alias_value":"HXJ6AOFME3CF","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_16","alias_value":"HXJ6AOFME3CFUAC3","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_8","alias_value":"HXJ6AOFM","created_at":"2026-05-18T12:33:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:HXJ6AOFME3CFUAC3KFIY34UENE","target":"record","payload":{"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"},"canonical_sha256":"3dd3e038ac26c45a005b51518df284691533704bbdb1ef22cbf2d16e6dc57b5c","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"},"source_kind":"arxiv","source_id":"1901.07502","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:55:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DbKXKkDzsQEj9T4YUcxk5NI3MtPjH3XjGYoCjqfdmTso0DGF83DrUcpg5V7lPOBD7KR27WzNtEidCWFG8dl7Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T05:15:53.618645Z"},"content_sha256":"c584e35f63d182dae0e8e4bd466114e66cb02557c6e1372489f2631fb603fa2f","schema_version":"1.0","event_id":"sha256:c584e35f63d182dae0e8e4bd466114e66cb02557c6e1372489f2631fb603fa2f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:HXJ6AOFME3CFUAC3KFIY34UENE","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:55:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SzX7FxD5XWvcOtq6/WpAALitL6vBNvwQRCgGYbv474WVetlPD3YUE284MYtEi4Ee0JbAueDwJmvRZQyqOEcIBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T05:15:53.618997Z"},"content_sha256":"b5210757f1a5fcf45754a2bcffd79e9add93352cbc73a381f09becbc3da689fb","schema_version":"1.0","event_id":"sha256:b5210757f1a5fcf45754a2bcffd79e9add93352cbc73a381f09becbc3da689fb"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HXJ6AOFME3CFUAC3KFIY34UENE/bundle.json","state_url":"https://pith.science/pith/HXJ6AOFME3CFUAC3KFIY34UENE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HXJ6AOFME3CFUAC3KFIY34UENE/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-01T05:15:53Z","links":{"resolver":"https://pith.science/pith/HXJ6AOFME3CFUAC3KFIY34UENE","bundle":"https://pith.science/pith/HXJ6AOFME3CFUAC3KFIY34UENE/bundle.json","state":"https://pith.science/pith/HXJ6AOFME3CFUAC3KFIY34UENE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HXJ6AOFME3CFUAC3KFIY34UENE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:HXJ6AOFME3CFUAC3KFIY34UENE","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"2fcc9427aff3425c4ead428edb12274d7b414bc02875e49df563fc79e8dd5311","cross_cats_sorted":["cs.DM","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2019-01-22T18:24:32Z","title_canon_sha256":"d7373e2194b6d3a12e86ad3c9f7ba8f9dbb712e0797596cab4274204aa12a618"},"schema_version":"1.0","source":{"id":"1901.07502","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1901.07502","created_at":"2026-05-17T23:55:44Z"},{"alias_kind":"arxiv_version","alias_value":"1901.07502v1","created_at":"2026-05-17T23:55:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.07502","created_at":"2026-05-17T23:55:44Z"},{"alias_kind":"pith_short_12","alias_value":"HXJ6AOFME3CF","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_16","alias_value":"HXJ6AOFME3CFUAC3","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_8","alias_value":"HXJ6AOFM","created_at":"2026-05-18T12:33:18Z"}],"graph_snapshots":[{"event_id":"sha256:b5210757f1a5fcf45754a2bcffd79e9add93352cbc73a381f09becbc3da689fb","target":"graph","created_at":"2026-05-17T23:55:44Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Andrew Ryzhikov, Clemens M\\\"ullner","cross_cats":["cs.DM","math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2019-01-22T18:24:32Z","title":"Palindromic Subsequences in Finite Words"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.07502","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:c584e35f63d182dae0e8e4bd466114e66cb02557c6e1372489f2631fb603fa2f","target":"record","created_at":"2026-05-17T23:55:44Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"2fcc9427aff3425c4ead428edb12274d7b414bc02875e49df563fc79e8dd5311","cross_cats_sorted":["cs.DM","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2019-01-22T18:24:32Z","title_canon_sha256":"d7373e2194b6d3a12e86ad3c9f7ba8f9dbb712e0797596cab4274204aa12a618"},"schema_version":"1.0","source":{"id":"1901.07502","kind":"arxiv","version":1}},"canonical_sha256":"3dd3e038ac26c45a005b51518df284691533704bbdb1ef22cbf2d16e6dc57b5c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3dd3e038ac26c45a005b51518df284691533704bbdb1ef22cbf2d16e6dc57b5c","first_computed_at":"2026-05-17T23:55:44.612741Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:55:44.612741Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ZVAzuzMvDpOWNVnmobGeJG4nXYScWVmfHJG04rgC9bEDugL8wuvK3oqRsQk+JX2/pmPYg5YdPtHBtihGFUOsDg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:55:44.613389Z","signed_message":"canonical_sha256_bytes"},"source_id":"1901.07502","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c584e35f63d182dae0e8e4bd466114e66cb02557c6e1372489f2631fb603fa2f","sha256:b5210757f1a5fcf45754a2bcffd79e9add93352cbc73a381f09becbc3da689fb"],"state_sha256":"bfa31bef859f3e591a8a7f044396c286941f2f93e6397eed381b10c590955188"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Cf8+tNOYkAQDRIxW7bli9N21lrOY0qwVVDTmd5fLOqvM8UvU2gh56o6a0G1+PSH/zMI8zgLEg79W893VUIf7CQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T05:15:53.621099Z","bundle_sha256":"7f276d3b74bd357bdf73bef2dc640231273449f2741f0b0517c28a8aa5e6af19"}}