{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:AAM7CSK2AGKCQEM7COW2MMP4IF","short_pith_number":"pith:AAM7CSK2","schema_version":"1.0","canonical_sha256":"0019f1495a019428119f13ada631fc417db84b827a2668f5e67fcbe527ec539c","source":{"kind":"arxiv","id":"1205.0856","version":1},"attestation_state":"computed","paper":{"title":"Global Optimal Solution to Discrete Value Selection Problem with Inequality Constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.OC","authors_text":"David Yang Gao, Ning Ruan","submitted_at":"2012-05-04T03:57:59Z","abstract_excerpt":"This paper presents a canonical dual method for solving a quadratic discrete value selection problem subjected to inequality constraints. The problem is first transformed into a problem with quadratic objective and 0-1 integer variables. The dual problem of the 0-1 programming problem is thus constructed by using the canonical duality theory. Under appropriate conditions, this dual problem is a maximization problem of a concave function over a convex continuous space. Numerical simulation studies, including some large scale problems, are carried out so as to demonstrate the effectiveness and e"},"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":"1205.0856","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2012-05-04T03:57:59Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"70cc5fc8594d6b364ed5f238bfa6b3a25262b2157d52f9acf361c1147b2de4da","abstract_canon_sha256":"6a82f5b6b45557d7467e9e879dbfb79062c9f5b0880d118de40d64603e1b486d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:56:23.761400Z","signature_b64":"qfCtUbnvgOmEKHgYAjdTYc75q05FZyLH/ivbDGPDdXqBcdJ7A7sPJQQYQEzfIVvmX6cZmu2t4uWzNCgqydHRDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0019f1495a019428119f13ada631fc417db84b827a2668f5e67fcbe527ec539c","last_reissued_at":"2026-05-18T03:56:23.760596Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:56:23.760596Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Global Optimal Solution to Discrete Value Selection Problem with Inequality Constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.OC","authors_text":"David Yang Gao, Ning Ruan","submitted_at":"2012-05-04T03:57:59Z","abstract_excerpt":"This paper presents a canonical dual method for solving a quadratic discrete value selection problem subjected to inequality constraints. The problem is first transformed into a problem with quadratic objective and 0-1 integer variables. The dual problem of the 0-1 programming problem is thus constructed by using the canonical duality theory. Under appropriate conditions, this dual problem is a maximization problem of a concave function over a convex continuous space. Numerical simulation studies, including some large scale problems, are carried out so as to demonstrate the effectiveness and e"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1205.0856","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":"1205.0856","created_at":"2026-05-18T03:56:23.760728+00:00"},{"alias_kind":"arxiv_version","alias_value":"1205.0856v1","created_at":"2026-05-18T03:56:23.760728+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1205.0856","created_at":"2026-05-18T03:56:23.760728+00:00"},{"alias_kind":"pith_short_12","alias_value":"AAM7CSK2AGKC","created_at":"2026-05-18T12:26:58.693483+00:00"},{"alias_kind":"pith_short_16","alias_value":"AAM7CSK2AGKCQEM7","created_at":"2026-05-18T12:26:58.693483+00:00"},{"alias_kind":"pith_short_8","alias_value":"AAM7CSK2","created_at":"2026-05-18T12:26:58.693483+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/AAM7CSK2AGKCQEM7COW2MMP4IF","json":"https://pith.science/pith/AAM7CSK2AGKCQEM7COW2MMP4IF.json","graph_json":"https://pith.science/api/pith-number/AAM7CSK2AGKCQEM7COW2MMP4IF/graph.json","events_json":"https://pith.science/api/pith-number/AAM7CSK2AGKCQEM7COW2MMP4IF/events.json","paper":"https://pith.science/paper/AAM7CSK2"},"agent_actions":{"view_html":"https://pith.science/pith/AAM7CSK2AGKCQEM7COW2MMP4IF","download_json":"https://pith.science/pith/AAM7CSK2AGKCQEM7COW2MMP4IF.json","view_paper":"https://pith.science/paper/AAM7CSK2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1205.0856&json=true","fetch_graph":"https://pith.science/api/pith-number/AAM7CSK2AGKCQEM7COW2MMP4IF/graph.json","fetch_events":"https://pith.science/api/pith-number/AAM7CSK2AGKCQEM7COW2MMP4IF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AAM7CSK2AGKCQEM7COW2MMP4IF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AAM7CSK2AGKCQEM7COW2MMP4IF/action/storage_attestation","attest_author":"https://pith.science/pith/AAM7CSK2AGKCQEM7COW2MMP4IF/action/author_attestation","sign_citation":"https://pith.science/pith/AAM7CSK2AGKCQEM7COW2MMP4IF/action/citation_signature","submit_replication":"https://pith.science/pith/AAM7CSK2AGKCQEM7COW2MMP4IF/action/replication_record"}},"created_at":"2026-05-18T03:56:23.760728+00:00","updated_at":"2026-05-18T03:56:23.760728+00:00"}