{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2009:743HNEMH4IJ7OXOYCZPD3HQLHM","short_pith_number":"pith:743HNEMH","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"},"canonical_sha256":"ff36769187e213f75dd8165e3d9e0b3b0c62e0ebce614ac08cdcf5e4f049b373","source":{"kind":"arxiv","id":"0905.2386","version":5},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0905.2386","created_at":"2026-05-18T04:39:16Z"},{"alias_kind":"arxiv_version","alias_value":"0905.2386v5","created_at":"2026-05-18T04:39:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0905.2386","created_at":"2026-05-18T04:39:16Z"},{"alias_kind":"pith_short_12","alias_value":"743HNEMH4IJ7","created_at":"2026-05-18T12:25:58Z"},{"alias_kind":"pith_short_16","alias_value":"743HNEMH4IJ7OXOY","created_at":"2026-05-18T12:25:58Z"},{"alias_kind":"pith_short_8","alias_value":"743HNEMH","created_at":"2026-05-18T12:25:58Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2009:743HNEMH4IJ7OXOYCZPD3HQLHM","target":"record","payload":{"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"},"canonical_sha256":"ff36769187e213f75dd8165e3d9e0b3b0c62e0ebce614ac08cdcf5e4f049b373","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"},"source_kind":"arxiv","source_id":"0905.2386","source_version":5,"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-18T04:39:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mLGpiBjceA6G7yzdaGTp0eFe8cgQMgIrxS4DSmI7B9YGMpAdj2AEqx5bAlfcx+gpaBZVE15PWp2XZ+0HKVGFBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T16:44:26.721161Z"},"content_sha256":"f0981075a66815591e471694ba7617a8e04ebdfa50415f0be1469042bff85cab","schema_version":"1.0","event_id":"sha256:f0981075a66815591e471694ba7617a8e04ebdfa50415f0be1469042bff85cab"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2009:743HNEMH4IJ7OXOYCZPD3HQLHM","target":"graph","payload":{"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"},"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-18T04:39:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cQfHQX4VOmbb3a70SfqBnH6uL1u19oRgkW8Rq8mEEuvlYoI5p5ktYd+VfhHclvJp283Tsd1HD3wEB7BK8Gi6CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T16:44:26.721508Z"},"content_sha256":"232ab0a198a9d38193ef96e3296e7cc3ef9787153f9baaea375b43853b026f98","schema_version":"1.0","event_id":"sha256:232ab0a198a9d38193ef96e3296e7cc3ef9787153f9baaea375b43853b026f98"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/743HNEMH4IJ7OXOYCZPD3HQLHM/bundle.json","state_url":"https://pith.science/pith/743HNEMH4IJ7OXOYCZPD3HQLHM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/743HNEMH4IJ7OXOYCZPD3HQLHM/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-06-01T16:44:26Z","links":{"resolver":"https://pith.science/pith/743HNEMH4IJ7OXOYCZPD3HQLHM","bundle":"https://pith.science/pith/743HNEMH4IJ7OXOYCZPD3HQLHM/bundle.json","state":"https://pith.science/pith/743HNEMH4IJ7OXOYCZPD3HQLHM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/743HNEMH4IJ7OXOYCZPD3HQLHM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2009:743HNEMH4IJ7OXOYCZPD3HQLHM","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":"89a42e97318e964cd42445900726db78f2eba525341fff1ce7d3b43c9e8582b5","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2009-05-14T17:44:39Z","title_canon_sha256":"02f4a03d8094c66b84d3a063c36f965a432187a75bd10967ee3a4478c2d7bb0e"},"schema_version":"1.0","source":{"id":"0905.2386","kind":"arxiv","version":5}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0905.2386","created_at":"2026-05-18T04:39:16Z"},{"alias_kind":"arxiv_version","alias_value":"0905.2386v5","created_at":"2026-05-18T04:39:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0905.2386","created_at":"2026-05-18T04:39:16Z"},{"alias_kind":"pith_short_12","alias_value":"743HNEMH4IJ7","created_at":"2026-05-18T12:25:58Z"},{"alias_kind":"pith_short_16","alias_value":"743HNEMH4IJ7OXOY","created_at":"2026-05-18T12:25:58Z"},{"alias_kind":"pith_short_8","alias_value":"743HNEMH","created_at":"2026-05-18T12:25:58Z"}],"graph_snapshots":[{"event_id":"sha256:232ab0a198a9d38193ef96e3296e7cc3ef9787153f9baaea375b43853b026f98","target":"graph","created_at":"2026-05-18T04:39:16Z","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":"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 ","authors_text":"Joel Ratsaby","cross_cats":["cs.IT","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2009-05-14T17:44:39Z","title":"Combinatorial information distance"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0905.2386","kind":"arxiv","version":5},"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:f0981075a66815591e471694ba7617a8e04ebdfa50415f0be1469042bff85cab","target":"record","created_at":"2026-05-18T04:39:16Z","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":"89a42e97318e964cd42445900726db78f2eba525341fff1ce7d3b43c9e8582b5","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2009-05-14T17:44:39Z","title_canon_sha256":"02f4a03d8094c66b84d3a063c36f965a432187a75bd10967ee3a4478c2d7bb0e"},"schema_version":"1.0","source":{"id":"0905.2386","kind":"arxiv","version":5}},"canonical_sha256":"ff36769187e213f75dd8165e3d9e0b3b0c62e0ebce614ac08cdcf5e4f049b373","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ff36769187e213f75dd8165e3d9e0b3b0c62e0ebce614ac08cdcf5e4f049b373","first_computed_at":"2026-05-18T04:39:16.934360Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:39:16.934360Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"aSKU8oUSqrYuu1BH4uDqafwi377WGe8Zrh5DPfPGOyCcKheMO0b9RpJDvwFzvY65waYVadePC+NEGv7YgZMBBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T04:39:16.935049Z","signed_message":"canonical_sha256_bytes"},"source_id":"0905.2386","source_kind":"arxiv","source_version":5}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f0981075a66815591e471694ba7617a8e04ebdfa50415f0be1469042bff85cab","sha256:232ab0a198a9d38193ef96e3296e7cc3ef9787153f9baaea375b43853b026f98"],"state_sha256":"c14e9d888067516fcb97c6ceeaf961079c91e79fab6f83ca1a455d1335571dda"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2ZQkBdjIqg/ko38Q3sU3penmGPCtkdoG1Tju78RKlcutg1fcue57Qc1yyXClPbOLl7KFTFPC8m8RNjGAOoXECg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T16:44:26.723199Z","bundle_sha256":"da7edd28a99b86f82cdf3982f5153cbea046c89123544e1b00e144fdd3a2789d"}}