{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:P5HCZ3RK5IFBZUZAN7MG6GAG5A","short_pith_number":"pith:P5HCZ3RK","canonical_record":{"source":{"id":"1712.08259","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-12-22T00:31:46Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"9788315ff66494bb94305d473f13b384d15cf53ff8fd554f30c429e3758b688f","abstract_canon_sha256":"c4859596e877f953d7611ea951cc3bc974558f37ead27ec014dcf7865d7bc31c"},"schema_version":"1.0"},"canonical_sha256":"7f4e2cee2aea0a1cd3206fd86f1806e8099083569b770aacf01bc287837984c2","source":{"kind":"arxiv","id":"1712.08259","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1712.08259","created_at":"2026-05-18T00:27:23Z"},{"alias_kind":"arxiv_version","alias_value":"1712.08259v1","created_at":"2026-05-18T00:27:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.08259","created_at":"2026-05-18T00:27:23Z"},{"alias_kind":"pith_short_12","alias_value":"P5HCZ3RK5IFB","created_at":"2026-05-18T12:31:37Z"},{"alias_kind":"pith_short_16","alias_value":"P5HCZ3RK5IFBZUZA","created_at":"2026-05-18T12:31:37Z"},{"alias_kind":"pith_short_8","alias_value":"P5HCZ3RK","created_at":"2026-05-18T12:31:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:P5HCZ3RK5IFBZUZAN7MG6GAG5A","target":"record","payload":{"canonical_record":{"source":{"id":"1712.08259","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-12-22T00:31:46Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"9788315ff66494bb94305d473f13b384d15cf53ff8fd554f30c429e3758b688f","abstract_canon_sha256":"c4859596e877f953d7611ea951cc3bc974558f37ead27ec014dcf7865d7bc31c"},"schema_version":"1.0"},"canonical_sha256":"7f4e2cee2aea0a1cd3206fd86f1806e8099083569b770aacf01bc287837984c2","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:27:23.996553Z","signature_b64":"04iXLBu4HCb8HlcDD+4a1jJknodjR8evZWMaoL3GONAG7WBuabt/UuAiPWQOv00GACtx0RDztNOGjavplNzKBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7f4e2cee2aea0a1cd3206fd86f1806e8099083569b770aacf01bc287837984c2","last_reissued_at":"2026-05-18T00:27:23.995799Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:27:23.995799Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1712.08259","source_version":1,"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:27:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Kqzl/59hpSzr12pOvCQ7+Qo3w+n6C8BpO0Wrj7THj63LiVENlKy84D6DmknuzpUTvtfNszsOxkmg14pdva/WBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T19:33:48.260254Z"},"content_sha256":"03ef18bd38ab6b484135c2ecbf1ef205b612bb7d830c83972fb07fe4be3a2b7c","schema_version":"1.0","event_id":"sha256:03ef18bd38ab6b484135c2ecbf1ef205b612bb7d830c83972fb07fe4be3a2b7c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:P5HCZ3RK5IFBZUZAN7MG6GAG5A","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Linear centralization classifier","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"David C. Reutens, Mohammad Reza Bonyadi, Viktor Vegh","submitted_at":"2017-12-22T00:31:46Z","abstract_excerpt":"A classification algorithm, called the Linear Centralization Classifier (LCC), is introduced. The algorithm seeks to find a transformation that best maps instances from the feature space to a space where they concentrate towards the center of their own classes, while maximimizing the distance between class centers. We formulate the classifier as a quadratic program with quadratic constraints. We then simplify this formulation to a linear program that can be solved effectively using a linear programming solver (e.g., simplex-dual). We extend the formulation for LCC to enable the use of kernel f"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.08259","kind":"arxiv","version":1},"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:27:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"V6H1y4cA4zpoxZpgYfW+991/tdcAhsRhOma18VOCkucNhEQdij3zcl8zBInu5PN9VeeJCxPIpZIFhVF/MUi7BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T19:33:48.260927Z"},"content_sha256":"6067fd7b93f4539589c352db364d80cc92bfcd49012bddb3792f9212e646d22e","schema_version":"1.0","event_id":"sha256:6067fd7b93f4539589c352db364d80cc92bfcd49012bddb3792f9212e646d22e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/P5HCZ3RK5IFBZUZAN7MG6GAG5A/bundle.json","state_url":"https://pith.science/pith/P5HCZ3RK5IFBZUZAN7MG6GAG5A/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/P5HCZ3RK5IFBZUZAN7MG6GAG5A/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-30T19:33:48Z","links":{"resolver":"https://pith.science/pith/P5HCZ3RK5IFBZUZAN7MG6GAG5A","bundle":"https://pith.science/pith/P5HCZ3RK5IFBZUZAN7MG6GAG5A/bundle.json","state":"https://pith.science/pith/P5HCZ3RK5IFBZUZAN7MG6GAG5A/state.json","well_known_bundle":"https://pith.science/.well-known/pith/P5HCZ3RK5IFBZUZAN7MG6GAG5A/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:P5HCZ3RK5IFBZUZAN7MG6GAG5A","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":"c4859596e877f953d7611ea951cc3bc974558f37ead27ec014dcf7865d7bc31c","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-12-22T00:31:46Z","title_canon_sha256":"9788315ff66494bb94305d473f13b384d15cf53ff8fd554f30c429e3758b688f"},"schema_version":"1.0","source":{"id":"1712.08259","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1712.08259","created_at":"2026-05-18T00:27:23Z"},{"alias_kind":"arxiv_version","alias_value":"1712.08259v1","created_at":"2026-05-18T00:27:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.08259","created_at":"2026-05-18T00:27:23Z"},{"alias_kind":"pith_short_12","alias_value":"P5HCZ3RK5IFB","created_at":"2026-05-18T12:31:37Z"},{"alias_kind":"pith_short_16","alias_value":"P5HCZ3RK5IFBZUZA","created_at":"2026-05-18T12:31:37Z"},{"alias_kind":"pith_short_8","alias_value":"P5HCZ3RK","created_at":"2026-05-18T12:31:37Z"}],"graph_snapshots":[{"event_id":"sha256:6067fd7b93f4539589c352db364d80cc92bfcd49012bddb3792f9212e646d22e","target":"graph","created_at":"2026-05-18T00:27:23Z","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":"A classification algorithm, called the Linear Centralization Classifier (LCC), is introduced. The algorithm seeks to find a transformation that best maps instances from the feature space to a space where they concentrate towards the center of their own classes, while maximimizing the distance between class centers. We formulate the classifier as a quadratic program with quadratic constraints. We then simplify this formulation to a linear program that can be solved effectively using a linear programming solver (e.g., simplex-dual). We extend the formulation for LCC to enable the use of kernel f","authors_text":"David C. Reutens, Mohammad Reza Bonyadi, Viktor Vegh","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-12-22T00:31:46Z","title":"Linear centralization classifier"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.08259","kind":"arxiv","version":1},"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:03ef18bd38ab6b484135c2ecbf1ef205b612bb7d830c83972fb07fe4be3a2b7c","target":"record","created_at":"2026-05-18T00:27:23Z","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":"c4859596e877f953d7611ea951cc3bc974558f37ead27ec014dcf7865d7bc31c","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-12-22T00:31:46Z","title_canon_sha256":"9788315ff66494bb94305d473f13b384d15cf53ff8fd554f30c429e3758b688f"},"schema_version":"1.0","source":{"id":"1712.08259","kind":"arxiv","version":1}},"canonical_sha256":"7f4e2cee2aea0a1cd3206fd86f1806e8099083569b770aacf01bc287837984c2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7f4e2cee2aea0a1cd3206fd86f1806e8099083569b770aacf01bc287837984c2","first_computed_at":"2026-05-18T00:27:23.995799Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:27:23.995799Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"04iXLBu4HCb8HlcDD+4a1jJknodjR8evZWMaoL3GONAG7WBuabt/UuAiPWQOv00GACtx0RDztNOGjavplNzKBg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:27:23.996553Z","signed_message":"canonical_sha256_bytes"},"source_id":"1712.08259","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:03ef18bd38ab6b484135c2ecbf1ef205b612bb7d830c83972fb07fe4be3a2b7c","sha256:6067fd7b93f4539589c352db364d80cc92bfcd49012bddb3792f9212e646d22e"],"state_sha256":"2c5e114360461112497f866aede136194428bc6e4df333000e2f88a7e0b2ad29"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4jwQ7MOU/8bRiJCVlhKvGW5xomLksuGmY2O2I61NNgCywqEGme7yPdUtBtVxeeYBiCAMv0QbGrGXC6jw3tcSAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T19:33:48.264692Z","bundle_sha256":"9a8798223a7e1b972b7131bbeece23a509fcdc3a6a873b7c4f454adc9790fd2c"}}