{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:TTFP2QGAO6HKKZWA2FOKJGDFNH","short_pith_number":"pith:TTFP2QGA","schema_version":"1.0","canonical_sha256":"9ccafd40c0778ea566c0d15ca4986569e4bd0d5f6f66299400cb4c63408a386c","source":{"kind":"arxiv","id":"1811.02169","version":1},"attestation_state":"computed","paper":{"title":"Knuth's Moves on Timed Words","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Amritanshu Prasad","submitted_at":"2018-11-06T05:26:56Z","abstract_excerpt":"We give an exposition of Schensted's algorithm to find the length of the longest increasing subword of a word in an ordered alphabet, and Greene's generalization of Schensted's results using Knuth equivalence. We announce a generalization of these results to timed words."},"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":"1811.02169","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-11-06T05:26:56Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"fbab1ca6ad2038b1a812ef0de0df75eb2ae3173abe40cad8204826d44f5fdf0f","abstract_canon_sha256":"3519c7100e139d61479165e8a06e7787f434c1dabefda8872b8016052788ef2e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:01:24.904702Z","signature_b64":"LTSDjwnLMECxZyNyhUnI8fr8ZLN0WMxuW+BoJW4cF4FTliPgZoFf2heRrtUIE8FN7GUJRGY0qh7t/VqmVdquCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9ccafd40c0778ea566c0d15ca4986569e4bd0d5f6f66299400cb4c63408a386c","last_reissued_at":"2026-05-18T00:01:24.904344Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:01:24.904344Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Knuth's Moves on Timed Words","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Amritanshu Prasad","submitted_at":"2018-11-06T05:26:56Z","abstract_excerpt":"We give an exposition of Schensted's algorithm to find the length of the longest increasing subword of a word in an ordered alphabet, and Greene's generalization of Schensted's results using Knuth equivalence. We announce a generalization of these results to timed words."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.02169","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":"1811.02169","created_at":"2026-05-18T00:01:24.904395+00:00"},{"alias_kind":"arxiv_version","alias_value":"1811.02169v1","created_at":"2026-05-18T00:01:24.904395+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.02169","created_at":"2026-05-18T00:01:24.904395+00:00"},{"alias_kind":"pith_short_12","alias_value":"TTFP2QGAO6HK","created_at":"2026-05-18T12:32:56.356000+00:00"},{"alias_kind":"pith_short_16","alias_value":"TTFP2QGAO6HKKZWA","created_at":"2026-05-18T12:32:56.356000+00:00"},{"alias_kind":"pith_short_8","alias_value":"TTFP2QGA","created_at":"2026-05-18T12:32:56.356000+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/TTFP2QGAO6HKKZWA2FOKJGDFNH","json":"https://pith.science/pith/TTFP2QGAO6HKKZWA2FOKJGDFNH.json","graph_json":"https://pith.science/api/pith-number/TTFP2QGAO6HKKZWA2FOKJGDFNH/graph.json","events_json":"https://pith.science/api/pith-number/TTFP2QGAO6HKKZWA2FOKJGDFNH/events.json","paper":"https://pith.science/paper/TTFP2QGA"},"agent_actions":{"view_html":"https://pith.science/pith/TTFP2QGAO6HKKZWA2FOKJGDFNH","download_json":"https://pith.science/pith/TTFP2QGAO6HKKZWA2FOKJGDFNH.json","view_paper":"https://pith.science/paper/TTFP2QGA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1811.02169&json=true","fetch_graph":"https://pith.science/api/pith-number/TTFP2QGAO6HKKZWA2FOKJGDFNH/graph.json","fetch_events":"https://pith.science/api/pith-number/TTFP2QGAO6HKKZWA2FOKJGDFNH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TTFP2QGAO6HKKZWA2FOKJGDFNH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TTFP2QGAO6HKKZWA2FOKJGDFNH/action/storage_attestation","attest_author":"https://pith.science/pith/TTFP2QGAO6HKKZWA2FOKJGDFNH/action/author_attestation","sign_citation":"https://pith.science/pith/TTFP2QGAO6HKKZWA2FOKJGDFNH/action/citation_signature","submit_replication":"https://pith.science/pith/TTFP2QGAO6HKKZWA2FOKJGDFNH/action/replication_record"}},"created_at":"2026-05-18T00:01:24.904395+00:00","updated_at":"2026-05-18T00:01:24.904395+00:00"}