{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:GUKX3MCW5NCI2W5FZMJFGFWZA4","short_pith_number":"pith:GUKX3MCW","canonical_record":{"source":{"id":"1511.02786","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-11-09T17:56:29Z","cross_cats_sorted":[],"title_canon_sha256":"5e2d379ba7600b9b2453da9603ed4e1108121de33b12f194b24804e332f5bba0","abstract_canon_sha256":"2625c0144d0a0174ede92c2fdd344bfb263477f38231f899335db40257db5929"},"schema_version":"1.0"},"canonical_sha256":"35157db056eb448d5ba5cb125316d907040c321178fa3d7cdca3cb8f9cba3aa2","source":{"kind":"arxiv","id":"1511.02786","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1511.02786","created_at":"2026-05-18T01:27:29Z"},{"alias_kind":"arxiv_version","alias_value":"1511.02786v1","created_at":"2026-05-18T01:27:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.02786","created_at":"2026-05-18T01:27:29Z"},{"alias_kind":"pith_short_12","alias_value":"GUKX3MCW5NCI","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_16","alias_value":"GUKX3MCW5NCI2W5F","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_8","alias_value":"GUKX3MCW","created_at":"2026-05-18T12:29:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:GUKX3MCW5NCI2W5FZMJFGFWZA4","target":"record","payload":{"canonical_record":{"source":{"id":"1511.02786","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-11-09T17:56:29Z","cross_cats_sorted":[],"title_canon_sha256":"5e2d379ba7600b9b2453da9603ed4e1108121de33b12f194b24804e332f5bba0","abstract_canon_sha256":"2625c0144d0a0174ede92c2fdd344bfb263477f38231f899335db40257db5929"},"schema_version":"1.0"},"canonical_sha256":"35157db056eb448d5ba5cb125316d907040c321178fa3d7cdca3cb8f9cba3aa2","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:27:29.339099Z","signature_b64":"RnAZrXYqBzstoy/j5hN5823jwFZnCY0t1mbrMWbD5c+J1tqjQIAovQEm3G8t2TWy9HKlxS6HSwjbU9lbhAYXAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"35157db056eb448d5ba5cb125316d907040c321178fa3d7cdca3cb8f9cba3aa2","last_reissued_at":"2026-05-18T01:27:29.338639Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:27:29.338639Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1511.02786","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-18T01:27:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Z8mtrhldVURgrIJJ97T/UbP07TfEIfcwNBeBbafPgw615tnNasEnbBuGM/deKwA0FvoFf9bnQfHC1OI4MCiACQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T05:14:55.577519Z"},"content_sha256":"4481a77c0af3b1254577a0e3a121c4355e38ad9657e3b97df332d0b0c52892d4","schema_version":"1.0","event_id":"sha256:4481a77c0af3b1254577a0e3a121c4355e38ad9657e3b97df332d0b0c52892d4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:GUKX3MCW5NCI2W5FZMJFGFWZA4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Approximation Algorithms for Finding Maximum Induced Expanders","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Alireza Rezaei, Shayan Oveis Gharan","submitted_at":"2015-11-09T17:56:29Z","abstract_excerpt":"We initiate the study of approximating the largest induced expander in a given graph $G$. Given a $\\Delta$-regular graph $G$ with $n$ vertices, the goal is to find the set with the largest induced expansion of size at least $\\delta \\cdot n$. We design a bi-criteria approximation algorithm for this problem; if the optimum has induced spectral expansion $\\lambda$ our algorithm returns a $\\frac{\\lambda}{\\log^2\\delta \\exp(\\Delta/\\lambda)}$-(spectral) expander of size at least $\\delta n$ (up to constants).\n  Our proof introduces and employs a novel semidefinite programming relaxation for the larges"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.02786","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-18T01:27:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lzStdWBYsKh3ef1i6XqEYHUMzCoQg/mGmC6le5f6jijMkezgFjooOTT8vNAkmSR8tRb/HzPZ9sHPtNjEyFoJBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T05:14:55.578080Z"},"content_sha256":"6bc2cc7f3a85b2d7257f1d7f42a961b1e19a5dca8defd75a60c3045020c9f831","schema_version":"1.0","event_id":"sha256:6bc2cc7f3a85b2d7257f1d7f42a961b1e19a5dca8defd75a60c3045020c9f831"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GUKX3MCW5NCI2W5FZMJFGFWZA4/bundle.json","state_url":"https://pith.science/pith/GUKX3MCW5NCI2W5FZMJFGFWZA4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GUKX3MCW5NCI2W5FZMJFGFWZA4/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-11T05:14:55Z","links":{"resolver":"https://pith.science/pith/GUKX3MCW5NCI2W5FZMJFGFWZA4","bundle":"https://pith.science/pith/GUKX3MCW5NCI2W5FZMJFGFWZA4/bundle.json","state":"https://pith.science/pith/GUKX3MCW5NCI2W5FZMJFGFWZA4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GUKX3MCW5NCI2W5FZMJFGFWZA4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:GUKX3MCW5NCI2W5FZMJFGFWZA4","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":"2625c0144d0a0174ede92c2fdd344bfb263477f38231f899335db40257db5929","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-11-09T17:56:29Z","title_canon_sha256":"5e2d379ba7600b9b2453da9603ed4e1108121de33b12f194b24804e332f5bba0"},"schema_version":"1.0","source":{"id":"1511.02786","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1511.02786","created_at":"2026-05-18T01:27:29Z"},{"alias_kind":"arxiv_version","alias_value":"1511.02786v1","created_at":"2026-05-18T01:27:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.02786","created_at":"2026-05-18T01:27:29Z"},{"alias_kind":"pith_short_12","alias_value":"GUKX3MCW5NCI","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_16","alias_value":"GUKX3MCW5NCI2W5F","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_8","alias_value":"GUKX3MCW","created_at":"2026-05-18T12:29:22Z"}],"graph_snapshots":[{"event_id":"sha256:6bc2cc7f3a85b2d7257f1d7f42a961b1e19a5dca8defd75a60c3045020c9f831","target":"graph","created_at":"2026-05-18T01:27:29Z","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 initiate the study of approximating the largest induced expander in a given graph $G$. Given a $\\Delta$-regular graph $G$ with $n$ vertices, the goal is to find the set with the largest induced expansion of size at least $\\delta \\cdot n$. We design a bi-criteria approximation algorithm for this problem; if the optimum has induced spectral expansion $\\lambda$ our algorithm returns a $\\frac{\\lambda}{\\log^2\\delta \\exp(\\Delta/\\lambda)}$-(spectral) expander of size at least $\\delta n$ (up to constants).\n  Our proof introduces and employs a novel semidefinite programming relaxation for the larges","authors_text":"Alireza Rezaei, Shayan Oveis Gharan","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-11-09T17:56:29Z","title":"Approximation Algorithms for Finding Maximum Induced Expanders"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.02786","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:4481a77c0af3b1254577a0e3a121c4355e38ad9657e3b97df332d0b0c52892d4","target":"record","created_at":"2026-05-18T01:27:29Z","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":"2625c0144d0a0174ede92c2fdd344bfb263477f38231f899335db40257db5929","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-11-09T17:56:29Z","title_canon_sha256":"5e2d379ba7600b9b2453da9603ed4e1108121de33b12f194b24804e332f5bba0"},"schema_version":"1.0","source":{"id":"1511.02786","kind":"arxiv","version":1}},"canonical_sha256":"35157db056eb448d5ba5cb125316d907040c321178fa3d7cdca3cb8f9cba3aa2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"35157db056eb448d5ba5cb125316d907040c321178fa3d7cdca3cb8f9cba3aa2","first_computed_at":"2026-05-18T01:27:29.338639Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:27:29.338639Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"RnAZrXYqBzstoy/j5hN5823jwFZnCY0t1mbrMWbD5c+J1tqjQIAovQEm3G8t2TWy9HKlxS6HSwjbU9lbhAYXAg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:27:29.339099Z","signed_message":"canonical_sha256_bytes"},"source_id":"1511.02786","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4481a77c0af3b1254577a0e3a121c4355e38ad9657e3b97df332d0b0c52892d4","sha256:6bc2cc7f3a85b2d7257f1d7f42a961b1e19a5dca8defd75a60c3045020c9f831"],"state_sha256":"f4b0eb583b3200625376c9c32f87bb2de317272e0846b497546fcdf6192a8d7f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EqZGHXahzPD0j3RCtNRVs3+z5O5A+v7Bg8QaxLF/cHuHzYE7CoBm5+DFKcR1hyqp+BaA0tAyFLBQyv9z7P9KAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T05:14:55.581832Z","bundle_sha256":"72dd2629ceeb95b22a7141cb4acb1099ccf30dc3dccf32f7f550e0edc19c1810"}}