{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:HICKFW25UTW6BL7RBQLXVQOE3G","short_pith_number":"pith:HICKFW25","canonical_record":{"source":{"id":"1407.6315","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2014-07-23T18:04:23Z","cross_cats_sorted":["cs.LG","cs.NE","math.OC"],"title_canon_sha256":"751bd6a463346cda7065727c411e927fa96ba537e161cc997fea4d6816d9b555","abstract_canon_sha256":"e3a9b845e769ea62ee6483e2744b6e774fda46a8422f2c62ddaf5b0fee358b9c"},"schema_version":"1.0"},"canonical_sha256":"3a04a2db5da4ede0aff10c177ac1c4d9afff1194d4003c6bb0f60ae3ae345b99","source":{"kind":"arxiv","id":"1407.6315","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1407.6315","created_at":"2026-05-18T02:46:39Z"},{"alias_kind":"arxiv_version","alias_value":"1407.6315v1","created_at":"2026-05-18T02:46:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.6315","created_at":"2026-05-18T02:46:39Z"},{"alias_kind":"pith_short_12","alias_value":"HICKFW25UTW6","created_at":"2026-05-18T12:28:30Z"},{"alias_kind":"pith_short_16","alias_value":"HICKFW25UTW6BL7R","created_at":"2026-05-18T12:28:30Z"},{"alias_kind":"pith_short_8","alias_value":"HICKFW25","created_at":"2026-05-18T12:28:30Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:HICKFW25UTW6BL7RBQLXVQOE3G","target":"record","payload":{"canonical_record":{"source":{"id":"1407.6315","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2014-07-23T18:04:23Z","cross_cats_sorted":["cs.LG","cs.NE","math.OC"],"title_canon_sha256":"751bd6a463346cda7065727c411e927fa96ba537e161cc997fea4d6816d9b555","abstract_canon_sha256":"e3a9b845e769ea62ee6483e2744b6e774fda46a8422f2c62ddaf5b0fee358b9c"},"schema_version":"1.0"},"canonical_sha256":"3a04a2db5da4ede0aff10c177ac1c4d9afff1194d4003c6bb0f60ae3ae345b99","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:46:39.883777Z","signature_b64":"HWh5nUewCa6jZmcqARywwIGFLeZof5vQrFr52p5sGLNrH7ugLnxU7KRDeMgZ4VZVlt7RecDgb6ezieAmKhhcCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3a04a2db5da4ede0aff10c177ac1c4d9afff1194d4003c6bb0f60ae3ae345b99","last_reissued_at":"2026-05-18T02:46:39.883359Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:46:39.883359Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1407.6315","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-18T02:46:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"M3wELNqiOgoXLp54CT8Qxdkd21ajdLtrWQtcf20Ygw9SeFpZMp+snhxqsbFpy1R9VSxvRoOLEAY+jS8dRcD6Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-28T11:07:07.241015Z"},"content_sha256":"b4a89f362e473a3f3f46283006d230e7d78971a0080cec5480293e48aae3b242","schema_version":"1.0","event_id":"sha256:b4a89f362e473a3f3f46283006d230e7d78971a0080cec5480293e48aae3b242"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:HICKFW25UTW6BL7RBQLXVQOE3G","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Quadratically constrained quadratic programming for classification using particle swarms and applications","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","cs.NE","math.OC"],"primary_cat":"cs.AI","authors_text":"A G Ramakrishnan, Deepak Kumar","submitted_at":"2014-07-23T18:04:23Z","abstract_excerpt":"Particle swarm optimization is used in several combinatorial optimization problems. In this work, particle swarms are used to solve quadratic programming problems with quadratic constraints. The approach of particle swarms is an example for interior point methods in optimization as an iterative technique. This approach is novel and deals with classification problems without the use of a traditional classifier. Our method determines the optimal hyperplane or classification boundary for a data set. In a binary classification problem, we constrain each class as a cluster, which is enclosed by an "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1407.6315","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-18T02:46:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yPTB4yTcPQEVirm/8lj6rQ8Sgz99UwqkrcG8eUqoXsGBmoFD4clppjR/Kk7F00+ZsgcIhLA7LO8sVxK9iCgCAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-28T11:07:07.241378Z"},"content_sha256":"97a002c3addb04b3fb743dd5454cb33bc48faa9283ea5415ea0c4ec4b7e5c335","schema_version":"1.0","event_id":"sha256:97a002c3addb04b3fb743dd5454cb33bc48faa9283ea5415ea0c4ec4b7e5c335"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HICKFW25UTW6BL7RBQLXVQOE3G/bundle.json","state_url":"https://pith.science/pith/HICKFW25UTW6BL7RBQLXVQOE3G/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HICKFW25UTW6BL7RBQLXVQOE3G/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-28T11:07:07Z","links":{"resolver":"https://pith.science/pith/HICKFW25UTW6BL7RBQLXVQOE3G","bundle":"https://pith.science/pith/HICKFW25UTW6BL7RBQLXVQOE3G/bundle.json","state":"https://pith.science/pith/HICKFW25UTW6BL7RBQLXVQOE3G/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HICKFW25UTW6BL7RBQLXVQOE3G/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:HICKFW25UTW6BL7RBQLXVQOE3G","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":"e3a9b845e769ea62ee6483e2744b6e774fda46a8422f2c62ddaf5b0fee358b9c","cross_cats_sorted":["cs.LG","cs.NE","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2014-07-23T18:04:23Z","title_canon_sha256":"751bd6a463346cda7065727c411e927fa96ba537e161cc997fea4d6816d9b555"},"schema_version":"1.0","source":{"id":"1407.6315","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1407.6315","created_at":"2026-05-18T02:46:39Z"},{"alias_kind":"arxiv_version","alias_value":"1407.6315v1","created_at":"2026-05-18T02:46:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.6315","created_at":"2026-05-18T02:46:39Z"},{"alias_kind":"pith_short_12","alias_value":"HICKFW25UTW6","created_at":"2026-05-18T12:28:30Z"},{"alias_kind":"pith_short_16","alias_value":"HICKFW25UTW6BL7R","created_at":"2026-05-18T12:28:30Z"},{"alias_kind":"pith_short_8","alias_value":"HICKFW25","created_at":"2026-05-18T12:28:30Z"}],"graph_snapshots":[{"event_id":"sha256:97a002c3addb04b3fb743dd5454cb33bc48faa9283ea5415ea0c4ec4b7e5c335","target":"graph","created_at":"2026-05-18T02:46:39Z","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":"Particle swarm optimization is used in several combinatorial optimization problems. In this work, particle swarms are used to solve quadratic programming problems with quadratic constraints. The approach of particle swarms is an example for interior point methods in optimization as an iterative technique. This approach is novel and deals with classification problems without the use of a traditional classifier. Our method determines the optimal hyperplane or classification boundary for a data set. In a binary classification problem, we constrain each class as a cluster, which is enclosed by an ","authors_text":"A G Ramakrishnan, Deepak Kumar","cross_cats":["cs.LG","cs.NE","math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2014-07-23T18:04:23Z","title":"Quadratically constrained quadratic programming for classification using particle swarms and applications"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1407.6315","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:b4a89f362e473a3f3f46283006d230e7d78971a0080cec5480293e48aae3b242","target":"record","created_at":"2026-05-18T02:46:39Z","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":"e3a9b845e769ea62ee6483e2744b6e774fda46a8422f2c62ddaf5b0fee358b9c","cross_cats_sorted":["cs.LG","cs.NE","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2014-07-23T18:04:23Z","title_canon_sha256":"751bd6a463346cda7065727c411e927fa96ba537e161cc997fea4d6816d9b555"},"schema_version":"1.0","source":{"id":"1407.6315","kind":"arxiv","version":1}},"canonical_sha256":"3a04a2db5da4ede0aff10c177ac1c4d9afff1194d4003c6bb0f60ae3ae345b99","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3a04a2db5da4ede0aff10c177ac1c4d9afff1194d4003c6bb0f60ae3ae345b99","first_computed_at":"2026-05-18T02:46:39.883359Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:46:39.883359Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"HWh5nUewCa6jZmcqARywwIGFLeZof5vQrFr52p5sGLNrH7ugLnxU7KRDeMgZ4VZVlt7RecDgb6ezieAmKhhcCA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:46:39.883777Z","signed_message":"canonical_sha256_bytes"},"source_id":"1407.6315","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b4a89f362e473a3f3f46283006d230e7d78971a0080cec5480293e48aae3b242","sha256:97a002c3addb04b3fb743dd5454cb33bc48faa9283ea5415ea0c4ec4b7e5c335"],"state_sha256":"7fc96e4dfe0f535698b391efab9140711b3205b719ef419cb491d2a97de6bafb"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nIvtJ9iXBmXIk3R1mjCwprMyElJUpD2DEFjP7tRuqKw9d/RZTWgtt+8mJAS8huEjb+iSixX7s8wLWakqSmSuCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-28T11:07:07.243243Z","bundle_sha256":"66821a4d43871cee0453e17fc0fd336197246b3d84a123200b3d730dc160eab6"}}