{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:IJCXOQMAXNXYGHFTDQTNC6E4YA","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":"1004470ca72b346ac8464504cd144e4508f4c9888f7c939c31bf7d89ad53725f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-12-01T18:24:25Z","title_canon_sha256":"048b9008ac17502ddfc973f54b943f2b270de752950ae56b2dde9d5f29448c48"},"schema_version":"1.0","source":{"id":"1912.00468","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1912.00468","created_at":"2026-07-05T00:26:59Z"},{"alias_kind":"arxiv_version","alias_value":"1912.00468v2","created_at":"2026-07-05T00:26:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1912.00468","created_at":"2026-07-05T00:26:59Z"},{"alias_kind":"pith_short_12","alias_value":"IJCXOQMAXNXY","created_at":"2026-07-05T00:26:59Z"},{"alias_kind":"pith_short_16","alias_value":"IJCXOQMAXNXYGHFT","created_at":"2026-07-05T00:26:59Z"},{"alias_kind":"pith_short_8","alias_value":"IJCXOQMA","created_at":"2026-07-05T00:26:59Z"}],"graph_snapshots":[{"event_id":"sha256:b3afc3dd786af2b9c330639462411b0ef03e00579811db2d0a102916b2a09666","target":"graph","created_at":"2026-07-05T00:26:59Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/1912.00468/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Marc E. Pfetsch, Martin Skutella, Max Klimm, Rico Raber","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-12-01T18:24:25Z","title":"Packing under Convex Quadratic Constraints"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1912.00468","kind":"arxiv","version":2},"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:abb94e7e44de5c4835c00cb90025826cac18ecb6349f0c6685d804d0529e02c6","target":"record","created_at":"2026-07-05T00:26:59Z","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":"1004470ca72b346ac8464504cd144e4508f4c9888f7c939c31bf7d89ad53725f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-12-01T18:24:25Z","title_canon_sha256":"048b9008ac17502ddfc973f54b943f2b270de752950ae56b2dde9d5f29448c48"},"schema_version":"1.0","source":{"id":"1912.00468","kind":"arxiv","version":2}},"canonical_sha256":"4245774180bb6f831cb31c26d1789cc0302b7992386a812cbc3c994deb4bb53c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4245774180bb6f831cb31c26d1789cc0302b7992386a812cbc3c994deb4bb53c","first_computed_at":"2026-07-05T00:26:59.786810Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T00:26:59.786810Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"y11yBFIbNE7K6emvgmTi19FgjJWudHQkhX5TVGzYs0Sz4K8od0IW5xD1hCU2MkStPm8YcICiK+A0u03Mp4AkBw==","signature_status":"signed_v1","signed_at":"2026-07-05T00:26:59.787307Z","signed_message":"canonical_sha256_bytes"},"source_id":"1912.00468","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:abb94e7e44de5c4835c00cb90025826cac18ecb6349f0c6685d804d0529e02c6","sha256:b3afc3dd786af2b9c330639462411b0ef03e00579811db2d0a102916b2a09666"],"state_sha256":"6e945cfdf01ed28209edde8a1883c0bb5c34dc1adb375c3877e600e7a7e373ef"}