{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:DAVHISE4DZV5SYWIMNTWUQUUTZ","short_pith_number":"pith:DAVHISE4","schema_version":"1.0","canonical_sha256":"182a74489c1e6bd962c863676a42949e79c0056049ea75f1b0b3f9ef1022c400","source":{"kind":"arxiv","id":"1106.0851","version":1},"attestation_state":"computed","paper":{"title":"A Dual Approach for Solving Nonlinear Infinite-Norm Minimization Problems with Applications in Separable Cases","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Wajeb Gharibi, Yong Xia","submitted_at":"2011-06-04T19:17:30Z","abstract_excerpt":"In this paper, we focus on nonlinear infinite-norm minimization problems that have many applications, especially in computer science and operations research. We set a reliable Lagrangian dual aproach for solving this kind of problems in general, and based on this method, we propose an algorithm for the mixed linear and nonlinear infinite-norm minimization cases with numerical results."},"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":"1106.0851","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2011-06-04T19:17:30Z","cross_cats_sorted":[],"title_canon_sha256":"63bda797d2b2f3ba87bb3a893b3f02f97fb817ab15f5a284dad555c676567fe2","abstract_canon_sha256":"9a9f0d53b36d0b4d4449f07587f9ea6e0ee954970cfd3c1af36130e0805dbc10"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:20:37.292076Z","signature_b64":"d3iPvNjZ3wuo2Ym2DQyU2OEr3sBazjEM2E5Stp1MNTBC2ItZTOtKqIK8rf/JTJ9flRxNnZ70TWI28BNundsSCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"182a74489c1e6bd962c863676a42949e79c0056049ea75f1b0b3f9ef1022c400","last_reissued_at":"2026-05-18T04:20:37.291387Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:20:37.291387Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Dual Approach for Solving Nonlinear Infinite-Norm Minimization Problems with Applications in Separable Cases","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Wajeb Gharibi, Yong Xia","submitted_at":"2011-06-04T19:17:30Z","abstract_excerpt":"In this paper, we focus on nonlinear infinite-norm minimization problems that have many applications, especially in computer science and operations research. We set a reliable Lagrangian dual aproach for solving this kind of problems in general, and based on this method, we propose an algorithm for the mixed linear and nonlinear infinite-norm minimization cases with numerical results."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1106.0851","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1106.0851","created_at":"2026-05-18T04:20:37.291485+00:00"},{"alias_kind":"arxiv_version","alias_value":"1106.0851v1","created_at":"2026-05-18T04:20:37.291485+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1106.0851","created_at":"2026-05-18T04:20:37.291485+00:00"},{"alias_kind":"pith_short_12","alias_value":"DAVHISE4DZV5","created_at":"2026-05-18T12:26:26.731475+00:00"},{"alias_kind":"pith_short_16","alias_value":"DAVHISE4DZV5SYWI","created_at":"2026-05-18T12:26:26.731475+00:00"},{"alias_kind":"pith_short_8","alias_value":"DAVHISE4","created_at":"2026-05-18T12:26:26.731475+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/DAVHISE4DZV5SYWIMNTWUQUUTZ","json":"https://pith.science/pith/DAVHISE4DZV5SYWIMNTWUQUUTZ.json","graph_json":"https://pith.science/api/pith-number/DAVHISE4DZV5SYWIMNTWUQUUTZ/graph.json","events_json":"https://pith.science/api/pith-number/DAVHISE4DZV5SYWIMNTWUQUUTZ/events.json","paper":"https://pith.science/paper/DAVHISE4"},"agent_actions":{"view_html":"https://pith.science/pith/DAVHISE4DZV5SYWIMNTWUQUUTZ","download_json":"https://pith.science/pith/DAVHISE4DZV5SYWIMNTWUQUUTZ.json","view_paper":"https://pith.science/paper/DAVHISE4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1106.0851&json=true","fetch_graph":"https://pith.science/api/pith-number/DAVHISE4DZV5SYWIMNTWUQUUTZ/graph.json","fetch_events":"https://pith.science/api/pith-number/DAVHISE4DZV5SYWIMNTWUQUUTZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DAVHISE4DZV5SYWIMNTWUQUUTZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DAVHISE4DZV5SYWIMNTWUQUUTZ/action/storage_attestation","attest_author":"https://pith.science/pith/DAVHISE4DZV5SYWIMNTWUQUUTZ/action/author_attestation","sign_citation":"https://pith.science/pith/DAVHISE4DZV5SYWIMNTWUQUUTZ/action/citation_signature","submit_replication":"https://pith.science/pith/DAVHISE4DZV5SYWIMNTWUQUUTZ/action/replication_record"}},"created_at":"2026-05-18T04:20:37.291485+00:00","updated_at":"2026-05-18T04:20:37.291485+00:00"}