{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:4AXYKKTATARV4WYQJLNR2WAUO2","short_pith_number":"pith:4AXYKKTA","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"},"canonical_sha256":"e02f852a6098235e5b104adb1d5814769c0c59e60fa63f665fc54edbce320c4b","source":{"kind":"arxiv","id":"1602.05561","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.05561","created_at":"2026-05-18T01:12:34Z"},{"alias_kind":"arxiv_version","alias_value":"1602.05561v3","created_at":"2026-05-18T01:12:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.05561","created_at":"2026-05-18T01:12:34Z"},{"alias_kind":"pith_short_12","alias_value":"4AXYKKTATARV","created_at":"2026-05-18T12:29:58Z"},{"alias_kind":"pith_short_16","alias_value":"4AXYKKTATARV4WYQ","created_at":"2026-05-18T12:29:58Z"},{"alias_kind":"pith_short_8","alias_value":"4AXYKKTA","created_at":"2026-05-18T12:29:58Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:4AXYKKTATARV4WYQJLNR2WAUO2","target":"record","payload":{"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"},"canonical_sha256":"e02f852a6098235e5b104adb1d5814769c0c59e60fa63f665fc54edbce320c4b","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"},"source_kind":"arxiv","source_id":"1602.05561","source_version":3,"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-18T01:12:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"In6l2yMMMX9s8d7C9cbmcBzqdeG4+nedjGg/fywIrHWqdmeYzUS9JFnZWyRpRAndJjEAUGUlLDjYqqVKmXgOBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T09:53:39.488142Z"},"content_sha256":"7913a7d1b6d11f553105a1cdc7611cb7a68d3edced9eb49e9bf6d2598e3d8a46","schema_version":"1.0","event_id":"sha256:7913a7d1b6d11f553105a1cdc7611cb7a68d3edced9eb49e9bf6d2598e3d8a46"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:4AXYKKTATARV4WYQJLNR2WAUO2","target":"graph","payload":{"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"},"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-18T01:12:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"n4kJm56k/VWvnFZZDDWJ0Wqj6JH6WDUd6FS0MB9wdm9l11HAu24jhf8kUzXAGhNApuKA8jnMK4TuXW/pEL8eDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T09:53:39.488796Z"},"content_sha256":"579aa0b147ce82b208ac9814ef44814a4149563178cb6c0ab75bdbe3eeb5e338","schema_version":"1.0","event_id":"sha256:579aa0b147ce82b208ac9814ef44814a4149563178cb6c0ab75bdbe3eeb5e338"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4AXYKKTATARV4WYQJLNR2WAUO2/bundle.json","state_url":"https://pith.science/pith/4AXYKKTATARV4WYQJLNR2WAUO2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4AXYKKTATARV4WYQJLNR2WAUO2/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-05-26T09:53:39Z","links":{"resolver":"https://pith.science/pith/4AXYKKTATARV4WYQJLNR2WAUO2","bundle":"https://pith.science/pith/4AXYKKTATARV4WYQJLNR2WAUO2/bundle.json","state":"https://pith.science/pith/4AXYKKTATARV4WYQJLNR2WAUO2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4AXYKKTATARV4WYQJLNR2WAUO2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:4AXYKKTATARV4WYQJLNR2WAUO2","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":"84d4890e34525594542c558fc81afb750837b15f629f8241987f3f40e6cf70ec","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2016-02-17T20:36:28Z","title_canon_sha256":"a137e8082fb3a4b075057e1cd0e73ce1c3926a2a02ae8971d003f723f8ae7d3c"},"schema_version":"1.0","source":{"id":"1602.05561","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.05561","created_at":"2026-05-18T01:12:34Z"},{"alias_kind":"arxiv_version","alias_value":"1602.05561v3","created_at":"2026-05-18T01:12:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.05561","created_at":"2026-05-18T01:12:34Z"},{"alias_kind":"pith_short_12","alias_value":"4AXYKKTATARV","created_at":"2026-05-18T12:29:58Z"},{"alias_kind":"pith_short_16","alias_value":"4AXYKKTATARV4WYQ","created_at":"2026-05-18T12:29:58Z"},{"alias_kind":"pith_short_8","alias_value":"4AXYKKTA","created_at":"2026-05-18T12:29:58Z"}],"graph_snapshots":[{"event_id":"sha256:579aa0b147ce82b208ac9814ef44814a4149563178cb6c0ab75bdbe3eeb5e338","target":"graph","created_at":"2026-05-18T01:12:34Z","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":"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","authors_text":"Bistra Dilkina, Constantine Dovrolis, Payam Siyari","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2016-02-17T20:36:28Z","title":"Lexis: An Optimization Framework for Discovering the Hierarchical Structure of Sequential Data"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.05561","kind":"arxiv","version":3},"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:7913a7d1b6d11f553105a1cdc7611cb7a68d3edced9eb49e9bf6d2598e3d8a46","target":"record","created_at":"2026-05-18T01:12:34Z","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":"84d4890e34525594542c558fc81afb750837b15f629f8241987f3f40e6cf70ec","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2016-02-17T20:36:28Z","title_canon_sha256":"a137e8082fb3a4b075057e1cd0e73ce1c3926a2a02ae8971d003f723f8ae7d3c"},"schema_version":"1.0","source":{"id":"1602.05561","kind":"arxiv","version":3}},"canonical_sha256":"e02f852a6098235e5b104adb1d5814769c0c59e60fa63f665fc54edbce320c4b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e02f852a6098235e5b104adb1d5814769c0c59e60fa63f665fc54edbce320c4b","first_computed_at":"2026-05-18T01:12:34.460372Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:12:34.460372Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"MW9SA8ZFpiO6dGbYQYJN4lp2LJAOWEieZJvIj4styh3nimXM5GSX5L6JfeOYsfLQWFicQc+c6DNaFNR8C3sPCg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:12:34.460729Z","signed_message":"canonical_sha256_bytes"},"source_id":"1602.05561","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7913a7d1b6d11f553105a1cdc7611cb7a68d3edced9eb49e9bf6d2598e3d8a46","sha256:579aa0b147ce82b208ac9814ef44814a4149563178cb6c0ab75bdbe3eeb5e338"],"state_sha256":"35466bff157236d00b10a8207f388ad12c6d9d42e506c1a610e09217d3be3922"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"R+8gewfOMtsKd/qePAUdmrPfqWJU9NHY6ANz3JAKoJ5h7wgP+jLfGz9DV16DtyCBePEvnzE6JBKgDM9vc7IZAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T09:53:39.492766Z","bundle_sha256":"9577a3cc57fd4d7cae3d910bd180683f64af24c64212f16022f51df20ee0f29e"}}