{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:PCBV2TC7L7QCTSXUTCCN65Y43J","short_pith_number":"pith:PCBV2TC7","schema_version":"1.0","canonical_sha256":"78835d4c5f5fe029caf49884df771cda7c1360dbb34c3a5e01a2afcf90a0d885","source":{"kind":"arxiv","id":"1705.07666","version":4},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1705.07666","created_at":"2026-05-18T00:34:37.150501+00:00"},{"alias_kind":"arxiv_version","alias_value":"1705.07666v4","created_at":"2026-05-18T00:34:37.150501+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.07666","created_at":"2026-05-18T00:34:37.150501+00:00"},{"alias_kind":"pith_short_12","alias_value":"PCBV2TC7L7QC","created_at":"2026-05-18T12:31:37.085036+00:00"},{"alias_kind":"pith_short_16","alias_value":"PCBV2TC7L7QCTSXU","created_at":"2026-05-18T12:31:37.085036+00:00"},{"alias_kind":"pith_short_8","alias_value":"PCBV2TC7","created_at":"2026-05-18T12:31:37.085036+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/PCBV2TC7L7QCTSXUTCCN65Y43J","json":"https://pith.science/pith/PCBV2TC7L7QCTSXUTCCN65Y43J.json","graph_json":"https://pith.science/api/pith-number/PCBV2TC7L7QCTSXUTCCN65Y43J/graph.json","events_json":"https://pith.science/api/pith-number/PCBV2TC7L7QCTSXUTCCN65Y43J/events.json","paper":"https://pith.science/paper/PCBV2TC7"},"agent_actions":{"view_html":"https://pith.science/pith/PCBV2TC7L7QCTSXUTCCN65Y43J","download_json":"https://pith.science/pith/PCBV2TC7L7QCTSXUTCCN65Y43J.json","view_paper":"https://pith.science/paper/PCBV2TC7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1705.07666&json=true","fetch_graph":"https://pith.science/api/pith-number/PCBV2TC7L7QCTSXUTCCN65Y43J/graph.json","fetch_events":"https://pith.science/api/pith-number/PCBV2TC7L7QCTSXUTCCN65Y43J/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PCBV2TC7L7QCTSXUTCCN65Y43J/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PCBV2TC7L7QCTSXUTCCN65Y43J/action/storage_attestation","attest_author":"https://pith.science/pith/PCBV2TC7L7QCTSXUTCCN65Y43J/action/author_attestation","sign_citation":"https://pith.science/pith/PCBV2TC7L7QCTSXUTCCN65Y43J/action/citation_signature","submit_replication":"https://pith.science/pith/PCBV2TC7L7QCTSXUTCCN65Y43J/action/replication_record"}},"created_at":"2026-05-18T00:34:37.150501+00:00","updated_at":"2026-05-18T00:34:37.150501+00:00"}