{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:GUKX3MCW5NCI2W5FZMJFGFWZA4","short_pith_number":"pith:GUKX3MCW","schema_version":"1.0","canonical_sha256":"35157db056eb448d5ba5cb125316d907040c321178fa3d7cdca3cb8f9cba3aa2","source":{"kind":"arxiv","id":"1511.02786","version":1},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1511.02786","created_at":"2026-05-18T01:27:29.338710+00:00"},{"alias_kind":"arxiv_version","alias_value":"1511.02786v1","created_at":"2026-05-18T01:27:29.338710+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.02786","created_at":"2026-05-18T01:27:29.338710+00:00"},{"alias_kind":"pith_short_12","alias_value":"GUKX3MCW5NCI","created_at":"2026-05-18T12:29:22.688609+00:00"},{"alias_kind":"pith_short_16","alias_value":"GUKX3MCW5NCI2W5F","created_at":"2026-05-18T12:29:22.688609+00:00"},{"alias_kind":"pith_short_8","alias_value":"GUKX3MCW","created_at":"2026-05-18T12:29:22.688609+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/GUKX3MCW5NCI2W5FZMJFGFWZA4","json":"https://pith.science/pith/GUKX3MCW5NCI2W5FZMJFGFWZA4.json","graph_json":"https://pith.science/api/pith-number/GUKX3MCW5NCI2W5FZMJFGFWZA4/graph.json","events_json":"https://pith.science/api/pith-number/GUKX3MCW5NCI2W5FZMJFGFWZA4/events.json","paper":"https://pith.science/paper/GUKX3MCW"},"agent_actions":{"view_html":"https://pith.science/pith/GUKX3MCW5NCI2W5FZMJFGFWZA4","download_json":"https://pith.science/pith/GUKX3MCW5NCI2W5FZMJFGFWZA4.json","view_paper":"https://pith.science/paper/GUKX3MCW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1511.02786&json=true","fetch_graph":"https://pith.science/api/pith-number/GUKX3MCW5NCI2W5FZMJFGFWZA4/graph.json","fetch_events":"https://pith.science/api/pith-number/GUKX3MCW5NCI2W5FZMJFGFWZA4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GUKX3MCW5NCI2W5FZMJFGFWZA4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GUKX3MCW5NCI2W5FZMJFGFWZA4/action/storage_attestation","attest_author":"https://pith.science/pith/GUKX3MCW5NCI2W5FZMJFGFWZA4/action/author_attestation","sign_citation":"https://pith.science/pith/GUKX3MCW5NCI2W5FZMJFGFWZA4/action/citation_signature","submit_replication":"https://pith.science/pith/GUKX3MCW5NCI2W5FZMJFGFWZA4/action/replication_record"}},"created_at":"2026-05-18T01:27:29.338710+00:00","updated_at":"2026-05-18T01:27:29.338710+00:00"}