{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:4V4XXOG2QBMLF623ZIALD7YZXH","short_pith_number":"pith:4V4XXOG2","canonical_record":{"source":{"id":"1104.4746","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2011-04-25T16:32:51Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"18305b1c0c348f9af87c877002995c5eaec94f4810cf485fd16043203e51475c","abstract_canon_sha256":"a587e2c3c4f02df1db4131531049806d91710db2d5c27302483d71942e42f4ea"},"schema_version":"1.0"},"canonical_sha256":"e5797bb8da8058b2fb5bca00b1ff19b9e0606b0eecc903f8ef2ac43cfa2cdd72","source":{"kind":"arxiv","id":"1104.4746","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1104.4746","created_at":"2026-05-18T02:22:00Z"},{"alias_kind":"arxiv_version","alias_value":"1104.4746v3","created_at":"2026-05-18T02:22:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1104.4746","created_at":"2026-05-18T02:22:00Z"},{"alias_kind":"pith_short_12","alias_value":"4V4XXOG2QBML","created_at":"2026-05-18T12:26:20Z"},{"alias_kind":"pith_short_16","alias_value":"4V4XXOG2QBMLF623","created_at":"2026-05-18T12:26:20Z"},{"alias_kind":"pith_short_8","alias_value":"4V4XXOG2","created_at":"2026-05-18T12:26:20Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:4V4XXOG2QBMLF623ZIALD7YZXH","target":"record","payload":{"canonical_record":{"source":{"id":"1104.4746","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2011-04-25T16:32:51Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"18305b1c0c348f9af87c877002995c5eaec94f4810cf485fd16043203e51475c","abstract_canon_sha256":"a587e2c3c4f02df1db4131531049806d91710db2d5c27302483d71942e42f4ea"},"schema_version":"1.0"},"canonical_sha256":"e5797bb8da8058b2fb5bca00b1ff19b9e0606b0eecc903f8ef2ac43cfa2cdd72","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:22:00.996884Z","signature_b64":"7i6u9IEZTx0k0g1IdABbfpV3IFyGtMSNVSTllHDFjxZPB5Zf5BzxzitASF2tGLutGTEi5O/KZwMSV1HnWPPQDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e5797bb8da8058b2fb5bca00b1ff19b9e0606b0eecc903f8ef2ac43cfa2cdd72","last_reissued_at":"2026-05-18T02:22:00.996155Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:22:00.996155Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1104.4746","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-18T02:22:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aQlDCMMcm5BX/nucyOJNQ06jU+c7mgwx4o4Wf9Y3nu+TfjfV/03f/kGBvSuhIO1BNWx98+SStoVcmRQIEV9sDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T05:15:39.590681Z"},"content_sha256":"971e0add26e70f285ac6b0677cfe98993e7397bb952230d6d1ef2c9b0e4994ca","schema_version":"1.0","event_id":"sha256:971e0add26e70f285ac6b0677cfe98993e7397bb952230d6d1ef2c9b0e4994ca"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:4V4XXOG2QBMLF623ZIALD7YZXH","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Lasserre Hierarchy, Higher Eigenvalues, and Approximation Schemes for Quadratic Integer Programming with PSD Objectives","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CC","authors_text":"Ali Kemal Sinop, Venkatesan Guruswami","submitted_at":"2011-04-25T16:32:51Z","abstract_excerpt":"We present an approximation scheme for optimizing certain Quadratic Integer Programming problems with positive semidefinite objective functions and global linear constraints. This framework includes well known graph problems such as Minimum graph bisection, Edge expansion, Uniform sparsest cut, and Small Set expansion, as well as the Unique Games problem. These problems are notorious for the existence of huge gaps between the known algorithmic results and NP-hardness results. Our algorithm is based on rounding semidefinite programs from the Lasserre hierarchy, and the analysis uses bounds for "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1104.4746","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-18T02:22:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mh6RZGVnYJ/bU0uWcJxSlqM8EwOVGisbFXUx66zKFe0ZWWnedEomi4l66XglHAd9/pZryJbkm8V/kMTLuMmpCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T05:15:39.591038Z"},"content_sha256":"d8baaabdfe5a567dc09cd2d7256e04fda243cf2386cb32c133ba1775238540e9","schema_version":"1.0","event_id":"sha256:d8baaabdfe5a567dc09cd2d7256e04fda243cf2386cb32c133ba1775238540e9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4V4XXOG2QBMLF623ZIALD7YZXH/bundle.json","state_url":"https://pith.science/pith/4V4XXOG2QBMLF623ZIALD7YZXH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4V4XXOG2QBMLF623ZIALD7YZXH/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-01T05:15:39Z","links":{"resolver":"https://pith.science/pith/4V4XXOG2QBMLF623ZIALD7YZXH","bundle":"https://pith.science/pith/4V4XXOG2QBMLF623ZIALD7YZXH/bundle.json","state":"https://pith.science/pith/4V4XXOG2QBMLF623ZIALD7YZXH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4V4XXOG2QBMLF623ZIALD7YZXH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:4V4XXOG2QBMLF623ZIALD7YZXH","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":"a587e2c3c4f02df1db4131531049806d91710db2d5c27302483d71942e42f4ea","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2011-04-25T16:32:51Z","title_canon_sha256":"18305b1c0c348f9af87c877002995c5eaec94f4810cf485fd16043203e51475c"},"schema_version":"1.0","source":{"id":"1104.4746","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1104.4746","created_at":"2026-05-18T02:22:00Z"},{"alias_kind":"arxiv_version","alias_value":"1104.4746v3","created_at":"2026-05-18T02:22:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1104.4746","created_at":"2026-05-18T02:22:00Z"},{"alias_kind":"pith_short_12","alias_value":"4V4XXOG2QBML","created_at":"2026-05-18T12:26:20Z"},{"alias_kind":"pith_short_16","alias_value":"4V4XXOG2QBMLF623","created_at":"2026-05-18T12:26:20Z"},{"alias_kind":"pith_short_8","alias_value":"4V4XXOG2","created_at":"2026-05-18T12:26:20Z"}],"graph_snapshots":[{"event_id":"sha256:d8baaabdfe5a567dc09cd2d7256e04fda243cf2386cb32c133ba1775238540e9","target":"graph","created_at":"2026-05-18T02:22:00Z","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 present an approximation scheme for optimizing certain Quadratic Integer Programming problems with positive semidefinite objective functions and global linear constraints. This framework includes well known graph problems such as Minimum graph bisection, Edge expansion, Uniform sparsest cut, and Small Set expansion, as well as the Unique Games problem. These problems are notorious for the existence of huge gaps between the known algorithmic results and NP-hardness results. Our algorithm is based on rounding semidefinite programs from the Lasserre hierarchy, and the analysis uses bounds for ","authors_text":"Ali Kemal Sinop, Venkatesan Guruswami","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2011-04-25T16:32:51Z","title":"Lasserre Hierarchy, Higher Eigenvalues, and Approximation Schemes for Quadratic Integer Programming with PSD Objectives"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1104.4746","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:971e0add26e70f285ac6b0677cfe98993e7397bb952230d6d1ef2c9b0e4994ca","target":"record","created_at":"2026-05-18T02:22:00Z","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":"a587e2c3c4f02df1db4131531049806d91710db2d5c27302483d71942e42f4ea","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2011-04-25T16:32:51Z","title_canon_sha256":"18305b1c0c348f9af87c877002995c5eaec94f4810cf485fd16043203e51475c"},"schema_version":"1.0","source":{"id":"1104.4746","kind":"arxiv","version":3}},"canonical_sha256":"e5797bb8da8058b2fb5bca00b1ff19b9e0606b0eecc903f8ef2ac43cfa2cdd72","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e5797bb8da8058b2fb5bca00b1ff19b9e0606b0eecc903f8ef2ac43cfa2cdd72","first_computed_at":"2026-05-18T02:22:00.996155Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:22:00.996155Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"7i6u9IEZTx0k0g1IdABbfpV3IFyGtMSNVSTllHDFjxZPB5Zf5BzxzitASF2tGLutGTEi5O/KZwMSV1HnWPPQDw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:22:00.996884Z","signed_message":"canonical_sha256_bytes"},"source_id":"1104.4746","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:971e0add26e70f285ac6b0677cfe98993e7397bb952230d6d1ef2c9b0e4994ca","sha256:d8baaabdfe5a567dc09cd2d7256e04fda243cf2386cb32c133ba1775238540e9"],"state_sha256":"3bdde0ccd1ccee3fc75afd8fc2e746404213d3feaa1f01a9efe6608fe5ef2d6b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"I6Z0QneN5BDWWjniIrxwSb3/SysCICXFbUWiG/ccFF+ho/QuJiG9nnfKIKN7HO87swGuRphysLNJRLCwik29Ag==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T05:15:39.593236Z","bundle_sha256":"152026dcac114e6304b160b27bf5f3cc67bb706bfba3b64a81d17fbb5dfa3260"}}