{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:4AXYKKTATARV4WYQJLNR2WAUO2","short_pith_number":"pith:4AXYKKTA","schema_version":"1.0","canonical_sha256":"e02f852a6098235e5b104adb1d5814769c0c59e60fa63f665fc54edbce320c4b","source":{"kind":"arxiv","id":"1602.05561","version":3},"attestation_state":"computed","paper":{"title":"Lexis: An Optimization Framework for Discovering the Hierarchical Structure of Sequential Data","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.AI","authors_text":"Bistra Dilkina, Constantine Dovrolis, Payam Siyari","submitted_at":"2016-02-17T20:36:28Z","abstract_excerpt":"Data represented as strings abounds in biology, linguistics, document mining, web search and many other fields. Such data often have a hierarchical structure, either because they were artificially designed and composed in a hierarchical manner or because there is an underlying evolutionary process that creates repeatedly more complex strings from simpler substrings. We propose a framework, referred to as \"Lexis\", that produces an optimized hierarchical representation of a given set of \"target\" strings. The resulting hierarchy, \"Lexis-DAG\", shows how to construct each target through the concate"},"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":"1602.05561","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2016-02-17T20:36:28Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"a137e8082fb3a4b075057e1cd0e73ce1c3926a2a02ae8971d003f723f8ae7d3c","abstract_canon_sha256":"84d4890e34525594542c558fc81afb750837b15f629f8241987f3f40e6cf70ec"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:12:34.460729Z","signature_b64":"MW9SA8ZFpiO6dGbYQYJN4lp2LJAOWEieZJvIj4styh3nimXM5GSX5L6JfeOYsfLQWFicQc+c6DNaFNR8C3sPCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e02f852a6098235e5b104adb1d5814769c0c59e60fa63f665fc54edbce320c4b","last_reissued_at":"2026-05-18T01:12:34.460372Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:12:34.460372Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Lexis: An Optimization Framework for Discovering the Hierarchical Structure of Sequential Data","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.AI","authors_text":"Bistra Dilkina, Constantine Dovrolis, Payam Siyari","submitted_at":"2016-02-17T20:36:28Z","abstract_excerpt":"Data represented as strings abounds in biology, linguistics, document mining, web search and many other fields. Such data often have a hierarchical structure, either because they were artificially designed and composed in a hierarchical manner or because there is an underlying evolutionary process that creates repeatedly more complex strings from simpler substrings. We propose a framework, referred to as \"Lexis\", that produces an optimized hierarchical representation of a given set of \"target\" strings. The resulting hierarchy, \"Lexis-DAG\", shows how to construct each target through the concate"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.05561","kind":"arxiv","version":3},"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":"1602.05561","created_at":"2026-05-18T01:12:34.460430+00:00"},{"alias_kind":"arxiv_version","alias_value":"1602.05561v3","created_at":"2026-05-18T01:12:34.460430+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.05561","created_at":"2026-05-18T01:12:34.460430+00:00"},{"alias_kind":"pith_short_12","alias_value":"4AXYKKTATARV","created_at":"2026-05-18T12:29:58.707656+00:00"},{"alias_kind":"pith_short_16","alias_value":"4AXYKKTATARV4WYQ","created_at":"2026-05-18T12:29:58.707656+00:00"},{"alias_kind":"pith_short_8","alias_value":"4AXYKKTA","created_at":"2026-05-18T12:29:58.707656+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/4AXYKKTATARV4WYQJLNR2WAUO2","json":"https://pith.science/pith/4AXYKKTATARV4WYQJLNR2WAUO2.json","graph_json":"https://pith.science/api/pith-number/4AXYKKTATARV4WYQJLNR2WAUO2/graph.json","events_json":"https://pith.science/api/pith-number/4AXYKKTATARV4WYQJLNR2WAUO2/events.json","paper":"https://pith.science/paper/4AXYKKTA"},"agent_actions":{"view_html":"https://pith.science/pith/4AXYKKTATARV4WYQJLNR2WAUO2","download_json":"https://pith.science/pith/4AXYKKTATARV4WYQJLNR2WAUO2.json","view_paper":"https://pith.science/paper/4AXYKKTA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1602.05561&json=true","fetch_graph":"https://pith.science/api/pith-number/4AXYKKTATARV4WYQJLNR2WAUO2/graph.json","fetch_events":"https://pith.science/api/pith-number/4AXYKKTATARV4WYQJLNR2WAUO2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4AXYKKTATARV4WYQJLNR2WAUO2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4AXYKKTATARV4WYQJLNR2WAUO2/action/storage_attestation","attest_author":"https://pith.science/pith/4AXYKKTATARV4WYQJLNR2WAUO2/action/author_attestation","sign_citation":"https://pith.science/pith/4AXYKKTATARV4WYQJLNR2WAUO2/action/citation_signature","submit_replication":"https://pith.science/pith/4AXYKKTATARV4WYQJLNR2WAUO2/action/replication_record"}},"created_at":"2026-05-18T01:12:34.460430+00:00","updated_at":"2026-05-18T01:12:34.460430+00:00"}