{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2006:VWAA3ASJOE2M75LMCMZZ672HUA","short_pith_number":"pith:VWAA3ASJ","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"},"canonical_sha256":"ad800d82497134cff56c13339f7f47a00c54584b859dd6a1d461e9ef58e979e7","source":{"kind":"arxiv","id":"cs/0602047","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"cs/0602047","created_at":"2026-05-18T04:08:43Z"},{"alias_kind":"arxiv_version","alias_value":"cs/0602047v3","created_at":"2026-05-18T04:08:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cs/0602047","created_at":"2026-05-18T04:08:43Z"},{"alias_kind":"pith_short_12","alias_value":"VWAA3ASJOE2M","created_at":"2026-05-18T12:25:54Z"},{"alias_kind":"pith_short_16","alias_value":"VWAA3ASJOE2M75LM","created_at":"2026-05-18T12:25:54Z"},{"alias_kind":"pith_short_8","alias_value":"VWAA3ASJ","created_at":"2026-05-18T12:25:54Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2006:VWAA3ASJOE2M75LMCMZZ672HUA","target":"record","payload":{"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"},"canonical_sha256":"ad800d82497134cff56c13339f7f47a00c54584b859dd6a1d461e9ef58e979e7","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"},"source_kind":"arxiv","source_id":"cs/0602047","source_version":3,"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-18T04:08:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gnTAex/RuT8a7yeDtfloCNGr/dL7kcVVqrj+XgGJldF9DrEHRA+bdBCZXymKiVeZF1qXErfIVD+buWyADm3WBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T08:49:34.543950Z"},"content_sha256":"f8fa028dea43ad90e1e7d97b916bea8f4101481a1c6c540135bf141f2a3facb2","schema_version":"1.0","event_id":"sha256:f8fa028dea43ad90e1e7d97b916bea8f4101481a1c6c540135bf141f2a3facb2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2006:VWAA3ASJOE2M75LMCMZZ672HUA","target":"graph","payload":{"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"},"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-18T04:08:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TqYLFCZ/OBd3EFsfGAz06yqO/Wa+d+NjQvRS9n1oduFHj2YHDtuR2g5UdQxg+o9CTgzB/JPLgkGzzCn4hGKfAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T08:49:34.544293Z"},"content_sha256":"5008bdb4b06c61ef164f54da6126befa6320cf37b4aab31c46c770888b2c697a","schema_version":"1.0","event_id":"sha256:5008bdb4b06c61ef164f54da6126befa6320cf37b4aab31c46c770888b2c697a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VWAA3ASJOE2M75LMCMZZ672HUA/bundle.json","state_url":"https://pith.science/pith/VWAA3ASJOE2M75LMCMZZ672HUA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VWAA3ASJOE2M75LMCMZZ672HUA/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-30T08:49:34Z","links":{"resolver":"https://pith.science/pith/VWAA3ASJOE2M75LMCMZZ672HUA","bundle":"https://pith.science/pith/VWAA3ASJOE2M75LMCMZZ672HUA/bundle.json","state":"https://pith.science/pith/VWAA3ASJOE2M75LMCMZZ672HUA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VWAA3ASJOE2M75LMCMZZ672HUA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2006:VWAA3ASJOE2M75LMCMZZ672HUA","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":"b98bc583ab4d764fd7f51dd0b53d294d1b50637b3f70138a5d8c365c6e501532","cross_cats_sorted":[],"license":"","primary_cat":"cs.CC","submitted_at":"2006-02-13T18:48:52Z","title_canon_sha256":"8d7ae42e4a7bbc1a3bb1e58bdd930421db6b29cc1654b23494660d90213b1384"},"schema_version":"1.0","source":{"id":"cs/0602047","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"cs/0602047","created_at":"2026-05-18T04:08:43Z"},{"alias_kind":"arxiv_version","alias_value":"cs/0602047v3","created_at":"2026-05-18T04:08:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cs/0602047","created_at":"2026-05-18T04:08:43Z"},{"alias_kind":"pith_short_12","alias_value":"VWAA3ASJOE2M","created_at":"2026-05-18T12:25:54Z"},{"alias_kind":"pith_short_16","alias_value":"VWAA3ASJOE2M75LM","created_at":"2026-05-18T12:25:54Z"},{"alias_kind":"pith_short_8","alias_value":"VWAA3ASJ","created_at":"2026-05-18T12:25:54Z"}],"graph_snapshots":[{"event_id":"sha256:5008bdb4b06c61ef164f54da6126befa6320cf37b4aab31c46c770888b2c697a","target":"graph","created_at":"2026-05-18T04:08:43Z","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":"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","authors_text":"Fredrik Kuivinen, Gustav Nordh, Peter Jonsson","cross_cats":[],"headline":"","license":"","primary_cat":"cs.CC","submitted_at":"2006-02-13T18:48:52Z","title":"Approximability of Integer Programming with Generalised Constraints"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"cs/0602047","kind":"arxiv","version":3},"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:f8fa028dea43ad90e1e7d97b916bea8f4101481a1c6c540135bf141f2a3facb2","target":"record","created_at":"2026-05-18T04:08:43Z","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":"b98bc583ab4d764fd7f51dd0b53d294d1b50637b3f70138a5d8c365c6e501532","cross_cats_sorted":[],"license":"","primary_cat":"cs.CC","submitted_at":"2006-02-13T18:48:52Z","title_canon_sha256":"8d7ae42e4a7bbc1a3bb1e58bdd930421db6b29cc1654b23494660d90213b1384"},"schema_version":"1.0","source":{"id":"cs/0602047","kind":"arxiv","version":3}},"canonical_sha256":"ad800d82497134cff56c13339f7f47a00c54584b859dd6a1d461e9ef58e979e7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ad800d82497134cff56c13339f7f47a00c54584b859dd6a1d461e9ef58e979e7","first_computed_at":"2026-05-18T04:08:43.556400Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:08:43.556400Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"xX97Mv5wSn0WhEjzr0bElJS1gq//+MqrTjdB2zVEUtwRNocWp5tI1i4OiQ9dN8Ewg33lD3oX8JtZwv0bBMNXBg==","signature_status":"signed_v1","signed_at":"2026-05-18T04:08:43.556834Z","signed_message":"canonical_sha256_bytes"},"source_id":"cs/0602047","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f8fa028dea43ad90e1e7d97b916bea8f4101481a1c6c540135bf141f2a3facb2","sha256:5008bdb4b06c61ef164f54da6126befa6320cf37b4aab31c46c770888b2c697a"],"state_sha256":"d126f8d5e65fb727f3a36be66aa1e9a73e479a6eb0b0874e20f1d22f29ca133e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UvzkkMFlA2QKce/R32U20rI7kYZN+fmXVjwN74C16ZQhAJLZCI3J03D/T+xZFX+zVy7WMth+rg7RvLum+SMLAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T08:49:34.546230Z","bundle_sha256":"5bbdaf5cf22128b461bcc99f14c1399ff7264f31ec3606a9b4f5d057f1fd64e1"}}