{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:37MPAJ2QX4AVRQK7W3U5QSCU23","short_pith_number":"pith:37MPAJ2Q","canonical_record":{"source":{"id":"1310.2026","kind":"arxiv","version":6},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-10-08T08:03:46Z","cross_cats_sorted":["cs.DS","math.IT"],"title_canon_sha256":"5e113fe1921c8356d776fdd420effd73ebab63574da1f86d37b42a5c4f12f191","abstract_canon_sha256":"13c8a01540871cedd33d068c951c238d25ff3a29a4691d148e744e6e612fad97"},"schema_version":"1.0"},"canonical_sha256":"dfd8f02750bf0158c15fb6e9d84854d6f3454ff5c45ecaa2da8696146518413e","source":{"kind":"arxiv","id":"1310.2026","version":6},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1310.2026","created_at":"2026-05-18T01:33:16Z"},{"alias_kind":"arxiv_version","alias_value":"1310.2026v6","created_at":"2026-05-18T01:33:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1310.2026","created_at":"2026-05-18T01:33:16Z"},{"alias_kind":"pith_short_12","alias_value":"37MPAJ2QX4AV","created_at":"2026-05-18T12:27:32Z"},{"alias_kind":"pith_short_16","alias_value":"37MPAJ2QX4AVRQK7","created_at":"2026-05-18T12:27:32Z"},{"alias_kind":"pith_short_8","alias_value":"37MPAJ2Q","created_at":"2026-05-18T12:27:32Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:37MPAJ2QX4AVRQK7W3U5QSCU23","target":"record","payload":{"canonical_record":{"source":{"id":"1310.2026","kind":"arxiv","version":6},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-10-08T08:03:46Z","cross_cats_sorted":["cs.DS","math.IT"],"title_canon_sha256":"5e113fe1921c8356d776fdd420effd73ebab63574da1f86d37b42a5c4f12f191","abstract_canon_sha256":"13c8a01540871cedd33d068c951c238d25ff3a29a4691d148e744e6e612fad97"},"schema_version":"1.0"},"canonical_sha256":"dfd8f02750bf0158c15fb6e9d84854d6f3454ff5c45ecaa2da8696146518413e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:33:16.881701Z","signature_b64":"WjLkbLAlOPQkduQK2+NUNGrcu2A9jylqjJFXFcAybp3JzKJnzf1usDVSHw6s4w9hIvIyTbOEkZ0hX4CwrRWwCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dfd8f02750bf0158c15fb6e9d84854d6f3454ff5c45ecaa2da8696146518413e","last_reissued_at":"2026-05-18T01:33:16.881100Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:33:16.881100Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1310.2026","source_version":6,"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-18T01:33:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"y2vPS5BrlTun0J/tzjGjTMIq76aMxo/s2uc3uGGaEd4Z6U4rTu3bpnvgchvioRKWd92JI4plL08cZfTmu84HDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T18:01:17.419631Z"},"content_sha256":"6607a21574de0f704a6765a28ec352975c9b07f95207ea851d7ca67c1e7f18ca","schema_version":"1.0","event_id":"sha256:6607a21574de0f704a6765a28ec352975c9b07f95207ea851d7ca67c1e7f18ca"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:37MPAJ2QX4AVRQK7W3U5QSCU23","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Low-Complexity Interactive Algorithms for Synchronization from Deletions, Insertions, and Substitutions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","math.IT"],"primary_cat":"cs.IT","authors_text":"Kannan Ramchandran, Ramji Venkataramanan, Vasuki Narasimha Swamy","submitted_at":"2013-10-08T08:03:46Z","abstract_excerpt":"Consider two remote nodes having binary sequences $X$ and $Y$, respectively. $Y$ is an edited version of ${X}$, where the editing involves random deletions, insertions, and substitutions, possibly in bursts. The goal is for the node with $Y$ to reconstruct $X$ with minimal exchange of information over a noiseless link. The communication is measured in terms of both the total number of bits exchanged and the number of interactive rounds of communication.\n  This paper focuses on the setting where the number of edits is $o(\\tfrac{n}{\\log n})$, where $n$ is the length of $X$. We first consider the"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1310.2026","kind":"arxiv","version":6},"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-18T01:33:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zc3frTJ08SHu98HzdnCVEjcfVmxc2k6tSZRyEDca1kGhexfp9rTdVCMRrQvZaJdJYK95/MLBvSt5Eu9Ns2TzBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T18:01:17.420306Z"},"content_sha256":"8fd56be272cd74cdf15250a207b09db96dc67da1b1ea40504c4328e7facebabc","schema_version":"1.0","event_id":"sha256:8fd56be272cd74cdf15250a207b09db96dc67da1b1ea40504c4328e7facebabc"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/37MPAJ2QX4AVRQK7W3U5QSCU23/bundle.json","state_url":"https://pith.science/pith/37MPAJ2QX4AVRQK7W3U5QSCU23/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/37MPAJ2QX4AVRQK7W3U5QSCU23/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-08T18:01:17Z","links":{"resolver":"https://pith.science/pith/37MPAJ2QX4AVRQK7W3U5QSCU23","bundle":"https://pith.science/pith/37MPAJ2QX4AVRQK7W3U5QSCU23/bundle.json","state":"https://pith.science/pith/37MPAJ2QX4AVRQK7W3U5QSCU23/state.json","well_known_bundle":"https://pith.science/.well-known/pith/37MPAJ2QX4AVRQK7W3U5QSCU23/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:37MPAJ2QX4AVRQK7W3U5QSCU23","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":"13c8a01540871cedd33d068c951c238d25ff3a29a4691d148e744e6e612fad97","cross_cats_sorted":["cs.DS","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-10-08T08:03:46Z","title_canon_sha256":"5e113fe1921c8356d776fdd420effd73ebab63574da1f86d37b42a5c4f12f191"},"schema_version":"1.0","source":{"id":"1310.2026","kind":"arxiv","version":6}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1310.2026","created_at":"2026-05-18T01:33:16Z"},{"alias_kind":"arxiv_version","alias_value":"1310.2026v6","created_at":"2026-05-18T01:33:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1310.2026","created_at":"2026-05-18T01:33:16Z"},{"alias_kind":"pith_short_12","alias_value":"37MPAJ2QX4AV","created_at":"2026-05-18T12:27:32Z"},{"alias_kind":"pith_short_16","alias_value":"37MPAJ2QX4AVRQK7","created_at":"2026-05-18T12:27:32Z"},{"alias_kind":"pith_short_8","alias_value":"37MPAJ2Q","created_at":"2026-05-18T12:27:32Z"}],"graph_snapshots":[{"event_id":"sha256:8fd56be272cd74cdf15250a207b09db96dc67da1b1ea40504c4328e7facebabc","target":"graph","created_at":"2026-05-18T01:33: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":"Consider two remote nodes having binary sequences $X$ and $Y$, respectively. $Y$ is an edited version of ${X}$, where the editing involves random deletions, insertions, and substitutions, possibly in bursts. The goal is for the node with $Y$ to reconstruct $X$ with minimal exchange of information over a noiseless link. The communication is measured in terms of both the total number of bits exchanged and the number of interactive rounds of communication.\n  This paper focuses on the setting where the number of edits is $o(\\tfrac{n}{\\log n})$, where $n$ is the length of $X$. We first consider the","authors_text":"Kannan Ramchandran, Ramji Venkataramanan, Vasuki Narasimha Swamy","cross_cats":["cs.DS","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-10-08T08:03:46Z","title":"Low-Complexity Interactive Algorithms for Synchronization from Deletions, Insertions, and Substitutions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1310.2026","kind":"arxiv","version":6},"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:6607a21574de0f704a6765a28ec352975c9b07f95207ea851d7ca67c1e7f18ca","target":"record","created_at":"2026-05-18T01:33: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":"13c8a01540871cedd33d068c951c238d25ff3a29a4691d148e744e6e612fad97","cross_cats_sorted":["cs.DS","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-10-08T08:03:46Z","title_canon_sha256":"5e113fe1921c8356d776fdd420effd73ebab63574da1f86d37b42a5c4f12f191"},"schema_version":"1.0","source":{"id":"1310.2026","kind":"arxiv","version":6}},"canonical_sha256":"dfd8f02750bf0158c15fb6e9d84854d6f3454ff5c45ecaa2da8696146518413e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"dfd8f02750bf0158c15fb6e9d84854d6f3454ff5c45ecaa2da8696146518413e","first_computed_at":"2026-05-18T01:33:16.881100Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:33:16.881100Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"WjLkbLAlOPQkduQK2+NUNGrcu2A9jylqjJFXFcAybp3JzKJnzf1usDVSHw6s4w9hIvIyTbOEkZ0hX4CwrRWwCw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:33:16.881701Z","signed_message":"canonical_sha256_bytes"},"source_id":"1310.2026","source_kind":"arxiv","source_version":6}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6607a21574de0f704a6765a28ec352975c9b07f95207ea851d7ca67c1e7f18ca","sha256:8fd56be272cd74cdf15250a207b09db96dc67da1b1ea40504c4328e7facebabc"],"state_sha256":"c635499aa931848f058d2f566a48e4825b300922e312afcf0773a70daa1e5653"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mt1jrH/hrdc/WTfklePWnoq+oj+Obqc0r4tQe24cUUwlX1AfBySXK7haBQ4JNEGDujvTDiNt88T2bv/B8FEbBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T18:01:17.424048Z","bundle_sha256":"db3136ec9737751bab3f9e2c30555a2accff58c3e87c54d729b7f0ac5f9d8b20"}}