{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:44R66UUR3KPFC7XUMHSFT42R5W","short_pith_number":"pith:44R66UUR","canonical_record":{"source":{"id":"1101.3620","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-01-19T05:29:24Z","cross_cats_sorted":["cs.CE"],"title_canon_sha256":"a38c04a66ec86d3c0edaa82b692702bcb5f084902c1d66c8b39069f18298a29b","abstract_canon_sha256":"39d340344c281593af9c5e1c295419d972164bd1b6f65f18c7b852e20a5cdf6e"},"schema_version":"1.0"},"canonical_sha256":"e723ef5291da9e517ef461e459f351ed9b3446c602cdd02df1b82c716aee68dc","source":{"kind":"arxiv","id":"1101.3620","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1101.3620","created_at":"2026-05-18T02:22:51Z"},{"alias_kind":"arxiv_version","alias_value":"1101.3620v2","created_at":"2026-05-18T02:22:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1101.3620","created_at":"2026-05-18T02:22:51Z"},{"alias_kind":"pith_short_12","alias_value":"44R66UUR3KPF","created_at":"2026-05-18T12:26:20Z"},{"alias_kind":"pith_short_16","alias_value":"44R66UUR3KPFC7XU","created_at":"2026-05-18T12:26:20Z"},{"alias_kind":"pith_short_8","alias_value":"44R66UUR","created_at":"2026-05-18T12:26:20Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:44R66UUR3KPFC7XUMHSFT42R5W","target":"record","payload":{"canonical_record":{"source":{"id":"1101.3620","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-01-19T05:29:24Z","cross_cats_sorted":["cs.CE"],"title_canon_sha256":"a38c04a66ec86d3c0edaa82b692702bcb5f084902c1d66c8b39069f18298a29b","abstract_canon_sha256":"39d340344c281593af9c5e1c295419d972164bd1b6f65f18c7b852e20a5cdf6e"},"schema_version":"1.0"},"canonical_sha256":"e723ef5291da9e517ef461e459f351ed9b3446c602cdd02df1b82c716aee68dc","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:22:51.473656Z","signature_b64":"cPd/h3KBRvFtoLEPGE8r1yndfSekOpF7eo7EYV+1oe5l2OJbauBJiw308gBO7++zLy8DyE8+5ARaqYnlwoiVDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e723ef5291da9e517ef461e459f351ed9b3446c602cdd02df1b82c716aee68dc","last_reissued_at":"2026-05-18T02:22:51.473149Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:22:51.473149Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1101.3620","source_version":2,"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-18T02:22:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"M9jR0huN6WTE8h35mAES5VlA296TuZBHbdEzgn6XF2TtpxNuso/agdx4emBlKSAf6X0LhUl6F8hFOsEiCL2fBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T23:07:51.743693Z"},"content_sha256":"5a146ab53bbcf11639163b234f2cad2a697c992c126c80617196a16c4b5488ff","schema_version":"1.0","event_id":"sha256:5a146ab53bbcf11639163b234f2cad2a697c992c126c80617196a16c4b5488ff"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:44R66UUR3KPFC7XUMHSFT42R5W","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Clustering Protein Sequences Given the Approximation Stability of the Min-Sum Objective Function","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CE"],"primary_cat":"cs.DS","authors_text":"Heiko Roglin, Konstantin Voevodski, Maria-Florina Balcan, Shang-Hua Teng, Yu Xia","submitted_at":"2011-01-19T05:29:24Z","abstract_excerpt":"We study the problem of efficiently clustering protein sequences in a limited information setting. We assume that we do not know the distances between the sequences in advance, and must query them during the execution of the algorithm. Our goal is to find an accurate clustering using few queries. We model the problem as a point set $S$ with an unknown metric $d$ on $S$, and assume that we have access to \\emph{one versus all} distance queries that given a point $s \\in S$ return the distances between $s$ and all other points. Our one versus all query represents an efficient sequence database sea"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1101.3620","kind":"arxiv","version":2},"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-18T02:22:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"s4gJL6VjzmO+FqZtcXyqviWmwpLltsbaxsgaVKiL6GSoCMVqGCf55c2PLdk/ELvE8VyI6c5WoF8n1/r1NwNuCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T23:07:51.744242Z"},"content_sha256":"3dcdc1ea8635923376e37ebc1eaa82c068c502335f7f48f81643dc8dc0a4a81d","schema_version":"1.0","event_id":"sha256:3dcdc1ea8635923376e37ebc1eaa82c068c502335f7f48f81643dc8dc0a4a81d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/44R66UUR3KPFC7XUMHSFT42R5W/bundle.json","state_url":"https://pith.science/pith/44R66UUR3KPFC7XUMHSFT42R5W/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/44R66UUR3KPFC7XUMHSFT42R5W/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-31T23:07:51Z","links":{"resolver":"https://pith.science/pith/44R66UUR3KPFC7XUMHSFT42R5W","bundle":"https://pith.science/pith/44R66UUR3KPFC7XUMHSFT42R5W/bundle.json","state":"https://pith.science/pith/44R66UUR3KPFC7XUMHSFT42R5W/state.json","well_known_bundle":"https://pith.science/.well-known/pith/44R66UUR3KPFC7XUMHSFT42R5W/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:44R66UUR3KPFC7XUMHSFT42R5W","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":"39d340344c281593af9c5e1c295419d972164bd1b6f65f18c7b852e20a5cdf6e","cross_cats_sorted":["cs.CE"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-01-19T05:29:24Z","title_canon_sha256":"a38c04a66ec86d3c0edaa82b692702bcb5f084902c1d66c8b39069f18298a29b"},"schema_version":"1.0","source":{"id":"1101.3620","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1101.3620","created_at":"2026-05-18T02:22:51Z"},{"alias_kind":"arxiv_version","alias_value":"1101.3620v2","created_at":"2026-05-18T02:22:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1101.3620","created_at":"2026-05-18T02:22:51Z"},{"alias_kind":"pith_short_12","alias_value":"44R66UUR3KPF","created_at":"2026-05-18T12:26:20Z"},{"alias_kind":"pith_short_16","alias_value":"44R66UUR3KPFC7XU","created_at":"2026-05-18T12:26:20Z"},{"alias_kind":"pith_short_8","alias_value":"44R66UUR","created_at":"2026-05-18T12:26:20Z"}],"graph_snapshots":[{"event_id":"sha256:3dcdc1ea8635923376e37ebc1eaa82c068c502335f7f48f81643dc8dc0a4a81d","target":"graph","created_at":"2026-05-18T02:22:51Z","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 efficiently clustering protein sequences in a limited information setting. We assume that we do not know the distances between the sequences in advance, and must query them during the execution of the algorithm. Our goal is to find an accurate clustering using few queries. We model the problem as a point set $S$ with an unknown metric $d$ on $S$, and assume that we have access to \\emph{one versus all} distance queries that given a point $s \\in S$ return the distances between $s$ and all other points. Our one versus all query represents an efficient sequence database sea","authors_text":"Heiko Roglin, Konstantin Voevodski, Maria-Florina Balcan, Shang-Hua Teng, Yu Xia","cross_cats":["cs.CE"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-01-19T05:29:24Z","title":"Clustering Protein Sequences Given the Approximation Stability of the Min-Sum Objective Function"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1101.3620","kind":"arxiv","version":2},"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:5a146ab53bbcf11639163b234f2cad2a697c992c126c80617196a16c4b5488ff","target":"record","created_at":"2026-05-18T02:22:51Z","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":"39d340344c281593af9c5e1c295419d972164bd1b6f65f18c7b852e20a5cdf6e","cross_cats_sorted":["cs.CE"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-01-19T05:29:24Z","title_canon_sha256":"a38c04a66ec86d3c0edaa82b692702bcb5f084902c1d66c8b39069f18298a29b"},"schema_version":"1.0","source":{"id":"1101.3620","kind":"arxiv","version":2}},"canonical_sha256":"e723ef5291da9e517ef461e459f351ed9b3446c602cdd02df1b82c716aee68dc","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e723ef5291da9e517ef461e459f351ed9b3446c602cdd02df1b82c716aee68dc","first_computed_at":"2026-05-18T02:22:51.473149Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:22:51.473149Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"cPd/h3KBRvFtoLEPGE8r1yndfSekOpF7eo7EYV+1oe5l2OJbauBJiw308gBO7++zLy8DyE8+5ARaqYnlwoiVDg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:22:51.473656Z","signed_message":"canonical_sha256_bytes"},"source_id":"1101.3620","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5a146ab53bbcf11639163b234f2cad2a697c992c126c80617196a16c4b5488ff","sha256:3dcdc1ea8635923376e37ebc1eaa82c068c502335f7f48f81643dc8dc0a4a81d"],"state_sha256":"eeb00fea03308a2428a4c23b1a28be73f497663077c8ae9f2ab7fdb0d3e61132"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4fFaUySlzd9GNzgIGBH9qvellij/sl6bBYx/b2BniTyhuPgNMKkuqqYLs2OTKjI2OxuirqIAfLFtkr8RsorxAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T23:07:51.746903Z","bundle_sha256":"8360fa5ef76853b98743e773ee9e0e1af07c848e4245c3b512c75b7744fb7e7c"}}