{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:PCBV2TC7L7QCTSXUTCCN65Y43J","short_pith_number":"pith:PCBV2TC7","canonical_record":{"source":{"id":"1705.07666","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2017-05-22T11:13:12Z","cross_cats_sorted":[],"title_canon_sha256":"fc13b9ce4d0d898ef03cf8b595118e1987dd1db3e671ea3877bf8cbdc2c975c4","abstract_canon_sha256":"16da5e6f08ba8d4e60fa39314d3b4a7c17aaa853202b981120693a65d6149d0b"},"schema_version":"1.0"},"canonical_sha256":"78835d4c5f5fe029caf49884df771cda7c1360dbb34c3a5e01a2afcf90a0d885","source":{"kind":"arxiv","id":"1705.07666","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.07666","created_at":"2026-05-18T00:34:37Z"},{"alias_kind":"arxiv_version","alias_value":"1705.07666v4","created_at":"2026-05-18T00:34:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.07666","created_at":"2026-05-18T00:34:37Z"},{"alias_kind":"pith_short_12","alias_value":"PCBV2TC7L7QC","created_at":"2026-05-18T12:31:37Z"},{"alias_kind":"pith_short_16","alias_value":"PCBV2TC7L7QCTSXU","created_at":"2026-05-18T12:31:37Z"},{"alias_kind":"pith_short_8","alias_value":"PCBV2TC7","created_at":"2026-05-18T12:31:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:PCBV2TC7L7QCTSXUTCCN65Y43J","target":"record","payload":{"canonical_record":{"source":{"id":"1705.07666","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2017-05-22T11:13:12Z","cross_cats_sorted":[],"title_canon_sha256":"fc13b9ce4d0d898ef03cf8b595118e1987dd1db3e671ea3877bf8cbdc2c975c4","abstract_canon_sha256":"16da5e6f08ba8d4e60fa39314d3b4a7c17aaa853202b981120693a65d6149d0b"},"schema_version":"1.0"},"canonical_sha256":"78835d4c5f5fe029caf49884df771cda7c1360dbb34c3a5e01a2afcf90a0d885","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:34:37.150862Z","signature_b64":"Cj3q+70CAyigk5BlirW9fSjRbuh8eOUsdNMuAxQ/ziP1g8bPJBF/wgwQtlvUMKMI6+zD84Ta7jBqRPUL6jBSDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"78835d4c5f5fe029caf49884df771cda7c1360dbb34c3a5e01a2afcf90a0d885","last_reissued_at":"2026-05-18T00:34:37.150432Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:34:37.150432Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1705.07666","source_version":4,"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:34:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XCA26VP/fYvCMVmn0rbCkpD4Ea6FiJUTMN7y3c4oWWFtwXLqFl8h3ir6g3a0D9QHQIqlLQ1k2za4KFOPtYPaDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T10:22:55.553985Z"},"content_sha256":"7dd3e1997dc7f814b964caa7288f9252a7e09ffa6e6f27dfdd5337a4f6f26473","schema_version":"1.0","event_id":"sha256:7dd3e1997dc7f814b964caa7288f9252a7e09ffa6e6f27dfdd5337a4f6f26473"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:PCBV2TC7L7QCTSXUTCCN65Y43J","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Goal Clustering: VNS based heuristics","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Pedro Martins","submitted_at":"2017-05-22T11:13:12Z","abstract_excerpt":"Given a set V of n elements on m attributes, we want to find a partition of V on the minimum number of clusters such that the associated R-squared ratio is at least a given threshold. We denote this problem as Goal Clustering (GC). This problem represents a new perspective, characterizing a different methodology within unsupervised non-hierarchical clustering. In effect, while in the k-means we set the number of clusters in advance and then test the associated R-squared ratio; in the GC we set an R-squared threshold lower limit in advance and minimize k. We present two Variable Neighborhood Se"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.07666","kind":"arxiv","version":4},"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:34:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IhjQvjBCLRXAaRtEoCuOhKR1Ff9izPxIJGSS0t2FT0kLy/h90ybNIyPrkvFmldylmujg3rwWAhNFvV+Po0O4Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T10:22:55.554349Z"},"content_sha256":"caa2434786c097757e914b6b8ca06cdb7f9f5527dff63e78652369f8a4c2b4db","schema_version":"1.0","event_id":"sha256:caa2434786c097757e914b6b8ca06cdb7f9f5527dff63e78652369f8a4c2b4db"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PCBV2TC7L7QCTSXUTCCN65Y43J/bundle.json","state_url":"https://pith.science/pith/PCBV2TC7L7QCTSXUTCCN65Y43J/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PCBV2TC7L7QCTSXUTCCN65Y43J/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-28T10:22:55Z","links":{"resolver":"https://pith.science/pith/PCBV2TC7L7QCTSXUTCCN65Y43J","bundle":"https://pith.science/pith/PCBV2TC7L7QCTSXUTCCN65Y43J/bundle.json","state":"https://pith.science/pith/PCBV2TC7L7QCTSXUTCCN65Y43J/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PCBV2TC7L7QCTSXUTCCN65Y43J/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:PCBV2TC7L7QCTSXUTCCN65Y43J","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":"16da5e6f08ba8d4e60fa39314d3b4a7c17aaa853202b981120693a65d6149d0b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2017-05-22T11:13:12Z","title_canon_sha256":"fc13b9ce4d0d898ef03cf8b595118e1987dd1db3e671ea3877bf8cbdc2c975c4"},"schema_version":"1.0","source":{"id":"1705.07666","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.07666","created_at":"2026-05-18T00:34:37Z"},{"alias_kind":"arxiv_version","alias_value":"1705.07666v4","created_at":"2026-05-18T00:34:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.07666","created_at":"2026-05-18T00:34:37Z"},{"alias_kind":"pith_short_12","alias_value":"PCBV2TC7L7QC","created_at":"2026-05-18T12:31:37Z"},{"alias_kind":"pith_short_16","alias_value":"PCBV2TC7L7QCTSXU","created_at":"2026-05-18T12:31:37Z"},{"alias_kind":"pith_short_8","alias_value":"PCBV2TC7","created_at":"2026-05-18T12:31:37Z"}],"graph_snapshots":[{"event_id":"sha256:caa2434786c097757e914b6b8ca06cdb7f9f5527dff63e78652369f8a4c2b4db","target":"graph","created_at":"2026-05-18T00:34:37Z","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":"Given a set V of n elements on m attributes, we want to find a partition of V on the minimum number of clusters such that the associated R-squared ratio is at least a given threshold. We denote this problem as Goal Clustering (GC). This problem represents a new perspective, characterizing a different methodology within unsupervised non-hierarchical clustering. In effect, while in the k-means we set the number of clusters in advance and then test the associated R-squared ratio; in the GC we set an R-squared threshold lower limit in advance and minimize k. We present two Variable Neighborhood Se","authors_text":"Pedro Martins","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2017-05-22T11:13:12Z","title":"Goal Clustering: VNS based heuristics"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.07666","kind":"arxiv","version":4},"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:7dd3e1997dc7f814b964caa7288f9252a7e09ffa6e6f27dfdd5337a4f6f26473","target":"record","created_at":"2026-05-18T00:34:37Z","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":"16da5e6f08ba8d4e60fa39314d3b4a7c17aaa853202b981120693a65d6149d0b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2017-05-22T11:13:12Z","title_canon_sha256":"fc13b9ce4d0d898ef03cf8b595118e1987dd1db3e671ea3877bf8cbdc2c975c4"},"schema_version":"1.0","source":{"id":"1705.07666","kind":"arxiv","version":4}},"canonical_sha256":"78835d4c5f5fe029caf49884df771cda7c1360dbb34c3a5e01a2afcf90a0d885","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"78835d4c5f5fe029caf49884df771cda7c1360dbb34c3a5e01a2afcf90a0d885","first_computed_at":"2026-05-18T00:34:37.150432Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:34:37.150432Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Cj3q+70CAyigk5BlirW9fSjRbuh8eOUsdNMuAxQ/ziP1g8bPJBF/wgwQtlvUMKMI6+zD84Ta7jBqRPUL6jBSDA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:34:37.150862Z","signed_message":"canonical_sha256_bytes"},"source_id":"1705.07666","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7dd3e1997dc7f814b964caa7288f9252a7e09ffa6e6f27dfdd5337a4f6f26473","sha256:caa2434786c097757e914b6b8ca06cdb7f9f5527dff63e78652369f8a4c2b4db"],"state_sha256":"e24b5a65bb5be287ac8be337cb1df19e82df5e230a7cd4e9be60ec827dfd7b7a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DUm6rCydaKKf4aPWMQCxXmPyOeVgzJ80SimrUpdesypuzoGrl17EY3ofp5YvC9I97deLrIFMjRz0hgZEHPhVAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T10:22:55.556284Z","bundle_sha256":"bc663b8c0f83ff593b8bb164c618627b1e11b53b1420528f3e150a448af9d5b0"}}