{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:5Y2ZGM7B2CSTOR5TLOZNT4JITF","short_pith_number":"pith:5Y2ZGM7B","canonical_record":{"source":{"id":"1204.2026","kind":"arxiv","version":6},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2012-04-10T02:11:49Z","cross_cats_sorted":[],"title_canon_sha256":"11ac25c27ec2a841ba93da963e6eea0d37d1bc251b07aa2c4ab7cc17fbe50a89","abstract_canon_sha256":"ab87d51db0180f4e9d7adaf1561d91bea076dda8d8a980e8bc54c96318d7a8a4"},"schema_version":"1.0"},"canonical_sha256":"ee359333e1d0a53747b35bb2d9f128996c488f774368fb919e02a83863854607","source":{"kind":"arxiv","id":"1204.2026","version":6},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1204.2026","created_at":"2026-05-18T02:31:27Z"},{"alias_kind":"arxiv_version","alias_value":"1204.2026v6","created_at":"2026-05-18T02:31:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1204.2026","created_at":"2026-05-18T02:31:27Z"},{"alias_kind":"pith_short_12","alias_value":"5Y2ZGM7B2CST","created_at":"2026-05-18T12:26:56Z"},{"alias_kind":"pith_short_16","alias_value":"5Y2ZGM7B2CSTOR5T","created_at":"2026-05-18T12:26:56Z"},{"alias_kind":"pith_short_8","alias_value":"5Y2ZGM7B","created_at":"2026-05-18T12:26:56Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:5Y2ZGM7B2CSTOR5TLOZNT4JITF","target":"record","payload":{"canonical_record":{"source":{"id":"1204.2026","kind":"arxiv","version":6},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2012-04-10T02:11:49Z","cross_cats_sorted":[],"title_canon_sha256":"11ac25c27ec2a841ba93da963e6eea0d37d1bc251b07aa2c4ab7cc17fbe50a89","abstract_canon_sha256":"ab87d51db0180f4e9d7adaf1561d91bea076dda8d8a980e8bc54c96318d7a8a4"},"schema_version":"1.0"},"canonical_sha256":"ee359333e1d0a53747b35bb2d9f128996c488f774368fb919e02a83863854607","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:31:27.714208Z","signature_b64":"WiYgQYMMp85qYxcDgJOjybvyDNl46TKzTb0wm5+BaBl7kOR8z11/jeG7S9tYk1sYFn7Y7U+oc06mv4kIpvYUAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ee359333e1d0a53747b35bb2d9f128996c488f774368fb919e02a83863854607","last_reissued_at":"2026-05-18T02:31:27.713701Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:31:27.713701Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1204.2026","source_version":6,"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:31:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Pp5U20f00tGdDKRXZAJUzmgC5P8iuEKn1r9ka1JtssYDoW8LnaktrJXv7hvm70OosD0fU46v7UIlsYhZdH+OBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T06:42:17.325159Z"},"content_sha256":"b35f687e459f88d752ac2af4236bd1e95bc87cf3f05b0f3b22ceb7ed516683a2","schema_version":"1.0","event_id":"sha256:b35f687e459f88d752ac2af4236bd1e95bc87cf3f05b0f3b22ceb7ed516683a2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:5Y2ZGM7B2CSTOR5TLOZNT4JITF","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Strengthened Hardness for Approximating Minimum Unique Game and Small Set Expansion","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Peng Cui","submitted_at":"2012-04-10T02:11:49Z","abstract_excerpt":"In this paper, the author puts forward a variation of Feige's Hypothesis, which claims that it is hard on average refuting Unbalanced Max 3-XOR under biased assignments on a natural distribution. Under this hypothesis, the author strengthens the previous known hardness for approximating Minimum Unique Game, $5/4-\\epsilon$, by proving that Min 2-Lin-2 is hard to within $3/2-\\epsilon$ and strengthens the previous known hardness for approximating Small Set Expansion, $4/3-\\epsilon$, by proving that Min Bisection is hard to approximate within $3-\\epsilon$. In addition, the author discusses the lim"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1204.2026","kind":"arxiv","version":6},"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:31:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XqWT2SCX31+xCVO3smoxpkF3CJqFMm+/P3elTuPaKZkDo86V8TUOOalMyHql/RWoCSTXm/BR8+5fjR1DdgwaCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T06:42:17.325839Z"},"content_sha256":"238ec0b46087626623dc98c99719ebbbd795aec3637990e8df11e9a3889b9cb5","schema_version":"1.0","event_id":"sha256:238ec0b46087626623dc98c99719ebbbd795aec3637990e8df11e9a3889b9cb5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5Y2ZGM7B2CSTOR5TLOZNT4JITF/bundle.json","state_url":"https://pith.science/pith/5Y2ZGM7B2CSTOR5TLOZNT4JITF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5Y2ZGM7B2CSTOR5TLOZNT4JITF/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-06T06:42:17Z","links":{"resolver":"https://pith.science/pith/5Y2ZGM7B2CSTOR5TLOZNT4JITF","bundle":"https://pith.science/pith/5Y2ZGM7B2CSTOR5TLOZNT4JITF/bundle.json","state":"https://pith.science/pith/5Y2ZGM7B2CSTOR5TLOZNT4JITF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5Y2ZGM7B2CSTOR5TLOZNT4JITF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:5Y2ZGM7B2CSTOR5TLOZNT4JITF","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":"ab87d51db0180f4e9d7adaf1561d91bea076dda8d8a980e8bc54c96318d7a8a4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2012-04-10T02:11:49Z","title_canon_sha256":"11ac25c27ec2a841ba93da963e6eea0d37d1bc251b07aa2c4ab7cc17fbe50a89"},"schema_version":"1.0","source":{"id":"1204.2026","kind":"arxiv","version":6}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1204.2026","created_at":"2026-05-18T02:31:27Z"},{"alias_kind":"arxiv_version","alias_value":"1204.2026v6","created_at":"2026-05-18T02:31:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1204.2026","created_at":"2026-05-18T02:31:27Z"},{"alias_kind":"pith_short_12","alias_value":"5Y2ZGM7B2CST","created_at":"2026-05-18T12:26:56Z"},{"alias_kind":"pith_short_16","alias_value":"5Y2ZGM7B2CSTOR5T","created_at":"2026-05-18T12:26:56Z"},{"alias_kind":"pith_short_8","alias_value":"5Y2ZGM7B","created_at":"2026-05-18T12:26:56Z"}],"graph_snapshots":[{"event_id":"sha256:238ec0b46087626623dc98c99719ebbbd795aec3637990e8df11e9a3889b9cb5","target":"graph","created_at":"2026-05-18T02:31:27Z","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":"In this paper, the author puts forward a variation of Feige's Hypothesis, which claims that it is hard on average refuting Unbalanced Max 3-XOR under biased assignments on a natural distribution. Under this hypothesis, the author strengthens the previous known hardness for approximating Minimum Unique Game, $5/4-\\epsilon$, by proving that Min 2-Lin-2 is hard to within $3/2-\\epsilon$ and strengthens the previous known hardness for approximating Small Set Expansion, $4/3-\\epsilon$, by proving that Min Bisection is hard to approximate within $3-\\epsilon$. In addition, the author discusses the lim","authors_text":"Peng Cui","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2012-04-10T02:11:49Z","title":"Strengthened Hardness for Approximating Minimum Unique Game and Small Set Expansion"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1204.2026","kind":"arxiv","version":6},"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:b35f687e459f88d752ac2af4236bd1e95bc87cf3f05b0f3b22ceb7ed516683a2","target":"record","created_at":"2026-05-18T02:31:27Z","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":"ab87d51db0180f4e9d7adaf1561d91bea076dda8d8a980e8bc54c96318d7a8a4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2012-04-10T02:11:49Z","title_canon_sha256":"11ac25c27ec2a841ba93da963e6eea0d37d1bc251b07aa2c4ab7cc17fbe50a89"},"schema_version":"1.0","source":{"id":"1204.2026","kind":"arxiv","version":6}},"canonical_sha256":"ee359333e1d0a53747b35bb2d9f128996c488f774368fb919e02a83863854607","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ee359333e1d0a53747b35bb2d9f128996c488f774368fb919e02a83863854607","first_computed_at":"2026-05-18T02:31:27.713701Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:31:27.713701Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"WiYgQYMMp85qYxcDgJOjybvyDNl46TKzTb0wm5+BaBl7kOR8z11/jeG7S9tYk1sYFn7Y7U+oc06mv4kIpvYUAw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:31:27.714208Z","signed_message":"canonical_sha256_bytes"},"source_id":"1204.2026","source_kind":"arxiv","source_version":6}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b35f687e459f88d752ac2af4236bd1e95bc87cf3f05b0f3b22ceb7ed516683a2","sha256:238ec0b46087626623dc98c99719ebbbd795aec3637990e8df11e9a3889b9cb5"],"state_sha256":"9a79dd31a766d31cd3f7c482fb2a50f21c514d7874b02aec8decf6bbd1045768"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3MOzFHCF6FRZz/tOJK/PiL4yidAbLtAXTxBhbXthkiZoRkKL6VzpScadxYRgbFi+qEk7uusvrwDDuShhotMaBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-06T06:42:17.329502Z","bundle_sha256":"7ec20a93a384633a8b2a8a85385acfeed241ca48f89afca763d2cb2dfbd48eec"}}