{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:PTWFTRCNJSJNVNJ757IGA6HKW5","short_pith_number":"pith:PTWFTRCN","canonical_record":{"source":{"id":"1807.06469","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2018-07-17T14:30:03Z","cross_cats_sorted":[],"title_canon_sha256":"daa81cfa8eacb8a9c7278c86c15d86d44ec54b468df0e870f3858e1c12891e51","abstract_canon_sha256":"313798781310e4d2e1eef67977ba695003641a62be0d7744108b268cb893b4e8"},"schema_version":"1.0"},"canonical_sha256":"7cec59c44d4c92dab53fefd06078eab74ca62c93f354d7b6fc37999fe26689cb","source":{"kind":"arxiv","id":"1807.06469","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1807.06469","created_at":"2026-05-17T23:42:08Z"},{"alias_kind":"arxiv_version","alias_value":"1807.06469v3","created_at":"2026-05-17T23:42:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.06469","created_at":"2026-05-17T23:42:08Z"},{"alias_kind":"pith_short_12","alias_value":"PTWFTRCNJSJN","created_at":"2026-05-18T12:32:46Z"},{"alias_kind":"pith_short_16","alias_value":"PTWFTRCNJSJNVNJ7","created_at":"2026-05-18T12:32:46Z"},{"alias_kind":"pith_short_8","alias_value":"PTWFTRCN","created_at":"2026-05-18T12:32:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:PTWFTRCNJSJNVNJ757IGA6HKW5","target":"record","payload":{"canonical_record":{"source":{"id":"1807.06469","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2018-07-17T14:30:03Z","cross_cats_sorted":[],"title_canon_sha256":"daa81cfa8eacb8a9c7278c86c15d86d44ec54b468df0e870f3858e1c12891e51","abstract_canon_sha256":"313798781310e4d2e1eef67977ba695003641a62be0d7744108b268cb893b4e8"},"schema_version":"1.0"},"canonical_sha256":"7cec59c44d4c92dab53fefd06078eab74ca62c93f354d7b6fc37999fe26689cb","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:42:08.690567Z","signature_b64":"fc5CMKummSTkKKFxvtdHhXAmw4ftjiHgJ3rRny2BKD3KAmw7hEVhFom4IvGBImPkIGjLVEibenstchRIxNXfCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7cec59c44d4c92dab53fefd06078eab74ca62c93f354d7b6fc37999fe26689cb","last_reissued_at":"2026-05-17T23:42:08.690012Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:42:08.690012Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1807.06469","source_version":3,"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-17T23:42:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Gn+JQy4N8DUQjMYlJvdWvGgBUELFxHNxZ/7CpK0lvaso3FZYrELvtslSe/GJ1ZvD46jIVUxPyFFYBXGsB8Y+Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T09:17:12.120813Z"},"content_sha256":"5226e400bd71733dfb7d7f03ddce738d54d2c6503ac1e61c2c2b81d4c336be1a","schema_version":"1.0","event_id":"sha256:5226e400bd71733dfb7d7f03ddce738d54d2c6503ac1e61c2c2b81d4c336be1a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:PTWFTRCNJSJNVNJ757IGA6HKW5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On Computing Centroids According to the $p$-Norms of Hamming Distance Vectors","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Danny Hermelin, Jiehua Chen, Manuel Sorge","submitted_at":"2018-07-17T14:30:03Z","abstract_excerpt":"In this paper we consider the $p$-Norm Hamming Centroid problem which asks to determine whether some given binary strings have a centroid with a bound on the $p$-norm of its Hamming distances to the strings. Specifically, given a set of strings $S$ and a real $k$, we consider the problem of determining whether there exists a string $s^*$ with $\\big(\\sum_{s \\in S}d^p(s^*,s)\\big)^{1/p} \\leq k$, where $d(,)$ denotes the Hamming distance metric. This problem has important applications in data clustering, and is a generalization of the well-known polynomial-time solvable \\textsc{Consensus String} $"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.06469","kind":"arxiv","version":3},"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-17T23:42:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Yfvc1cadwee3hWk0riSS2onHWTsbermAJUl1R+n99IqE3sILpCbPlt9ICeQ1yngfLJw8hT4gFJ9OTAlT12tFBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T09:17:12.121421Z"},"content_sha256":"19dc0f7bbcdb339e001ac358ef706a0f2f1e696325733469a2a151881f234cd7","schema_version":"1.0","event_id":"sha256:19dc0f7bbcdb339e001ac358ef706a0f2f1e696325733469a2a151881f234cd7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PTWFTRCNJSJNVNJ757IGA6HKW5/bundle.json","state_url":"https://pith.science/pith/PTWFTRCNJSJNVNJ757IGA6HKW5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PTWFTRCNJSJNVNJ757IGA6HKW5/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-07T09:17:12Z","links":{"resolver":"https://pith.science/pith/PTWFTRCNJSJNVNJ757IGA6HKW5","bundle":"https://pith.science/pith/PTWFTRCNJSJNVNJ757IGA6HKW5/bundle.json","state":"https://pith.science/pith/PTWFTRCNJSJNVNJ757IGA6HKW5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PTWFTRCNJSJNVNJ757IGA6HKW5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:PTWFTRCNJSJNVNJ757IGA6HKW5","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":"313798781310e4d2e1eef67977ba695003641a62be0d7744108b268cb893b4e8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2018-07-17T14:30:03Z","title_canon_sha256":"daa81cfa8eacb8a9c7278c86c15d86d44ec54b468df0e870f3858e1c12891e51"},"schema_version":"1.0","source":{"id":"1807.06469","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1807.06469","created_at":"2026-05-17T23:42:08Z"},{"alias_kind":"arxiv_version","alias_value":"1807.06469v3","created_at":"2026-05-17T23:42:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.06469","created_at":"2026-05-17T23:42:08Z"},{"alias_kind":"pith_short_12","alias_value":"PTWFTRCNJSJN","created_at":"2026-05-18T12:32:46Z"},{"alias_kind":"pith_short_16","alias_value":"PTWFTRCNJSJNVNJ7","created_at":"2026-05-18T12:32:46Z"},{"alias_kind":"pith_short_8","alias_value":"PTWFTRCN","created_at":"2026-05-18T12:32:46Z"}],"graph_snapshots":[{"event_id":"sha256:19dc0f7bbcdb339e001ac358ef706a0f2f1e696325733469a2a151881f234cd7","target":"graph","created_at":"2026-05-17T23:42:08Z","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":"In this paper we consider the $p$-Norm Hamming Centroid problem which asks to determine whether some given binary strings have a centroid with a bound on the $p$-norm of its Hamming distances to the strings. Specifically, given a set of strings $S$ and a real $k$, we consider the problem of determining whether there exists a string $s^*$ with $\\big(\\sum_{s \\in S}d^p(s^*,s)\\big)^{1/p} \\leq k$, where $d(,)$ denotes the Hamming distance metric. This problem has important applications in data clustering, and is a generalization of the well-known polynomial-time solvable \\textsc{Consensus String} $","authors_text":"Danny Hermelin, Jiehua Chen, Manuel Sorge","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2018-07-17T14:30:03Z","title":"On Computing Centroids According to the $p$-Norms of Hamming Distance Vectors"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.06469","kind":"arxiv","version":3},"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:5226e400bd71733dfb7d7f03ddce738d54d2c6503ac1e61c2c2b81d4c336be1a","target":"record","created_at":"2026-05-17T23:42:08Z","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":"313798781310e4d2e1eef67977ba695003641a62be0d7744108b268cb893b4e8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2018-07-17T14:30:03Z","title_canon_sha256":"daa81cfa8eacb8a9c7278c86c15d86d44ec54b468df0e870f3858e1c12891e51"},"schema_version":"1.0","source":{"id":"1807.06469","kind":"arxiv","version":3}},"canonical_sha256":"7cec59c44d4c92dab53fefd06078eab74ca62c93f354d7b6fc37999fe26689cb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7cec59c44d4c92dab53fefd06078eab74ca62c93f354d7b6fc37999fe26689cb","first_computed_at":"2026-05-17T23:42:08.690012Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:42:08.690012Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"fc5CMKummSTkKKFxvtdHhXAmw4ftjiHgJ3rRny2BKD3KAmw7hEVhFom4IvGBImPkIGjLVEibenstchRIxNXfCw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:42:08.690567Z","signed_message":"canonical_sha256_bytes"},"source_id":"1807.06469","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5226e400bd71733dfb7d7f03ddce738d54d2c6503ac1e61c2c2b81d4c336be1a","sha256:19dc0f7bbcdb339e001ac358ef706a0f2f1e696325733469a2a151881f234cd7"],"state_sha256":"355b206a6394fab7e6df16c22cceeaf78f3ef3439cd79edcb5bf0a65a7643414"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"klo3GERSbZ/YijqwRDB5oHfjl2/nSEiuUyC4Cc+eYiPnxaKaPPLeyaQWDnLh7rhEGJPZAyrWEgMg7yNn5myBDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T09:17:12.124896Z","bundle_sha256":"3cc1609436cab2ce6fbde5ec34883be872f752e82da543cd871dbd9309ff30b8"}}