{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:TIS6AK4U772LXSVG7PHSNIO2KL","short_pith_number":"pith:TIS6AK4U","canonical_record":{"source":{"id":"2606.21218","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2026-06-19T08:34:08Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"92d647025157d19e8948912c77e4b02484ca4cf98aa31998972f155aab962842","abstract_canon_sha256":"57f51932d08ba20600f44f142acea43fe653e29b53a7187da197e369964524b5"},"schema_version":"1.0"},"canonical_sha256":"9a25e02b94fff4bbcaa6fbcf26a1da52fd453818f6f755932282cf8de91338d4","source":{"kind":"arxiv","id":"2606.21218","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.21218","created_at":"2026-06-23T01:12:33Z"},{"alias_kind":"arxiv_version","alias_value":"2606.21218v1","created_at":"2026-06-23T01:12:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.21218","created_at":"2026-06-23T01:12:33Z"},{"alias_kind":"pith_short_12","alias_value":"TIS6AK4U772L","created_at":"2026-06-23T01:12:33Z"},{"alias_kind":"pith_short_16","alias_value":"TIS6AK4U772LXSVG","created_at":"2026-06-23T01:12:33Z"},{"alias_kind":"pith_short_8","alias_value":"TIS6AK4U","created_at":"2026-06-23T01:12:33Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:TIS6AK4U772LXSVG7PHSNIO2KL","target":"record","payload":{"canonical_record":{"source":{"id":"2606.21218","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2026-06-19T08:34:08Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"92d647025157d19e8948912c77e4b02484ca4cf98aa31998972f155aab962842","abstract_canon_sha256":"57f51932d08ba20600f44f142acea43fe653e29b53a7187da197e369964524b5"},"schema_version":"1.0"},"canonical_sha256":"9a25e02b94fff4bbcaa6fbcf26a1da52fd453818f6f755932282cf8de91338d4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-23T01:12:33.694339Z","signature_b64":"dZzNhTANQSPDop072aJg25yfaC+zO8mcG/YLm6/GH4qo2g4aoUSoTbiAlL8O1JRx9WRCrA4L/H8YvT3uKyI0Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9a25e02b94fff4bbcaa6fbcf26a1da52fd453818f6f755932282cf8de91338d4","last_reissued_at":"2026-06-23T01:12:33.693870Z","signature_status":"signed_v1","first_computed_at":"2026-06-23T01:12:33.693870Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2606.21218","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-23T01:12:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TAeyXi3Nh7RreeJhzr9Si3Pt+R4BnGW2TyjoRJkGnRSaWDaZj7yNCq/3QeVFK8YPe23O0fLDB6Alp2ou93K8Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-01T13:52:16.646249Z"},"content_sha256":"362ea02872b3e92574b4c2bf75fa6535f7b54453fc55910b317d070ae34089e9","schema_version":"1.0","event_id":"sha256:362ea02872b3e92574b4c2bf75fa6535f7b54453fc55910b317d070ae34089e9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:TIS6AK4U772LXSVG7PHSNIO2KL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Error Exponent Bounds for Optimal Short-Read Clustering","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Nir Weinberger, Yoav Chachamovitz","submitted_at":"2026-06-19T08:34:08Z","abstract_excerpt":"Motivated by the operation of decoders for DNA storage, we consider the problem of unsupervised clustering of noisy short sequences, each generated from one of multiple possible unknown source sequences after passing through a memoryless channel. Focusing on the statistically optimal clustering rule, we derive upper and lower bounds on the probability of incorrect clustering as a function of the sequence length, the number of reads, and the channel statistics."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.21218","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.21218/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-23T01:12:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pOmYVPuEL8vywGJS5SIKzlPCmcEG5Jb9Y2IasxkZvI6RGW9yjm5tJFk3pSJAYTeIbRJdQRBIZNNZX1mkJGwtBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-01T13:52:16.646636Z"},"content_sha256":"860de48c1eac2da25ac261709fca015ac7e60f47681ab7926f13c0bc15ab88ab","schema_version":"1.0","event_id":"sha256:860de48c1eac2da25ac261709fca015ac7e60f47681ab7926f13c0bc15ab88ab"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TIS6AK4U772LXSVG7PHSNIO2KL/bundle.json","state_url":"https://pith.science/pith/TIS6AK4U772LXSVG7PHSNIO2KL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TIS6AK4U772LXSVG7PHSNIO2KL/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-07-01T13:52:16Z","links":{"resolver":"https://pith.science/pith/TIS6AK4U772LXSVG7PHSNIO2KL","bundle":"https://pith.science/pith/TIS6AK4U772LXSVG7PHSNIO2KL/bundle.json","state":"https://pith.science/pith/TIS6AK4U772LXSVG7PHSNIO2KL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TIS6AK4U772LXSVG7PHSNIO2KL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:TIS6AK4U772LXSVG7PHSNIO2KL","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":"57f51932d08ba20600f44f142acea43fe653e29b53a7187da197e369964524b5","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2026-06-19T08:34:08Z","title_canon_sha256":"92d647025157d19e8948912c77e4b02484ca4cf98aa31998972f155aab962842"},"schema_version":"1.0","source":{"id":"2606.21218","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.21218","created_at":"2026-06-23T01:12:33Z"},{"alias_kind":"arxiv_version","alias_value":"2606.21218v1","created_at":"2026-06-23T01:12:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.21218","created_at":"2026-06-23T01:12:33Z"},{"alias_kind":"pith_short_12","alias_value":"TIS6AK4U772L","created_at":"2026-06-23T01:12:33Z"},{"alias_kind":"pith_short_16","alias_value":"TIS6AK4U772LXSVG","created_at":"2026-06-23T01:12:33Z"},{"alias_kind":"pith_short_8","alias_value":"TIS6AK4U","created_at":"2026-06-23T01:12:33Z"}],"graph_snapshots":[{"event_id":"sha256:860de48c1eac2da25ac261709fca015ac7e60f47681ab7926f13c0bc15ab88ab","target":"graph","created_at":"2026-06-23T01:12:33Z","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.21218/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Motivated by the operation of decoders for DNA storage, we consider the problem of unsupervised clustering of noisy short sequences, each generated from one of multiple possible unknown source sequences after passing through a memoryless channel. Focusing on the statistically optimal clustering rule, we derive upper and lower bounds on the probability of incorrect clustering as a function of the sequence length, the number of reads, and the channel statistics.","authors_text":"Nir Weinberger, Yoav Chachamovitz","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2026-06-19T08:34:08Z","title":"Error Exponent Bounds for Optimal Short-Read Clustering"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.21218","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:362ea02872b3e92574b4c2bf75fa6535f7b54453fc55910b317d070ae34089e9","target":"record","created_at":"2026-06-23T01:12:33Z","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":"57f51932d08ba20600f44f142acea43fe653e29b53a7187da197e369964524b5","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2026-06-19T08:34:08Z","title_canon_sha256":"92d647025157d19e8948912c77e4b02484ca4cf98aa31998972f155aab962842"},"schema_version":"1.0","source":{"id":"2606.21218","kind":"arxiv","version":1}},"canonical_sha256":"9a25e02b94fff4bbcaa6fbcf26a1da52fd453818f6f755932282cf8de91338d4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9a25e02b94fff4bbcaa6fbcf26a1da52fd453818f6f755932282cf8de91338d4","first_computed_at":"2026-06-23T01:12:33.693870Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-23T01:12:33.693870Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"dZzNhTANQSPDop072aJg25yfaC+zO8mcG/YLm6/GH4qo2g4aoUSoTbiAlL8O1JRx9WRCrA4L/H8YvT3uKyI0Cg==","signature_status":"signed_v1","signed_at":"2026-06-23T01:12:33.694339Z","signed_message":"canonical_sha256_bytes"},"source_id":"2606.21218","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:362ea02872b3e92574b4c2bf75fa6535f7b54453fc55910b317d070ae34089e9","sha256:860de48c1eac2da25ac261709fca015ac7e60f47681ab7926f13c0bc15ab88ab"],"state_sha256":"92a0153339d3bf51c6c85a0394747ed235259a57c5c3100bd940c10753537b97"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"N0llGtuJ8KAE45b/fMccNUCItG9L2juFoJFK36XTTVWhPB9o+Ey5NgJVJ40g9Uu/XfAUm5n1AqeXy3dYpzxiBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-01T13:52:16.648596Z","bundle_sha256":"53d038c155ab86e5a07047da83020badeccda82ed79a554ca09495336475685b"}}