{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:RI6VOK23DOSC5TQ2YJ636JZEK3","short_pith_number":"pith:RI6VOK23","canonical_record":{"source":{"id":"1202.0865","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-02-04T03:33:58Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"15f7478cc617693f17ec572025c9d6e7a158617efe88f62b946768fc8f592b07","abstract_canon_sha256":"52eb9f7668dde56a5775a37eff83aafd2582243d3bfcc2809833c4b6c59e8152"},"schema_version":"1.0"},"canonical_sha256":"8a3d572b5b1ba42ece1ac27dbf272456d0f0330d6114d2335558ff7e035a56db","source":{"kind":"arxiv","id":"1202.0865","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1202.0865","created_at":"2026-05-18T00:59:09Z"},{"alias_kind":"arxiv_version","alias_value":"1202.0865v1","created_at":"2026-05-18T00:59:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1202.0865","created_at":"2026-05-18T00:59:09Z"},{"alias_kind":"pith_short_12","alias_value":"RI6VOK23DOSC","created_at":"2026-05-18T12:27:20Z"},{"alias_kind":"pith_short_16","alias_value":"RI6VOK23DOSC5TQ2","created_at":"2026-05-18T12:27:20Z"},{"alias_kind":"pith_short_8","alias_value":"RI6VOK23","created_at":"2026-05-18T12:27:20Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:RI6VOK23DOSC5TQ2YJ636JZEK3","target":"record","payload":{"canonical_record":{"source":{"id":"1202.0865","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-02-04T03:33:58Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"15f7478cc617693f17ec572025c9d6e7a158617efe88f62b946768fc8f592b07","abstract_canon_sha256":"52eb9f7668dde56a5775a37eff83aafd2582243d3bfcc2809833c4b6c59e8152"},"schema_version":"1.0"},"canonical_sha256":"8a3d572b5b1ba42ece1ac27dbf272456d0f0330d6114d2335558ff7e035a56db","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:59:09.882715Z","signature_b64":"GuIZ1GgEj1t4OpfPlsfiLI3Oei9pYlFmMAZrJniW9J+5+bCuGWShEACg6Q4LgayqMuK3ecXhhXuczb2U9kC8BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8a3d572b5b1ba42ece1ac27dbf272456d0f0330d6114d2335558ff7e035a56db","last_reissued_at":"2026-05-18T00:59:09.881995Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:59:09.881995Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1202.0865","source_version":1,"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-18T00:59:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/FTf/CyjH7qe6gZ4kcgozgJM7O39BCA+f8clxUrsiTL3gZf4dDivwiyaeYbkaYRkGiLJtMjYi4iiPuxCy4FeBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T20:29:39.032732Z"},"content_sha256":"4ba889b8e78610265f104b6b5e0a836ae429e2730e183087e78b07cb3f2f561f","schema_version":"1.0","event_id":"sha256:4ba889b8e78610265f104b6b5e0a836ae429e2730e183087e78b07cb3f2f561f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:RI6VOK23DOSC5TQ2YJ636JZEK3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Compression Algorithm Using Mis-aligned Side-information","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"David Tse, Kannan Ramchandran, Nan Ma","submitted_at":"2012-02-04T03:33:58Z","abstract_excerpt":"We study the problem of compressing a source sequence in the presence of side-information that is related to the source via insertions, deletions and substitutions. We propose a simple algorithm to compress the source sequence when the side-information is present at both the encoder and decoder. A key attribute of the algorithm is that it encodes the edits contained in runs of different extents separately. For small insertion and deletion probabilities, the compression rate of the algorithm is shown to be asymptotically optimal."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1202.0865","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"},"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-18T00:59:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TapLAmex3Y+IJoy6qLdgbYDcS13mIx1ARS+lBCd1srHKJkhGLIVnzYL1UA36XztlD/uBjIxsieJQBX46EWgHDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T20:29:39.033373Z"},"content_sha256":"d7d0535b1c71de5564bf8f9d9f5ee9fdb660c6e96a2646d76c7bee78d189352f","schema_version":"1.0","event_id":"sha256:d7d0535b1c71de5564bf8f9d9f5ee9fdb660c6e96a2646d76c7bee78d189352f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RI6VOK23DOSC5TQ2YJ636JZEK3/bundle.json","state_url":"https://pith.science/pith/RI6VOK23DOSC5TQ2YJ636JZEK3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RI6VOK23DOSC5TQ2YJ636JZEK3/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-28T20:29:39Z","links":{"resolver":"https://pith.science/pith/RI6VOK23DOSC5TQ2YJ636JZEK3","bundle":"https://pith.science/pith/RI6VOK23DOSC5TQ2YJ636JZEK3/bundle.json","state":"https://pith.science/pith/RI6VOK23DOSC5TQ2YJ636JZEK3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RI6VOK23DOSC5TQ2YJ636JZEK3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:RI6VOK23DOSC5TQ2YJ636JZEK3","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":"52eb9f7668dde56a5775a37eff83aafd2582243d3bfcc2809833c4b6c59e8152","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-02-04T03:33:58Z","title_canon_sha256":"15f7478cc617693f17ec572025c9d6e7a158617efe88f62b946768fc8f592b07"},"schema_version":"1.0","source":{"id":"1202.0865","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1202.0865","created_at":"2026-05-18T00:59:09Z"},{"alias_kind":"arxiv_version","alias_value":"1202.0865v1","created_at":"2026-05-18T00:59:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1202.0865","created_at":"2026-05-18T00:59:09Z"},{"alias_kind":"pith_short_12","alias_value":"RI6VOK23DOSC","created_at":"2026-05-18T12:27:20Z"},{"alias_kind":"pith_short_16","alias_value":"RI6VOK23DOSC5TQ2","created_at":"2026-05-18T12:27:20Z"},{"alias_kind":"pith_short_8","alias_value":"RI6VOK23","created_at":"2026-05-18T12:27:20Z"}],"graph_snapshots":[{"event_id":"sha256:d7d0535b1c71de5564bf8f9d9f5ee9fdb660c6e96a2646d76c7bee78d189352f","target":"graph","created_at":"2026-05-18T00:59:09Z","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":"We study the problem of compressing a source sequence in the presence of side-information that is related to the source via insertions, deletions and substitutions. We propose a simple algorithm to compress the source sequence when the side-information is present at both the encoder and decoder. A key attribute of the algorithm is that it encodes the edits contained in runs of different extents separately. For small insertion and deletion probabilities, the compression rate of the algorithm is shown to be asymptotically optimal.","authors_text":"David Tse, Kannan Ramchandran, Nan Ma","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-02-04T03:33:58Z","title":"A Compression Algorithm Using Mis-aligned Side-information"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1202.0865","kind":"arxiv","version":1},"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:4ba889b8e78610265f104b6b5e0a836ae429e2730e183087e78b07cb3f2f561f","target":"record","created_at":"2026-05-18T00:59:09Z","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":"52eb9f7668dde56a5775a37eff83aafd2582243d3bfcc2809833c4b6c59e8152","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-02-04T03:33:58Z","title_canon_sha256":"15f7478cc617693f17ec572025c9d6e7a158617efe88f62b946768fc8f592b07"},"schema_version":"1.0","source":{"id":"1202.0865","kind":"arxiv","version":1}},"canonical_sha256":"8a3d572b5b1ba42ece1ac27dbf272456d0f0330d6114d2335558ff7e035a56db","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8a3d572b5b1ba42ece1ac27dbf272456d0f0330d6114d2335558ff7e035a56db","first_computed_at":"2026-05-18T00:59:09.881995Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:59:09.881995Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"GuIZ1GgEj1t4OpfPlsfiLI3Oei9pYlFmMAZrJniW9J+5+bCuGWShEACg6Q4LgayqMuK3ecXhhXuczb2U9kC8BQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:59:09.882715Z","signed_message":"canonical_sha256_bytes"},"source_id":"1202.0865","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4ba889b8e78610265f104b6b5e0a836ae429e2730e183087e78b07cb3f2f561f","sha256:d7d0535b1c71de5564bf8f9d9f5ee9fdb660c6e96a2646d76c7bee78d189352f"],"state_sha256":"d9cc12c1cb8e20fef7306399dd4eb707af5f69c6a88f83379e6d349f0098324d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"w/+9coApL+OddDBG3zw3hLWnRZWSDhaa3zmADVIWZfJ09Whn2uTIDdxZME2xgL2JoqIEpftnVTkHnmMeAS2vBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T20:29:39.036595Z","bundle_sha256":"5e7c1c0a8ae9773a36980191def87ce69fd4e2621fc70ebb19fb50e5d792688e"}}