{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2009:743HNEMH4IJ7OXOYCZPD3HQLHM","short_pith_number":"pith:743HNEMH","schema_version":"1.0","canonical_sha256":"ff36769187e213f75dd8165e3d9e0b3b0c62e0ebce614ac08cdcf5e4f049b373","source":{"kind":"arxiv","id":"0905.2386","version":5},"attestation_state":"computed","paper":{"title":"Combinatorial information distance","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"cs.DM","authors_text":"Joel Ratsaby","submitted_at":"2009-05-14T17:44:39Z","abstract_excerpt":"Let $|A|$ denote the cardinality of a finite set $A$. For any real number $x$ define $t(x)=x$ if $x\\geq1$ and 1 otherwise. For any finite sets $A,B$ let $\\delta(A,B)$ $=$ $\\log_{2}(t(|B\\cap\\bar{A}||A|))$. We define {This appears as Technical Report # arXiv:0905.2386v4. A shorter version appears in the {Proc. of Mini-Conference on Applied Theoretical Computer Science (MATCOS-10)}, Slovenia, Oct. 13-14, 2010.} a new cobinatorial distance $d(A,B)$ $=$ $\\max\\{\\delta(A,B),\\delta(B,A)\\} $ which may be applied to measure the distance between binary strings of different lengths. The distance is based "},"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":"0905.2386","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2009-05-14T17:44:39Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"02f4a03d8094c66b84d3a063c36f965a432187a75bd10967ee3a4478c2d7bb0e","abstract_canon_sha256":"89a42e97318e964cd42445900726db78f2eba525341fff1ce7d3b43c9e8582b5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:39:16.935049Z","signature_b64":"aSKU8oUSqrYuu1BH4uDqafwi377WGe8Zrh5DPfPGOyCcKheMO0b9RpJDvwFzvY65waYVadePC+NEGv7YgZMBBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ff36769187e213f75dd8165e3d9e0b3b0c62e0ebce614ac08cdcf5e4f049b373","last_reissued_at":"2026-05-18T04:39:16.934360Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:39:16.934360Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Combinatorial information distance","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"cs.DM","authors_text":"Joel Ratsaby","submitted_at":"2009-05-14T17:44:39Z","abstract_excerpt":"Let $|A|$ denote the cardinality of a finite set $A$. For any real number $x$ define $t(x)=x$ if $x\\geq1$ and 1 otherwise. For any finite sets $A,B$ let $\\delta(A,B)$ $=$ $\\log_{2}(t(|B\\cap\\bar{A}||A|))$. We define {This appears as Technical Report # arXiv:0905.2386v4. A shorter version appears in the {Proc. of Mini-Conference on Applied Theoretical Computer Science (MATCOS-10)}, Slovenia, Oct. 13-14, 2010.} a new cobinatorial distance $d(A,B)$ $=$ $\\max\\{\\delta(A,B),\\delta(B,A)\\} $ which may be applied to measure the distance between binary strings of different lengths. The distance is based "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0905.2386","kind":"arxiv","version":5},"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":"0905.2386","created_at":"2026-05-18T04:39:16.934461+00:00"},{"alias_kind":"arxiv_version","alias_value":"0905.2386v5","created_at":"2026-05-18T04:39:16.934461+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0905.2386","created_at":"2026-05-18T04:39:16.934461+00:00"},{"alias_kind":"pith_short_12","alias_value":"743HNEMH4IJ7","created_at":"2026-05-18T12:25:58.837520+00:00"},{"alias_kind":"pith_short_16","alias_value":"743HNEMH4IJ7OXOY","created_at":"2026-05-18T12:25:58.837520+00:00"},{"alias_kind":"pith_short_8","alias_value":"743HNEMH","created_at":"2026-05-18T12:25:58.837520+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/743HNEMH4IJ7OXOYCZPD3HQLHM","json":"https://pith.science/pith/743HNEMH4IJ7OXOYCZPD3HQLHM.json","graph_json":"https://pith.science/api/pith-number/743HNEMH4IJ7OXOYCZPD3HQLHM/graph.json","events_json":"https://pith.science/api/pith-number/743HNEMH4IJ7OXOYCZPD3HQLHM/events.json","paper":"https://pith.science/paper/743HNEMH"},"agent_actions":{"view_html":"https://pith.science/pith/743HNEMH4IJ7OXOYCZPD3HQLHM","download_json":"https://pith.science/pith/743HNEMH4IJ7OXOYCZPD3HQLHM.json","view_paper":"https://pith.science/paper/743HNEMH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0905.2386&json=true","fetch_graph":"https://pith.science/api/pith-number/743HNEMH4IJ7OXOYCZPD3HQLHM/graph.json","fetch_events":"https://pith.science/api/pith-number/743HNEMH4IJ7OXOYCZPD3HQLHM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/743HNEMH4IJ7OXOYCZPD3HQLHM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/743HNEMH4IJ7OXOYCZPD3HQLHM/action/storage_attestation","attest_author":"https://pith.science/pith/743HNEMH4IJ7OXOYCZPD3HQLHM/action/author_attestation","sign_citation":"https://pith.science/pith/743HNEMH4IJ7OXOYCZPD3HQLHM/action/citation_signature","submit_replication":"https://pith.science/pith/743HNEMH4IJ7OXOYCZPD3HQLHM/action/replication_record"}},"created_at":"2026-05-18T04:39:16.934461+00:00","updated_at":"2026-05-18T04:39:16.934461+00:00"}