{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:S4KM34T2NZ54CBYY2UBTY26ZDY","short_pith_number":"pith:S4KM34T2","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"},"canonical_sha256":"9714cdf27a6e7bc10718d5033c6bd91e374aeb02ab83b7372fbdb8a56e7c8336","source":{"kind":"arxiv","id":"2304.07284","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2304.07284","created_at":"2026-07-05T06:01:07Z"},{"alias_kind":"arxiv_version","alias_value":"2304.07284v1","created_at":"2026-07-05T06:01:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2304.07284","created_at":"2026-07-05T06:01:07Z"},{"alias_kind":"pith_short_12","alias_value":"S4KM34T2NZ54","created_at":"2026-07-05T06:01:07Z"},{"alias_kind":"pith_short_16","alias_value":"S4KM34T2NZ54CBYY","created_at":"2026-07-05T06:01:07Z"},{"alias_kind":"pith_short_8","alias_value":"S4KM34T2","created_at":"2026-07-05T06:01:07Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:S4KM34T2NZ54CBYY2UBTY26ZDY","target":"record","payload":{"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"},"canonical_sha256":"9714cdf27a6e7bc10718d5033c6bd91e374aeb02ab83b7372fbdb8a56e7c8336","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"},"source_kind":"arxiv","source_id":"2304.07284","source_version":1,"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-07-05T06:01:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TKCC3AVgSYLOOduwzvIX2li27doKLqiZm/rdvxm3Njmat/HUtoGMBHwJFtaw9Gxwan+VJHFjGlNEs60vmT45BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-07T19:53:56.439947Z"},"content_sha256":"398fae618b17e87ebc769a72a481e00223e0b567ad180b2efe75335f4d067043","schema_version":"1.0","event_id":"sha256:398fae618b17e87ebc769a72a481e00223e0b567ad180b2efe75335f4d067043"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:S4KM34T2NZ54CBYY2UBTY26ZDY","target":"graph","payload":{"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"},"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-07-05T06:01:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bSMJusoh914+wYYEEyPPMzpEICkr5D4IzPgAfzE79x3zCc7RSElH/647Yarf7Mvh/KKvAlWBq+JceFmo2MbUDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-07T19:53:56.440732Z"},"content_sha256":"a1bce56fdc3ad8dcf7b4b46505baf00f5290c3b94e72386833ee6c6701abba0e","schema_version":"1.0","event_id":"sha256:a1bce56fdc3ad8dcf7b4b46505baf00f5290c3b94e72386833ee6c6701abba0e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/S4KM34T2NZ54CBYY2UBTY26ZDY/bundle.json","state_url":"https://pith.science/pith/S4KM34T2NZ54CBYY2UBTY26ZDY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/S4KM34T2NZ54CBYY2UBTY26ZDY/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-08-07T19:53:56Z","links":{"resolver":"https://pith.science/pith/S4KM34T2NZ54CBYY2UBTY26ZDY","bundle":"https://pith.science/pith/S4KM34T2NZ54CBYY2UBTY26ZDY/bundle.json","state":"https://pith.science/pith/S4KM34T2NZ54CBYY2UBTY26ZDY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/S4KM34T2NZ54CBYY2UBTY26ZDY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:S4KM34T2NZ54CBYY2UBTY26ZDY","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":"d911ba344c11c22d556e202098be2dcb2cb67d05d24167b4358d17501f32b495","cross_cats_sorted":["cs.DS"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CC","submitted_at":"2023-04-14T17:53:26Z","title_canon_sha256":"ea39abf8dd356c720400e28ef2757ef2411853f86d06bb21e15f9e9c8899ca2e"},"schema_version":"1.0","source":{"id":"2304.07284","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2304.07284","created_at":"2026-07-05T06:01:07Z"},{"alias_kind":"arxiv_version","alias_value":"2304.07284v1","created_at":"2026-07-05T06:01:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2304.07284","created_at":"2026-07-05T06:01:07Z"},{"alias_kind":"pith_short_12","alias_value":"S4KM34T2NZ54","created_at":"2026-07-05T06:01:07Z"},{"alias_kind":"pith_short_16","alias_value":"S4KM34T2NZ54CBYY","created_at":"2026-07-05T06:01:07Z"},{"alias_kind":"pith_short_8","alias_value":"S4KM34T2","created_at":"2026-07-05T06:01:07Z"}],"graph_snapshots":[{"event_id":"sha256:a1bce56fdc3ad8dcf7b4b46505baf00f5290c3b94e72386833ee6c6701abba0e","target":"graph","created_at":"2026-07-05T06:01:07Z","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/2304.07284/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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 [","authors_text":"Dor Minzer, Mitali Bafna","cross_cats":["cs.DS"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CC","submitted_at":"2023-04-14T17:53:26Z","title":"Solving Unique Games over Globally Hypercontractive Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2304.07284","kind":"arxiv","version":1},"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:398fae618b17e87ebc769a72a481e00223e0b567ad180b2efe75335f4d067043","target":"record","created_at":"2026-07-05T06:01:07Z","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":"d911ba344c11c22d556e202098be2dcb2cb67d05d24167b4358d17501f32b495","cross_cats_sorted":["cs.DS"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CC","submitted_at":"2023-04-14T17:53:26Z","title_canon_sha256":"ea39abf8dd356c720400e28ef2757ef2411853f86d06bb21e15f9e9c8899ca2e"},"schema_version":"1.0","source":{"id":"2304.07284","kind":"arxiv","version":1}},"canonical_sha256":"9714cdf27a6e7bc10718d5033c6bd91e374aeb02ab83b7372fbdb8a56e7c8336","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9714cdf27a6e7bc10718d5033c6bd91e374aeb02ab83b7372fbdb8a56e7c8336","first_computed_at":"2026-07-05T06:01:07.670872Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T06:01:07.670872Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Va69OWhVW0MW3vJm4Eel0/NAlxSKQS/0bTIpmir/DWR3U8CnOkAIi5JuNgn+BlRo9lAwOSP8g8FatruNKtMaBA==","signature_status":"signed_v1","signed_at":"2026-07-05T06:01:07.671336Z","signed_message":"canonical_sha256_bytes"},"source_id":"2304.07284","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:398fae618b17e87ebc769a72a481e00223e0b567ad180b2efe75335f4d067043","sha256:a1bce56fdc3ad8dcf7b4b46505baf00f5290c3b94e72386833ee6c6701abba0e"],"state_sha256":"316a1938e1818ebd94879065b61c940723da12e51c64af9a38820c1f94ec69d2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"10GRP1DtrbOcxeW9YBOnVEK7A3xWYINHxDR8z5wqlN5E7QDx9rUIVQrpuePyEMicDIxms911xDiwaa/EjI/DAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-07T19:53:56.445587Z","bundle_sha256":"3fc0b85092f2decc66f91488465da0bc52d784df6c3d66665f90bf5f716ee6e6"}}