{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2005:VBLIREIZXXBDML54YLA32NLZNU","short_pith_number":"pith:VBLIREIZ","canonical_record":{"source":{"id":"cs/0511082","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"cs.DS","submitted_at":"2005-11-23T10:32:47Z","cross_cats_sorted":[],"title_canon_sha256":"d260afd02292741db3c38e037e70e804759783f24425496df950ebc1390d1381","abstract_canon_sha256":"74b515d1f5f6f4afd0f37e189b39a266c9737635170fabcbf57fbbf759a850e4"},"schema_version":"1.0"},"canonical_sha256":"a856889119bdc2362fbcc2c1bd35796d3bf5293577524d5a9d61e8702a243cb5","source":{"kind":"arxiv","id":"cs/0511082","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"cs/0511082","created_at":"2026-05-18T04:16:31Z"},{"alias_kind":"arxiv_version","alias_value":"cs/0511082v1","created_at":"2026-05-18T04:16:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cs/0511082","created_at":"2026-05-18T04:16:31Z"},{"alias_kind":"pith_short_12","alias_value":"VBLIREIZXXBD","created_at":"2026-05-18T12:25:53Z"},{"alias_kind":"pith_short_16","alias_value":"VBLIREIZXXBDML54","created_at":"2026-05-18T12:25:53Z"},{"alias_kind":"pith_short_8","alias_value":"VBLIREIZ","created_at":"2026-05-18T12:25:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2005:VBLIREIZXXBDML54YLA32NLZNU","target":"record","payload":{"canonical_record":{"source":{"id":"cs/0511082","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"cs.DS","submitted_at":"2005-11-23T10:32:47Z","cross_cats_sorted":[],"title_canon_sha256":"d260afd02292741db3c38e037e70e804759783f24425496df950ebc1390d1381","abstract_canon_sha256":"74b515d1f5f6f4afd0f37e189b39a266c9737635170fabcbf57fbbf759a850e4"},"schema_version":"1.0"},"canonical_sha256":"a856889119bdc2362fbcc2c1bd35796d3bf5293577524d5a9d61e8702a243cb5","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:16:31.138605Z","signature_b64":"Ce0ag3fREU2qwknMxcyel9Ehi6Vv7LewaMi0ARJezYyp0+SmnUAouHjPPpeUreVA6QjIqiRgSeEw9OpaHEWJAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a856889119bdc2362fbcc2c1bd35796d3bf5293577524d5a9d61e8702a243cb5","last_reissued_at":"2026-05-18T04:16:31.138244Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:16:31.138244Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"cs/0511082","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-05-18T04:16:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tWcNJXBE2S084h9RPR3djPsWRnJ6lbQSxeQsWel9FEYiK9ESTkjAycUVrR+S1aHC9JVMCM2N1V53k1+JyLvYAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T18:34:38.422307Z"},"content_sha256":"ba55aa40a9e958523cca4a65f082ee07be3c5d1722bcc39670513b9f0d4111d8","schema_version":"1.0","event_id":"sha256:ba55aa40a9e958523cca4a65f082ee07be3c5d1722bcc39670513b9f0d4111d8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2005:VBLIREIZXXBDML54YLA32NLZNU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Approximating Clustering of Fingerprint Vectors with Missing Values","license":"","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Gianluca Della Vedova, Paola Bonizzoni, Riccardo Dondi","submitted_at":"2005-11-23T10:32:47Z","abstract_excerpt":"The problem of clustering fingerprint vectors is an interesting problem in Computational Biology that has been proposed in (Figureroa et al. 2004). In this paper we show some improvements in closing the gaps between the known lower bounds and upper bounds on the approximability of some variants of the biological problem. Namely we are able to prove that the problem is APX-hard even when each fingerprint contains only two unknown position. Moreover we have studied some variants of the orginal problem, and we give two 2-approximation algorithm for the IECMV and OECMV problems when the number of "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"cs/0511082","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":""},"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-18T04:16:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pJffDopJCVU4UbZS38/M/8UUmtGr9Dyo4S8TIsQKxSxqGOg/Xbt2vJNXcvVX9HukMbMNc0hcPXsUMXcSvpRdDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T18:34:38.422705Z"},"content_sha256":"f1b7573722628dab6ff6d5fd9569b712cba25cde9763559cca5b09b37286bbdd","schema_version":"1.0","event_id":"sha256:f1b7573722628dab6ff6d5fd9569b712cba25cde9763559cca5b09b37286bbdd"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VBLIREIZXXBDML54YLA32NLZNU/bundle.json","state_url":"https://pith.science/pith/VBLIREIZXXBDML54YLA32NLZNU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VBLIREIZXXBDML54YLA32NLZNU/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-28T18:34:38Z","links":{"resolver":"https://pith.science/pith/VBLIREIZXXBDML54YLA32NLZNU","bundle":"https://pith.science/pith/VBLIREIZXXBDML54YLA32NLZNU/bundle.json","state":"https://pith.science/pith/VBLIREIZXXBDML54YLA32NLZNU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VBLIREIZXXBDML54YLA32NLZNU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2005:VBLIREIZXXBDML54YLA32NLZNU","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":"74b515d1f5f6f4afd0f37e189b39a266c9737635170fabcbf57fbbf759a850e4","cross_cats_sorted":[],"license":"","primary_cat":"cs.DS","submitted_at":"2005-11-23T10:32:47Z","title_canon_sha256":"d260afd02292741db3c38e037e70e804759783f24425496df950ebc1390d1381"},"schema_version":"1.0","source":{"id":"cs/0511082","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"cs/0511082","created_at":"2026-05-18T04:16:31Z"},{"alias_kind":"arxiv_version","alias_value":"cs/0511082v1","created_at":"2026-05-18T04:16:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cs/0511082","created_at":"2026-05-18T04:16:31Z"},{"alias_kind":"pith_short_12","alias_value":"VBLIREIZXXBD","created_at":"2026-05-18T12:25:53Z"},{"alias_kind":"pith_short_16","alias_value":"VBLIREIZXXBDML54","created_at":"2026-05-18T12:25:53Z"},{"alias_kind":"pith_short_8","alias_value":"VBLIREIZ","created_at":"2026-05-18T12:25:53Z"}],"graph_snapshots":[{"event_id":"sha256:f1b7573722628dab6ff6d5fd9569b712cba25cde9763559cca5b09b37286bbdd","target":"graph","created_at":"2026-05-18T04:16:31Z","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":"The problem of clustering fingerprint vectors is an interesting problem in Computational Biology that has been proposed in (Figureroa et al. 2004). In this paper we show some improvements in closing the gaps between the known lower bounds and upper bounds on the approximability of some variants of the biological problem. Namely we are able to prove that the problem is APX-hard even when each fingerprint contains only two unknown position. Moreover we have studied some variants of the orginal problem, and we give two 2-approximation algorithm for the IECMV and OECMV problems when the number of ","authors_text":"Gianluca Della Vedova, Paola Bonizzoni, Riccardo Dondi","cross_cats":[],"headline":"","license":"","primary_cat":"cs.DS","submitted_at":"2005-11-23T10:32:47Z","title":"Approximating Clustering of Fingerprint Vectors with Missing Values"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"cs/0511082","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:ba55aa40a9e958523cca4a65f082ee07be3c5d1722bcc39670513b9f0d4111d8","target":"record","created_at":"2026-05-18T04:16:31Z","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":"74b515d1f5f6f4afd0f37e189b39a266c9737635170fabcbf57fbbf759a850e4","cross_cats_sorted":[],"license":"","primary_cat":"cs.DS","submitted_at":"2005-11-23T10:32:47Z","title_canon_sha256":"d260afd02292741db3c38e037e70e804759783f24425496df950ebc1390d1381"},"schema_version":"1.0","source":{"id":"cs/0511082","kind":"arxiv","version":1}},"canonical_sha256":"a856889119bdc2362fbcc2c1bd35796d3bf5293577524d5a9d61e8702a243cb5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a856889119bdc2362fbcc2c1bd35796d3bf5293577524d5a9d61e8702a243cb5","first_computed_at":"2026-05-18T04:16:31.138244Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:16:31.138244Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Ce0ag3fREU2qwknMxcyel9Ehi6Vv7LewaMi0ARJezYyp0+SmnUAouHjPPpeUreVA6QjIqiRgSeEw9OpaHEWJAw==","signature_status":"signed_v1","signed_at":"2026-05-18T04:16:31.138605Z","signed_message":"canonical_sha256_bytes"},"source_id":"cs/0511082","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ba55aa40a9e958523cca4a65f082ee07be3c5d1722bcc39670513b9f0d4111d8","sha256:f1b7573722628dab6ff6d5fd9569b712cba25cde9763559cca5b09b37286bbdd"],"state_sha256":"12299d79864feb7181246c80e8ce35346370ff1f639dd678566d78faf4b687c7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"p3cdNlLQOhXE9FfvRC6SV9YKahwWeHGj197dXMBcFLnJKvFPRTbG96Vv5XYNzmUoiC4Vt9aoahvZKC0n646hBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T18:34:38.424830Z","bundle_sha256":"4783e12c9b01e15356397c43ec8aa9ae7cc71d92d14758625bc06af3e8ce3270"}}