{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:ANROWLAEYRBZIAMU3PXYYZKOHA","short_pith_number":"pith:ANROWLAE","canonical_record":{"source":{"id":"1804.02270","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-03-19T07:43:45Z","cross_cats_sorted":[],"title_canon_sha256":"21ca64d9e3b7252ad30b0314b7d83c89912dc2a876ba40fe59388bff1c7d7d45","abstract_canon_sha256":"051f602df14e30211f23e0c721ad75a4ed18674097f1150b4026f0e3252a803b"},"schema_version":"1.0"},"canonical_sha256":"0362eb2c04c443940194dbef8c654e382e338b37869146490c5b30b38947908d","source":{"kind":"arxiv","id":"1804.02270","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1804.02270","created_at":"2026-05-18T00:19:05Z"},{"alias_kind":"arxiv_version","alias_value":"1804.02270v1","created_at":"2026-05-18T00:19:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.02270","created_at":"2026-05-18T00:19:05Z"},{"alias_kind":"pith_short_12","alias_value":"ANROWLAEYRBZ","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_16","alias_value":"ANROWLAEYRBZIAMU","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_8","alias_value":"ANROWLAE","created_at":"2026-05-18T12:32:13Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:ANROWLAEYRBZIAMU3PXYYZKOHA","target":"record","payload":{"canonical_record":{"source":{"id":"1804.02270","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-03-19T07:43:45Z","cross_cats_sorted":[],"title_canon_sha256":"21ca64d9e3b7252ad30b0314b7d83c89912dc2a876ba40fe59388bff1c7d7d45","abstract_canon_sha256":"051f602df14e30211f23e0c721ad75a4ed18674097f1150b4026f0e3252a803b"},"schema_version":"1.0"},"canonical_sha256":"0362eb2c04c443940194dbef8c654e382e338b37869146490c5b30b38947908d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:19:05.368515Z","signature_b64":"DySjS3ySlEpHGyX0BlU1zi0FaF7M5m/xWk7MKPac6gnXWlub0xRlF/AAC34qjs4YZRMAhF2waz2mIJAKNmDTCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0362eb2c04c443940194dbef8c654e382e338b37869146490c5b30b38947908d","last_reissued_at":"2026-05-18T00:19:05.368034Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:19:05.368034Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1804.02270","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:19:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mHWNXVrYAiWAoU1kxmvTupj5NBxXJ7InBl7H/OB4jYLsMPw4LLnflUuqkF7ieeVv9auIp/kWBNxTH81xGn2dCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T17:40:42.330486Z"},"content_sha256":"be01126a4a78f23277d0eb317876d8f88461f4069ac0fba789c124d683bb955a","schema_version":"1.0","event_id":"sha256:be01126a4a78f23277d0eb317876d8f88461f4069ac0fba789c124d683bb955a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:ANROWLAEYRBZIAMU3PXYYZKOHA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Lagrange Multiplier Local Necessary and Global Sufficiency Criteria for Some Non-Convex Programming Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"B. Muraleetharan, K. Thirulogasanthar, S. Selvarajan, S. Srisatkunarajah","submitted_at":"2018-03-19T07:43:45Z","abstract_excerpt":"In this paper we consider three minimization problems, namely quadratic, $\\rho$-convex and quadratic fractional programing problems. The quadratic problem is considered with quadratic inequality constraints with bounded continuous and discrete mixed variables. The $\\rho$-convex problem is considered with $\\rho$-convex inequality constraints in mixed variables. The quadratic fractional problem is studied with quadratic fractional constraints in mixed variables. For all three problems we reformulate the problem as a mathematical programming problem and apply standard Karush Kuhn Tucker necessary"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.02270","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:19:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Pr8XdCpBc3QmpYLed8tZePdNoT4XJ/yjhaL4vIauOQufnVJn8ENuI0OPU/R0cWmp5myoc8BDDqsVlossCJs4CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T17:40:42.331145Z"},"content_sha256":"5bee7148ac325a998a809fb8776948dc9dd43cb6d36874cdd5d192de0eae44fe","schema_version":"1.0","event_id":"sha256:5bee7148ac325a998a809fb8776948dc9dd43cb6d36874cdd5d192de0eae44fe"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ANROWLAEYRBZIAMU3PXYYZKOHA/bundle.json","state_url":"https://pith.science/pith/ANROWLAEYRBZIAMU3PXYYZKOHA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ANROWLAEYRBZIAMU3PXYYZKOHA/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-30T17:40:42Z","links":{"resolver":"https://pith.science/pith/ANROWLAEYRBZIAMU3PXYYZKOHA","bundle":"https://pith.science/pith/ANROWLAEYRBZIAMU3PXYYZKOHA/bundle.json","state":"https://pith.science/pith/ANROWLAEYRBZIAMU3PXYYZKOHA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ANROWLAEYRBZIAMU3PXYYZKOHA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:ANROWLAEYRBZIAMU3PXYYZKOHA","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":"051f602df14e30211f23e0c721ad75a4ed18674097f1150b4026f0e3252a803b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-03-19T07:43:45Z","title_canon_sha256":"21ca64d9e3b7252ad30b0314b7d83c89912dc2a876ba40fe59388bff1c7d7d45"},"schema_version":"1.0","source":{"id":"1804.02270","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1804.02270","created_at":"2026-05-18T00:19:05Z"},{"alias_kind":"arxiv_version","alias_value":"1804.02270v1","created_at":"2026-05-18T00:19:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.02270","created_at":"2026-05-18T00:19:05Z"},{"alias_kind":"pith_short_12","alias_value":"ANROWLAEYRBZ","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_16","alias_value":"ANROWLAEYRBZIAMU","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_8","alias_value":"ANROWLAE","created_at":"2026-05-18T12:32:13Z"}],"graph_snapshots":[{"event_id":"sha256:5bee7148ac325a998a809fb8776948dc9dd43cb6d36874cdd5d192de0eae44fe","target":"graph","created_at":"2026-05-18T00:19:05Z","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":"In this paper we consider three minimization problems, namely quadratic, $\\rho$-convex and quadratic fractional programing problems. The quadratic problem is considered with quadratic inequality constraints with bounded continuous and discrete mixed variables. The $\\rho$-convex problem is considered with $\\rho$-convex inequality constraints in mixed variables. The quadratic fractional problem is studied with quadratic fractional constraints in mixed variables. For all three problems we reformulate the problem as a mathematical programming problem and apply standard Karush Kuhn Tucker necessary","authors_text":"B. Muraleetharan, K. Thirulogasanthar, S. Selvarajan, S. Srisatkunarajah","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-03-19T07:43:45Z","title":"Lagrange Multiplier Local Necessary and Global Sufficiency Criteria for Some Non-Convex Programming Problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.02270","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:be01126a4a78f23277d0eb317876d8f88461f4069ac0fba789c124d683bb955a","target":"record","created_at":"2026-05-18T00:19:05Z","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":"051f602df14e30211f23e0c721ad75a4ed18674097f1150b4026f0e3252a803b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-03-19T07:43:45Z","title_canon_sha256":"21ca64d9e3b7252ad30b0314b7d83c89912dc2a876ba40fe59388bff1c7d7d45"},"schema_version":"1.0","source":{"id":"1804.02270","kind":"arxiv","version":1}},"canonical_sha256":"0362eb2c04c443940194dbef8c654e382e338b37869146490c5b30b38947908d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0362eb2c04c443940194dbef8c654e382e338b37869146490c5b30b38947908d","first_computed_at":"2026-05-18T00:19:05.368034Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:19:05.368034Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"DySjS3ySlEpHGyX0BlU1zi0FaF7M5m/xWk7MKPac6gnXWlub0xRlF/AAC34qjs4YZRMAhF2waz2mIJAKNmDTCA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:19:05.368515Z","signed_message":"canonical_sha256_bytes"},"source_id":"1804.02270","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:be01126a4a78f23277d0eb317876d8f88461f4069ac0fba789c124d683bb955a","sha256:5bee7148ac325a998a809fb8776948dc9dd43cb6d36874cdd5d192de0eae44fe"],"state_sha256":"3e5319bf74c0ae778d9690cc822a1ed50af5fcbbad588fc0c7887d8e49814d8a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"52aiWnD9NMSPcJMSqCRQR5H7EJs7lFRPdNpVzaBwPQGQXSoHI9w2shmfvAiEvuXGAK5TUBbTyvmPgMpM3JXLBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T17:40:42.334541Z","bundle_sha256":"7bbc6c0f362633288cbf3e65920b0cae03079c6d155f340ba5dd26c3488fbd6d"}}