{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:SUBQNZDNMMXXVWXFDSOLMLWEOL","short_pith_number":"pith:SUBQNZDN","canonical_record":{"source":{"id":"1703.02375","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-03-07T13:43:45Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"5b3f4bdcd5be3aa4ed09f815b94064271a7d8fbb10fe14bd734613af16435ab9","abstract_canon_sha256":"e8fcd5d062ab7ed1651c0c4e72eb9bf20b17ac3b2637e63d1cc83e4e40c572d5"},"schema_version":"1.0"},"canonical_sha256":"950306e46d632f7adae51c9cb62ec472ee9665ded022a703721e348b9f89e8a8","source":{"kind":"arxiv","id":"1703.02375","version":5},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1703.02375","created_at":"2026-05-18T00:14:57Z"},{"alias_kind":"arxiv_version","alias_value":"1703.02375v5","created_at":"2026-05-18T00:14:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.02375","created_at":"2026-05-18T00:14:57Z"},{"alias_kind":"pith_short_12","alias_value":"SUBQNZDNMMXX","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_16","alias_value":"SUBQNZDNMMXXVWXF","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_8","alias_value":"SUBQNZDN","created_at":"2026-05-18T12:31:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:SUBQNZDNMMXXVWXFDSOLMLWEOL","target":"record","payload":{"canonical_record":{"source":{"id":"1703.02375","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-03-07T13:43:45Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"5b3f4bdcd5be3aa4ed09f815b94064271a7d8fbb10fe14bd734613af16435ab9","abstract_canon_sha256":"e8fcd5d062ab7ed1651c0c4e72eb9bf20b17ac3b2637e63d1cc83e4e40c572d5"},"schema_version":"1.0"},"canonical_sha256":"950306e46d632f7adae51c9cb62ec472ee9665ded022a703721e348b9f89e8a8","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:14:57.161222Z","signature_b64":"KpkgN1ffwBw7wWLfxaQi4a6ZyHmjXWM1qceAYVt+BCxjRczo9DdCq2eAL7Ves9ugWgUtPWA3oVrVPVl5AQ//Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"950306e46d632f7adae51c9cb62ec472ee9665ded022a703721e348b9f89e8a8","last_reissued_at":"2026-05-18T00:14:57.160509Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:14:57.160509Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1703.02375","source_version":5,"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:14:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"atL57Szl7Va/RM1fb7KYHTqCUYMNFmrepM24h/7XSq2Dne+HkQjhIjI7cBZo8jV1F9VkUPq5ioFrT4jKz1hEAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T16:57:32.985059Z"},"content_sha256":"92a3b75f74d30f80ea6e42aefc5eb229ab91b2066c80daa23c1003d1a372451d","schema_version":"1.0","event_id":"sha256:92a3b75f74d30f80ea6e42aefc5eb229ab91b2066c80daa23c1003d1a372451d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:SUBQNZDNMMXXVWXFDSOLMLWEOL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Graph sketching-based Space-efficient Data Clustering","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.LG","authors_text":"Anne Morvan, C\\'edric Gouy-Pailler, Jamal Atif, Krzysztof Choromanski","submitted_at":"2017-03-07T13:43:45Z","abstract_excerpt":"In this paper, we address the problem of recovering arbitrary-shaped data clusters from datasets while facing \\emph{high space constraints}, as this is for instance the case in many real-world applications when analysis algorithms are directly deployed on resources-limited mobile devices collecting the data. We present DBMSTClu a new space-efficient density-based \\emph{non-parametric} method working on a Minimum Spanning Tree (MST) recovered from a limited number of linear measurements i.e. a \\emph{sketched} version of the dissimilarity graph $\\mathcal{G}$ between the $N$ objects to cluster. U"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.02375","kind":"arxiv","version":5},"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:14:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Di2ly0/L4eSNX7pj5E4zBBia0AzI+xyXRY5jP10HyH/m5IEk5mSn25u4fJZy7YvwkNEKmrjdBd5zLQEaqX2wAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T16:57:32.985722Z"},"content_sha256":"26544a24799c35d3d4e98470c029009905e03a58aaf18eea04f6dd6ad0023b00","schema_version":"1.0","event_id":"sha256:26544a24799c35d3d4e98470c029009905e03a58aaf18eea04f6dd6ad0023b00"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SUBQNZDNMMXXVWXFDSOLMLWEOL/bundle.json","state_url":"https://pith.science/pith/SUBQNZDNMMXXVWXFDSOLMLWEOL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SUBQNZDNMMXXVWXFDSOLMLWEOL/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-25T16:57:32Z","links":{"resolver":"https://pith.science/pith/SUBQNZDNMMXXVWXFDSOLMLWEOL","bundle":"https://pith.science/pith/SUBQNZDNMMXXVWXFDSOLMLWEOL/bundle.json","state":"https://pith.science/pith/SUBQNZDNMMXXVWXFDSOLMLWEOL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SUBQNZDNMMXXVWXFDSOLMLWEOL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:SUBQNZDNMMXXVWXFDSOLMLWEOL","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":"e8fcd5d062ab7ed1651c0c4e72eb9bf20b17ac3b2637e63d1cc83e4e40c572d5","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-03-07T13:43:45Z","title_canon_sha256":"5b3f4bdcd5be3aa4ed09f815b94064271a7d8fbb10fe14bd734613af16435ab9"},"schema_version":"1.0","source":{"id":"1703.02375","kind":"arxiv","version":5}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1703.02375","created_at":"2026-05-18T00:14:57Z"},{"alias_kind":"arxiv_version","alias_value":"1703.02375v5","created_at":"2026-05-18T00:14:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.02375","created_at":"2026-05-18T00:14:57Z"},{"alias_kind":"pith_short_12","alias_value":"SUBQNZDNMMXX","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_16","alias_value":"SUBQNZDNMMXXVWXF","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_8","alias_value":"SUBQNZDN","created_at":"2026-05-18T12:31:43Z"}],"graph_snapshots":[{"event_id":"sha256:26544a24799c35d3d4e98470c029009905e03a58aaf18eea04f6dd6ad0023b00","target":"graph","created_at":"2026-05-18T00:14:57Z","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 address the problem of recovering arbitrary-shaped data clusters from datasets while facing \\emph{high space constraints}, as this is for instance the case in many real-world applications when analysis algorithms are directly deployed on resources-limited mobile devices collecting the data. We present DBMSTClu a new space-efficient density-based \\emph{non-parametric} method working on a Minimum Spanning Tree (MST) recovered from a limited number of linear measurements i.e. a \\emph{sketched} version of the dissimilarity graph $\\mathcal{G}$ between the $N$ objects to cluster. U","authors_text":"Anne Morvan, C\\'edric Gouy-Pailler, Jamal Atif, Krzysztof Choromanski","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-03-07T13:43:45Z","title":"Graph sketching-based Space-efficient Data Clustering"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.02375","kind":"arxiv","version":5},"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:92a3b75f74d30f80ea6e42aefc5eb229ab91b2066c80daa23c1003d1a372451d","target":"record","created_at":"2026-05-18T00:14:57Z","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":"e8fcd5d062ab7ed1651c0c4e72eb9bf20b17ac3b2637e63d1cc83e4e40c572d5","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-03-07T13:43:45Z","title_canon_sha256":"5b3f4bdcd5be3aa4ed09f815b94064271a7d8fbb10fe14bd734613af16435ab9"},"schema_version":"1.0","source":{"id":"1703.02375","kind":"arxiv","version":5}},"canonical_sha256":"950306e46d632f7adae51c9cb62ec472ee9665ded022a703721e348b9f89e8a8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"950306e46d632f7adae51c9cb62ec472ee9665ded022a703721e348b9f89e8a8","first_computed_at":"2026-05-18T00:14:57.160509Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:14:57.160509Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"KpkgN1ffwBw7wWLfxaQi4a6ZyHmjXWM1qceAYVt+BCxjRczo9DdCq2eAL7Ves9ugWgUtPWA3oVrVPVl5AQ//Aw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:14:57.161222Z","signed_message":"canonical_sha256_bytes"},"source_id":"1703.02375","source_kind":"arxiv","source_version":5}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:92a3b75f74d30f80ea6e42aefc5eb229ab91b2066c80daa23c1003d1a372451d","sha256:26544a24799c35d3d4e98470c029009905e03a58aaf18eea04f6dd6ad0023b00"],"state_sha256":"5776fa0ec06658253ab31a3fd35495afe785f08db1a709a84aa9b733d4bcdd73"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"z61IjKoYrudLxTVk3vGiGZ4zjac5pdYxgC0G3IXFecybv9yarPUbL8wSbrsXF3mSiDYQVBj97l8KOZ5jRP3zBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T16:57:32.989664Z","bundle_sha256":"9c25b5b0760dcee3e3cb9dd25f498943fcafe9930ea033001f05ec8a43b6156a"}}