{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:4VYLJBIDBUD4HIJGERYYVCD6QI","short_pith_number":"pith:4VYLJBID","schema_version":"1.0","canonical_sha256":"e570b485030d07c3a12624718a887e8215e14d6ee34bfa39b25a2443a35e585b","source":{"kind":"arxiv","id":"2501.13730","version":3},"attestation_state":"computed","paper":{"title":"Hypercube minor-universality","license":"http://creativecommons.org/publicdomain/zero/1.0/","headline":"","cross_cats":["math.MG"],"primary_cat":"math.CO","authors_text":"Elad Tzalik, Itai Benjamini, Or Kalifa","submitted_at":"2025-01-23T15:03:41Z","abstract_excerpt":"A graph $G$ is $m$-minor-universal if every graph with at most $m$ edges (and no isolated vertices) is a minor of $G$. We prove that the $d$-dimensional hypercube, $Q_d$, is $\\Omega\\left(\\frac{2^d}{d}\\right)$-minor-universal, and that there exists an absolute constant $C >0$ such that $Q_d$ is not $\\frac{C2^d}{\\sqrt{d}}$-minor-universal. Similar results are obtained in a more generalized setting, where we bound the size of minors in a product of finite connected graphs. A key component of our proof is the following claim regarding the decomposition of a permutation of a box into simpler, one-d"},"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":"2501.13730","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"math.CO","submitted_at":"2025-01-23T15:03:41Z","cross_cats_sorted":["math.MG"],"title_canon_sha256":"6dbc88adb8526fe900a6249fe1556368baf771a49ddf59aeb165aeb29b54260d","abstract_canon_sha256":"a06c223325c35367ac3dd681538b0d7499f871b0916976d2786ba9426b7c99bc"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:11:32.007702Z","signature_b64":"kKq7xAcxORUM04HHoANgKTBVR1H0h+yE4GeTvh9ZMYdKBD97VjW06y7gU+w/HHXemXDRqi7kqGzoCijFcOoDCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e570b485030d07c3a12624718a887e8215e14d6ee34bfa39b25a2443a35e585b","last_reissued_at":"2026-07-05T10:11:32.007267Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:11:32.007267Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Hypercube minor-universality","license":"http://creativecommons.org/publicdomain/zero/1.0/","headline":"","cross_cats":["math.MG"],"primary_cat":"math.CO","authors_text":"Elad Tzalik, Itai Benjamini, Or Kalifa","submitted_at":"2025-01-23T15:03:41Z","abstract_excerpt":"A graph $G$ is $m$-minor-universal if every graph with at most $m$ edges (and no isolated vertices) is a minor of $G$. We prove that the $d$-dimensional hypercube, $Q_d$, is $\\Omega\\left(\\frac{2^d}{d}\\right)$-minor-universal, and that there exists an absolute constant $C >0$ such that $Q_d$ is not $\\frac{C2^d}{\\sqrt{d}}$-minor-universal. Similar results are obtained in a more generalized setting, where we bound the size of minors in a product of finite connected graphs. A key component of our proof is the following claim regarding the decomposition of a permutation of a box into simpler, one-d"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2501.13730","kind":"arxiv","version":3},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2501.13730/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2501.13730","created_at":"2026-07-05T10:11:32.007322+00:00"},{"alias_kind":"arxiv_version","alias_value":"2501.13730v3","created_at":"2026-07-05T10:11:32.007322+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2501.13730","created_at":"2026-07-05T10:11:32.007322+00:00"},{"alias_kind":"pith_short_12","alias_value":"4VYLJBIDBUD4","created_at":"2026-07-05T10:11:32.007322+00:00"},{"alias_kind":"pith_short_16","alias_value":"4VYLJBIDBUD4HIJG","created_at":"2026-07-05T10:11:32.007322+00:00"},{"alias_kind":"pith_short_8","alias_value":"4VYLJBID","created_at":"2026-07-05T10:11:32.007322+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2502.06629","citing_title":"Tight Bounds for Hypercube Minor-Universality","ref_index":5,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/4VYLJBIDBUD4HIJGERYYVCD6QI","json":"https://pith.science/pith/4VYLJBIDBUD4HIJGERYYVCD6QI.json","graph_json":"https://pith.science/api/pith-number/4VYLJBIDBUD4HIJGERYYVCD6QI/graph.json","events_json":"https://pith.science/api/pith-number/4VYLJBIDBUD4HIJGERYYVCD6QI/events.json","paper":"https://pith.science/paper/4VYLJBID"},"agent_actions":{"view_html":"https://pith.science/pith/4VYLJBIDBUD4HIJGERYYVCD6QI","download_json":"https://pith.science/pith/4VYLJBIDBUD4HIJGERYYVCD6QI.json","view_paper":"https://pith.science/paper/4VYLJBID","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2501.13730&json=true","fetch_graph":"https://pith.science/api/pith-number/4VYLJBIDBUD4HIJGERYYVCD6QI/graph.json","fetch_events":"https://pith.science/api/pith-number/4VYLJBIDBUD4HIJGERYYVCD6QI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4VYLJBIDBUD4HIJGERYYVCD6QI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4VYLJBIDBUD4HIJGERYYVCD6QI/action/storage_attestation","attest_author":"https://pith.science/pith/4VYLJBIDBUD4HIJGERYYVCD6QI/action/author_attestation","sign_citation":"https://pith.science/pith/4VYLJBIDBUD4HIJGERYYVCD6QI/action/citation_signature","submit_replication":"https://pith.science/pith/4VYLJBIDBUD4HIJGERYYVCD6QI/action/replication_record"}},"created_at":"2026-07-05T10:11:32.007322+00:00","updated_at":"2026-07-05T10:11:32.007322+00:00"}