{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:FWFECAKWNPNBLLZKT2IHF6AYPU","short_pith_number":"pith:FWFECAKW","canonical_record":{"source":{"id":"1101.1710","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2011-01-10T05:57:39Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"a714abac2c7ade2ceee94a3106cb44956e675f571f485dcf1b9ae84a53673a72","abstract_canon_sha256":"cfb95786107fd9a9b45b97ba29667ac49de24ab1b5956a1eda9a610377f08597"},"schema_version":"1.0"},"canonical_sha256":"2d8a4101566bda15af2a9e9072f8187d09ae147975c66d2e756124c0d9bc77ea","source":{"kind":"arxiv","id":"1101.1710","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1101.1710","created_at":"2026-05-18T02:22:59Z"},{"alias_kind":"arxiv_version","alias_value":"1101.1710v2","created_at":"2026-05-18T02:22:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1101.1710","created_at":"2026-05-18T02:22:59Z"},{"alias_kind":"pith_short_12","alias_value":"FWFECAKWNPNB","created_at":"2026-05-18T12:26:28Z"},{"alias_kind":"pith_short_16","alias_value":"FWFECAKWNPNBLLZK","created_at":"2026-05-18T12:26:28Z"},{"alias_kind":"pith_short_8","alias_value":"FWFECAKW","created_at":"2026-05-18T12:26:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:FWFECAKWNPNBLLZKT2IHF6AYPU","target":"record","payload":{"canonical_record":{"source":{"id":"1101.1710","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2011-01-10T05:57:39Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"a714abac2c7ade2ceee94a3106cb44956e675f571f485dcf1b9ae84a53673a72","abstract_canon_sha256":"cfb95786107fd9a9b45b97ba29667ac49de24ab1b5956a1eda9a610377f08597"},"schema_version":"1.0"},"canonical_sha256":"2d8a4101566bda15af2a9e9072f8187d09ae147975c66d2e756124c0d9bc77ea","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:22:59.586564Z","signature_b64":"FWyBSDb0qzH/2k3FqFJu3wUSaw0mTWapY2/ofwHmTDaz8bk68vlmcx67TjlWAbl6QQJvaYwFVvNuY4mnVpvVDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2d8a4101566bda15af2a9e9072f8187d09ae147975c66d2e756124c0d9bc77ea","last_reissued_at":"2026-05-18T02:22:59.585897Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:22:59.585897Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1101.1710","source_version":2,"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-18T02:22:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8OOyyf7NT0eBQIPflwow/uS9VnecNZpUq5ZuqwyZDnN6F9sBrx2c8j318P3/aUqtCOzS8yk44at3zEvEZq4yCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T14:31:30.834424Z"},"content_sha256":"6105e301d52e25b31229bf2e065cb0c62a117d60ee368a6a7c5d28607888c504","schema_version":"1.0","event_id":"sha256:6105e301d52e25b31229bf2e065cb0c62a117d60ee368a6a7c5d28607888c504"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:FWFECAKWNPNBLLZKT2IHF6AYPU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On Quadratic Programming with a Ratio Objective","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CC","authors_text":"Aditya Bhaskara, Aravindan Vijayaraghavan, Moses Charikar, Rajsekar Manokaran","submitted_at":"2011-01-10T05:57:39Z","abstract_excerpt":"Quadratic Programming (QP) is the well-studied problem of maximizing over {-1,1} values the quadratic form \\sum_{i \\ne j} a_{ij} x_i x_j. QP captures many known combinatorial optimization problems, and assuming the unique games conjecture, semidefinite programming techniques give optimal approximation algorithms. We extend this body of work by initiating the study of Quadratic Programming problems where the variables take values in the domain {-1,0,1}. The specific problems we study are\n  QP-Ratio : \\max_{\\{-1,0,1\\}^n} \\frac{\\sum_{i \\not = j} a_{ij} x_i x_j}{\\sum x_i^2}, and Normalized QP-Rati"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1101.1710","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":""},"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-18T02:22:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"d+e96/W868mYNpQo+eHmO6o/9R3Irgb4MAQ6+x7wAI1xwkxkVnKgfYInrS7zWArh16fSYHhzfuuj1sEClEi9Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T14:31:30.834789Z"},"content_sha256":"0527a294e626e4bdce78cccbf5c11716390a25076608101fffc0a0751c091085","schema_version":"1.0","event_id":"sha256:0527a294e626e4bdce78cccbf5c11716390a25076608101fffc0a0751c091085"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FWFECAKWNPNBLLZKT2IHF6AYPU/bundle.json","state_url":"https://pith.science/pith/FWFECAKWNPNBLLZKT2IHF6AYPU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FWFECAKWNPNBLLZKT2IHF6AYPU/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-03T14:31:30Z","links":{"resolver":"https://pith.science/pith/FWFECAKWNPNBLLZKT2IHF6AYPU","bundle":"https://pith.science/pith/FWFECAKWNPNBLLZKT2IHF6AYPU/bundle.json","state":"https://pith.science/pith/FWFECAKWNPNBLLZKT2IHF6AYPU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FWFECAKWNPNBLLZKT2IHF6AYPU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:FWFECAKWNPNBLLZKT2IHF6AYPU","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":"cfb95786107fd9a9b45b97ba29667ac49de24ab1b5956a1eda9a610377f08597","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2011-01-10T05:57:39Z","title_canon_sha256":"a714abac2c7ade2ceee94a3106cb44956e675f571f485dcf1b9ae84a53673a72"},"schema_version":"1.0","source":{"id":"1101.1710","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1101.1710","created_at":"2026-05-18T02:22:59Z"},{"alias_kind":"arxiv_version","alias_value":"1101.1710v2","created_at":"2026-05-18T02:22:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1101.1710","created_at":"2026-05-18T02:22:59Z"},{"alias_kind":"pith_short_12","alias_value":"FWFECAKWNPNB","created_at":"2026-05-18T12:26:28Z"},{"alias_kind":"pith_short_16","alias_value":"FWFECAKWNPNBLLZK","created_at":"2026-05-18T12:26:28Z"},{"alias_kind":"pith_short_8","alias_value":"FWFECAKW","created_at":"2026-05-18T12:26:28Z"}],"graph_snapshots":[{"event_id":"sha256:0527a294e626e4bdce78cccbf5c11716390a25076608101fffc0a0751c091085","target":"graph","created_at":"2026-05-18T02:22: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"},"paper":{"abstract_excerpt":"Quadratic Programming (QP) is the well-studied problem of maximizing over {-1,1} values the quadratic form \\sum_{i \\ne j} a_{ij} x_i x_j. QP captures many known combinatorial optimization problems, and assuming the unique games conjecture, semidefinite programming techniques give optimal approximation algorithms. We extend this body of work by initiating the study of Quadratic Programming problems where the variables take values in the domain {-1,0,1}. The specific problems we study are\n  QP-Ratio : \\max_{\\{-1,0,1\\}^n} \\frac{\\sum_{i \\not = j} a_{ij} x_i x_j}{\\sum x_i^2}, and Normalized QP-Rati","authors_text":"Aditya Bhaskara, Aravindan Vijayaraghavan, Moses Charikar, Rajsekar Manokaran","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2011-01-10T05:57:39Z","title":"On Quadratic Programming with a Ratio Objective"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1101.1710","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:6105e301d52e25b31229bf2e065cb0c62a117d60ee368a6a7c5d28607888c504","target":"record","created_at":"2026-05-18T02:22: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":"cfb95786107fd9a9b45b97ba29667ac49de24ab1b5956a1eda9a610377f08597","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2011-01-10T05:57:39Z","title_canon_sha256":"a714abac2c7ade2ceee94a3106cb44956e675f571f485dcf1b9ae84a53673a72"},"schema_version":"1.0","source":{"id":"1101.1710","kind":"arxiv","version":2}},"canonical_sha256":"2d8a4101566bda15af2a9e9072f8187d09ae147975c66d2e756124c0d9bc77ea","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2d8a4101566bda15af2a9e9072f8187d09ae147975c66d2e756124c0d9bc77ea","first_computed_at":"2026-05-18T02:22:59.585897Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:22:59.585897Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"FWyBSDb0qzH/2k3FqFJu3wUSaw0mTWapY2/ofwHmTDaz8bk68vlmcx67TjlWAbl6QQJvaYwFVvNuY4mnVpvVDw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:22:59.586564Z","signed_message":"canonical_sha256_bytes"},"source_id":"1101.1710","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6105e301d52e25b31229bf2e065cb0c62a117d60ee368a6a7c5d28607888c504","sha256:0527a294e626e4bdce78cccbf5c11716390a25076608101fffc0a0751c091085"],"state_sha256":"be63aa9544f12f4c8de44b7caa23ba87a4597b3beda26e6d76d6f8d632a2587e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Uovpv7KhJDjV2DDhMxPlYcGIEzMRShXmIbJiRxn57UsfTlEHKZzn0kkM0vNu007GrECJqiW5WQVKHueIHMhlBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T14:31:30.836804Z","bundle_sha256":"755ba4f779e72cf0c5e4ec99f246bc41ceb644265557de3d34f6b0ea6b790a76"}}