{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:AAM7CSK2AGKCQEM7COW2MMP4IF","short_pith_number":"pith:AAM7CSK2","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"},"canonical_sha256":"0019f1495a019428119f13ada631fc417db84b827a2668f5e67fcbe527ec539c","source":{"kind":"arxiv","id":"1205.0856","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1205.0856","created_at":"2026-05-18T03:56:23Z"},{"alias_kind":"arxiv_version","alias_value":"1205.0856v1","created_at":"2026-05-18T03:56:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1205.0856","created_at":"2026-05-18T03:56:23Z"},{"alias_kind":"pith_short_12","alias_value":"AAM7CSK2AGKC","created_at":"2026-05-18T12:26:58Z"},{"alias_kind":"pith_short_16","alias_value":"AAM7CSK2AGKCQEM7","created_at":"2026-05-18T12:26:58Z"},{"alias_kind":"pith_short_8","alias_value":"AAM7CSK2","created_at":"2026-05-18T12:26:58Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:AAM7CSK2AGKCQEM7COW2MMP4IF","target":"record","payload":{"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"},"canonical_sha256":"0019f1495a019428119f13ada631fc417db84b827a2668f5e67fcbe527ec539c","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"},"source_kind":"arxiv","source_id":"1205.0856","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-18T03:56:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Irg7dl24N1V+OVQYdvLJhYqztTRy3dsDn/aIMy1a1KHLqZGnNvK1CfFD0hce96K+EeR/wrJNVKdSZODZpAZiCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T20:26:07.117625Z"},"content_sha256":"2ac84b29cbf66735ecc37f6cab08f5ed7e14ddc63a730a984df2cd172d7589f2","schema_version":"1.0","event_id":"sha256:2ac84b29cbf66735ecc37f6cab08f5ed7e14ddc63a730a984df2cd172d7589f2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:AAM7CSK2AGKCQEM7COW2MMP4IF","target":"graph","payload":{"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"},"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-18T03:56:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LzO6vc2nPRJH0gLPV6yCKYGMTRQgzhJzCoPKUkEpZJ28BsMtQkWhN77HMmOs3SaHU8YlQdQsqQwS3SuzpQinCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T20:26:07.118327Z"},"content_sha256":"3ab554379cd58e26fb02678002b9bbe56a3d2383ffcd675c35ba8b94aad68f02","schema_version":"1.0","event_id":"sha256:3ab554379cd58e26fb02678002b9bbe56a3d2383ffcd675c35ba8b94aad68f02"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/AAM7CSK2AGKCQEM7COW2MMP4IF/bundle.json","state_url":"https://pith.science/pith/AAM7CSK2AGKCQEM7COW2MMP4IF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/AAM7CSK2AGKCQEM7COW2MMP4IF/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-05T20:26:07Z","links":{"resolver":"https://pith.science/pith/AAM7CSK2AGKCQEM7COW2MMP4IF","bundle":"https://pith.science/pith/AAM7CSK2AGKCQEM7COW2MMP4IF/bundle.json","state":"https://pith.science/pith/AAM7CSK2AGKCQEM7COW2MMP4IF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/AAM7CSK2AGKCQEM7COW2MMP4IF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:AAM7CSK2AGKCQEM7COW2MMP4IF","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":"6a82f5b6b45557d7467e9e879dbfb79062c9f5b0880d118de40d64603e1b486d","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2012-05-04T03:57:59Z","title_canon_sha256":"70cc5fc8594d6b364ed5f238bfa6b3a25262b2157d52f9acf361c1147b2de4da"},"schema_version":"1.0","source":{"id":"1205.0856","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1205.0856","created_at":"2026-05-18T03:56:23Z"},{"alias_kind":"arxiv_version","alias_value":"1205.0856v1","created_at":"2026-05-18T03:56:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1205.0856","created_at":"2026-05-18T03:56:23Z"},{"alias_kind":"pith_short_12","alias_value":"AAM7CSK2AGKC","created_at":"2026-05-18T12:26:58Z"},{"alias_kind":"pith_short_16","alias_value":"AAM7CSK2AGKCQEM7","created_at":"2026-05-18T12:26:58Z"},{"alias_kind":"pith_short_8","alias_value":"AAM7CSK2","created_at":"2026-05-18T12:26:58Z"}],"graph_snapshots":[{"event_id":"sha256:3ab554379cd58e26fb02678002b9bbe56a3d2383ffcd675c35ba8b94aad68f02","target":"graph","created_at":"2026-05-18T03:56: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":"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","authors_text":"David Yang Gao, Ning Ruan","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2012-05-04T03:57:59Z","title":"Global Optimal Solution to Discrete Value Selection Problem with Inequality Constraints"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1205.0856","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:2ac84b29cbf66735ecc37f6cab08f5ed7e14ddc63a730a984df2cd172d7589f2","target":"record","created_at":"2026-05-18T03:56: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":"6a82f5b6b45557d7467e9e879dbfb79062c9f5b0880d118de40d64603e1b486d","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2012-05-04T03:57:59Z","title_canon_sha256":"70cc5fc8594d6b364ed5f238bfa6b3a25262b2157d52f9acf361c1147b2de4da"},"schema_version":"1.0","source":{"id":"1205.0856","kind":"arxiv","version":1}},"canonical_sha256":"0019f1495a019428119f13ada631fc417db84b827a2668f5e67fcbe527ec539c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0019f1495a019428119f13ada631fc417db84b827a2668f5e67fcbe527ec539c","first_computed_at":"2026-05-18T03:56:23.760596Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:56:23.760596Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"qfCtUbnvgOmEKHgYAjdTYc75q05FZyLH/ivbDGPDdXqBcdJ7A7sPJQQYQEzfIVvmX6cZmu2t4uWzNCgqydHRDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:56:23.761400Z","signed_message":"canonical_sha256_bytes"},"source_id":"1205.0856","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2ac84b29cbf66735ecc37f6cab08f5ed7e14ddc63a730a984df2cd172d7589f2","sha256:3ab554379cd58e26fb02678002b9bbe56a3d2383ffcd675c35ba8b94aad68f02"],"state_sha256":"0e467387404aae32f351c2c2515a149436d6eb6ad9d1ee47359a00bdaf4dac60"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7XDVZ9QeiH60uwarvMKLWGXUH23R+F4MSGNWypeCQQbxXswHSWzszrzj+i53tUoTi/qArB+9bsKFSp60ccaoDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T20:26:07.122698Z","bundle_sha256":"4fd921608ec2d3d66224914a82e869bec941137d47b850695ffaa4ddf16eb3ed"}}