{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:BWNOXIDPPZA7OKGIMXRHMJOTYQ","short_pith_number":"pith:BWNOXIDP","canonical_record":{"source":{"id":"1804.03048","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.HC","submitted_at":"2018-04-09T15:05:56Z","cross_cats_sorted":["cs.AI","cs.DB","cs.LG"],"title_canon_sha256":"81aee33ecc519f34a718a192973c66857e2bdf65e91ec4590e01e3e82a39e415","abstract_canon_sha256":"09f502b6929c972944ef0ecc61af032e631fbc86c7554f3089117a88bea424d1"},"schema_version":"1.0"},"canonical_sha256":"0d9aeba06f7e41f728c865e27625d3c40a3b4e159e6c266755666c827f7de11a","source":{"kind":"arxiv","id":"1804.03048","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1804.03048","created_at":"2026-05-17T23:59:44Z"},{"alias_kind":"arxiv_version","alias_value":"1804.03048v3","created_at":"2026-05-17T23:59:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.03048","created_at":"2026-05-17T23:59:44Z"},{"alias_kind":"pith_short_12","alias_value":"BWNOXIDPPZA7","created_at":"2026-05-18T12:32:16Z"},{"alias_kind":"pith_short_16","alias_value":"BWNOXIDPPZA7OKGI","created_at":"2026-05-18T12:32:16Z"},{"alias_kind":"pith_short_8","alias_value":"BWNOXIDP","created_at":"2026-05-18T12:32:16Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:BWNOXIDPPZA7OKGIMXRHMJOTYQ","target":"record","payload":{"canonical_record":{"source":{"id":"1804.03048","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.HC","submitted_at":"2018-04-09T15:05:56Z","cross_cats_sorted":["cs.AI","cs.DB","cs.LG"],"title_canon_sha256":"81aee33ecc519f34a718a192973c66857e2bdf65e91ec4590e01e3e82a39e415","abstract_canon_sha256":"09f502b6929c972944ef0ecc61af032e631fbc86c7554f3089117a88bea424d1"},"schema_version":"1.0"},"canonical_sha256":"0d9aeba06f7e41f728c865e27625d3c40a3b4e159e6c266755666c827f7de11a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:59:44.672677Z","signature_b64":"xuacFh2/V66QiqvOE5FmReBb4Bsw0tXB3VqNdFeltELU8/hR3QgG1KVcpGGxcaooKIGuvbGu2L8KThwPgktuAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0d9aeba06f7e41f728c865e27625d3c40a3b4e159e6c266755666c827f7de11a","last_reissued_at":"2026-05-17T23:59:44.672251Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:59:44.672251Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1804.03048","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:59:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bZwS6udhyO5o7T5qA+owkbHWTS4yvkYKcdreDRA4eN4ERv4Me+z89fm6QNJkiX08TfT3xgIa2EgkjHQMYeUvCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T07:22:51.951985Z"},"content_sha256":"d8b7935dd0144b8c0d4dae586d06e0c0526e6d2ded1a0b9d84d4425b451b9040","schema_version":"1.0","event_id":"sha256:d8b7935dd0144b8c0d4dae586d06e0c0526e6d2ded1a0b9d84d4425b451b9040"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:BWNOXIDPPZA7OKGIMXRHMJOTYQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Clustrophile 2: Guided Visual Clustering Analysis","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.DB","cs.LG"],"primary_cat":"cs.HC","authors_text":"\\c{C}a\\u{g}atay Demiralp, Marco Cavallo","submitted_at":"2018-04-09T15:05:56Z","abstract_excerpt":"Data clustering is a common unsupervised learning method frequently used in exploratory data analysis. However, identifying relevant structures in unlabeled, high-dimensional data is nontrivial, requiring iterative experimentation with clustering parameters as well as data features and instances. The number of possible clusterings for a typical dataset is vast, and navigating in this vast space is also challenging. The absence of ground-truth labels makes it impossible to define an optimal solution, thus requiring user judgment to establish what can be considered a satisfiable clustering resul"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.03048","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:59:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TG++LPl5OrzR62chfg9UMOMO11VeT01/BqQbgrwXSVSrtvBFEbTauBZGV23dlvK7gjLs7QZi9zzRZqMhnw/lDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T07:22:51.952354Z"},"content_sha256":"e44f46a8e97c67b3db88f27de7573009d24f0416671b48b3cccc84cf3aea3f96","schema_version":"1.0","event_id":"sha256:e44f46a8e97c67b3db88f27de7573009d24f0416671b48b3cccc84cf3aea3f96"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BWNOXIDPPZA7OKGIMXRHMJOTYQ/bundle.json","state_url":"https://pith.science/pith/BWNOXIDPPZA7OKGIMXRHMJOTYQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BWNOXIDPPZA7OKGIMXRHMJOTYQ/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-24T07:22:51Z","links":{"resolver":"https://pith.science/pith/BWNOXIDPPZA7OKGIMXRHMJOTYQ","bundle":"https://pith.science/pith/BWNOXIDPPZA7OKGIMXRHMJOTYQ/bundle.json","state":"https://pith.science/pith/BWNOXIDPPZA7OKGIMXRHMJOTYQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BWNOXIDPPZA7OKGIMXRHMJOTYQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:BWNOXIDPPZA7OKGIMXRHMJOTYQ","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":"09f502b6929c972944ef0ecc61af032e631fbc86c7554f3089117a88bea424d1","cross_cats_sorted":["cs.AI","cs.DB","cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.HC","submitted_at":"2018-04-09T15:05:56Z","title_canon_sha256":"81aee33ecc519f34a718a192973c66857e2bdf65e91ec4590e01e3e82a39e415"},"schema_version":"1.0","source":{"id":"1804.03048","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1804.03048","created_at":"2026-05-17T23:59:44Z"},{"alias_kind":"arxiv_version","alias_value":"1804.03048v3","created_at":"2026-05-17T23:59:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.03048","created_at":"2026-05-17T23:59:44Z"},{"alias_kind":"pith_short_12","alias_value":"BWNOXIDPPZA7","created_at":"2026-05-18T12:32:16Z"},{"alias_kind":"pith_short_16","alias_value":"BWNOXIDPPZA7OKGI","created_at":"2026-05-18T12:32:16Z"},{"alias_kind":"pith_short_8","alias_value":"BWNOXIDP","created_at":"2026-05-18T12:32:16Z"}],"graph_snapshots":[{"event_id":"sha256:e44f46a8e97c67b3db88f27de7573009d24f0416671b48b3cccc84cf3aea3f96","target":"graph","created_at":"2026-05-17T23:59:44Z","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":"Data clustering is a common unsupervised learning method frequently used in exploratory data analysis. However, identifying relevant structures in unlabeled, high-dimensional data is nontrivial, requiring iterative experimentation with clustering parameters as well as data features and instances. The number of possible clusterings for a typical dataset is vast, and navigating in this vast space is also challenging. The absence of ground-truth labels makes it impossible to define an optimal solution, thus requiring user judgment to establish what can be considered a satisfiable clustering resul","authors_text":"\\c{C}a\\u{g}atay Demiralp, Marco Cavallo","cross_cats":["cs.AI","cs.DB","cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.HC","submitted_at":"2018-04-09T15:05:56Z","title":"Clustrophile 2: Guided Visual Clustering Analysis"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.03048","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:d8b7935dd0144b8c0d4dae586d06e0c0526e6d2ded1a0b9d84d4425b451b9040","target":"record","created_at":"2026-05-17T23:59:44Z","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":"09f502b6929c972944ef0ecc61af032e631fbc86c7554f3089117a88bea424d1","cross_cats_sorted":["cs.AI","cs.DB","cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.HC","submitted_at":"2018-04-09T15:05:56Z","title_canon_sha256":"81aee33ecc519f34a718a192973c66857e2bdf65e91ec4590e01e3e82a39e415"},"schema_version":"1.0","source":{"id":"1804.03048","kind":"arxiv","version":3}},"canonical_sha256":"0d9aeba06f7e41f728c865e27625d3c40a3b4e159e6c266755666c827f7de11a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0d9aeba06f7e41f728c865e27625d3c40a3b4e159e6c266755666c827f7de11a","first_computed_at":"2026-05-17T23:59:44.672251Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:59:44.672251Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"xuacFh2/V66QiqvOE5FmReBb4Bsw0tXB3VqNdFeltELU8/hR3QgG1KVcpGGxcaooKIGuvbGu2L8KThwPgktuAg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:59:44.672677Z","signed_message":"canonical_sha256_bytes"},"source_id":"1804.03048","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d8b7935dd0144b8c0d4dae586d06e0c0526e6d2ded1a0b9d84d4425b451b9040","sha256:e44f46a8e97c67b3db88f27de7573009d24f0416671b48b3cccc84cf3aea3f96"],"state_sha256":"dea493c97762430430c5430f3dbde972d25eb33e37fa6429d5710a2561cf4ad3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SRNaFeHK0XxlNrh0+viK63bEIvnbIUCJgw4+F4RHym5cxEhrbMrtlyi1Tlh37zoIjZYDwOxqmhVI+aAl3WkBDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-24T07:22:51.954287Z","bundle_sha256":"e2639a35d7d9d88a3f4d7a0e2d9fee526c7ec01b040dd467b19f2ccde0456194"}}