{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2006:VWAA3ASJOE2M75LMCMZZ672HUA","short_pith_number":"pith:VWAA3ASJ","schema_version":"1.0","canonical_sha256":"ad800d82497134cff56c13339f7f47a00c54584b859dd6a1d461e9ef58e979e7","source":{"kind":"arxiv","id":"cs/0602047","version":3},"attestation_state":"computed","paper":{"title":"Approximability of Integer Programming with Generalised Constraints","license":"","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Fredrik Kuivinen, Gustav Nordh, Peter Jonsson","submitted_at":"2006-02-13T18:48:52Z","abstract_excerpt":"We study a family of problems, called \\prob{Maximum Solution}, where the objective is to maximise a linear goal function over the feasible integer assignments to a set of variables subject to a set of constraints. When the domain is Boolean (i.e. restricted to $\\{0,1\\}$), the maximum solution problem is identical to the well-studied \\prob{Max Ones} problem, and the approximability is completely understood for all restrictions on the underlying constraints [Khanna et al., SIAM J. Comput., 30 (2001), pp. 1863-1920]. We continue this line of research by considering domains containing more than tw"},"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":"cs/0602047","kind":"arxiv","version":3},"metadata":{"license":"","primary_cat":"cs.CC","submitted_at":"2006-02-13T18:48:52Z","cross_cats_sorted":[],"title_canon_sha256":"8d7ae42e4a7bbc1a3bb1e58bdd930421db6b29cc1654b23494660d90213b1384","abstract_canon_sha256":"b98bc583ab4d764fd7f51dd0b53d294d1b50637b3f70138a5d8c365c6e501532"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:08:43.556834Z","signature_b64":"xX97Mv5wSn0WhEjzr0bElJS1gq//+MqrTjdB2zVEUtwRNocWp5tI1i4OiQ9dN8Ewg33lD3oX8JtZwv0bBMNXBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ad800d82497134cff56c13339f7f47a00c54584b859dd6a1d461e9ef58e979e7","last_reissued_at":"2026-05-18T04:08:43.556400Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:08:43.556400Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Approximability of Integer Programming with Generalised Constraints","license":"","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Fredrik Kuivinen, Gustav Nordh, Peter Jonsson","submitted_at":"2006-02-13T18:48:52Z","abstract_excerpt":"We study a family of problems, called \\prob{Maximum Solution}, where the objective is to maximise a linear goal function over the feasible integer assignments to a set of variables subject to a set of constraints. When the domain is Boolean (i.e. restricted to $\\{0,1\\}$), the maximum solution problem is identical to the well-studied \\prob{Max Ones} problem, and the approximability is completely understood for all restrictions on the underlying constraints [Khanna et al., SIAM J. Comput., 30 (2001), pp. 1863-1920]. We continue this line of research by considering domains containing more than tw"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"cs/0602047","kind":"arxiv","version":3},"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":"cs/0602047","created_at":"2026-05-18T04:08:43.556465+00:00"},{"alias_kind":"arxiv_version","alias_value":"cs/0602047v3","created_at":"2026-05-18T04:08:43.556465+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cs/0602047","created_at":"2026-05-18T04:08:43.556465+00:00"},{"alias_kind":"pith_short_12","alias_value":"VWAA3ASJOE2M","created_at":"2026-05-18T12:25:54.717736+00:00"},{"alias_kind":"pith_short_16","alias_value":"VWAA3ASJOE2M75LM","created_at":"2026-05-18T12:25:54.717736+00:00"},{"alias_kind":"pith_short_8","alias_value":"VWAA3ASJ","created_at":"2026-05-18T12:25:54.717736+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/VWAA3ASJOE2M75LMCMZZ672HUA","json":"https://pith.science/pith/VWAA3ASJOE2M75LMCMZZ672HUA.json","graph_json":"https://pith.science/api/pith-number/VWAA3ASJOE2M75LMCMZZ672HUA/graph.json","events_json":"https://pith.science/api/pith-number/VWAA3ASJOE2M75LMCMZZ672HUA/events.json","paper":"https://pith.science/paper/VWAA3ASJ"},"agent_actions":{"view_html":"https://pith.science/pith/VWAA3ASJOE2M75LMCMZZ672HUA","download_json":"https://pith.science/pith/VWAA3ASJOE2M75LMCMZZ672HUA.json","view_paper":"https://pith.science/paper/VWAA3ASJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=cs/0602047&json=true","fetch_graph":"https://pith.science/api/pith-number/VWAA3ASJOE2M75LMCMZZ672HUA/graph.json","fetch_events":"https://pith.science/api/pith-number/VWAA3ASJOE2M75LMCMZZ672HUA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VWAA3ASJOE2M75LMCMZZ672HUA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VWAA3ASJOE2M75LMCMZZ672HUA/action/storage_attestation","attest_author":"https://pith.science/pith/VWAA3ASJOE2M75LMCMZZ672HUA/action/author_attestation","sign_citation":"https://pith.science/pith/VWAA3ASJOE2M75LMCMZZ672HUA/action/citation_signature","submit_replication":"https://pith.science/pith/VWAA3ASJOE2M75LMCMZZ672HUA/action/replication_record"}},"created_at":"2026-05-18T04:08:43.556465+00:00","updated_at":"2026-05-18T04:08:43.556465+00:00"}