{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:MPBH3SWFEYJHCWPMQLDOTPMA7I","short_pith_number":"pith:MPBH3SWF","schema_version":"1.0","canonical_sha256":"63c27dcac526127159ec82c6e9bd80fa3cf095bc336c23ceba35170b6ec86593","source":{"kind":"arxiv","id":"1805.09025","version":1},"attestation_state":"computed","paper":{"title":"Joint String Complexity for Markov Sources: Small Data Matters","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Dimitris Milioris, Philippe Jacquet, Wojciech Szpankowski","submitted_at":"2018-05-23T09:25:40Z","abstract_excerpt":"String complexity is defined as the cardinality of a set of all distinct words (factors) of a given string. For two strings, we introduce the joint string complexity as the cardinality of a set of words that are common to both strings. String complexity finds a number of applications from capturing the richness of a language to finding similarities between two genome sequences. In this paper we analyze the joint string complexity when both strings are generated by Markov sources. We prove that the joint string complexity grows linearly (in terms of the string lengths) when both sources are sta"},"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":"1805.09025","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-05-23T09:25:40Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"616e913e71c5890cf40e4408c8c2ebf716355ce7307c0db5ef66a60fa1d2de0b","abstract_canon_sha256":"7f0c78c0d1b046ad7791f08c1b085f52ecfcef9d37e533286c604756fb233d20"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:15:08.735972Z","signature_b64":"CIiWBOkLdQvvmAwo/Dy3G2tllxIicXFY15k5O/7KHZ6K8MnM2JsqskMnjt4I+8RFP+zZab0vihvZpb3nm78JCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"63c27dcac526127159ec82c6e9bd80fa3cf095bc336c23ceba35170b6ec86593","last_reissued_at":"2026-05-18T00:15:08.735430Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:15:08.735430Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Joint String Complexity for Markov Sources: Small Data Matters","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Dimitris Milioris, Philippe Jacquet, Wojciech Szpankowski","submitted_at":"2018-05-23T09:25:40Z","abstract_excerpt":"String complexity is defined as the cardinality of a set of all distinct words (factors) of a given string. For two strings, we introduce the joint string complexity as the cardinality of a set of words that are common to both strings. String complexity finds a number of applications from capturing the richness of a language to finding similarities between two genome sequences. In this paper we analyze the joint string complexity when both strings are generated by Markov sources. We prove that the joint string complexity grows linearly (in terms of the string lengths) when both sources are sta"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.09025","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":"1805.09025","created_at":"2026-05-18T00:15:08.735506+00:00"},{"alias_kind":"arxiv_version","alias_value":"1805.09025v1","created_at":"2026-05-18T00:15:08.735506+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.09025","created_at":"2026-05-18T00:15:08.735506+00:00"},{"alias_kind":"pith_short_12","alias_value":"MPBH3SWFEYJH","created_at":"2026-05-18T12:32:37.024351+00:00"},{"alias_kind":"pith_short_16","alias_value":"MPBH3SWFEYJHCWPM","created_at":"2026-05-18T12:32:37.024351+00:00"},{"alias_kind":"pith_short_8","alias_value":"MPBH3SWF","created_at":"2026-05-18T12:32:37.024351+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/MPBH3SWFEYJHCWPMQLDOTPMA7I","json":"https://pith.science/pith/MPBH3SWFEYJHCWPMQLDOTPMA7I.json","graph_json":"https://pith.science/api/pith-number/MPBH3SWFEYJHCWPMQLDOTPMA7I/graph.json","events_json":"https://pith.science/api/pith-number/MPBH3SWFEYJHCWPMQLDOTPMA7I/events.json","paper":"https://pith.science/paper/MPBH3SWF"},"agent_actions":{"view_html":"https://pith.science/pith/MPBH3SWFEYJHCWPMQLDOTPMA7I","download_json":"https://pith.science/pith/MPBH3SWFEYJHCWPMQLDOTPMA7I.json","view_paper":"https://pith.science/paper/MPBH3SWF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1805.09025&json=true","fetch_graph":"https://pith.science/api/pith-number/MPBH3SWFEYJHCWPMQLDOTPMA7I/graph.json","fetch_events":"https://pith.science/api/pith-number/MPBH3SWFEYJHCWPMQLDOTPMA7I/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MPBH3SWFEYJHCWPMQLDOTPMA7I/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MPBH3SWFEYJHCWPMQLDOTPMA7I/action/storage_attestation","attest_author":"https://pith.science/pith/MPBH3SWFEYJHCWPMQLDOTPMA7I/action/author_attestation","sign_citation":"https://pith.science/pith/MPBH3SWFEYJHCWPMQLDOTPMA7I/action/citation_signature","submit_replication":"https://pith.science/pith/MPBH3SWFEYJHCWPMQLDOTPMA7I/action/replication_record"}},"created_at":"2026-05-18T00:15:08.735506+00:00","updated_at":"2026-05-18T00:15:08.735506+00:00"}