{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:H3O5G5GI65HRDLLAVM7UP3THRM","short_pith_number":"pith:H3O5G5GI","canonical_record":{"source":{"id":"2505.04232","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2025-05-07T08:34:06Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"48fb270c2c262688ad7a62ab4ea67be33cc1ea0b89e4532da9d008a0923b89e0","abstract_canon_sha256":"afa13ad540cb457f9381b08beb2637a2103757917aead9563fc3c6686557063e"},"schema_version":"1.0"},"canonical_sha256":"3eddd374c8f74f11ad60ab3f47ee678b20b93d6b8950a4ae9bea2867482f1c39","source":{"kind":"arxiv","id":"2505.04232","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2505.04232","created_at":"2026-07-05T10:59:38Z"},{"alias_kind":"arxiv_version","alias_value":"2505.04232v1","created_at":"2026-07-05T10:59:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.04232","created_at":"2026-07-05T10:59:38Z"},{"alias_kind":"pith_short_12","alias_value":"H3O5G5GI65HR","created_at":"2026-07-05T10:59:38Z"},{"alias_kind":"pith_short_16","alias_value":"H3O5G5GI65HRDLLA","created_at":"2026-07-05T10:59:38Z"},{"alias_kind":"pith_short_8","alias_value":"H3O5G5GI","created_at":"2026-07-05T10:59:38Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:H3O5G5GI65HRDLLAVM7UP3THRM","target":"record","payload":{"canonical_record":{"source":{"id":"2505.04232","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2025-05-07T08:34:06Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"48fb270c2c262688ad7a62ab4ea67be33cc1ea0b89e4532da9d008a0923b89e0","abstract_canon_sha256":"afa13ad540cb457f9381b08beb2637a2103757917aead9563fc3c6686557063e"},"schema_version":"1.0"},"canonical_sha256":"3eddd374c8f74f11ad60ab3f47ee678b20b93d6b8950a4ae9bea2867482f1c39","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:59:38.527451Z","signature_b64":"WHvJ1teaDPnwTt2/BxWOlYKdOkRMSlvYQcmHj/hb2SVZOPR1mxnwVfyBhYOOWtrWCXQo3B2SoSm3+MIIK3leAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3eddd374c8f74f11ad60ab3f47ee678b20b93d6b8950a4ae9bea2867482f1c39","last_reissued_at":"2026-07-05T10:59:38.526967Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:59:38.526967Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2505.04232","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-07-05T10:59:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1wXZVvRF2NHEQvHXgO6qPBBa+vHal9smrTnxtgyATZ1TcBhNtI0YeTnGOLeYIqzqb8px8jSjd+MWP8re6EraCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-18T09:25:48.323209Z"},"content_sha256":"ed174963af98f1ff06a786447a63e4b4733024797e698c864e4a4a86deae028e","schema_version":"1.0","event_id":"sha256:ed174963af98f1ff06a786447a63e4b4733024797e698c864e4a4a86deae028e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:H3O5G5GI65HRDLLAVM7UP3THRM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Binary Reconstruction Codes for Correcting One Deletion and One Substitution","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Gennian Ge, Yubo Sun, Yuling Li","submitted_at":"2025-05-07T08:34:06Z","abstract_excerpt":"In this paper, we investigate binary reconstruction codes capable of correcting one deletion and one substitution. We define the \\emph{single-deletion single-substitution ball} function $ \\mathcal{B} $ as a mapping from a sequence to the set of sequences that can be derived from it by performing one deletion and one substitution. A binary \\emph{$(n,N;\\mathcal{B})$-reconstruction code} is defined as a collection of binary sequences of length $ n $ such that the intersection size between the single-deletion single-substitution balls of any two distinct codewords is strictly less than $ N $. This"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.04232","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/2505.04232/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-07-05T10:59:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SuAHOnOH/iHeueC38F4eR0k8ydQlccz99T5WAuLHPgfTqwVM81Y9flXfmzzXwoZbreHlU01VGj7FY/Qpi1YUBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-18T09:25:48.323726Z"},"content_sha256":"269438a4ca1a1894bee9ddfc41b3e298d0dfb7d7d61afdcf9e53638a3adbadf5","schema_version":"1.0","event_id":"sha256:269438a4ca1a1894bee9ddfc41b3e298d0dfb7d7d61afdcf9e53638a3adbadf5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/H3O5G5GI65HRDLLAVM7UP3THRM/bundle.json","state_url":"https://pith.science/pith/H3O5G5GI65HRDLLAVM7UP3THRM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/H3O5G5GI65HRDLLAVM7UP3THRM/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-08-18T09:25:48Z","links":{"resolver":"https://pith.science/pith/H3O5G5GI65HRDLLAVM7UP3THRM","bundle":"https://pith.science/pith/H3O5G5GI65HRDLLAVM7UP3THRM/bundle.json","state":"https://pith.science/pith/H3O5G5GI65HRDLLAVM7UP3THRM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/H3O5G5GI65HRDLLAVM7UP3THRM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:H3O5G5GI65HRDLLAVM7UP3THRM","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":"afa13ad540cb457f9381b08beb2637a2103757917aead9563fc3c6686557063e","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2025-05-07T08:34:06Z","title_canon_sha256":"48fb270c2c262688ad7a62ab4ea67be33cc1ea0b89e4532da9d008a0923b89e0"},"schema_version":"1.0","source":{"id":"2505.04232","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2505.04232","created_at":"2026-07-05T10:59:38Z"},{"alias_kind":"arxiv_version","alias_value":"2505.04232v1","created_at":"2026-07-05T10:59:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.04232","created_at":"2026-07-05T10:59:38Z"},{"alias_kind":"pith_short_12","alias_value":"H3O5G5GI65HR","created_at":"2026-07-05T10:59:38Z"},{"alias_kind":"pith_short_16","alias_value":"H3O5G5GI65HRDLLA","created_at":"2026-07-05T10:59:38Z"},{"alias_kind":"pith_short_8","alias_value":"H3O5G5GI","created_at":"2026-07-05T10:59:38Z"}],"graph_snapshots":[{"event_id":"sha256:269438a4ca1a1894bee9ddfc41b3e298d0dfb7d7d61afdcf9e53638a3adbadf5","target":"graph","created_at":"2026-07-05T10:59:38Z","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/2505.04232/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In this paper, we investigate binary reconstruction codes capable of correcting one deletion and one substitution. We define the \\emph{single-deletion single-substitution ball} function $ \\mathcal{B} $ as a mapping from a sequence to the set of sequences that can be derived from it by performing one deletion and one substitution. A binary \\emph{$(n,N;\\mathcal{B})$-reconstruction code} is defined as a collection of binary sequences of length $ n $ such that the intersection size between the single-deletion single-substitution balls of any two distinct codewords is strictly less than $ N $. This","authors_text":"Gennian Ge, Yubo Sun, Yuling Li","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2025-05-07T08:34:06Z","title":"Binary Reconstruction Codes for Correcting One Deletion and One Substitution"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.04232","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:ed174963af98f1ff06a786447a63e4b4733024797e698c864e4a4a86deae028e","target":"record","created_at":"2026-07-05T10:59:38Z","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":"afa13ad540cb457f9381b08beb2637a2103757917aead9563fc3c6686557063e","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2025-05-07T08:34:06Z","title_canon_sha256":"48fb270c2c262688ad7a62ab4ea67be33cc1ea0b89e4532da9d008a0923b89e0"},"schema_version":"1.0","source":{"id":"2505.04232","kind":"arxiv","version":1}},"canonical_sha256":"3eddd374c8f74f11ad60ab3f47ee678b20b93d6b8950a4ae9bea2867482f1c39","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3eddd374c8f74f11ad60ab3f47ee678b20b93d6b8950a4ae9bea2867482f1c39","first_computed_at":"2026-07-05T10:59:38.526967Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T10:59:38.526967Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"WHvJ1teaDPnwTt2/BxWOlYKdOkRMSlvYQcmHj/hb2SVZOPR1mxnwVfyBhYOOWtrWCXQo3B2SoSm3+MIIK3leAQ==","signature_status":"signed_v1","signed_at":"2026-07-05T10:59:38.527451Z","signed_message":"canonical_sha256_bytes"},"source_id":"2505.04232","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ed174963af98f1ff06a786447a63e4b4733024797e698c864e4a4a86deae028e","sha256:269438a4ca1a1894bee9ddfc41b3e298d0dfb7d7d61afdcf9e53638a3adbadf5"],"state_sha256":"ac45f1f4f2809b0354f214348af77011eaa2914e6d04c3385e0004757674bf1f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sPp7Z9PWib4uHWY3wiXFdP2QDuuvtERzWsqxYZSNzhSQGQoIanVPlYrrXxTmPbAygc59bUjoZbfZ3jaMeq5aCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-18T09:25:48.327388Z","bundle_sha256":"8973796a53febaa8096adc0c1ef735202425021cd293d22e9741a2a85a277bec"}}