{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:KX73OYWFXZG33S7EKYINCFNDXC","short_pith_number":"pith:KX73OYWF","schema_version":"1.0","canonical_sha256":"55ffb762c5be4dbdcbe45610d115a3b89882c99c12e2897e6776b961e82fedf5","source":{"kind":"arxiv","id":"1006.1315","version":1},"attestation_state":"computed","paper":{"title":"Counting dependent and independent strings","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Marius Zimand","submitted_at":"2010-06-07T18:21:10Z","abstract_excerpt":"The paper gives estimations for the sizes of the the following sets: (1) the set of strings that have a given dependency with a fixed string, (2) the set of strings that are pairwise \\alpha independent, (3) the set of strings that are mutually \\alpha independent. The relevant definitions are as follows: C(x) is the Kolmogorov complexity of the string x. A string y has \\alpha -dependency with a string x if C(y) - C(y|x) \\geq \\alpha. A set of strings {x_1, \\ldots, x_t} is pairwise \\alpha-independent if for all i different from j, C(x_i) - C(x_i | x_j) \\leq \\alpha. A tuple of strings (x_1, \\ldots"},"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":"1006.1315","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2010-06-07T18:21:10Z","cross_cats_sorted":[],"title_canon_sha256":"ad4e0785fbe36c9fd4efae3821ad14982661744720e0a6ce00f5a2a4a12d9186","abstract_canon_sha256":"d5439a8a9c2db771e9120b2d812173329685b48fd353af1bb130ca53d2a96009"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:06:56.571828Z","signature_b64":"ktZPUcuLpa792x4XzCG9aEwIpXklL1k34q8DaW3LhX5eysDmjubUvGhPbQGVlDY3mKS34Goh0w5aN4i6uuXkBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"55ffb762c5be4dbdcbe45610d115a3b89882c99c12e2897e6776b961e82fedf5","last_reissued_at":"2026-05-18T02:06:56.571045Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:06:56.571045Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Counting dependent and independent strings","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Marius Zimand","submitted_at":"2010-06-07T18:21:10Z","abstract_excerpt":"The paper gives estimations for the sizes of the the following sets: (1) the set of strings that have a given dependency with a fixed string, (2) the set of strings that are pairwise \\alpha independent, (3) the set of strings that are mutually \\alpha independent. The relevant definitions are as follows: C(x) is the Kolmogorov complexity of the string x. A string y has \\alpha -dependency with a string x if C(y) - C(y|x) \\geq \\alpha. A set of strings {x_1, \\ldots, x_t} is pairwise \\alpha-independent if for all i different from j, C(x_i) - C(x_i | x_j) \\leq \\alpha. A tuple of strings (x_1, \\ldots"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1006.1315","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":"1006.1315","created_at":"2026-05-18T02:06:56.571168+00:00"},{"alias_kind":"arxiv_version","alias_value":"1006.1315v1","created_at":"2026-05-18T02:06:56.571168+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1006.1315","created_at":"2026-05-18T02:06:56.571168+00:00"},{"alias_kind":"pith_short_12","alias_value":"KX73OYWFXZG3","created_at":"2026-05-18T12:26:09.077623+00:00"},{"alias_kind":"pith_short_16","alias_value":"KX73OYWFXZG33S7E","created_at":"2026-05-18T12:26:09.077623+00:00"},{"alias_kind":"pith_short_8","alias_value":"KX73OYWF","created_at":"2026-05-18T12:26:09.077623+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/KX73OYWFXZG33S7EKYINCFNDXC","json":"https://pith.science/pith/KX73OYWFXZG33S7EKYINCFNDXC.json","graph_json":"https://pith.science/api/pith-number/KX73OYWFXZG33S7EKYINCFNDXC/graph.json","events_json":"https://pith.science/api/pith-number/KX73OYWFXZG33S7EKYINCFNDXC/events.json","paper":"https://pith.science/paper/KX73OYWF"},"agent_actions":{"view_html":"https://pith.science/pith/KX73OYWFXZG33S7EKYINCFNDXC","download_json":"https://pith.science/pith/KX73OYWFXZG33S7EKYINCFNDXC.json","view_paper":"https://pith.science/paper/KX73OYWF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1006.1315&json=true","fetch_graph":"https://pith.science/api/pith-number/KX73OYWFXZG33S7EKYINCFNDXC/graph.json","fetch_events":"https://pith.science/api/pith-number/KX73OYWFXZG33S7EKYINCFNDXC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KX73OYWFXZG33S7EKYINCFNDXC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KX73OYWFXZG33S7EKYINCFNDXC/action/storage_attestation","attest_author":"https://pith.science/pith/KX73OYWFXZG33S7EKYINCFNDXC/action/author_attestation","sign_citation":"https://pith.science/pith/KX73OYWFXZG33S7EKYINCFNDXC/action/citation_signature","submit_replication":"https://pith.science/pith/KX73OYWFXZG33S7EKYINCFNDXC/action/replication_record"}},"created_at":"2026-05-18T02:06:56.571168+00:00","updated_at":"2026-05-18T02:06:56.571168+00:00"}