{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:N4ZTMW6L6URULGNOJP642HH2RW","short_pith_number":"pith:N4ZTMW6L","canonical_record":{"source":{"id":"2606.05454","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2026-06-03T21:23:45Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"e86b3c15ab5afd4b9b089c049122a69c29c163e4b5c1199c2c509796596bf903","abstract_canon_sha256":"eb4996cdabe86018bf7418a3a2588a74dcc4576933ac50529266f8ed710d8874"},"schema_version":"1.0"},"canonical_sha256":"6f33365bcbf5234599ae4bfdcd1cfa8d87ef617799f743b1480cacc6557ee9e1","source":{"kind":"arxiv","id":"2606.05454","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.05454","created_at":"2026-06-05T00:13:58Z"},{"alias_kind":"arxiv_version","alias_value":"2606.05454v1","created_at":"2026-06-05T00:13:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.05454","created_at":"2026-06-05T00:13:58Z"},{"alias_kind":"pith_short_12","alias_value":"N4ZTMW6L6URU","created_at":"2026-06-05T00:13:58Z"},{"alias_kind":"pith_short_16","alias_value":"N4ZTMW6L6URULGNO","created_at":"2026-06-05T00:13:58Z"},{"alias_kind":"pith_short_8","alias_value":"N4ZTMW6L","created_at":"2026-06-05T00:13:58Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:N4ZTMW6L6URULGNOJP642HH2RW","target":"record","payload":{"canonical_record":{"source":{"id":"2606.05454","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2026-06-03T21:23:45Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"e86b3c15ab5afd4b9b089c049122a69c29c163e4b5c1199c2c509796596bf903","abstract_canon_sha256":"eb4996cdabe86018bf7418a3a2588a74dcc4576933ac50529266f8ed710d8874"},"schema_version":"1.0"},"canonical_sha256":"6f33365bcbf5234599ae4bfdcd1cfa8d87ef617799f743b1480cacc6557ee9e1","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-05T00:13:58.388853Z","signature_b64":"nb3T3rmPKTnmW2QqVRKD5/nbL73Wyb3eMhd49NW39JcNTuIJd6Y951fzwhHt8gvJvvqhkBDdEz9xkO1c5shGDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6f33365bcbf5234599ae4bfdcd1cfa8d87ef617799f743b1480cacc6557ee9e1","last_reissued_at":"2026-06-05T00:13:58.388430Z","signature_status":"signed_v1","first_computed_at":"2026-06-05T00:13:58.388430Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2606.05454","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-06-05T00:13:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Sxpy1zakEfE3SURqMnbmooDXwY7BG/eM1R9XhfI5MnOoX0CvJy13YljgGzfRtwpVQ1VxXMDDO99NxRT4+1cUCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T20:51:57.047136Z"},"content_sha256":"b352dacee863fbb45e11e108783b955fd7299bb2eab0a0513481e729bcc1efab","schema_version":"1.0","event_id":"sha256:b352dacee863fbb45e11e108783b955fd7299bb2eab0a0513481e729bcc1efab"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:N4ZTMW6L6URULGNOJP642HH2RW","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Sequence Reconstruction for Substitution Channel: New Sufficient Conditions and Algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Chen Wang, Eitan Yaakobi, Yiwei Zhang","submitted_at":"2026-06-03T21:23:45Z","abstract_excerpt":"In the sequence reconstruction problem, a codeword $\\x$ is transmitted through several identical channels where each channel produces a noisy read of $\\x$, and the problem is to analyze how to uniquely reconstruct $\\x$ based on these noisy reads. Levenshtein has studied the minimum number of reads which guarantees unique reconstruction of $\\x$, which is one sufficient condition for unique reconstruction. In this paper, we move on to a different perspective and propose a new framework for unique reconstruction. Our new sufficient condition for unique reconstruction takes both the number of read"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.05454","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2606.05454/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-06-05T00:13:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vfxQ4i7h5iQic/c4fJkDi5UgCEFOi8mYlGA1wMkEL3EKkcnp1HEv3GBL8q9DoBcdBagPVZPtdTJl/aa5xn0TBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T20:51:57.047877Z"},"content_sha256":"6250d280c439c315802f40c0427559ae23a335374e1da30ae196e22feb9ffe98","schema_version":"1.0","event_id":"sha256:6250d280c439c315802f40c0427559ae23a335374e1da30ae196e22feb9ffe98"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/N4ZTMW6L6URULGNOJP642HH2RW/bundle.json","state_url":"https://pith.science/pith/N4ZTMW6L6URULGNOJP642HH2RW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/N4ZTMW6L6URULGNOJP642HH2RW/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-05T20:51:57Z","links":{"resolver":"https://pith.science/pith/N4ZTMW6L6URULGNOJP642HH2RW","bundle":"https://pith.science/pith/N4ZTMW6L6URULGNOJP642HH2RW/bundle.json","state":"https://pith.science/pith/N4ZTMW6L6URULGNOJP642HH2RW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/N4ZTMW6L6URULGNOJP642HH2RW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:N4ZTMW6L6URULGNOJP642HH2RW","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":"eb4996cdabe86018bf7418a3a2588a74dcc4576933ac50529266f8ed710d8874","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2026-06-03T21:23:45Z","title_canon_sha256":"e86b3c15ab5afd4b9b089c049122a69c29c163e4b5c1199c2c509796596bf903"},"schema_version":"1.0","source":{"id":"2606.05454","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.05454","created_at":"2026-06-05T00:13:58Z"},{"alias_kind":"arxiv_version","alias_value":"2606.05454v1","created_at":"2026-06-05T00:13:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.05454","created_at":"2026-06-05T00:13:58Z"},{"alias_kind":"pith_short_12","alias_value":"N4ZTMW6L6URU","created_at":"2026-06-05T00:13:58Z"},{"alias_kind":"pith_short_16","alias_value":"N4ZTMW6L6URULGNO","created_at":"2026-06-05T00:13:58Z"},{"alias_kind":"pith_short_8","alias_value":"N4ZTMW6L","created_at":"2026-06-05T00:13:58Z"}],"graph_snapshots":[{"event_id":"sha256:6250d280c439c315802f40c0427559ae23a335374e1da30ae196e22feb9ffe98","target":"graph","created_at":"2026-06-05T00:13:58Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2606.05454/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In the sequence reconstruction problem, a codeword $\\x$ is transmitted through several identical channels where each channel produces a noisy read of $\\x$, and the problem is to analyze how to uniquely reconstruct $\\x$ based on these noisy reads. Levenshtein has studied the minimum number of reads which guarantees unique reconstruction of $\\x$, which is one sufficient condition for unique reconstruction. In this paper, we move on to a different perspective and propose a new framework for unique reconstruction. Our new sufficient condition for unique reconstruction takes both the number of read","authors_text":"Chen Wang, Eitan Yaakobi, Yiwei Zhang","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2026-06-03T21:23:45Z","title":"Sequence Reconstruction for Substitution Channel: New Sufficient Conditions and Algorithms"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.05454","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:b352dacee863fbb45e11e108783b955fd7299bb2eab0a0513481e729bcc1efab","target":"record","created_at":"2026-06-05T00:13:58Z","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":"eb4996cdabe86018bf7418a3a2588a74dcc4576933ac50529266f8ed710d8874","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2026-06-03T21:23:45Z","title_canon_sha256":"e86b3c15ab5afd4b9b089c049122a69c29c163e4b5c1199c2c509796596bf903"},"schema_version":"1.0","source":{"id":"2606.05454","kind":"arxiv","version":1}},"canonical_sha256":"6f33365bcbf5234599ae4bfdcd1cfa8d87ef617799f743b1480cacc6557ee9e1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6f33365bcbf5234599ae4bfdcd1cfa8d87ef617799f743b1480cacc6557ee9e1","first_computed_at":"2026-06-05T00:13:58.388430Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-05T00:13:58.388430Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"nb3T3rmPKTnmW2QqVRKD5/nbL73Wyb3eMhd49NW39JcNTuIJd6Y951fzwhHt8gvJvvqhkBDdEz9xkO1c5shGDA==","signature_status":"signed_v1","signed_at":"2026-06-05T00:13:58.388853Z","signed_message":"canonical_sha256_bytes"},"source_id":"2606.05454","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b352dacee863fbb45e11e108783b955fd7299bb2eab0a0513481e729bcc1efab","sha256:6250d280c439c315802f40c0427559ae23a335374e1da30ae196e22feb9ffe98"],"state_sha256":"b4a0ee7826ce570c7d8004def5ad32f18dd3d2850a4f1479d85e19cd67c284c4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pMumN0pV+J9TxsueHbA7ee7ctKSLuNdfMvQY/3VQM5bym21dydZmRIKHbg3aGFTYtcOCUeCCooIYs8alk3xvCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T20:51:57.052780Z","bundle_sha256":"e355eba3f36babd57e42564dfac4ba9c0e769284f5c99a95da73185808b5b204"}}