{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:HHBPGSOBGXMURTNBF5BHS7JUYI","short_pith_number":"pith:HHBPGSOB","schema_version":"1.0","canonical_sha256":"39c2f349c135d948cda12f42797d34c209bbbf87c15c69982783d077240caf5c","source":{"kind":"arxiv","id":"1101.2630","version":1},"attestation_state":"computed","paper":{"title":"Minimum degree condition forcing complete graph immersion","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Bojan Mohar, Diego Scheide, Jacob Fox, Jessica McDonald, Matt DeVos, Zden\\v{e}k Dvo\\v{r}\\'ak","submitted_at":"2011-01-13T18:28:50Z","abstract_excerpt":"An immersion of a graph $H$ into a graph $G$ is a one-to-one mapping $f:V(H) \\to V(G)$ and a collection of edge-disjoint paths in $G$, one for each edge of $H$, such that the path $P_{uv}$ corresponding to edge $uv$ has endpoints $f(u)$ and $f(v)$. The immersion is strong if the paths $P_{uv}$ are internally disjoint from $f(V(H))$. It is proved that for every positive integer $t$, every simple graph of minimum degree at least $200t$ contains a strong immersion of the complete graph $K_t$. For dense graphs one can say even more. If the graph has order $n$ and has $2cn^2$ edges, then there is a"},"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":"1101.2630","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-01-13T18:28:50Z","cross_cats_sorted":[],"title_canon_sha256":"da79b0586cdfcadcba6af992e2c938be3caed9f40cd5cec8ba54a8db37ebc2f3","abstract_canon_sha256":"d8bff4900f3b816c18aa744c697f11430ea0f396e61e723abd69a8bc44c2ea35"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:31:41.758625Z","signature_b64":"Aqc6tyHmChlU1rZoDiIS1ye4UNyWT+OR+ba5ejc6zZhY2jqpuijS7TlM8UNzpe3WWCAbszncF5GAk+/OYACnAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"39c2f349c135d948cda12f42797d34c209bbbf87c15c69982783d077240caf5c","last_reissued_at":"2026-05-18T04:31:41.758106Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:31:41.758106Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Minimum degree condition forcing complete graph immersion","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Bojan Mohar, Diego Scheide, Jacob Fox, Jessica McDonald, Matt DeVos, Zden\\v{e}k Dvo\\v{r}\\'ak","submitted_at":"2011-01-13T18:28:50Z","abstract_excerpt":"An immersion of a graph $H$ into a graph $G$ is a one-to-one mapping $f:V(H) \\to V(G)$ and a collection of edge-disjoint paths in $G$, one for each edge of $H$, such that the path $P_{uv}$ corresponding to edge $uv$ has endpoints $f(u)$ and $f(v)$. The immersion is strong if the paths $P_{uv}$ are internally disjoint from $f(V(H))$. It is proved that for every positive integer $t$, every simple graph of minimum degree at least $200t$ contains a strong immersion of the complete graph $K_t$. For dense graphs one can say even more. If the graph has order $n$ and has $2cn^2$ edges, then there is a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1101.2630","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":"1101.2630","created_at":"2026-05-18T04:31:41.758184+00:00"},{"alias_kind":"arxiv_version","alias_value":"1101.2630v1","created_at":"2026-05-18T04:31:41.758184+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1101.2630","created_at":"2026-05-18T04:31:41.758184+00:00"},{"alias_kind":"pith_short_12","alias_value":"HHBPGSOBGXMU","created_at":"2026-05-18T12:26:30.835961+00:00"},{"alias_kind":"pith_short_16","alias_value":"HHBPGSOBGXMURTNB","created_at":"2026-05-18T12:26:30.835961+00:00"},{"alias_kind":"pith_short_8","alias_value":"HHBPGSOB","created_at":"2026-05-18T12:26:30.835961+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/HHBPGSOBGXMURTNBF5BHS7JUYI","json":"https://pith.science/pith/HHBPGSOBGXMURTNBF5BHS7JUYI.json","graph_json":"https://pith.science/api/pith-number/HHBPGSOBGXMURTNBF5BHS7JUYI/graph.json","events_json":"https://pith.science/api/pith-number/HHBPGSOBGXMURTNBF5BHS7JUYI/events.json","paper":"https://pith.science/paper/HHBPGSOB"},"agent_actions":{"view_html":"https://pith.science/pith/HHBPGSOBGXMURTNBF5BHS7JUYI","download_json":"https://pith.science/pith/HHBPGSOBGXMURTNBF5BHS7JUYI.json","view_paper":"https://pith.science/paper/HHBPGSOB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1101.2630&json=true","fetch_graph":"https://pith.science/api/pith-number/HHBPGSOBGXMURTNBF5BHS7JUYI/graph.json","fetch_events":"https://pith.science/api/pith-number/HHBPGSOBGXMURTNBF5BHS7JUYI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HHBPGSOBGXMURTNBF5BHS7JUYI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HHBPGSOBGXMURTNBF5BHS7JUYI/action/storage_attestation","attest_author":"https://pith.science/pith/HHBPGSOBGXMURTNBF5BHS7JUYI/action/author_attestation","sign_citation":"https://pith.science/pith/HHBPGSOBGXMURTNBF5BHS7JUYI/action/citation_signature","submit_replication":"https://pith.science/pith/HHBPGSOBGXMURTNBF5BHS7JUYI/action/replication_record"}},"created_at":"2026-05-18T04:31:41.758184+00:00","updated_at":"2026-05-18T04:31:41.758184+00:00"}