{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:IJCXOQMAXNXYGHFTDQTNC6E4YA","short_pith_number":"pith:IJCXOQMA","schema_version":"1.0","canonical_sha256":"4245774180bb6f831cb31c26d1789cc0302b7992386a812cbc3c994deb4bb53c","source":{"kind":"arxiv","id":"1912.00468","version":2},"attestation_state":"computed","paper":{"title":"Packing under Convex Quadratic Constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Marc E. Pfetsch, Martin Skutella, Max Klimm, Rico Raber","submitted_at":"2019-12-01T18:24:25Z","abstract_excerpt":"We consider a general class of binary packing problems with a convex quadratic knapsack constraint. We prove that these problems are APX-hard to approximate and present constant-factor approximation algorithms based upon three different algorithmic techniques: (1) a rounding technique tailored to a convex relaxation in conjunction with a non-convex relaxation whose approximation ratio equals the golden ratio; (2) a greedy strategy; (3) a randomized rounding leading to an approximation algorithm for the more general case with multiple convex quadratic constraints. We further show that a combina"},"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":"1912.00468","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-12-01T18:24:25Z","cross_cats_sorted":[],"title_canon_sha256":"048b9008ac17502ddfc973f54b943f2b270de752950ae56b2dde9d5f29448c48","abstract_canon_sha256":"1004470ca72b346ac8464504cd144e4508f4c9888f7c939c31bf7d89ad53725f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:26:59.787307Z","signature_b64":"y11yBFIbNE7K6emvgmTi19FgjJWudHQkhX5TVGzYs0Sz4K8od0IW5xD1hCU2MkStPm8YcICiK+A0u03Mp4AkBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4245774180bb6f831cb31c26d1789cc0302b7992386a812cbc3c994deb4bb53c","last_reissued_at":"2026-07-05T00:26:59.786810Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:26:59.786810Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Packing under Convex Quadratic Constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Marc E. Pfetsch, Martin Skutella, Max Klimm, Rico Raber","submitted_at":"2019-12-01T18:24:25Z","abstract_excerpt":"We consider a general class of binary packing problems with a convex quadratic knapsack constraint. We prove that these problems are APX-hard to approximate and present constant-factor approximation algorithms based upon three different algorithmic techniques: (1) a rounding technique tailored to a convex relaxation in conjunction with a non-convex relaxation whose approximation ratio equals the golden ratio; (2) a greedy strategy; (3) a randomized rounding leading to an approximation algorithm for the more general case with multiple convex quadratic constraints. We further show that a combina"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1912.00468","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1912.00468/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"1912.00468","created_at":"2026-07-05T00:26:59.786868+00:00"},{"alias_kind":"arxiv_version","alias_value":"1912.00468v2","created_at":"2026-07-05T00:26:59.786868+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1912.00468","created_at":"2026-07-05T00:26:59.786868+00:00"},{"alias_kind":"pith_short_12","alias_value":"IJCXOQMAXNXY","created_at":"2026-07-05T00:26:59.786868+00:00"},{"alias_kind":"pith_short_16","alias_value":"IJCXOQMAXNXYGHFT","created_at":"2026-07-05T00:26:59.786868+00:00"},{"alias_kind":"pith_short_8","alias_value":"IJCXOQMA","created_at":"2026-07-05T00:26:59.786868+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/IJCXOQMAXNXYGHFTDQTNC6E4YA","json":"https://pith.science/pith/IJCXOQMAXNXYGHFTDQTNC6E4YA.json","graph_json":"https://pith.science/api/pith-number/IJCXOQMAXNXYGHFTDQTNC6E4YA/graph.json","events_json":"https://pith.science/api/pith-number/IJCXOQMAXNXYGHFTDQTNC6E4YA/events.json","paper":"https://pith.science/paper/IJCXOQMA"},"agent_actions":{"view_html":"https://pith.science/pith/IJCXOQMAXNXYGHFTDQTNC6E4YA","download_json":"https://pith.science/pith/IJCXOQMAXNXYGHFTDQTNC6E4YA.json","view_paper":"https://pith.science/paper/IJCXOQMA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1912.00468&json=true","fetch_graph":"https://pith.science/api/pith-number/IJCXOQMAXNXYGHFTDQTNC6E4YA/graph.json","fetch_events":"https://pith.science/api/pith-number/IJCXOQMAXNXYGHFTDQTNC6E4YA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IJCXOQMAXNXYGHFTDQTNC6E4YA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IJCXOQMAXNXYGHFTDQTNC6E4YA/action/storage_attestation","attest_author":"https://pith.science/pith/IJCXOQMAXNXYGHFTDQTNC6E4YA/action/author_attestation","sign_citation":"https://pith.science/pith/IJCXOQMAXNXYGHFTDQTNC6E4YA/action/citation_signature","submit_replication":"https://pith.science/pith/IJCXOQMAXNXYGHFTDQTNC6E4YA/action/replication_record"}},"created_at":"2026-07-05T00:26:59.786868+00:00","updated_at":"2026-07-05T00:26:59.786868+00:00"}