{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:OEFXYFDX7CK2VD3PJFOPILCYGE","short_pith_number":"pith:OEFXYFDX","schema_version":"1.0","canonical_sha256":"710b7c1477f895aa8f6f495cf42c583139e4648299e3a8784dab92559c2bffed","source":{"kind":"arxiv","id":"1901.09349","version":2},"attestation_state":"computed","paper":{"title":"Large Minors in Expanders","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.DS","authors_text":"Julia Chuzhoy, Rachit Nimavat","submitted_at":"2019-01-27T10:47:49Z","abstract_excerpt":"In this paper we study expander graphs and their minors. Specifically, we attempt to answer the following question: what is the largest function $f(n,\\alpha,d)$, such that every $n$-vertex $\\alpha$-expander with maximum vertex degree at most $d$ contains {\\bf every} graph $H$ with at most $f(n,\\alpha,d)$ edges and vertices as a minor? Our main result is that there is some universal constant $c$, such that $f(n,\\alpha,d)\\geq \\frac{n}{c\\log n}\\cdot \\left(\\frac{\\alpha}{d}\\right )^c$. This bound achieves a tight dependence on $n$: it is well known that there are bounded-degree $n$-vertex expanders"},"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":"1901.09349","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-01-27T10:47:49Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"007d8e7b4bd32f0f949c4a4da2240a9f9671f8cd2d3b3a10bd7d937e9ca78ed7","abstract_canon_sha256":"b4bc6db98ddc0a84a1e874b82b887bc308ab1ba3e9b68b8f6e87285a257bbbd8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:55:16.678036Z","signature_b64":"+JzvdbHYoGk13jxYspUMwF24pn/a+206uLi1dHqprDjDdHwg4XEwshHVQN1Ypcz2PxBv1AETeAzRyNBRxRPNAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"710b7c1477f895aa8f6f495cf42c583139e4648299e3a8784dab92559c2bffed","last_reissued_at":"2026-05-17T23:55:16.677299Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:55:16.677299Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Large Minors in Expanders","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.DS","authors_text":"Julia Chuzhoy, Rachit Nimavat","submitted_at":"2019-01-27T10:47:49Z","abstract_excerpt":"In this paper we study expander graphs and their minors. Specifically, we attempt to answer the following question: what is the largest function $f(n,\\alpha,d)$, such that every $n$-vertex $\\alpha$-expander with maximum vertex degree at most $d$ contains {\\bf every} graph $H$ with at most $f(n,\\alpha,d)$ edges and vertices as a minor? Our main result is that there is some universal constant $c$, such that $f(n,\\alpha,d)\\geq \\frac{n}{c\\log n}\\cdot \\left(\\frac{\\alpha}{d}\\right )^c$. This bound achieves a tight dependence on $n$: it is well known that there are bounded-degree $n$-vertex expanders"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.09349","kind":"arxiv","version":2},"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":"1901.09349","created_at":"2026-05-17T23:55:16.677447+00:00"},{"alias_kind":"arxiv_version","alias_value":"1901.09349v2","created_at":"2026-05-17T23:55:16.677447+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.09349","created_at":"2026-05-17T23:55:16.677447+00:00"},{"alias_kind":"pith_short_12","alias_value":"OEFXYFDX7CK2","created_at":"2026-05-18T12:33:24.271573+00:00"},{"alias_kind":"pith_short_16","alias_value":"OEFXYFDX7CK2VD3P","created_at":"2026-05-18T12:33:24.271573+00:00"},{"alias_kind":"pith_short_8","alias_value":"OEFXYFDX","created_at":"2026-05-18T12:33:24.271573+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/OEFXYFDX7CK2VD3PJFOPILCYGE","json":"https://pith.science/pith/OEFXYFDX7CK2VD3PJFOPILCYGE.json","graph_json":"https://pith.science/api/pith-number/OEFXYFDX7CK2VD3PJFOPILCYGE/graph.json","events_json":"https://pith.science/api/pith-number/OEFXYFDX7CK2VD3PJFOPILCYGE/events.json","paper":"https://pith.science/paper/OEFXYFDX"},"agent_actions":{"view_html":"https://pith.science/pith/OEFXYFDX7CK2VD3PJFOPILCYGE","download_json":"https://pith.science/pith/OEFXYFDX7CK2VD3PJFOPILCYGE.json","view_paper":"https://pith.science/paper/OEFXYFDX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1901.09349&json=true","fetch_graph":"https://pith.science/api/pith-number/OEFXYFDX7CK2VD3PJFOPILCYGE/graph.json","fetch_events":"https://pith.science/api/pith-number/OEFXYFDX7CK2VD3PJFOPILCYGE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OEFXYFDX7CK2VD3PJFOPILCYGE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OEFXYFDX7CK2VD3PJFOPILCYGE/action/storage_attestation","attest_author":"https://pith.science/pith/OEFXYFDX7CK2VD3PJFOPILCYGE/action/author_attestation","sign_citation":"https://pith.science/pith/OEFXYFDX7CK2VD3PJFOPILCYGE/action/citation_signature","submit_replication":"https://pith.science/pith/OEFXYFDX7CK2VD3PJFOPILCYGE/action/replication_record"}},"created_at":"2026-05-17T23:55:16.677447+00:00","updated_at":"2026-05-17T23:55:16.677447+00:00"}