{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:4VJBVVUUOTVPSI22BRGYOFLUG4","short_pith_number":"pith:4VJBVVUU","canonical_record":{"source":{"id":"1701.03403","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-01-12T16:49:21Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"a7c6a6841e679175dd0b3a738c923a7f1f242f821aca7d26cfb37355b3887a4f","abstract_canon_sha256":"09dbec029b0ee5f0e860ce5cca45e4717f489cae184842878c7633964e0b18ea"},"schema_version":"1.0"},"canonical_sha256":"e5521ad69474eaf9235a0c4d871574371090d035d9420c2bfb74babd834d6672","source":{"kind":"arxiv","id":"1701.03403","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1701.03403","created_at":"2026-05-18T00:25:42Z"},{"alias_kind":"arxiv_version","alias_value":"1701.03403v2","created_at":"2026-05-18T00:25:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.03403","created_at":"2026-05-18T00:25:42Z"},{"alias_kind":"pith_short_12","alias_value":"4VJBVVUUOTVP","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_16","alias_value":"4VJBVVUUOTVPSI22","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_8","alias_value":"4VJBVVUU","created_at":"2026-05-18T12:31:00Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:4VJBVVUUOTVPSI22BRGYOFLUG4","target":"record","payload":{"canonical_record":{"source":{"id":"1701.03403","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-01-12T16:49:21Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"a7c6a6841e679175dd0b3a738c923a7f1f242f821aca7d26cfb37355b3887a4f","abstract_canon_sha256":"09dbec029b0ee5f0e860ce5cca45e4717f489cae184842878c7633964e0b18ea"},"schema_version":"1.0"},"canonical_sha256":"e5521ad69474eaf9235a0c4d871574371090d035d9420c2bfb74babd834d6672","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:25:42.274890Z","signature_b64":"k95LQQloJFDLPAwl9mf7EIs0BKgAnkqRNeBz7tri+kJTcuKp3SdmF7+qqebPrIWcB7BmBQNkG7gP/ctku/38Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e5521ad69474eaf9235a0c4d871574371090d035d9420c2bfb74babd834d6672","last_reissued_at":"2026-05-18T00:25:42.274168Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:25:42.274168Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1701.03403","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-18T00:25:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"c2OpZV2Q32OTYdUo5mtK+Y3DP9DZqb5yo/gcQ4JCNtqNAi/Za9EKm/XIVemGWQKegyrDzc2TXzVMnw/kDoFxDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-24T01:45:49.559542Z"},"content_sha256":"baf88832228bf2852451dfeafc224ebcbebf5270360d8b044b404f29fa7bde83","schema_version":"1.0","event_id":"sha256:baf88832228bf2852451dfeafc224ebcbebf5270360d8b044b404f29fa7bde83"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:4VJBVVUUOTVPSI22BRGYOFLUG4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"K-means Algorithm over Compressed Binary Data","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Elsa Dupraz","submitted_at":"2017-01-12T16:49:21Z","abstract_excerpt":"We consider a network of binary-valued sensors with a fusion center. The fusion center has to perform K-means clustering on the binary data transmitted by the sensors. In order to reduce the amount of data transmitted within the network, the sensors compress their data with a source coding scheme based on binary sparse matrices. We propose to apply the K-means algorithm directly over the compressed data without reconstructing the original sensors measurements, in order to avoid potentially complex decoding operations. We provide approximated expressions of the error probabilities of the K-mean"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.03403","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-18T00:25:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bdhcoAmoIkWj7i6VK6lOKrGaOQXlpqSPJ+qLAeoASLOgiGKoMAxY4Fgj/MWk6KcNKykBn8hhVay5R/v2mO/BAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-24T01:45:49.560223Z"},"content_sha256":"c7514d0d71b37b76fd50764ea7f938e127f24d40d56f8876cb01e47af8fd4883","schema_version":"1.0","event_id":"sha256:c7514d0d71b37b76fd50764ea7f938e127f24d40d56f8876cb01e47af8fd4883"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4VJBVVUUOTVPSI22BRGYOFLUG4/bundle.json","state_url":"https://pith.science/pith/4VJBVVUUOTVPSI22BRGYOFLUG4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4VJBVVUUOTVPSI22BRGYOFLUG4/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-24T01:45:49Z","links":{"resolver":"https://pith.science/pith/4VJBVVUUOTVPSI22BRGYOFLUG4","bundle":"https://pith.science/pith/4VJBVVUUOTVPSI22BRGYOFLUG4/bundle.json","state":"https://pith.science/pith/4VJBVVUUOTVPSI22BRGYOFLUG4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4VJBVVUUOTVPSI22BRGYOFLUG4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:4VJBVVUUOTVPSI22BRGYOFLUG4","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":"09dbec029b0ee5f0e860ce5cca45e4717f489cae184842878c7633964e0b18ea","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-01-12T16:49:21Z","title_canon_sha256":"a7c6a6841e679175dd0b3a738c923a7f1f242f821aca7d26cfb37355b3887a4f"},"schema_version":"1.0","source":{"id":"1701.03403","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1701.03403","created_at":"2026-05-18T00:25:42Z"},{"alias_kind":"arxiv_version","alias_value":"1701.03403v2","created_at":"2026-05-18T00:25:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.03403","created_at":"2026-05-18T00:25:42Z"},{"alias_kind":"pith_short_12","alias_value":"4VJBVVUUOTVP","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_16","alias_value":"4VJBVVUUOTVPSI22","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_8","alias_value":"4VJBVVUU","created_at":"2026-05-18T12:31:00Z"}],"graph_snapshots":[{"event_id":"sha256:c7514d0d71b37b76fd50764ea7f938e127f24d40d56f8876cb01e47af8fd4883","target":"graph","created_at":"2026-05-18T00:25:42Z","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 consider a network of binary-valued sensors with a fusion center. The fusion center has to perform K-means clustering on the binary data transmitted by the sensors. In order to reduce the amount of data transmitted within the network, the sensors compress their data with a source coding scheme based on binary sparse matrices. We propose to apply the K-means algorithm directly over the compressed data without reconstructing the original sensors measurements, in order to avoid potentially complex decoding operations. We provide approximated expressions of the error probabilities of the K-mean","authors_text":"Elsa Dupraz","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-01-12T16:49:21Z","title":"K-means Algorithm over Compressed Binary Data"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.03403","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:baf88832228bf2852451dfeafc224ebcbebf5270360d8b044b404f29fa7bde83","target":"record","created_at":"2026-05-18T00:25:42Z","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":"09dbec029b0ee5f0e860ce5cca45e4717f489cae184842878c7633964e0b18ea","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-01-12T16:49:21Z","title_canon_sha256":"a7c6a6841e679175dd0b3a738c923a7f1f242f821aca7d26cfb37355b3887a4f"},"schema_version":"1.0","source":{"id":"1701.03403","kind":"arxiv","version":2}},"canonical_sha256":"e5521ad69474eaf9235a0c4d871574371090d035d9420c2bfb74babd834d6672","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e5521ad69474eaf9235a0c4d871574371090d035d9420c2bfb74babd834d6672","first_computed_at":"2026-05-18T00:25:42.274168Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:25:42.274168Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"k95LQQloJFDLPAwl9mf7EIs0BKgAnkqRNeBz7tri+kJTcuKp3SdmF7+qqebPrIWcB7BmBQNkG7gP/ctku/38Ag==","signature_status":"signed_v1","signed_at":"2026-05-18T00:25:42.274890Z","signed_message":"canonical_sha256_bytes"},"source_id":"1701.03403","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:baf88832228bf2852451dfeafc224ebcbebf5270360d8b044b404f29fa7bde83","sha256:c7514d0d71b37b76fd50764ea7f938e127f24d40d56f8876cb01e47af8fd4883"],"state_sha256":"0a52b9b49d615cb7cf50d3ca5e36e439f41b67d745b9b8ba3191c060ab9c472d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bFhfyiRMyG4+M8ZcvHMWdSr7G6TaKV+euiWulF0CQE1ew2wf1rIwGAmKpzp/piXPu3x70dRW992qfZXikDz0CQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-24T01:45:49.563903Z","bundle_sha256":"76e1711c4f08ec05cdf22b6f8d5de4c54fcb551e5640ee96c7ca723ba95884c9"}}