{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:S4KM34T2NZ54CBYY2UBTY26ZDY","short_pith_number":"pith:S4KM34T2","schema_version":"1.0","canonical_sha256":"9714cdf27a6e7bc10718d5033c6bd91e374aeb02ab83b7372fbdb8a56e7c8336","source":{"kind":"arxiv","id":"2304.07284","version":1},"attestation_state":"computed","paper":{"title":"Solving Unique Games over Globally Hypercontractive Graphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CC","authors_text":"Dor Minzer, Mitali Bafna","submitted_at":"2023-04-14T17:53:26Z","abstract_excerpt":"We study the complexity of affine Unique-Games (UG) over globally hypercontractive graphs, which are graphs that are not small set expanders but admit a useful and succinct characterization of all small sets that violate the small-set expansion property. This class of graphs includes the Johnson and Grassmann graphs, which have played a pivotal role in recent PCP constructions for UG, and their generalizations via high-dimensional expanders.\n  Our algorithm shows how to round \"low-entropy\" solutions to sum-of-squares (SoS) semidefinite programs, broadly extending the algorithmic framework of ["},"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":"2304.07284","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CC","submitted_at":"2023-04-14T17:53:26Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"ea39abf8dd356c720400e28ef2757ef2411853f86d06bb21e15f9e9c8899ca2e","abstract_canon_sha256":"d911ba344c11c22d556e202098be2dcb2cb67d05d24167b4358d17501f32b495"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:01:07.671336Z","signature_b64":"Va69OWhVW0MW3vJm4Eel0/NAlxSKQS/0bTIpmir/DWR3U8CnOkAIi5JuNgn+BlRo9lAwOSP8g8FatruNKtMaBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9714cdf27a6e7bc10718d5033c6bd91e374aeb02ab83b7372fbdb8a56e7c8336","last_reissued_at":"2026-07-05T06:01:07.670872Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:01:07.670872Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Solving Unique Games over Globally Hypercontractive Graphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CC","authors_text":"Dor Minzer, Mitali Bafna","submitted_at":"2023-04-14T17:53:26Z","abstract_excerpt":"We study the complexity of affine Unique-Games (UG) over globally hypercontractive graphs, which are graphs that are not small set expanders but admit a useful and succinct characterization of all small sets that violate the small-set expansion property. This class of graphs includes the Johnson and Grassmann graphs, which have played a pivotal role in recent PCP constructions for UG, and their generalizations via high-dimensional expanders.\n  Our algorithm shows how to round \"low-entropy\" solutions to sum-of-squares (SoS) semidefinite programs, broadly extending the algorithmic framework of ["},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2304.07284","kind":"arxiv","version":1},"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/2304.07284/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":"2304.07284","created_at":"2026-07-05T06:01:07.670937+00:00"},{"alias_kind":"arxiv_version","alias_value":"2304.07284v1","created_at":"2026-07-05T06:01:07.670937+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2304.07284","created_at":"2026-07-05T06:01:07.670937+00:00"},{"alias_kind":"pith_short_12","alias_value":"S4KM34T2NZ54","created_at":"2026-07-05T06:01:07.670937+00:00"},{"alias_kind":"pith_short_16","alias_value":"S4KM34T2NZ54CBYY","created_at":"2026-07-05T06:01:07.670937+00:00"},{"alias_kind":"pith_short_8","alias_value":"S4KM34T2","created_at":"2026-07-05T06:01:07.670937+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/S4KM34T2NZ54CBYY2UBTY26ZDY","json":"https://pith.science/pith/S4KM34T2NZ54CBYY2UBTY26ZDY.json","graph_json":"https://pith.science/api/pith-number/S4KM34T2NZ54CBYY2UBTY26ZDY/graph.json","events_json":"https://pith.science/api/pith-number/S4KM34T2NZ54CBYY2UBTY26ZDY/events.json","paper":"https://pith.science/paper/S4KM34T2"},"agent_actions":{"view_html":"https://pith.science/pith/S4KM34T2NZ54CBYY2UBTY26ZDY","download_json":"https://pith.science/pith/S4KM34T2NZ54CBYY2UBTY26ZDY.json","view_paper":"https://pith.science/paper/S4KM34T2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2304.07284&json=true","fetch_graph":"https://pith.science/api/pith-number/S4KM34T2NZ54CBYY2UBTY26ZDY/graph.json","fetch_events":"https://pith.science/api/pith-number/S4KM34T2NZ54CBYY2UBTY26ZDY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/S4KM34T2NZ54CBYY2UBTY26ZDY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/S4KM34T2NZ54CBYY2UBTY26ZDY/action/storage_attestation","attest_author":"https://pith.science/pith/S4KM34T2NZ54CBYY2UBTY26ZDY/action/author_attestation","sign_citation":"https://pith.science/pith/S4KM34T2NZ54CBYY2UBTY26ZDY/action/citation_signature","submit_replication":"https://pith.science/pith/S4KM34T2NZ54CBYY2UBTY26ZDY/action/replication_record"}},"created_at":"2026-07-05T06:01:07.670937+00:00","updated_at":"2026-07-05T06:01:07.670937+00:00"}