{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:V46JPQYDHN2IDENP47KWT3ESDM","short_pith_number":"pith:V46JPQYD","canonical_record":{"source":{"id":"1705.03581","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2017-05-10T02:03:01Z","cross_cats_sorted":[],"title_canon_sha256":"d19780c49a58b7c54ce376e73bd20c1f013d73c94683713591f09f0f199aac27","abstract_canon_sha256":"435669d8001517012b581d1266a22fb23f52b9d40af4b8819f76d61f578cf6cc"},"schema_version":"1.0"},"canonical_sha256":"af3c97c3033b748191afe7d569ec921b38ace4a8ebdf1c8165accc0582feb3d6","source":{"kind":"arxiv","id":"1705.03581","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.03581","created_at":"2026-05-18T00:44:43Z"},{"alias_kind":"arxiv_version","alias_value":"1705.03581v1","created_at":"2026-05-18T00:44:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.03581","created_at":"2026-05-18T00:44:43Z"},{"alias_kind":"pith_short_12","alias_value":"V46JPQYDHN2I","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_16","alias_value":"V46JPQYDHN2IDENP","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_8","alias_value":"V46JPQYD","created_at":"2026-05-18T12:31:49Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:V46JPQYDHN2IDENP47KWT3ESDM","target":"record","payload":{"canonical_record":{"source":{"id":"1705.03581","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2017-05-10T02:03:01Z","cross_cats_sorted":[],"title_canon_sha256":"d19780c49a58b7c54ce376e73bd20c1f013d73c94683713591f09f0f199aac27","abstract_canon_sha256":"435669d8001517012b581d1266a22fb23f52b9d40af4b8819f76d61f578cf6cc"},"schema_version":"1.0"},"canonical_sha256":"af3c97c3033b748191afe7d569ec921b38ace4a8ebdf1c8165accc0582feb3d6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:44:43.562113Z","signature_b64":"p2JIiGHi/hjqj1423O6nkwVo5l/lapeiO3dv9VtKIHPG8HGLDHXh+9w+5mrzCBRqiwG3eVqZkJ4l5QTbd+L+AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"af3c97c3033b748191afe7d569ec921b38ace4a8ebdf1c8165accc0582feb3d6","last_reissued_at":"2026-05-18T00:44:43.561563Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:44:43.561563Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1705.03581","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-05-18T00:44:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"L8VXXFB6vzsTT8PnD9JK6OL9w8aQEc9AkeXXfJHJycXs4vNjFRfIeGTjsTYcefVAK6uYLKGRBlgManw3iZU4BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T15:21:35.725817Z"},"content_sha256":"b961435b4be62e3c5d215be9d84d046626fdd20803c895026e5cca4ffa4d1df7","schema_version":"1.0","event_id":"sha256:b961435b4be62e3c5d215be9d84d046626fdd20803c895026e5cca4ffa4d1df7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:V46JPQYDHN2IDENP47KWT3ESDM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Inapproximability of Maximum Biclique Problems, Minimum $k$-Cut and Densest At-Least-$k$-Subgraph from the Small Set Expansion Hypothesis","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Pasin Manurangsi","submitted_at":"2017-05-10T02:03:01Z","abstract_excerpt":"The Small Set Expansion Hypothesis (SSEH) is a conjecture which roughly states that it is NP-hard to distinguish between a graph with a small subset of vertices whose edge expansion is almost zero and one in which all small subsets of vertices have expansion almost one. In this work, we prove inapproximability results for the following graph problems based on this hypothesis:\n  - Maximum Edge Biclique (MEB): given a bipartite graph $G$, find a complete bipartite subgraph of $G$ with maximum number of edges.\n  - Maximum Balanced Biclique (MBB): given a bipartite graph $G$, find a balanced compl"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.03581","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":""},"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-18T00:44:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AyWRxQOjCYARUyLLfFa7kOGyRexKTHLTbMwpr1RmiZNgEDXX1CVJCfmiO+kSEMLlBEHpZir3XVtg0cSerfhDAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T15:21:35.726214Z"},"content_sha256":"1b11a0fad84325136028a441be91cbd8a38fed05dc70e0631ec3c7eea6372b32","schema_version":"1.0","event_id":"sha256:1b11a0fad84325136028a441be91cbd8a38fed05dc70e0631ec3c7eea6372b32"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/V46JPQYDHN2IDENP47KWT3ESDM/bundle.json","state_url":"https://pith.science/pith/V46JPQYDHN2IDENP47KWT3ESDM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/V46JPQYDHN2IDENP47KWT3ESDM/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-01T15:21:35Z","links":{"resolver":"https://pith.science/pith/V46JPQYDHN2IDENP47KWT3ESDM","bundle":"https://pith.science/pith/V46JPQYDHN2IDENP47KWT3ESDM/bundle.json","state":"https://pith.science/pith/V46JPQYDHN2IDENP47KWT3ESDM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/V46JPQYDHN2IDENP47KWT3ESDM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:V46JPQYDHN2IDENP47KWT3ESDM","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":"435669d8001517012b581d1266a22fb23f52b9d40af4b8819f76d61f578cf6cc","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2017-05-10T02:03:01Z","title_canon_sha256":"d19780c49a58b7c54ce376e73bd20c1f013d73c94683713591f09f0f199aac27"},"schema_version":"1.0","source":{"id":"1705.03581","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.03581","created_at":"2026-05-18T00:44:43Z"},{"alias_kind":"arxiv_version","alias_value":"1705.03581v1","created_at":"2026-05-18T00:44:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.03581","created_at":"2026-05-18T00:44:43Z"},{"alias_kind":"pith_short_12","alias_value":"V46JPQYDHN2I","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_16","alias_value":"V46JPQYDHN2IDENP","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_8","alias_value":"V46JPQYD","created_at":"2026-05-18T12:31:49Z"}],"graph_snapshots":[{"event_id":"sha256:1b11a0fad84325136028a441be91cbd8a38fed05dc70e0631ec3c7eea6372b32","target":"graph","created_at":"2026-05-18T00:44:43Z","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":"The Small Set Expansion Hypothesis (SSEH) is a conjecture which roughly states that it is NP-hard to distinguish between a graph with a small subset of vertices whose edge expansion is almost zero and one in which all small subsets of vertices have expansion almost one. In this work, we prove inapproximability results for the following graph problems based on this hypothesis:\n  - Maximum Edge Biclique (MEB): given a bipartite graph $G$, find a complete bipartite subgraph of $G$ with maximum number of edges.\n  - Maximum Balanced Biclique (MBB): given a bipartite graph $G$, find a balanced compl","authors_text":"Pasin Manurangsi","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2017-05-10T02:03:01Z","title":"Inapproximability of Maximum Biclique Problems, Minimum $k$-Cut and Densest At-Least-$k$-Subgraph from the Small Set Expansion Hypothesis"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.03581","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:b961435b4be62e3c5d215be9d84d046626fdd20803c895026e5cca4ffa4d1df7","target":"record","created_at":"2026-05-18T00:44:43Z","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":"435669d8001517012b581d1266a22fb23f52b9d40af4b8819f76d61f578cf6cc","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2017-05-10T02:03:01Z","title_canon_sha256":"d19780c49a58b7c54ce376e73bd20c1f013d73c94683713591f09f0f199aac27"},"schema_version":"1.0","source":{"id":"1705.03581","kind":"arxiv","version":1}},"canonical_sha256":"af3c97c3033b748191afe7d569ec921b38ace4a8ebdf1c8165accc0582feb3d6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"af3c97c3033b748191afe7d569ec921b38ace4a8ebdf1c8165accc0582feb3d6","first_computed_at":"2026-05-18T00:44:43.561563Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:44:43.561563Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"p2JIiGHi/hjqj1423O6nkwVo5l/lapeiO3dv9VtKIHPG8HGLDHXh+9w+5mrzCBRqiwG3eVqZkJ4l5QTbd+L+AA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:44:43.562113Z","signed_message":"canonical_sha256_bytes"},"source_id":"1705.03581","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b961435b4be62e3c5d215be9d84d046626fdd20803c895026e5cca4ffa4d1df7","sha256:1b11a0fad84325136028a441be91cbd8a38fed05dc70e0631ec3c7eea6372b32"],"state_sha256":"4df2f6f3c55cd90b396ae79e2695a3f21c84fd967e1727a6a9c31a21bb1f0ef6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"80vRRiT6T0GNg2u1lSm9/Wo1tYfBHVUde00+Vsez6gWnf8Etw8YcEMKxgUV/HZZebqVXuW8/OOnSeqktiPeEDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T15:21:35.728482Z","bundle_sha256":"3acf1ab6a5de2f3eb043dbd31aa75e80ae45bb505f2b3a19afb3136c67456640"}}